# An Effective Approach for Human Activity Classification Using Feature Fusion and Machine Learning Methods

Authors: Muhammad Junaid Ibrahim; Jaweria Kainat; Hussain AlSalman; Syed Sajid Ullah; Suheer Al-Hadhrami; Saddam Hussain
Journal: Applied Bionics and Biomechanics
 (2022)

---

## Abstract

Recent advances in image processing and machine learning methods have greatly enhanced the ability of object classification from images and videos in different applications. Classification of human activities is one of the emerging research areas in the field of computer vision. It can be used in several applications including medical informatics, surveillance, human computer interaction, and task monitoring. In the medical and healthcare field, the classification of patients’ activities is important for providing the required information to doctors and physicians for medication reactions and diagnosis. Nowadays, some research approaches to recognize human activity from videos and images have been proposed using machine learning (ML) and soft computational algorithms. However, advanced computer vision methods are still considered promising development directions for developing human activity classification approach from a sequence of video frames. This paper proposes an effective automated approach using feature fusion and ML methods. It consists of five steps, which are the preprocessing, feature extraction, feature selection, feature fusion, and classification steps. Two available public benchmark datasets are utilized to train, validate, and test ML classifiers of the developed approach. The experimental results of this research work show that the accuracies achieved are 99.5% and 99.9% on the first and second datasets, respectively. Compared with many existing related approaches, the proposed approach attained high performance results in terms of sensitivity, accuracy, precision, and specificity evaluation metric.


---

## Body

## 1. Introduction

In recent years, the e-vision community has focused largely on recognizing human activities. This is mainly because of a large number of industrial applications including human-computer interaction [1], antiterrorist applications [2], traffic surveillance [3], automotive safety [4], pedestrian detection [5], video surveillance [6], real-time tracking [7], rescue missions [8], and human-robot interaction [9]. This research work focuses on efficient recognition of human activity from recorded videos. Design of an efficient and optimal cost algorithm to detect a person from a video or an image is a challenging task. It is challenging in terms of variations of appearance, color, and movements [10]. Few other detection issues are also noticed like light and background variations [11]. Recently, numerous approaches have been proposed to detect a human from a video or an image. These approaches focused on the distinct use of classifiers, segmentation techniques, and feature extraction methods. Segmentation methods for human detection mainly contain foreground detection [12] and template matching [13]. Existing approaches do not yield optimal results with several humans in an image or a scene. Furthermore, there are many techniques used to detect humans like the Histogram of Gradients (HOG) [14], Haar-like features [15], adaptive contour features (ACF) [16], Hybrid Wind Farm (HWF) [17], Image Source Method (ISM) [18], edge detection [19], and movement characteristics [20]. These extraction methods do not clearly show the mark when people are unclear or have significant fluctuations in their positions. However, selections of relevant characteristics significantly improve human activity recognition. This research implemented a hybrid approach to overcome accuracy challenge of human activity identification. This is done by enhancing the quality of frames extracted from videos and later categorizing the regions on the basis of specified feature vectors. The approach proposed in this paper comprises of five major stages including (a) normalization, (b) feature extraction, (c) feature selection, (d) feature fusion, and (e) classification. Normalization is a preprocessing stage in which several techniques like background subtraction, noise removal, and object extraction are implemented. Three types of features are extracted which are HOG, Gabor, and chromatic features. Principal Component Analysis (PCA) is separately implemented on three feature vectors to get optimal features. Later, the serial feature fusion is incorporated on the selected features. Lastly, five versatile classifiers are applied to evaluate better accuracy.


### 1.1. Major Contributions

Inefficient and lengthy preprocessing procedures decline the optimality of any algorithm. This work focuses on the efficient and accurate use of preprocessing and feature extraction steps. Thus, main contributions in this work include the following:(i)
Morphological operations are applied after background subtraction to get the exact region of interest(ii)
Separate principal component-based scoring for feature subset selection(iii)
Optimal results are obtained by the application of multiple classification techniquesThe chronological order of this manuscript is as follows: Section1 provides domain introduction, Section 2 describes past work related to the recognition of the human activities, Section 3 describes the proposed method, and in Section 4, results are compared with other existing techniques.


## 1.1. Major Contributions

Inefficient and lengthy preprocessing procedures decline the optimality of any algorithm. This work focuses on the efficient and accurate use of preprocessing and feature extraction steps. Thus, main contributions in this work include the following:(i)
Morphological operations are applied after background subtraction to get the exact region of interest(ii)
Separate principal component-based scoring for feature subset selection(iii)
Optimal results are obtained by the application of multiple classification techniquesThe chronological order of this manuscript is as follows: Section1 provides domain introduction, Section 2 describes past work related to the recognition of the human activities, Section 3 describes the proposed method, and in Section 4, results are compared with other existing techniques.


## 2. Related Work

So much work has been done and is ongoing in human activity recognition. All of the approaches proposed lie under two main categories: (a) the traditional handcrafted feature extraction methods [21] and (b) the automatic features (deep learning) [22] which employ automatic feature extraction methods. Some major existing works performed in human activity recognition are discussed as follows: An activity recognition system based on streaming data is presented by Yala et al. [23]. The proposed technique efficiently detects significant human activities. Nunes et al. [24] presented a framework for daily human action recognition. The proposed technique firstly extracts various features. Later, every human activity frame is encircled by two consecutive automatically recognized key positions, in which maximum static and dynamic characteristics are extracted. Kantorov and Laptev [25] discovered feature encoding by Fisher vectors and determined accurate action recognition utilizing linear classifiers. Liu et al. [26] presented a framework in which multiple features are fused to make action recognition better. The proposed approach captures the silhouette deformation of the performer after considering activities as 3D objects. Azary and Savakis [27] use sporadic demonstrations of spatial and temporal aggregate movements with abnormal size and location characteristics. Oreifej and Liu [28] defined the depth order incorporating histogram that records the physical dispersion of the surface in the 4 dimensions including spatial, coordinates, depth, and time. Conde et al. [29] introduced a human crawling technique to watch videos that work in a dynamic environment. This approach used the combined function of HOG and Gabor [30].In deep learning features, Wang et al. [31] proposed an algorithm which is useful to mine deep features from small video fragments. Additionally, depiction features of neighboring nodes of the secreted layer were considered according to similar activation states. Zhang et al. [32] introduced a less complex descriptor called 3D histogram texture in order to mine unique features from a given set of depth maps. On 3 orthogonal Cartesian planes, a three-dimensional histogram is formed. In [33], Lan et al. proposed an approach to influence operational methods from data-independent and data-driven methods to make action recognition systems better. Sargano et al. [34] proposed a new technique for recognizing human activity on the basis of the pretrained structure of the deep Convolutional Neural Network (CNN) for extraction and depiction of features in which the support vector machine (SVM) and K-Nearest Neighbor (KNN) are fused to recognize activity. In [35], the authors offered a small radial feature based on imaginary contour points and adapted to reactive real-time processing. Imaging-based features are useful for RGB-D images because of the shape, which is easily viewed as a bit mask based on the depth data provided by Microsoft Connect. Another common feature is presented by Tran and Sorokin [36]. It combines visual flow and silhouette into a single vector of attributes. With radial graphs, the silhouette and optical flow are encoded in X, Y dimensions and linked to a frame of fifteen adjacent frames. Lv and Nevatia [37] suggested a graph of the polynomial calculated by the selection of modified cell beams based on the logarithmic scale. Different kinds of human action include the abnormal activities by using the wireless connection. Support vector machine and the kernel nonlinear regression are used for reduction of the false positive rate. This can be done in the unsupervised learning. The proposed system performs the great function by using the real data [38]. Several techniques are used for finding the human activity in the videos. The authors worked on the feature correlation and frame differencing [39].


## 3. Proposed Methodology

In the proposed algorithm, a novel technique for human activity recognition is proposed. The proposed approach comprises of five basic steps, namely, these approaches are (a) detecting moving objects from the video sequence; (b) extracting the HOG, Gabor, and color features of the moving object; (c) selecting the best characteristics; (d) fusing the selected features serially; and (e) classifying the moving object. Figure1 shows the complete flow of the proposed technique.Figure 1
Detailed description of proposed model based on the machine learning methods.


### 3.1. Preprocessing

In the preprocessing stage, region-wise sliding window is implemented by considering variation in each consecutive frame. The needless regions including the background are ignored. A binary image is achieved after background subtraction on which the noise removal technique is applied. The binary image is transformed to RGB color space and later RGB is converted into Hue Saturation Intensity (HSI). In the next phase, a person is detected by drawing a bounding box around the person. The aim of preprocessing is to enhance the quality of video-extracted frames. The input image or frame extracted from a video is in RGB format. Preprocessing is applied to improve the foreground features for further processing. The steps of preprocessing are described below.


#### 3.1.1. Background Subtraction

Background subtraction is the first step in which RGB frames are extracted from the background and foreground videos for frame-by-frame processing. This is done because every processed frame gives us diverse results. With the presence of variations in every processed frame, the authenticity of the proposed algorithm is judged in a better way. In some cases, moving background or the presence of multiple objects is challenging to handle. The background frames are subtracted from the frames having a person doing a particular activity. Before taking the difference, both images are transformed from RGB color to HSI color. After that, the background image is subtracted from the actual image after converting from RGB to HSI. The conversion equation from RGB space and HIS space is given as [40]
(1)I=3R+G+B,(2)θ=arccos1/2R−G+R−BR−G2+R−BG−B,(3)H=θG≥B2x−θG≤B,(4)S=1−3minR,G,BR+G+B,whereI, S, and H are intensity, saturation, and hue, respectively. After this step, the binary image is produced. Some samples of the resulted images of this step can be seen in Figure 2(b).Figure 2
Preprocessing stages: (a) original images; (b) background subtraction images; (c) image enhancement; (d) object detection; (e) binary to RGB conversion; (f) image cropping.


#### 3.1.2. Morphological Operation

Images yielded after general background subtraction steps are noisy as shown in Figure2(b). Morphological operation is applied to minimize the noise present in the image because the noisy image is not used for further processing. For this purpose, the preprocessing steps can be performed. The operation is known as opening by reestablishment of erosion, and it conserves the underlying shape of the object [41]. Regions having the least number of pixels are removed. The aim of this step is to detect the person in the image easily. After applying the opening morphological operation using the structuring element of 12-pixel-wide circular, the resulting images are much enhanced, and an individual is easily detected from the frame. The outcome of the enhanced image is shown in Figure 2(c). Hence, it is obvious that the opening morphological operation is the necessary step before object detection in the preprocessing stage.


#### 3.1.3. Image Cropping

Pixels from the white region in an image are counted to identify an object. The area which has more than 300 pixels is considered as the required object or human. All the white regions having less than 300 pixels are eliminated which are not required. When the object is detected, the bounding box is drawn around the person and the unnecessary part of the image is removed. The purpose of drawing the bounding box is to get the required part of the image by neglecting the unnecessary part as shown in Figure2(d).


### 3.2. Feature Extraction

In the second stage of the proposed algorithm, three different types of extractors including HOG, Gabor, and cooccurrence matrices and chromatic features are employed to get the features of each frame. HOG, Gabor, and cooccurrence matrices and chromatic feature vectors are formed with1×3780, 1×60, and 1×9 standard dimensions, respectively. Each feature is described as follows.


#### 3.2.1. HOG Features

In HOG feature extraction [14], the image is separated into small segments for individual processing. These segments are joined later. To achieve Gx and Gy directions, the Sobel kernel function is used on processed images. Mathematically, the process is depicted in the following equations.
(5)FsegGi,j=Gxi,j2+Gyi,j2,(6)Fseg∅Gi,j=tan−1Gyi,jGxi,j,where∣G∣ represents magnitude, ∅G donates the angle of gradient, and i and j represent rows and columns simultaneously. The angle allocates the cell votes to bins based on the gradient. Later, the standardized vector is being achieved by using every block of the histogram. On the segmented image, the HOG feature descriptor is being implemented with 8 bin cells which are represented in the following equation.
(7)FsegVNi=ViV22+∊2,where “∊” is a minor constant which does not divide by zero and V indicates the vector which is not normalized by containing all histograms in a block. When all of these vectors are combined in a single block, the HOG feature vector is achieved. Furthermore, mean variance and range through each feature are measured. Graphical representation of HOG features is shown in Figure 3.Figure 3
Visualization of histogram of oriented gradient features: (a) original image; (b) HOG features.
(a)(b)


#### 3.2.2. Gabor Features

In the spatial area, modified 2D-Gabor filter [42] is utilized using the “Gaussian Kernel” feature by a complex sinusoidal wave as shown in the following equation.
(8)Fseg=fs2πYη′exp−p′+Y2q′2σ2exp2πfsx′+∅.Herefs shows sinusoidal frequency, θ represents band similarity direction of an activity described by Gabor, ∅ indicates the phase offset, σ indicates the Standard Deviation (SD) of the Gaussian wrapper, and Y shows the characteristics regarding space proportion in which the elliptic support of the function described by Gabor is designated; p′ and q′ are described in the following equations.
(9)x′=xcoscosθ+ysinsinθ,(10)y′=xsinsinθ+ycoscosθ.Gabor feature [43] is implemented in six directions and five scales. Gabor feature measurement is chosen as 1×30. The variance and mean through the Gabor feature are measured. Graphical representation of HOG features is described in Figure 4.Figure 4
Gabor feature visualization: (a) original image; (b) Gabor features.
(a)(b)


#### 3.2.3. Cooccurrence Matrices and Chromatic Features

Grey tone spatial dependence is linked with cooccurrence technique. This approach works with the approximation. The function of the second-order density probabilityhi,j∣d,θ is approximated. Each combined density function of the second order is calculated by measuring all pairs of pixels which are separated by distance d having gray levels i and j in the direction of the angle. The angular displacement θ is generally understood in the following interval: θ=0,π/4,π/2,3π/4. The correlation table records a considerable amount of textual information. For a rough texture, these matrices usually have high values near the main diameter, while the costs are split into a soft texture. The cooccurrence matrices are summarized from the different directions to obtain a rotational invariant characteristic. This technique has become a reference point because of its intensive use [44], while other researchers relied on a smaller number of functions, such as entropy (H), correlation (COR), energy (E), and local homogeneity (LH).
(11)E=∑i∑jhi,j∣d,θ2,(12)H=−∑i∑jhd,θloghd,θ,(13)I=∑i∑ji−j2hd,θ,(14)LH=∑i∑ji,j∣d,θ1+i+j2,(15)COR=∑i∑ji−μxj−μyhi,j∣d,θσxσy,whereμx is the horizontal mean, σx is the variance, and both μy and σy are the vertical statistics.This technique records second-degree grayscale statistics related to human perception and texture discrimination which are used with various disadvantages [45]. The disadvantage of the given technique is that it does not explain the aspects of the shape and type of texture. In addition, this technique involves choosing an appropriate level of quantification. Text information may be lost due to the reduced number of antenna sizes at the quantization level. And a relatively large number of compartments can lead to irrelevant text features.


### 3.3. Feature Selection

The sensitivity of various machine defect features differs meaningfully in dissimilar working circumstances. It becomes vital to develop an organize feature selection structure. This provides the basis for organization of descriptive structures [46]. In the proposed technique, PCA is used for feature selection to select the prominent features separately from the results of HOG, Gabor, and cooccurrence matrices and chromatic feature vectors.Generally, the PCA method converts fromd-dimensional space of n vectors to another space of d′-dimensions having n vectors (x1′,x2′,⋯,xi′,⋯,xn′) as given by the following equation [47].
(16)xr′=∑n=1d′an,ren,d′≤d,where en shows the eigenvectors relating with d′-dimensional space and largest eigenvalues of the disseminated matrix S. On the other hand, an,r are forecasts of the vectors xr on the eigenvectors. These are the main constituents of true datasets. The d and d′ are both positive integers such that d′ cannot be greater than d in any of the cases. d×d matrix S represents the original dataset (x1,x2,⋯,xi,⋯,xn) which is defined as
(17)S=ExixiT,fori=1ton,whereExixiT is the “statistical expectancy operator” implemented on the external multiplicative product of xi and xiT. The depiction illustrated in Equation (26) decreases the occurrence of error between the converted vectors and the original. If the variance of principal components such as an,r is considered, the problem is simplified.


### 3.4. Feature Fusion

The purpose of feature fusion makes the action recognition algorithm efficient. This also enhances the action classification rate of human in complicated scenarios. In this method, feature fusion produces considerably improved results not only in the dark background but also in the high brightness environment as compared to original Gabor and HOG features. Hand-crafted features are combined with the deep learning models. The model is named as the posteriori algorithm [48].For fusing the features, a unique method is deployed which depends on the vector dimension size. The size of these feature vectors are1×60, 1×3780, and 1×9 in HOG, Gabor, and cooccurrence matrices and chromatic features, respectively. For feature fusion, let C1,C2,C3,⋯,Cn be the human activity classes, which need to be classified. Let Δ=∅v∅∈RN indicate the number of training samples. ΎHOG,ΎGab,ΎChrom∈RNHOG+Gab+Chrom are the three feature vectors extracted. The size is defined as
(18)FV1=j1,⋯jk,FV2=y1,⋯yk,FV3=d1,⋯dk,whereFV1, FV2, and FV3 indicate the size of HOG, Gabor, and cooccurrence matrices and chromatic features, respectively. The sizes of the feature vectors are characterized through set k, where k∈60,3780,9. As discussed earlier, the sizes of extracted feature sets are ′ϒHOG⟶1×3780,′ϒGab⟶1×60,′ϒChrom⟶1×9. The final extracted vector is indicated as
(19)F∅=∑jFV1ΎHOG+∑tFV2ΎGab+∑dFV3ΎChrom,(20)F∅=1×3780+1×60+1×9,(21)Final∅=1×3849.


### 3.5. Classification

Five different classifiers including linear-SVM, cubic-SVM, complex tree, fine-KNN, and subspace-KNN are used for result comparisons. Figure5 depicts the detailed view of feature selection, fusion, and selection.Figure 5
Feature vector selection, fusion, and classification.The accuracy achieved by subspace-KNN is highest among all the classifiers on the KTH dataset, while cubic-SVM has achieved higher accuracy than other classifiers on the Weizmann dataset. The random subspace approach depends on a stochastic procedure which selects the components of the particular feature vector randomly to construct every classifier. In the KNN classifier, when a testing sample is compared to the original, only the chosen features will get the nonzero contributions [49]. On the other hand, State Vector Machines construct models which are complicated and contain radial basis function (RBF), polynomial classifiers, and large neural nets. It is easy to examine mathematically; it resembles a linear method in a multidimensional feature space nonlinearly associated with the input space [50].


## 3.1. Preprocessing

In the preprocessing stage, region-wise sliding window is implemented by considering variation in each consecutive frame. The needless regions including the background are ignored. A binary image is achieved after background subtraction on which the noise removal technique is applied. The binary image is transformed to RGB color space and later RGB is converted into Hue Saturation Intensity (HSI). In the next phase, a person is detected by drawing a bounding box around the person. The aim of preprocessing is to enhance the quality of video-extracted frames. The input image or frame extracted from a video is in RGB format. Preprocessing is applied to improve the foreground features for further processing. The steps of preprocessing are described below.


### 3.1.1. Background Subtraction

Background subtraction is the first step in which RGB frames are extracted from the background and foreground videos for frame-by-frame processing. This is done because every processed frame gives us diverse results. With the presence of variations in every processed frame, the authenticity of the proposed algorithm is judged in a better way. In some cases, moving background or the presence of multiple objects is challenging to handle. The background frames are subtracted from the frames having a person doing a particular activity. Before taking the difference, both images are transformed from RGB color to HSI color. After that, the background image is subtracted from the actual image after converting from RGB to HSI. The conversion equation from RGB space and HIS space is given as [40]
(1)I=3R+G+B,(2)θ=arccos1/2R−G+R−BR−G2+R−BG−B,(3)H=θG≥B2x−θG≤B,(4)S=1−3minR,G,BR+G+B,whereI, S, and H are intensity, saturation, and hue, respectively. After this step, the binary image is produced. Some samples of the resulted images of this step can be seen in Figure 2(b).Figure 2
Preprocessing stages: (a) original images; (b) background subtraction images; (c) image enhancement; (d) object detection; (e) binary to RGB conversion; (f) image cropping.


### 3.1.2. Morphological Operation

Images yielded after general background subtraction steps are noisy as shown in Figure2(b). Morphological operation is applied to minimize the noise present in the image because the noisy image is not used for further processing. For this purpose, the preprocessing steps can be performed. The operation is known as opening by reestablishment of erosion, and it conserves the underlying shape of the object [41]. Regions having the least number of pixels are removed. The aim of this step is to detect the person in the image easily. After applying the opening morphological operation using the structuring element of 12-pixel-wide circular, the resulting images are much enhanced, and an individual is easily detected from the frame. The outcome of the enhanced image is shown in Figure 2(c). Hence, it is obvious that the opening morphological operation is the necessary step before object detection in the preprocessing stage.


### 3.1.3. Image Cropping

Pixels from the white region in an image are counted to identify an object. The area which has more than 300 pixels is considered as the required object or human. All the white regions having less than 300 pixels are eliminated which are not required. When the object is detected, the bounding box is drawn around the person and the unnecessary part of the image is removed. The purpose of drawing the bounding box is to get the required part of the image by neglecting the unnecessary part as shown in Figure2(d).


## 3.1.1. Background Subtraction

Background subtraction is the first step in which RGB frames are extracted from the background and foreground videos for frame-by-frame processing. This is done because every processed frame gives us diverse results. With the presence of variations in every processed frame, the authenticity of the proposed algorithm is judged in a better way. In some cases, moving background or the presence of multiple objects is challenging to handle. The background frames are subtracted from the frames having a person doing a particular activity. Before taking the difference, both images are transformed from RGB color to HSI color. After that, the background image is subtracted from the actual image after converting from RGB to HSI. The conversion equation from RGB space and HIS space is given as [40]
(1)I=3R+G+B,(2)θ=arccos1/2R−G+R−BR−G2+R−BG−B,(3)H=θG≥B2x−θG≤B,(4)S=1−3minR,G,BR+G+B,whereI, S, and H are intensity, saturation, and hue, respectively. After this step, the binary image is produced. Some samples of the resulted images of this step can be seen in Figure 2(b).Figure 2
Preprocessing stages: (a) original images; (b) background subtraction images; (c) image enhancement; (d) object detection; (e) binary to RGB conversion; (f) image cropping.


## 3.1.2. Morphological Operation

Images yielded after general background subtraction steps are noisy as shown in Figure2(b). Morphological operation is applied to minimize the noise present in the image because the noisy image is not used for further processing. For this purpose, the preprocessing steps can be performed. The operation is known as opening by reestablishment of erosion, and it conserves the underlying shape of the object [41]. Regions having the least number of pixels are removed. The aim of this step is to detect the person in the image easily. After applying the opening morphological operation using the structuring element of 12-pixel-wide circular, the resulting images are much enhanced, and an individual is easily detected from the frame. The outcome of the enhanced image is shown in Figure 2(c). Hence, it is obvious that the opening morphological operation is the necessary step before object detection in the preprocessing stage.


## 3.1.3. Image Cropping

Pixels from the white region in an image are counted to identify an object. The area which has more than 300 pixels is considered as the required object or human. All the white regions having less than 300 pixels are eliminated which are not required. When the object is detected, the bounding box is drawn around the person and the unnecessary part of the image is removed. The purpose of drawing the bounding box is to get the required part of the image by neglecting the unnecessary part as shown in Figure2(d).


## 3.2. Feature Extraction

In the second stage of the proposed algorithm, three different types of extractors including HOG, Gabor, and cooccurrence matrices and chromatic features are employed to get the features of each frame. HOG, Gabor, and cooccurrence matrices and chromatic feature vectors are formed with1×3780, 1×60, and 1×9 standard dimensions, respectively. Each feature is described as follows.


### 3.2.1. HOG Features

In HOG feature extraction [14], the image is separated into small segments for individual processing. These segments are joined later. To achieve Gx and Gy directions, the Sobel kernel function is used on processed images. Mathematically, the process is depicted in the following equations.
(5)FsegGi,j=Gxi,j2+Gyi,j2,(6)Fseg∅Gi,j=tan−1Gyi,jGxi,j,where∣G∣ represents magnitude, ∅G donates the angle of gradient, and i and j represent rows and columns simultaneously. The angle allocates the cell votes to bins based on the gradient. Later, the standardized vector is being achieved by using every block of the histogram. On the segmented image, the HOG feature descriptor is being implemented with 8 bin cells which are represented in the following equation.
(7)FsegVNi=ViV22+∊2,where “∊” is a minor constant which does not divide by zero and V indicates the vector which is not normalized by containing all histograms in a block. When all of these vectors are combined in a single block, the HOG feature vector is achieved. Furthermore, mean variance and range through each feature are measured. Graphical representation of HOG features is shown in Figure 3.Figure 3
Visualization of histogram of oriented gradient features: (a) original image; (b) HOG features.
(a)(b)


### 3.2.2. Gabor Features

In the spatial area, modified 2D-Gabor filter [42] is utilized using the “Gaussian Kernel” feature by a complex sinusoidal wave as shown in the following equation.
(8)Fseg=fs2πYη′exp−p′+Y2q′2σ2exp2πfsx′+∅.Herefs shows sinusoidal frequency, θ represents band similarity direction of an activity described by Gabor, ∅ indicates the phase offset, σ indicates the Standard Deviation (SD) of the Gaussian wrapper, and Y shows the characteristics regarding space proportion in which the elliptic support of the function described by Gabor is designated; p′ and q′ are described in the following equations.
(9)x′=xcoscosθ+ysinsinθ,(10)y′=xsinsinθ+ycoscosθ.Gabor feature [43] is implemented in six directions and five scales. Gabor feature measurement is chosen as 1×30. The variance and mean through the Gabor feature are measured. Graphical representation of HOG features is described in Figure 4.Figure 4
Gabor feature visualization: (a) original image; (b) Gabor features.
(a)(b)


### 3.2.3. Cooccurrence Matrices and Chromatic Features

Grey tone spatial dependence is linked with cooccurrence technique. This approach works with the approximation. The function of the second-order density probabilityhi,j∣d,θ is approximated. Each combined density function of the second order is calculated by measuring all pairs of pixels which are separated by distance d having gray levels i and j in the direction of the angle. The angular displacement θ is generally understood in the following interval: θ=0,π/4,π/2,3π/4. The correlation table records a considerable amount of textual information. For a rough texture, these matrices usually have high values near the main diameter, while the costs are split into a soft texture. The cooccurrence matrices are summarized from the different directions to obtain a rotational invariant characteristic. This technique has become a reference point because of its intensive use [44], while other researchers relied on a smaller number of functions, such as entropy (H), correlation (COR), energy (E), and local homogeneity (LH).
(11)E=∑i∑jhi,j∣d,θ2,(12)H=−∑i∑jhd,θloghd,θ,(13)I=∑i∑ji−j2hd,θ,(14)LH=∑i∑ji,j∣d,θ1+i+j2,(15)COR=∑i∑ji−μxj−μyhi,j∣d,θσxσy,whereμx is the horizontal mean, σx is the variance, and both μy and σy are the vertical statistics.This technique records second-degree grayscale statistics related to human perception and texture discrimination which are used with various disadvantages [45]. The disadvantage of the given technique is that it does not explain the aspects of the shape and type of texture. In addition, this technique involves choosing an appropriate level of quantification. Text information may be lost due to the reduced number of antenna sizes at the quantization level. And a relatively large number of compartments can lead to irrelevant text features.


## 3.2.1. HOG Features

In HOG feature extraction [14], the image is separated into small segments for individual processing. These segments are joined later. To achieve Gx and Gy directions, the Sobel kernel function is used on processed images. Mathematically, the process is depicted in the following equations.
(5)FsegGi,j=Gxi,j2+Gyi,j2,(6)Fseg∅Gi,j=tan−1Gyi,jGxi,j,where∣G∣ represents magnitude, ∅G donates the angle of gradient, and i and j represent rows and columns simultaneously. The angle allocates the cell votes to bins based on the gradient. Later, the standardized vector is being achieved by using every block of the histogram. On the segmented image, the HOG feature descriptor is being implemented with 8 bin cells which are represented in the following equation.
(7)FsegVNi=ViV22+∊2,where “∊” is a minor constant which does not divide by zero and V indicates the vector which is not normalized by containing all histograms in a block. When all of these vectors are combined in a single block, the HOG feature vector is achieved. Furthermore, mean variance and range through each feature are measured. Graphical representation of HOG features is shown in Figure 3.Figure 3
Visualization of histogram of oriented gradient features: (a) original image; (b) HOG features.
(a)(b)


## 3.2.2. Gabor Features

In the spatial area, modified 2D-Gabor filter [42] is utilized using the “Gaussian Kernel” feature by a complex sinusoidal wave as shown in the following equation.
(8)Fseg=fs2πYη′exp−p′+Y2q′2σ2exp2πfsx′+∅.Herefs shows sinusoidal frequency, θ represents band similarity direction of an activity described by Gabor, ∅ indicates the phase offset, σ indicates the Standard Deviation (SD) of the Gaussian wrapper, and Y shows the characteristics regarding space proportion in which the elliptic support of the function described by Gabor is designated; p′ and q′ are described in the following equations.
(9)x′=xcoscosθ+ysinsinθ,(10)y′=xsinsinθ+ycoscosθ.Gabor feature [43] is implemented in six directions and five scales. Gabor feature measurement is chosen as 1×30. The variance and mean through the Gabor feature are measured. Graphical representation of HOG features is described in Figure 4.Figure 4
Gabor feature visualization: (a) original image; (b) Gabor features.
(a)(b)


## 3.2.3. Cooccurrence Matrices and Chromatic Features

Grey tone spatial dependence is linked with cooccurrence technique. This approach works with the approximation. The function of the second-order density probabilityhi,j∣d,θ is approximated. Each combined density function of the second order is calculated by measuring all pairs of pixels which are separated by distance d having gray levels i and j in the direction of the angle. The angular displacement θ is generally understood in the following interval: θ=0,π/4,π/2,3π/4. The correlation table records a considerable amount of textual information. For a rough texture, these matrices usually have high values near the main diameter, while the costs are split into a soft texture. The cooccurrence matrices are summarized from the different directions to obtain a rotational invariant characteristic. This technique has become a reference point because of its intensive use [44], while other researchers relied on a smaller number of functions, such as entropy (H), correlation (COR), energy (E), and local homogeneity (LH).
(11)E=∑i∑jhi,j∣d,θ2,(12)H=−∑i∑jhd,θloghd,θ,(13)I=∑i∑ji−j2hd,θ,(14)LH=∑i∑ji,j∣d,θ1+i+j2,(15)COR=∑i∑ji−μxj−μyhi,j∣d,θσxσy,whereμx is the horizontal mean, σx is the variance, and both μy and σy are the vertical statistics.This technique records second-degree grayscale statistics related to human perception and texture discrimination which are used with various disadvantages [45]. The disadvantage of the given technique is that it does not explain the aspects of the shape and type of texture. In addition, this technique involves choosing an appropriate level of quantification. Text information may be lost due to the reduced number of antenna sizes at the quantization level. And a relatively large number of compartments can lead to irrelevant text features.


## 3.3. Feature Selection

The sensitivity of various machine defect features differs meaningfully in dissimilar working circumstances. It becomes vital to develop an organize feature selection structure. This provides the basis for organization of descriptive structures [46]. In the proposed technique, PCA is used for feature selection to select the prominent features separately from the results of HOG, Gabor, and cooccurrence matrices and chromatic feature vectors.Generally, the PCA method converts fromd-dimensional space of n vectors to another space of d′-dimensions having n vectors (x1′,x2′,⋯,xi′,⋯,xn′) as given by the following equation [47].
(16)xr′=∑n=1d′an,ren,d′≤d,where en shows the eigenvectors relating with d′-dimensional space and largest eigenvalues of the disseminated matrix S. On the other hand, an,r are forecasts of the vectors xr on the eigenvectors. These are the main constituents of true datasets. The d and d′ are both positive integers such that d′ cannot be greater than d in any of the cases. d×d matrix S represents the original dataset (x1,x2,⋯,xi,⋯,xn) which is defined as
(17)S=ExixiT,fori=1ton,whereExixiT is the “statistical expectancy operator” implemented on the external multiplicative product of xi and xiT. The depiction illustrated in Equation (26) decreases the occurrence of error between the converted vectors and the original. If the variance of principal components such as an,r is considered, the problem is simplified.


## 3.4. Feature Fusion

The purpose of feature fusion makes the action recognition algorithm efficient. This also enhances the action classification rate of human in complicated scenarios. In this method, feature fusion produces considerably improved results not only in the dark background but also in the high brightness environment as compared to original Gabor and HOG features. Hand-crafted features are combined with the deep learning models. The model is named as the posteriori algorithm [48].For fusing the features, a unique method is deployed which depends on the vector dimension size. The size of these feature vectors are1×60, 1×3780, and 1×9 in HOG, Gabor, and cooccurrence matrices and chromatic features, respectively. For feature fusion, let C1,C2,C3,⋯,Cn be the human activity classes, which need to be classified. Let Δ=∅v∅∈RN indicate the number of training samples. ΎHOG,ΎGab,ΎChrom∈RNHOG+Gab+Chrom are the three feature vectors extracted. The size is defined as
(18)FV1=j1,⋯jk,FV2=y1,⋯yk,FV3=d1,⋯dk,whereFV1, FV2, and FV3 indicate the size of HOG, Gabor, and cooccurrence matrices and chromatic features, respectively. The sizes of the feature vectors are characterized through set k, where k∈60,3780,9. As discussed earlier, the sizes of extracted feature sets are ′ϒHOG⟶1×3780,′ϒGab⟶1×60,′ϒChrom⟶1×9. The final extracted vector is indicated as
(19)F∅=∑jFV1ΎHOG+∑tFV2ΎGab+∑dFV3ΎChrom,(20)F∅=1×3780+1×60+1×9,(21)Final∅=1×3849.


## 3.5. Classification

Five different classifiers including linear-SVM, cubic-SVM, complex tree, fine-KNN, and subspace-KNN are used for result comparisons. Figure5 depicts the detailed view of feature selection, fusion, and selection.Figure 5
Feature vector selection, fusion, and classification.The accuracy achieved by subspace-KNN is highest among all the classifiers on the KTH dataset, while cubic-SVM has achieved higher accuracy than other classifiers on the Weizmann dataset. The random subspace approach depends on a stochastic procedure which selects the components of the particular feature vector randomly to construct every classifier. In the KNN classifier, when a testing sample is compared to the original, only the chosen features will get the nonzero contributions [49]. On the other hand, State Vector Machines construct models which are complicated and contain radial basis function (RBF), polynomial classifiers, and large neural nets. It is easy to examine mathematically; it resembles a linear method in a multidimensional feature space nonlinearly associated with the input space [50].


## 4. Results and Analysis of Experiment

The experimental setups, datasets, and results based on the performance measures are discussed in this section.


### 4.1. Experimental Setup

The time elapsed during activity classification depends on resources such as memory, Central Processing Unit (CPU) speed, power supplies, disk storage, and cooling systems. This can precisely describe a linear relationship between elapsed time and CPU usage. The tested system (DELL Latitude E5520) to run the proposed algorithm consists of a Microsoft Windows 10 Pro environment with Intel Core-i5 2540M @ 2.60 GHz processor. The system RAM is 4.00 GB with a 64-bit operating system and an x64 processor. All the results presented in this section are the results obtained in this system.


### 4.2. Datasets

To validate the results, two different types of datasets are used in this research. This includes KTH and Weizmann datasets. Both of the datasets are described briefly hereunder.


#### 4.2.1. Weizmann Dataset

The Weizmann dataset [51] contains 2513 human activity images. It covers five types of human behavior performed by nine different actors. To verify the proposed algorithm, a 50 : 50 method is run. This means that half of the images are used for training the classifier and the remaining half are used to test the performance of the algorithm. After the selection and fusion of features, classification techniques are applied to evaluate the results. Figure 6 shows some images as a sample from the Weizmann dataset.Figure 6
Sample images of Weizmann dataset.


#### 4.2.2. KTH Datasets

KTH datasets consists of 1628 images of six different types of human activities. Images with different variations are chosen for the authentication of the proposed method. Half of the images are used in the training of the classifier while the remaining 50% are used for the purpose of testing. Figure7 shows some of the images from the Weizmann datasets. These datasets include boxing, clapping, hand waving, running, and walking.Figure 7
Sample images of KTH dataset.


### 4.3. Performance Measures

Performance of the proposed algorithm is assessed on the basis of performance measures such as specificity (SPE), area under the curve (AUC), precision (PRE), sensitivity (SEN), and accuracy (ACU). Mathematically, it is represented by the following equations.(22)PRE=TPTP+FP,(23)SEN=TPTP+FN,(24)SPE=TNTN+FP,(25)ACU=TP+TNFP+TP+FN+TN,(26)AUC=∫∞−∞TPRTFPRTdT.In the above equations, FP represents false positive, TN represents true negative, TP represents true positive, and FN represents false negative.All of the performance measures mentioned in Equation (20) to (25) are calculated from confusion matrices. These matrices have the finest results of the Weizmann and KTH datasets.


### 4.4. Experiments

For quantitative outcomes, six different experiments are implemented using a separate number of features. The comprehensive description of all experiments with a numeral classes, numeral folds, and features can be seen in Table1. The comprehensive analyses of experiments performed on 316 bend, 624 hand waving, 457 jumping, 405 run, and 711 walk images are described in the upcoming sections.Table 1
Summary of experiments setting for Weizmann and KTH datasets.
Exp no.No. of classesShapeTextureColorFoldsKTHWeizmann1651006095265300609103655006098465800589556511005597


#### 4.4.1. Experiment 1: Shape Features—100, Texture Features—60, and Color Features—9

In experiment 1, a total of 2513 and 1628 images are collected from the Weizmann and KTH datasets, respectively. The Weizmann dataset consists of 5 categories of manual bending, jumping, running, and walking images, while the KTH dataset includes 6 classes which are clapping, boxing, running, hand waving, and walking. To get the experimental results, 50% of images are used for the purpose of training and the remaining 50% of them are used for testing. For assessment of the results, the “5-fold” validation is used. For experiment 1, the maximum classification rate is 99.3% for the Weizmann dataset obtained with cubic-SVM. The linear-SVM and subspace-KNN obtained 99.8% accuracy simultaneously on the KTH dataset as shown in Table2. Cubic-SVM obtained a better sensitivity rate of 98.84, specificity of 99.81 and accuracy of 98.98 as compared to other classification methods using the Weizmann dataset. On the other hand, linear-SVM and subspace-KNN obtained a sensitivity rate of 99.86, specificity of 99.96, and precision of 98.74 which is better in comparison with other classification methods using the KTH dataset.Table 2
Classification results of experiment 1 with all possible values.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM98.899.798.5298.899.8599.9599.0399.8Cubic-SVM98.8499.8198.9899.399.899.9499.0999.7Complex tree85.9297.3386.0689.098.2699.6797.7798.4Fine-KNN98.9999.7899.2399.099.7799.9199.7599.6Subspace-KNN90.398.3091.793.399.8699.9699.7499.8


#### 4.4.2. Experiment 2: Shape Features—300, Texture Features—60, and Color Features—9

In experiment 2, 2513 and 1628 images are taken from the Weizmann and KTH datasets, respectively. The Weizmann dataset includes five categories. These five categories are bending, handshaking, jumping, running, and walking, while the KTH dataset includes 6 classes which are boxing, clapping, handshake, jogging, running, and walking. For experimental results, half of the images from each dataset are used for training and the remaining half are used for the purpose of testing. For assessment of the results, “10-fold” validation is used. The 10-fold validation is known as the evaluation method. For experiment 2, the maximum classification frequency is 99.5% for the Weizmann dataset on cubic-SVM, while for the KTH dataset, 99.9% is achieved in the subspace-KNN, as shown in Table3. The cubic-SVM applied to the Weizmann dataset is better in terms of sensitivity of 99.34, specificity of 99.89, and precision of 99.5 than other approaches, whereas the KNN subdomain applied to the KTH dataset is better in terms of sensitivity of 99.97, specification of 99.99, and accuracy of 99.95 than the other classification approaches.Table 3
Classification results of experiment 2 along with the sensitivity and other measures.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM98.8399.8499.099.399.8999.9599.8999.8Cubic-SVM99.3499.8999.599.598.8199.9498.6099.7Complex tree85.4097.1585.088.398.3299.6797.3798.5Fine-KNN87.2697.2195.491.199.4299.8499.3899.2Subspace-KNN90.2598.391.993.999.9799.9999.9599.9The experiment 2 produces the best results among all the five experiments implemented during this research process. The proposed algorithm produced the best results on the conditions provided in the experiment 2. The best results calculated on the basis of performance measures of the KTH and Weizmann datasets using confusion matrices are shown in Tables4 and 5, respectively. The KTH datasets give 99.9% accuracy using the subspace-KNN classifier and the Weizmann dataset produced 99.5% accuracy using cubic-SVM which is best among all other classifiers.Table 4
Confusion matrix of KTH dataset of experiment 2 on subspace-KNN.
Classification classesTotal imagesClappingJoggingHand wavingRunningWalkingBoxingClapping312312Jogging191191Hand waving5811580Running109109Walking2727Boxing408408Table 5
Confusion matrix of Weizmann dataset of experiment 2 on cubic-SVM.
Classification classesTotal imagesHand wavingRunningJumpingWalkingBendingHand waving624624Running20620123Jumping42114201Walking27122267Bending375375


#### 4.4.3. Experiment 3: Shape Features—500, Texture Features—60, and Color Features—9

In experiment 3, a total of 2513 images of the Weizmann dataset and 1628 images of the KTH dataset are collected. Five classes from the Weizmann dataset are selected which includes bending, hand waving, jumping, running, and walking. Six classes from the KTH dataset including clapping, boxing, running, hand waving, walking, and hand waiving are selected.For experimental results, half of images from both datasets are selected for training purposes and the remaining half are used for testing. For assessment of the results, “8-fold” validation is used. Maximum classification frequency attained on cubic-SVM is 98.7% for the Weizmann datasets. For the KTH datasets, 99.9% accuracy is attained on subspace-KNN as given in Table6. The cubic-SVM implemented for the Weizmann datasets is better in terms of sensitivity of 97.86, specificity of 99.67, and precision of 98.54 as compared to other approaches. On the other hand, the subspace-KNN implemented for the “KTH” datasets is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.95 as compared to other approaches.Table 6
Classification results of experiment 3 using the linear-SVM method and others.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM97.9099.6998.3998.710099.7298.7098.7Cubic-SVM97.8699.6798.54498.791.5199.2196.3996.5Complex tree85.4397.21285.5388.698.3499.6997.9398.5Fine-KNN63.791.6390.7971.995.3099.3298.0297.0Subspace-KNN89.9998.1892.1193.099.9799.9999.9599.9


#### 4.4.4. Experiment 4: Shape Features—800, Texture Features—59, and Color Features—9

In experiment 4, total of 2513 images of Weizmann datasets and 1628 images of KTH datasets are collected. The Weizmann datasets are comprised of 5 classes including bending, hand waving, jumping, running, and walking images. The KTH datasets are comprised of 6 classes including clapping, boxing, running, hand waving, walking, and hand waiving. For experimental results, half of images from both the datasets are selected for training and the other half of them are used for testing. For assessment of the results, “5-fold” validation is used. Maximum classification frequency of 95.9% for the Weizmann datasets is attained on linear-SVM while 99.9% for the KTH dataset on subspace-KNN as given in Table7. The linear-SVM implemented for the Weizmann dataset is better in terms of sensitivity of 93.38, specificity of 98.96, and precision of 96.09 from other approaches. On the other hand, the subspace-KNN implemented for the “KTH” dataset is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.45 from other approaches.Table 7
Classification results of experiment 4.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM93.3898.9696.0995.959.2596.790.9085.3Cubic-SVM91.5698.595.6394.557.5696.4574.4984.3Complex tree80.5697.1885.5788.597.7499.6397.5198.2Fine-KNN46.2987.5488.8158.270.1496.3090.9084.0Subspace-KNN89.2198.3791.4492.599.9799.9999.4599.9


#### 4.4.5. Experiment 5: Shape Features—1100, Texture Features—55, and Color Features—9

In experiment 5, a total of 2513 images of the Weizmann dataset and 1628 images of the KTH dataset are collected. The Weizmann dataset comprising of 5 classes including bending, hand waving, jumping, running, and walking images is selected. The KTH dataset comprising of 6 classes including clapping, boxing, running, hand waving, and walking is selected. For experimental results, half of the images from both datasets is selected for training the algorithm and the remaining half is used for testing. For appraisal of the results, “7-fold” validation is used. Maximum classification frequency is 92.0% for the Weizmann datasets on subspace-KNN while 99.9% for the KTH dataset on subspace-KNN as given in Table8. The class-wise AUCs are mentioned in Table 9. The subspace-KNN implemented for the Weizmann datasets is better in terms of sensitivity of 88.72, specificity of 97.96, precision of 90.81, and AUC. We can say that subspace-KNN gives the better results. On the other hand, the subspace-KNN implemented for “KTH” datasets is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.95. The results of experiment 5 are presented in Table 8.Table 8
Classification results of experiment 5.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM80.096.6890.087.550.8395.4957.1680.2Cubic-SVM80.096.2090.3186.350.4295.3755.0379.5Complex tree85.3297.885.3188.498.4999.6997.9398.6Fine-KNN33.4284.187.6346.739.4793.684.9257.6Subspace-KNN88.7297.9690.8192.099.9799.9999.9599.9Table 9
AUC results.
MethodClassesExperiment 1Experiment 2Experiment 3Experiment 4Experiment 5WeizmannKTHWeizmannKTHWeizmannKTHWeizmannKTHWeizmannKTHLinear-SVMC1C2C3C4C5C61.000.991.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.000.981.001.000.991.000.991.001.000.981.000.991.001.001.000.980.990.981.001.000.901.000.981.001.00Cubic-SVMC1C2C3C4C5C61.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.000.991.001.000.991.000.991.001.000.981.000.990.991.001.000.980.990.981.001.000.901.000.981.000.99Complex treeC1C2C3C4C5C60.980.870.940.900.971.000.981.000.990.981.000.990.890.930.880.951.000.961.000.980.961.000.980.850.940.900.971.000.981.000.990.981.000.980.880.940.880.960.990.990.990.991.001.000.980.870.940.870.960.990.990.990.961.001.00Fine-KNNC1C2C3C4C5C61.000.990.990.991.000.981.000.980.811.000.980.930.870.910.921.000.971.000.990.691.000.960.790.630.710.760.990.980.990.980.641.000.940.690.510.650.610.890.950.880.910.610.760.910.600.500.620.510.710.750.540.760.500.540.81Subspace-KNNC1C2C3C4C5C61.000.981.000.991.001.001.001.001.001.001.001.000.980.990.991.001.001.001.001.001.001.001.000.981.000.991.001.001.001.001.001.001.001.000.980.990.991.001.001.001.001.001.001.001.000.981.000.991.001.001.001.001.001.001.00


## 4.1. Experimental Setup

The time elapsed during activity classification depends on resources such as memory, Central Processing Unit (CPU) speed, power supplies, disk storage, and cooling systems. This can precisely describe a linear relationship between elapsed time and CPU usage. The tested system (DELL Latitude E5520) to run the proposed algorithm consists of a Microsoft Windows 10 Pro environment with Intel Core-i5 2540M @ 2.60 GHz processor. The system RAM is 4.00 GB with a 64-bit operating system and an x64 processor. All the results presented in this section are the results obtained in this system.


## 4.2. Datasets

To validate the results, two different types of datasets are used in this research. This includes KTH and Weizmann datasets. Both of the datasets are described briefly hereunder.


### 4.2.1. Weizmann Dataset

The Weizmann dataset [51] contains 2513 human activity images. It covers five types of human behavior performed by nine different actors. To verify the proposed algorithm, a 50 : 50 method is run. This means that half of the images are used for training the classifier and the remaining half are used to test the performance of the algorithm. After the selection and fusion of features, classification techniques are applied to evaluate the results. Figure 6 shows some images as a sample from the Weizmann dataset.Figure 6
Sample images of Weizmann dataset.


### 4.2.2. KTH Datasets

KTH datasets consists of 1628 images of six different types of human activities. Images with different variations are chosen for the authentication of the proposed method. Half of the images are used in the training of the classifier while the remaining 50% are used for the purpose of testing. Figure7 shows some of the images from the Weizmann datasets. These datasets include boxing, clapping, hand waving, running, and walking.Figure 7
Sample images of KTH dataset.


## 4.2.1. Weizmann Dataset

The Weizmann dataset [51] contains 2513 human activity images. It covers five types of human behavior performed by nine different actors. To verify the proposed algorithm, a 50 : 50 method is run. This means that half of the images are used for training the classifier and the remaining half are used to test the performance of the algorithm. After the selection and fusion of features, classification techniques are applied to evaluate the results. Figure 6 shows some images as a sample from the Weizmann dataset.Figure 6
Sample images of Weizmann dataset.


## 4.2.2. KTH Datasets

KTH datasets consists of 1628 images of six different types of human activities. Images with different variations are chosen for the authentication of the proposed method. Half of the images are used in the training of the classifier while the remaining 50% are used for the purpose of testing. Figure7 shows some of the images from the Weizmann datasets. These datasets include boxing, clapping, hand waving, running, and walking.Figure 7
Sample images of KTH dataset.


## 4.3. Performance Measures

Performance of the proposed algorithm is assessed on the basis of performance measures such as specificity (SPE), area under the curve (AUC), precision (PRE), sensitivity (SEN), and accuracy (ACU). Mathematically, it is represented by the following equations.(22)PRE=TPTP+FP,(23)SEN=TPTP+FN,(24)SPE=TNTN+FP,(25)ACU=TP+TNFP+TP+FN+TN,(26)AUC=∫∞−∞TPRTFPRTdT.In the above equations, FP represents false positive, TN represents true negative, TP represents true positive, and FN represents false negative.All of the performance measures mentioned in Equation (20) to (25) are calculated from confusion matrices. These matrices have the finest results of the Weizmann and KTH datasets.


## 4.4. Experiments

For quantitative outcomes, six different experiments are implemented using a separate number of features. The comprehensive description of all experiments with a numeral classes, numeral folds, and features can be seen in Table1. The comprehensive analyses of experiments performed on 316 bend, 624 hand waving, 457 jumping, 405 run, and 711 walk images are described in the upcoming sections.Table 1
Summary of experiments setting for Weizmann and KTH datasets.
Exp no.No. of classesShapeTextureColorFoldsKTHWeizmann1651006095265300609103655006098465800589556511005597


### 4.4.1. Experiment 1: Shape Features—100, Texture Features—60, and Color Features—9

In experiment 1, a total of 2513 and 1628 images are collected from the Weizmann and KTH datasets, respectively. The Weizmann dataset consists of 5 categories of manual bending, jumping, running, and walking images, while the KTH dataset includes 6 classes which are clapping, boxing, running, hand waving, and walking. To get the experimental results, 50% of images are used for the purpose of training and the remaining 50% of them are used for testing. For assessment of the results, the “5-fold” validation is used. For experiment 1, the maximum classification rate is 99.3% for the Weizmann dataset obtained with cubic-SVM. The linear-SVM and subspace-KNN obtained 99.8% accuracy simultaneously on the KTH dataset as shown in Table2. Cubic-SVM obtained a better sensitivity rate of 98.84, specificity of 99.81 and accuracy of 98.98 as compared to other classification methods using the Weizmann dataset. On the other hand, linear-SVM and subspace-KNN obtained a sensitivity rate of 99.86, specificity of 99.96, and precision of 98.74 which is better in comparison with other classification methods using the KTH dataset.Table 2
Classification results of experiment 1 with all possible values.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM98.899.798.5298.899.8599.9599.0399.8Cubic-SVM98.8499.8198.9899.399.899.9499.0999.7Complex tree85.9297.3386.0689.098.2699.6797.7798.4Fine-KNN98.9999.7899.2399.099.7799.9199.7599.6Subspace-KNN90.398.3091.793.399.8699.9699.7499.8


### 4.4.2. Experiment 2: Shape Features—300, Texture Features—60, and Color Features—9

In experiment 2, 2513 and 1628 images are taken from the Weizmann and KTH datasets, respectively. The Weizmann dataset includes five categories. These five categories are bending, handshaking, jumping, running, and walking, while the KTH dataset includes 6 classes which are boxing, clapping, handshake, jogging, running, and walking. For experimental results, half of the images from each dataset are used for training and the remaining half are used for the purpose of testing. For assessment of the results, “10-fold” validation is used. The 10-fold validation is known as the evaluation method. For experiment 2, the maximum classification frequency is 99.5% for the Weizmann dataset on cubic-SVM, while for the KTH dataset, 99.9% is achieved in the subspace-KNN, as shown in Table3. The cubic-SVM applied to the Weizmann dataset is better in terms of sensitivity of 99.34, specificity of 99.89, and precision of 99.5 than other approaches, whereas the KNN subdomain applied to the KTH dataset is better in terms of sensitivity of 99.97, specification of 99.99, and accuracy of 99.95 than the other classification approaches.Table 3
Classification results of experiment 2 along with the sensitivity and other measures.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM98.8399.8499.099.399.8999.9599.8999.8Cubic-SVM99.3499.8999.599.598.8199.9498.6099.7Complex tree85.4097.1585.088.398.3299.6797.3798.5Fine-KNN87.2697.2195.491.199.4299.8499.3899.2Subspace-KNN90.2598.391.993.999.9799.9999.9599.9The experiment 2 produces the best results among all the five experiments implemented during this research process. The proposed algorithm produced the best results on the conditions provided in the experiment 2. The best results calculated on the basis of performance measures of the KTH and Weizmann datasets using confusion matrices are shown in Tables4 and 5, respectively. The KTH datasets give 99.9% accuracy using the subspace-KNN classifier and the Weizmann dataset produced 99.5% accuracy using cubic-SVM which is best among all other classifiers.Table 4
Confusion matrix of KTH dataset of experiment 2 on subspace-KNN.
Classification classesTotal imagesClappingJoggingHand wavingRunningWalkingBoxingClapping312312Jogging191191Hand waving5811580Running109109Walking2727Boxing408408Table 5
Confusion matrix of Weizmann dataset of experiment 2 on cubic-SVM.
Classification classesTotal imagesHand wavingRunningJumpingWalkingBendingHand waving624624Running20620123Jumping42114201Walking27122267Bending375375


### 4.4.3. Experiment 3: Shape Features—500, Texture Features—60, and Color Features—9

In experiment 3, a total of 2513 images of the Weizmann dataset and 1628 images of the KTH dataset are collected. Five classes from the Weizmann dataset are selected which includes bending, hand waving, jumping, running, and walking. Six classes from the KTH dataset including clapping, boxing, running, hand waving, walking, and hand waiving are selected.For experimental results, half of images from both datasets are selected for training purposes and the remaining half are used for testing. For assessment of the results, “8-fold” validation is used. Maximum classification frequency attained on cubic-SVM is 98.7% for the Weizmann datasets. For the KTH datasets, 99.9% accuracy is attained on subspace-KNN as given in Table6. The cubic-SVM implemented for the Weizmann datasets is better in terms of sensitivity of 97.86, specificity of 99.67, and precision of 98.54 as compared to other approaches. On the other hand, the subspace-KNN implemented for the “KTH” datasets is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.95 as compared to other approaches.Table 6
Classification results of experiment 3 using the linear-SVM method and others.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM97.9099.6998.3998.710099.7298.7098.7Cubic-SVM97.8699.6798.54498.791.5199.2196.3996.5Complex tree85.4397.21285.5388.698.3499.6997.9398.5Fine-KNN63.791.6390.7971.995.3099.3298.0297.0Subspace-KNN89.9998.1892.1193.099.9799.9999.9599.9


### 4.4.4. Experiment 4: Shape Features—800, Texture Features—59, and Color Features—9

In experiment 4, total of 2513 images of Weizmann datasets and 1628 images of KTH datasets are collected. The Weizmann datasets are comprised of 5 classes including bending, hand waving, jumping, running, and walking images. The KTH datasets are comprised of 6 classes including clapping, boxing, running, hand waving, walking, and hand waiving. For experimental results, half of images from both the datasets are selected for training and the other half of them are used for testing. For assessment of the results, “5-fold” validation is used. Maximum classification frequency of 95.9% for the Weizmann datasets is attained on linear-SVM while 99.9% for the KTH dataset on subspace-KNN as given in Table7. The linear-SVM implemented for the Weizmann dataset is better in terms of sensitivity of 93.38, specificity of 98.96, and precision of 96.09 from other approaches. On the other hand, the subspace-KNN implemented for the “KTH” dataset is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.45 from other approaches.Table 7
Classification results of experiment 4.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM93.3898.9696.0995.959.2596.790.9085.3Cubic-SVM91.5698.595.6394.557.5696.4574.4984.3Complex tree80.5697.1885.5788.597.7499.6397.5198.2Fine-KNN46.2987.5488.8158.270.1496.3090.9084.0Subspace-KNN89.2198.3791.4492.599.9799.9999.4599.9


### 4.4.5. Experiment 5: Shape Features—1100, Texture Features—55, and Color Features—9

In experiment 5, a total of 2513 images of the Weizmann dataset and 1628 images of the KTH dataset are collected. The Weizmann dataset comprising of 5 classes including bending, hand waving, jumping, running, and walking images is selected. The KTH dataset comprising of 6 classes including clapping, boxing, running, hand waving, and walking is selected. For experimental results, half of the images from both datasets is selected for training the algorithm and the remaining half is used for testing. For appraisal of the results, “7-fold” validation is used. Maximum classification frequency is 92.0% for the Weizmann datasets on subspace-KNN while 99.9% for the KTH dataset on subspace-KNN as given in Table8. The class-wise AUCs are mentioned in Table 9. The subspace-KNN implemented for the Weizmann datasets is better in terms of sensitivity of 88.72, specificity of 97.96, precision of 90.81, and AUC. We can say that subspace-KNN gives the better results. On the other hand, the subspace-KNN implemented for “KTH” datasets is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.95. The results of experiment 5 are presented in Table 8.Table 8
Classification results of experiment 5.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM80.096.6890.087.550.8395.4957.1680.2Cubic-SVM80.096.2090.3186.350.4295.3755.0379.5Complex tree85.3297.885.3188.498.4999.6997.9398.6Fine-KNN33.4284.187.6346.739.4793.684.9257.6Subspace-KNN88.7297.9690.8192.099.9799.9999.9599.9Table 9
AUC results.
MethodClassesExperiment 1Experiment 2Experiment 3Experiment 4Experiment 5WeizmannKTHWeizmannKTHWeizmannKTHWeizmannKTHWeizmannKTHLinear-SVMC1C2C3C4C5C61.000.991.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.000.981.001.000.991.000.991.001.000.981.000.991.001.001.000.980.990.981.001.000.901.000.981.001.00Cubic-SVMC1C2C3C4C5C61.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.000.991.001.000.991.000.991.001.000.981.000.990.991.001.000.980.990.981.001.000.901.000.981.000.99Complex treeC1C2C3C4C5C60.980.870.940.900.971.000.981.000.990.981.000.990.890.930.880.951.000.961.000.980.961.000.980.850.940.900.971.000.981.000.990.981.000.980.880.940.880.960.990.990.990.991.001.000.980.870.940.870.960.990.990.990.961.001.00Fine-KNNC1C2C3C4C5C61.000.990.990.991.000.981.000.980.811.000.980.930.870.910.921.000.971.000.990.691.000.960.790.630.710.760.990.980.990.980.641.000.940.690.510.650.610.890.950.880.910.610.760.910.600.500.620.510.710.750.540.760.500.540.81Subspace-KNNC1C2C3C4C5C61.000.981.000.991.001.001.001.001.001.001.001.000.980.990.991.001.001.001.001.001.001.001.000.981.000.991.001.001.001.001.001.001.001.000.980.990.991.001.001.001.001.001.001.001.000.981.000.991.001.001.001.001.001.001.00


## 4.4.1. Experiment 1: Shape Features—100, Texture Features—60, and Color Features—9

In experiment 1, a total of 2513 and 1628 images are collected from the Weizmann and KTH datasets, respectively. The Weizmann dataset consists of 5 categories of manual bending, jumping, running, and walking images, while the KTH dataset includes 6 classes which are clapping, boxing, running, hand waving, and walking. To get the experimental results, 50% of images are used for the purpose of training and the remaining 50% of them are used for testing. For assessment of the results, the “5-fold” validation is used. For experiment 1, the maximum classification rate is 99.3% for the Weizmann dataset obtained with cubic-SVM. The linear-SVM and subspace-KNN obtained 99.8% accuracy simultaneously on the KTH dataset as shown in Table2. Cubic-SVM obtained a better sensitivity rate of 98.84, specificity of 99.81 and accuracy of 98.98 as compared to other classification methods using the Weizmann dataset. On the other hand, linear-SVM and subspace-KNN obtained a sensitivity rate of 99.86, specificity of 99.96, and precision of 98.74 which is better in comparison with other classification methods using the KTH dataset.Table 2
Classification results of experiment 1 with all possible values.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM98.899.798.5298.899.8599.9599.0399.8Cubic-SVM98.8499.8198.9899.399.899.9499.0999.7Complex tree85.9297.3386.0689.098.2699.6797.7798.4Fine-KNN98.9999.7899.2399.099.7799.9199.7599.6Subspace-KNN90.398.3091.793.399.8699.9699.7499.8


## 4.4.2. Experiment 2: Shape Features—300, Texture Features—60, and Color Features—9

In experiment 2, 2513 and 1628 images are taken from the Weizmann and KTH datasets, respectively. The Weizmann dataset includes five categories. These five categories are bending, handshaking, jumping, running, and walking, while the KTH dataset includes 6 classes which are boxing, clapping, handshake, jogging, running, and walking. For experimental results, half of the images from each dataset are used for training and the remaining half are used for the purpose of testing. For assessment of the results, “10-fold” validation is used. The 10-fold validation is known as the evaluation method. For experiment 2, the maximum classification frequency is 99.5% for the Weizmann dataset on cubic-SVM, while for the KTH dataset, 99.9% is achieved in the subspace-KNN, as shown in Table3. The cubic-SVM applied to the Weizmann dataset is better in terms of sensitivity of 99.34, specificity of 99.89, and precision of 99.5 than other approaches, whereas the KNN subdomain applied to the KTH dataset is better in terms of sensitivity of 99.97, specification of 99.99, and accuracy of 99.95 than the other classification approaches.Table 3
Classification results of experiment 2 along with the sensitivity and other measures.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM98.8399.8499.099.399.8999.9599.8999.8Cubic-SVM99.3499.8999.599.598.8199.9498.6099.7Complex tree85.4097.1585.088.398.3299.6797.3798.5Fine-KNN87.2697.2195.491.199.4299.8499.3899.2Subspace-KNN90.2598.391.993.999.9799.9999.9599.9The experiment 2 produces the best results among all the five experiments implemented during this research process. The proposed algorithm produced the best results on the conditions provided in the experiment 2. The best results calculated on the basis of performance measures of the KTH and Weizmann datasets using confusion matrices are shown in Tables4 and 5, respectively. The KTH datasets give 99.9% accuracy using the subspace-KNN classifier and the Weizmann dataset produced 99.5% accuracy using cubic-SVM which is best among all other classifiers.Table 4
Confusion matrix of KTH dataset of experiment 2 on subspace-KNN.
Classification classesTotal imagesClappingJoggingHand wavingRunningWalkingBoxingClapping312312Jogging191191Hand waving5811580Running109109Walking2727Boxing408408Table 5
Confusion matrix of Weizmann dataset of experiment 2 on cubic-SVM.
Classification classesTotal imagesHand wavingRunningJumpingWalkingBendingHand waving624624Running20620123Jumping42114201Walking27122267Bending375375


## 4.4.3. Experiment 3: Shape Features—500, Texture Features—60, and Color Features—9

In experiment 3, a total of 2513 images of the Weizmann dataset and 1628 images of the KTH dataset are collected. Five classes from the Weizmann dataset are selected which includes bending, hand waving, jumping, running, and walking. Six classes from the KTH dataset including clapping, boxing, running, hand waving, walking, and hand waiving are selected.For experimental results, half of images from both datasets are selected for training purposes and the remaining half are used for testing. For assessment of the results, “8-fold” validation is used. Maximum classification frequency attained on cubic-SVM is 98.7% for the Weizmann datasets. For the KTH datasets, 99.9% accuracy is attained on subspace-KNN as given in Table6. The cubic-SVM implemented for the Weizmann datasets is better in terms of sensitivity of 97.86, specificity of 99.67, and precision of 98.54 as compared to other approaches. On the other hand, the subspace-KNN implemented for the “KTH” datasets is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.95 as compared to other approaches.Table 6
Classification results of experiment 3 using the linear-SVM method and others.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM97.9099.6998.3998.710099.7298.7098.7Cubic-SVM97.8699.6798.54498.791.5199.2196.3996.5Complex tree85.4397.21285.5388.698.3499.6997.9398.5Fine-KNN63.791.6390.7971.995.3099.3298.0297.0Subspace-KNN89.9998.1892.1193.099.9799.9999.9599.9


## 4.4.4. Experiment 4: Shape Features—800, Texture Features—59, and Color Features—9

In experiment 4, total of 2513 images of Weizmann datasets and 1628 images of KTH datasets are collected. The Weizmann datasets are comprised of 5 classes including bending, hand waving, jumping, running, and walking images. The KTH datasets are comprised of 6 classes including clapping, boxing, running, hand waving, walking, and hand waiving. For experimental results, half of images from both the datasets are selected for training and the other half of them are used for testing. For assessment of the results, “5-fold” validation is used. Maximum classification frequency of 95.9% for the Weizmann datasets is attained on linear-SVM while 99.9% for the KTH dataset on subspace-KNN as given in Table7. The linear-SVM implemented for the Weizmann dataset is better in terms of sensitivity of 93.38, specificity of 98.96, and precision of 96.09 from other approaches. On the other hand, the subspace-KNN implemented for the “KTH” dataset is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.45 from other approaches.Table 7
Classification results of experiment 4.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM93.3898.9696.0995.959.2596.790.9085.3Cubic-SVM91.5698.595.6394.557.5696.4574.4984.3Complex tree80.5697.1885.5788.597.7499.6397.5198.2Fine-KNN46.2987.5488.8158.270.1496.3090.9084.0Subspace-KNN89.2198.3791.4492.599.9799.9999.4599.9


## 4.4.5. Experiment 5: Shape Features—1100, Texture Features—55, and Color Features—9

In experiment 5, a total of 2513 images of the Weizmann dataset and 1628 images of the KTH dataset are collected. The Weizmann dataset comprising of 5 classes including bending, hand waving, jumping, running, and walking images is selected. The KTH dataset comprising of 6 classes including clapping, boxing, running, hand waving, and walking is selected. For experimental results, half of the images from both datasets is selected for training the algorithm and the remaining half is used for testing. For appraisal of the results, “7-fold” validation is used. Maximum classification frequency is 92.0% for the Weizmann datasets on subspace-KNN while 99.9% for the KTH dataset on subspace-KNN as given in Table8. The class-wise AUCs are mentioned in Table 9. The subspace-KNN implemented for the Weizmann datasets is better in terms of sensitivity of 88.72, specificity of 97.96, precision of 90.81, and AUC. We can say that subspace-KNN gives the better results. On the other hand, the subspace-KNN implemented for “KTH” datasets is better in terms of sensitivity of 99.97, specificity of 99.99, and precision of 99.95. The results of experiment 5 are presented in Table 8.Table 8
Classification results of experiment 5.
WeizmannKTHMethodSEN (%)SPE (%)PRE (%)ACU (%)SEN (%)SPE (%)PRE (%)ACU (%)Linear-SVM80.096.6890.087.550.8395.4957.1680.2Cubic-SVM80.096.2090.3186.350.4295.3755.0379.5Complex tree85.3297.885.3188.498.4999.6997.9398.6Fine-KNN33.4284.187.6346.739.4793.684.9257.6Subspace-KNN88.7297.9690.8192.099.9799.9999.9599.9Table 9
AUC results.
MethodClassesExperiment 1Experiment 2Experiment 3Experiment 4Experiment 5WeizmannKTHWeizmannKTHWeizmannKTHWeizmannKTHWeizmannKTHLinear-SVMC1C2C3C4C5C61.000.991.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.000.981.001.000.991.000.991.001.000.981.000.991.001.001.000.980.990.981.001.000.901.000.981.001.00Cubic-SVMC1C2C3C4C5C61.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.001.000.991.001.000.991.000.991.001.000.981.000.990.991.001.000.980.990.981.001.000.901.000.981.000.99Complex treeC1C2C3C4C5C60.980.870.940.900.971.000.981.000.990.981.000.990.890.930.880.951.000.961.000.980.961.000.980.850.940.900.971.000.981.000.990.981.000.980.880.940.880.960.990.990.990.991.001.000.980.870.940.870.960.990.990.990.961.001.00Fine-KNNC1C2C3C4C5C61.000.990.990.991.000.981.000.980.811.000.980.930.870.910.921.000.971.000.990.691.000.960.790.630.710.760.990.980.990.980.641.000.940.690.510.650.610.890.950.880.910.610.760.910.600.500.620.510.710.750.540.760.500.540.81Subspace-KNNC1C2C3C4C5C61.000.981.000.991.001.001.001.001.001.001.001.000.980.990.991.001.001.001.001.001.001.001.000.981.000.991.001.001.001.001.001.001.001.000.980.990.991.001.001.001.001.001.001.001.000.981.000.991.001.001.001.001.001.001.00


## 5. Discussion

This section presents a detailed analysis of experimental outcomes through the proposed method on the basis of accuracy measures such as precision, sensitivity, specificity, and accuracy. The proposed algorithm consists of five main stages. These five main stages include the preprocessing which is performed first in which datasets are normalized to get better results. The accurate results will give more accuracy. In the second step, feature extraction is implemented using HOG, Gabor, and chromatic feature extractor. In the third step, feature selection is implemented separately based on PCA to get the best features. In the fourth step, features are fused, while in the final stage, results are taken through the classification learner. In preprocessing, background subtraction is done to detect the human from the image and the noise is removed using morphological operations. After removing the noise, a bounding box is drawn to around the person to ignore the unnecessary parts using cropping. In the next step, three kinds of features comprising shape, texture, and color are extracted from segmented images. Five classifiers containing linear-SVM, cubic-SVM, complex tree, fine-KNN, and subspace-KNN are used to test the proposed algorithm. Subspace-KNN and cubic-SVM have achieved higher accuracy than the other classification learners on the “Weizmann” and “KTH” datasets, respectively.In the experimental results, six classes of KTH datasets and five classes of Weizmann datasets are used to get results. 99.90% and 99.5% accuracies for KTH datasets using subspace-KNN are achieved using subspace-KNN and cubic-SVM, respectively. Comparison of the previously implemented algorithms with the proposed algorithm is shown in Table10. The table is explained in a better way. On the basis of the above discussion, it is clear that the combination of three feature extractors used in the proposed algorithm gives better accuracy as compared to the already implemented algorithms.Table 10
Comparison of action recognition results.
ReferenceYearRecognition (%)Weizmann dataset[52]201395.45[53]201495.56[54]201595.10[55]201688.10[7]201795.80[56]201999.0[57]202096.0Proposed201899.5KTH dataset[58]201495.0[59]201595.21[60]201596.50[61]201697.10[62]201794.92[7]201799.30[63]202094.83[64]201991.67Proposed201899.90


## 6. Conclusion

In this research, a technique is proposed for the “detection” and “classification” of several activities from videos and multimedia frames. The proposed algorithm consists of five pipeline processes which are preprocessing, feature extraction, feature selection, serial feature fusion, and classification. From all results shown above and in Discussion, it is obvious that by using the proposed technique, the detection of human activities is tackled. Five different experiments are executed to judge the authenticity of this algorithm. The results of all five experiments are discussed in detail in Results and Analysis of Experiment. The KTH and Weizmann datasets are selected to check the reliability of this algorithm. This method executed better on the KTH and Weizmann datasets. Moreover, it is determined that shape features are very important for the classification of chosen classes such as bending, jumping, running, walking, and hand waving. The texture and color features are very essential for the detection and classification of different usual activities performed by a human being. To enhance the system performance, feature selection and feature fusion seem to be quite significant as accuracy and sensitivity. In contrast to the existing techniques, the proposed technique has achieved higher accuracy which is 99.9% on KTH datasets and 99.5% on Weizmann datasets.



---

*Source: 7931729-2022-02-02.xml*