human action recognition has been in great demand in the field of pattern recognition , given its direct relation to video surveillance , human - computer interaction , and ambient - assisted living ( aal ) , among other application scenarios . especially in the latter , human behavior analysis ( hba ) , in which human action recognition plays a fundamental role , can endow smart home services with the required  smartness  needed to perform fall detection , intelligent safety services ( closing a door or an open tap ) , or activities of daily living ( adl ) recognition . upon these detection stages
, aal services may learn subjects ' routines , diets , and even personal hygiene habits , which allow providing useful and proactive services .
for this reason , human action recognition techniques are essential in order to develop aal services that support safety at home , health assistance , and aging in place .
great advances have been made in vision - based motion capture and analysis , and , at the same time , the society is starting to demand sophisticated and accurate hba systems .
this is shown , for example , in the recent rise of interest in devices like the microsoft kinect sensor .
current efforts focus on achieving admissible recognition speeds , which is essential for real - time and online systems .
another goal is the successful handling of multiview scenarios so as to add robustness to occlusions and improve the quality of the recognition .
one of the main drawbacks of multiview techniques is that rich and detailed 3d scene reconstructions are normally incompatible with real - time recognition . on the other hand ,
the current proposal builds upon earlier work , where we have presented a human action recognition method based on silhouettes and sequences of key poses , which shows to be suitable for real - time scenarios and specially robust to actor variances .
in , a study is included comparing different approaches of fusing multiple views using an approach based on a bag of key poses , which is extended in the present contribution .
one method stage in which substantial computational cost is added and success in later stages depends upon is feature extraction . in this paper , this specific stage is especially targeted . a low - dimensional radial silhouette - based feature is combined with a simple learning approach based on multiple video streams .
working with silhouette contour points , radial bins are computed using the centroid as the origin , and a summary representation is obtained for each bin .
this pose representation is used in order to obtain the per - view key poses which are involved in each action performance .
therefore , a model fusion of multiple visual sensors is applied . from the obtained bag of key poses ,
the sequences of key poses of each action class are computed , which are used later on for sequence matching and recognition .
experimentation performed on two publicly available datasets ( weizmann   and muhavi ) and a self - recorded one shows that the proposed technique not only obtains very high and stable recognition rates but also proves to be suitable for real - time applications . note that by  real time 
we mean that recognition can be performed at video frequency or above , as is common in the field .
section 2 summarizes the most recent and relevant works in human action recognition focusing on the type of features used and how multiview scenarios are managed . in section 3 ,
our proposal is detailed offering a low - dimensional feature based on silhouette contours and a radial scheme .
sections 4 and 5 specify the applied multiview learning approach based on a bag of key poses and action recognition through sequence matching .   section 6 analyzes the obtained results and compares them with the state of the art in terms of recognition rate and speed , providing also an analysis of the behaviour of the proposed method with respect to its parameters .
regarding the feature extraction stage of human action recognition methods based on vision , these can be differentiated by the either static or dynamic nature of the feature . whereas static features consider only the current frame ( extracting diverse types of characteristics based on shape , gradients , key points , etc . ) , dynamic features consider a sequence of several frames and apply techniques like image differencing , optical flow , and spatial - temporal interest points ( stip ) . among the former ,
we find silhouette - based features which rely either on the whole shape of the silhouette or only on the contour points . in , action primitives are extracted reducing the dimensionality of the binary images with principal component analysis ( pca ) .
polar coordinates are considered in , where three radial histograms are defined for the upper part , the lower part , and the whole human body .
each polar coordinate system has several bins with different radii and angles , and the concatenated normalized histograms are used to describe the human posture .
similarly , in , a log - polar histogram is computed choosing the different radii of the bins based on logarithmic scale .
silhouette contours are employed in   with the purpose of creating a distance signal based on the pointwise euclidean distances between each contour point and the centroid of the silhouette .
conversely , in , the pairwise distances between contour points are computed to build a histogram of distances resulting in a rotation , scale , and translation invariant feature . in , the whole silhouette is used for gait recognition . an angular transform based on the average distance between the silhouette points and the centroid
similarly , in , the shape of the silhouette contour is projected on a line based on the  transform , which is then made invariant to translation .
silhouettes can also be used to obtain stick figures , for instance , by means of skeletonization .
chen et al .   applied star skeletonization to obtain a five - dimensional vector in star fashion considering the head , the arms , and the legs as local maxima .
pointwise distances between contour points and the centroid of the silhouette are used to find the five local maxima . in the work of ikizler and duygulu , a different approach based on a  bag - of - rectangles
oriented rectangular patches are extracted over the human silhouette , and the human pose is represented with a histogram of circular bins of 15 each .
a very popular dynamic feature in pattern recognition based on computer vision is optical flow .
fathi and mori   rely on low - level features based on optical flow . in their work
, weighted combinations of midlevel motion features are built covering small spatiotemporal cuboids from which the low - level features are chosen . in , motion over a sequence of frames is considered defining motion history and energy images .
these encode the temporal evolution and the location of the motion , respectively , over a number of frames .
this work has been extended by   so as to obtain a free - viewpoint representation from multiple views .
a similar objective is pursued in , where time is considered as the third dimension building space - time volumes based on sequences of binary silhouettes .
action recognition is performed with global space - time features composed of the weighted moments of local space - time saliency and orientation .
combine eigenprojections of the width profile of the actor with the centroid of the silhouette and the standard deviation in the x and y axes in a single feature vector .
a 3d histogram of oriented gradients ( 3dhog ) is computed for densely distributed regions and combined with temporal embedding to represent an entire video sequence .
tran and sorokin   merge both silhouette shape and optical flow in a 286-dimensional feature , which also includes the context of 15 surrounding frames reduced by means of pca .
this feature has been used successfully in other works as , for instance , recently in .
take an interesting approach proposing a novel feature extraction technique , which relies on the surrounding regions of the subjects .
these negative spaces present advantages related to robustness to boundary variations caused by partial occlusions , shadows , and nonrigid deformations .
rgb - d data , that is , rgb color information along pixel - wise depth measurement , is increasingly being used , since the microsoft kinect device has been released . using the depth data and relying on an intermediate body part recognition process ,
a markerless body pose estimation in form of 3d skeletal information can be obtained in real time .
this kind of data results proficient for gesture and action recognition required by applications , such as gaming and natural user interfaces ( nui ) . in [ 31 ,
32 ] , more detailed surveys about these recently appeared depth - based methods can be found .
naturally , the usage of static features does not mean that the temporal aspect can not be considered .
temporal cues are commonly reflected in the change between successive elements of a sequence of features or in the learning algorithm itself . for further details about the state of the art
another relevant area for this work is how human action recognition is handled when dealing with multiple camera views .
multiview recognition methods can be classified , for example , by the level at which the fusion of information happens .
initially , when dealing with 2d data from multiple sources , these can be used in order to create a 3d representation [ 34 , 35 ] .
nevertheless , 3d representations usually imply a higher computational cost as appropriate 3d features need to be obtained .
feature fusion places the fusion process one step further by obtaining single - view features for each of the camera views and generating a common representation for all the features afterwards .
feature vectors are commonly combined by aggregation functions or concatenation of vectors [ 36 , 37 ] or also more sophisticated techniques as canonical correlation analysis .
the appeal of this type of fusion is the resulting simplicity of transition from single- to multiview recognition methods , since multiview data is only handled implicitly .
a learning method which in fact learns and extracts information from actions or poses from multiple views requires considerations at the learning scheme . through model fusion ,
multiple views are learned either as other possible instances of the same class   or by explicitly modelling each possible view .
these 2d or 3d models may support a limited or unlimited number of points of view ( pov ) .
last but not least , information fusion can be applied at the decision level . in this case , for each of the views , a single - view recognition method is used independently , and a decision is taken based on the single - view recognition results . the best view is chosen based on one or multiple criteria like closest distance to the learned pattern , highest score / probability of feature matching , or metrics which try to estimate the quality of the received input pattern . however , the main difficulty is to establish this decision rule because it depends strongly on the type of actions to recognize and on the camera setup .
for example , in , a local segment similarity voting scheme is employed to fuse multiple views , and superior results are obtained when compared with feature fusion based on feature concatenation .
finally , feature extraction and fusion of multiple views do not necessarily have to be considered two separate processing stages .
for instance , in [ 40 , 41 ] , lattice computing is proposed for low - dimensional representation of 2d shapes and data fusion . in our case ,
model fusion has been chosen because of two reasons : ( 1 ) in comparison with fusion at the decision level , only a single learning process is required in order to perform multiview recognition and ( 2 ) it allows explicit modeling of the poses from each view that are involved in a performance of an action . as a consequence
, multiple benefits can be obtained as follows.once the learning process has been finished , further views and action classes can be learned without restarting the whole process .
this leads to supporting incremental learning and eliminating the widely accepted limitation of batch - mode training for human action recognition .the camera setups do not need to match between training and testing stages .
more camera views may improve the result of the recognition , though it is not required to have all the cameras available.each camera view is processed separately and matched with the corresponding view , without requiring to know specifically at which angle it is installed .
once the learning process has been finished , further views and action classes can be learned without restarting the whole process .
this leads to supporting incremental learning and eliminating the widely accepted limitation of batch - mode training for human action recognition .
more camera views may improve the result of the recognition , though it is not required to have all the cameras available .
each camera view is processed separately and matched with the corresponding view , without requiring to know specifically at which angle it is installed .
these considerations are important requirements in order to apply the proposed method to the development of aal services .
model fusion enabled us to fulfil these constraints , as will be seen in the following sections .
as has been previously introduced , our goal is to perform human action recognition in real time and to do so even in scenarios with multiple cameras .
human silhouettes contain rich shape information and can be extracted relatively easily , for example , through background subtraction or human body detection .
in addition , silhouettes and their contours show certain robustness to lighting changes and small viewpoint variations compared to other techniques , as optical flow . using only the contour points of the silhouette results in a significant dimensionality reduction by getting rid of the redundant interior points .
the following variables are used along this section:(1)the number of contour points n;(2)the number of radial bins s;(3)the indices i , j , k , and l , for all i , k , l  { 1 ,  ,
n } and for all j  { 1 ,  , s}. the number of contour points n ; the number of radial bins s ; the indices i , j , k , and l , for all i , k , l  { 1 ,  , n } and for all j  { 1 ,  , s}. we use the border following algorithm from   to extract the n contour points p = { p1 , p2 ,  , pn } , where pi = ( xi , yi ) . our proposal
taking the centroid of the silhouette as the origin , the specific bin of each contour point can be assigned .
then , in difference to [ 20 , 21 ] where radial or log - polar histograms are used as spatial descriptors or   where star skeletonization is applied , in our approach , an efficient summary representation is obtained for each of the bins , whose concatenation returns the final feature ( figure 1 shows an overview of the process ) .
on one hand , it relies on the fact that when using a direct comparison of contours , even after length normalization as in , spatial alignment between feature patterns is still missing .
each silhouette has a distinct shape depending on the actor and the action class , and therefore a specific part of the contour can have more or less points in each sample . using an element - wise comparison of the radial bins of different contours ,
this avoids an element - wise comparison of the contour points , which would imply the erroneous assumption that these are correlated . on the other hand ,
this radial scheme allows us to apply an even further dimensionality reduction by obtaining a representative summary value for each radial bin .
the following steps are taken to compute the feature.(1)the centroid of the contour points c = ( xc , yc ) is calculated as 
 ( 1)xc=i=1nxin ,  yc=i=1nyin.(2)the pointwise euclidean distances between each contour point and the centroid , d = { d1 , d2 ,  , dn } , are obtained as in .
consider 
 ( 2)di = cmpi ,  i1,  ,n.(3)considering a clockwise order , the corresponding bin si of each contour point pi is assigned as follows ( for the sake of simplicity , i = 0 is considered as i = 360 ) : 
 ( 3)i = arccosyiycdi180,if  xi0,180+arccosyiycdi180,otherwise , si = si360 ,  i{1,  ,n}.(4)finally , a summary representation is obtained for the points of each bin . the final feature v results of the concatenation of summary representations .
these are normalized to unit sum in order to achieve scale invariance : 
 ( 4)vj = fpk , pk+1,  ,plsk, 
,sl = jk ,  l1,  ,n , kkkkkkkkkkkkkkkkkkkkkkkkkkkj1,  ,s , vj=vj0=1sv0 ,  j1,  ,s , v=v1||v2||||vs. the centroid of the contour points c = ( xc , yc ) is calculated as 
 ( 1)xc=i=1nxin ,  yc=i=1nyin .
the pointwise euclidean distances between each contour point and the centroid , d = { d1 , d2 ,  , dn } , are obtained as in .
consider 
 ( 2)di = cmpi ,  i1,  ,n . considering a clockwise order , the corresponding bin si of each contour point pi is assigned as follows ( for the sake of simplicity , i = 0 is considered as i = 360 ) : 
 ( 3)i = arccosyiycdi180,if  xi0,180+arccosyiycdi180,otherwise , si = si360 ,  i{1,  ,n}. finally , a summary representation is obtained for the points of each bin . the final feature v results of the concatenation of summary representations .
these are normalized to unit sum in order to achieve scale invariance : 
 ( 4)vj = fpk , pk+1,  ,plsk, 
vj=vj0=1sv0 ,  j1,  ,s , v=v1||v2||||vs. the function f could be any type of function which returns a significant value or property of the input points .
we tested three types of summaries ( variance , max value , and range ) , based on the previously obtained distances to the centroid , whose results will be analyzed in section 6 .
,pl=i = kldi2 , 
 where  is the average distance of the contour points of each bin .
consider 
 ( 6)fmaxpk , pk+1,  ,pl = maxdk , dk+1,  ,dl , frangepk , pk+1, 
,dl  mindk , dk+1,  ,dl.figure 2 shows an example of the result of the fmax summary function .
considering that multiple views of the same field of view are available , our method learns from these views at the model level , relying therefore on model fusion .
k - means clustering is used in order to identify the per - view representative instances , the so - called key poses , of each action class .
the resulting bag of key poses serves as a dictionary of known poses and can be used to simplify the training sequences of pose representations to sequences of key poses .
first , all the training video sequences need to be processed to obtain their pose representations .
supposing that m views are available and r action classes need to be learned , k - means clustering with euclidean distance is applied for the pose representations of each combination of view and action class separately .
hence , k clusters are obtained for each of the m  r groups of data .
the center of each cluster is taken as a key pose , and a bag of key poses of k  m  r class representatives is generated . in this way ,
an equal representation of each of the action classes and fused views can be assured in the bag of key poses ( figure 3 shows an overview of the process ) . at this point
, the training data has been reduced to a representative model of the key poses that are involved in each view of each action class . nevertheless , not all the key poses are equally important . very common
poses such as standing still are not able to distinguish between actions , whereas a bend pose can most certainly be only found in its own action class . for this reason , a weight w which indicates the capacity of discrimination of each key pose kp
for this purpose , all available pose representations are matched with their nearest neighbor among the bag of key poses ( using euclidean distance ) so as to obtain the ratio of within - class matches wkp = matcheskp / assignmentskp . in this manner ,
matches is defined as the number of within - class assignments , that is , the number of cases in which a pose representation is matched with a key pose from the same class , whereas assignments denotes the total number of times that key pose got chosen .
video recognition presents a clear advantage over image recognition which relies on the temporal dimension .
the available training sequences present valuable information about the duration and the temporal evolution of action performances . in order to model the temporal relationship between key poses ,
the training sequences of pose representations are converted into sequences of key poses . for each sequence ,
the corresponding sequence of key poses seq = { kp1 , kp2 ,  , kpt } is obtained by interchanging each pose representation with its nearest neighbor key pose among the bag of key poses .
this allows us to capture the long - term temporal evolution of key poses and , at the same time , to significantly improve the quality of the training sequences as noise and outliers are filtered .
during the recognition stage , the goal is to assign an action class label to an unknown sequence . for this purpose ,
( 1 ) the corresponding pose representation of each video frame is generated and ( 2 ) the pose representations are replaced with the nearest neighbor key poses among the bag of key poses .
this way , a sequence of key poses is obtained and recognition can be performed by means of sequence matching . since action performances can nonuniformly vary in speed depending on the actor and his / her condition , sequences need to be aligned properly .
dynamic time warping ( dtw )   shows proficiency in temporal alignment of sequences with inconsistent lengths , accelerations , or decelerations .
we use dtw in order to find the nearest neighbor training sequence based on the lowest dtw distance . given two sequences
seq = { kp1 , kp2 ,  , kpt } and seq = { kp1 , kp2 ,  , kpu } , the dtw distance ddtw(seq , seq ) can be obtained as follows : 
 ( 7)ddtwseq , seq'=dtwt , u , dtwi , j = mindtwi1,j , dtwi , j1,dtwi1,j1+dkpi , kpj ' , 
 where the distance between two key poses d(kpi ,
kpj ) is obtained based on both the euclidean distance between their features and the relevance of the match of key poses . as seen before ,
not all the key poses are as relevant for the purpose of identifying the corresponding action class .
hence , it can be determined how relevant a specific match of key poses is based on their weights wi and wj. in this sense , the distance between key poses is obtained as 
 ( 8)dkpi , kpj'=kpikpj'+zreli , j , reli , j = devi , jwiwj',devi , j = kpikpj'average_distance , 
 where average_distance corresponds to the average distance between key poses computed throughout the training stage .
as it can be seen , the relevance rel(i , j ) of the match is determined based on the weights of the key poses , that is , the capacity of discrimination and the deviation of the feature distance .
consequently , matches of key poses which are very similar or very different are considered more relevant than those that present an average similarity .
table 1 shows the chosen value for each case . in pairings of discriminative key poses which are similar to each other ,
if the distance among them is higher than average , this indicates that these important key poses do not match well together and therefore the final distance is increased . for ambiguous key poses , that is , key poses with low discriminative value , pairings are not as important for the distance between sequences . on the other hand ,
a pairing of a discriminative and an ambiguous key pose should be disfavored as these key poses should match with instances with similar weights .
otherwise , the operator is based on the sign of dev(i , j ) , which means that low feature distances are favored ( z = 1 ) and high feature distances are penalized ( z = + 1 ) . this way , not only the shape - based similarity between key poses but also the relevance of the specific match is taken into account in sequence matching .
once the nearest neighbor sequence of key poses is found , its label is retrieved .
the label of the match with the lowest distance is chosen as the final result of the recognition ; that is , the result is based on the best view .
this means that only a single view is required in order to perform the recognition , even though better viewing angles may improve the result .
note that this process is similar to decision - level fusion , but , in this case , recognition relies on the same multiview learning model , that is , the bag of key poses .
in this section , the presented method is tested on three datasets which serve as benchmarks . on this
single- and multiview data , our learning algorithm is used with the proposed feature , and the results of the three chosen summary representations ( variance , max value , and range ) are compared .
in addition , the distance - signal feature from dedeolu et al .   and the silhouette - based feature from boulgouris et al . , which have been summarized in section 2 , are used as a reference so as to make a comparison between features possible .
lastly , our approach is compared with the state of the art in terms of recognition rates and speed .
it includes video sequences from nine actors performing ten different actions outdoors ( bending , jumping jack , jumping forward , jumping in place , running , galloping sideways , skipping , walking , waving one hand , and waving two hands ) and has been recorded with a static front - side camera providing rgb images of a resolution of 180  144  px .
these silhouettes have been obtained automatically through background subtraction techniques ; therefore , they present noise and incompleteness .
it is worth to mention that we do include the skip action , which is excluded in several other works because it usually has a negative impact on the overall recognition accuracy .
the muhavi dataset   targets multiview human action recognition , since it includes 17 different actions recorded from eight views with a resolution of 720  576  px .
muhavi - mas provides manually annotated silhouettes for a subset of two views from 14 ( muhavi-14 : collapseleft , collapseright , guardtokick , guardtopunch , kickright , punchright , runlefttoright , runrighttoleft , standupleft , standupright , turnbackleft , turnbackright , walklefttoright , and walkrighttoleft ) or 8 ( muhavi-8 : collapse , guard , kickright , punchright , run , standup , turnback , and walk ) actions performed by two actors .
finally , our self - recorded dai rgbd dataset has been acquired using a multiview setup of microsoft kinect devices .
this dataset includes 12 actions classes ( bend , carryball , checkwatch , jump , punchleft , punchright , sitdown , standingstill , standup , waveboth , waveleft , and waveright ) , performed by three different actors . using depth - based segmentation ,
the silhouettes of the so - called users of a resolution of 320  240  px are obtained . in future works , we intend to expand this dataset with more subjects and samples and make it publicly available .
we chose two tests to be performed on these datasets as follows.leave-one-sequence-out cross validation ( loso ) .
the system is trained with all but one sequence which is used as test sequence .
this procedure is repeated for all available sequences and the accuracy scores are averaged . in the case of multiview sequences , each video sequence is considered as the combination of its views.leave-one-actor-out cross validation ( loao ) .
this test verifies the robustness to actor - variance . in this sense , the sequences from all but one actor are used for training , while the sequences from the remaining actor , unknown to the system , are used for testing .
the system is trained with all but one sequence which is used as test sequence .
this procedure is repeated for all available sequences and the accuracy scores are averaged . in the case of multiview sequences , each video sequence is considered as the combination of its views .
this test verifies the robustness to actor - variance . in this sense , the sequences from all but one actor are used for training , while the sequences from the remaining actor , unknown to the system , are used for testing .
this test is performed for each actor and the obtained accuracy scores are averaged . the feature from boulgouris et al . , which has been originally designed for gait recognition , presents advantages regarding , for instance , robustness to segmentation errors , since it relies on the average distance to the centroid of all the silhouette points of each circular sector .
nevertheless , on the tested action recognition datasets , it returned low success rates , which are significantly outperformed by the other four contour - based approaches . both the feature from dedeolu et al .   and
ours are based on the pointwise distances between the contour points and the centroid of the silhouette .
our proposal distinguishes itself in that a radial scheme is applied in order to spatially align contour parts .
further dimensionality reduction is also provided by summarizing each radial bin in a single characteristic value .  
table 2 shows the performance we obtained by applying this existing feature to our learning algorithm .
whereas on the weizmann dataset the results are significantly behind the state of the art and the rates obtained on the dai rgbd dataset are rather low , the results for the muhavi dataset are promising .
the difference of performance can be explained with the different qualities of the binary silhouettes .
the silhouettes from the muhavi - mas subset have been manually annotated in order to separate the problem of silhouette - based human action recognition from the difficulties which arise from the silhouette extraction task .
this stands in contrast to the other datasets whose silhouettes have been obtained automatically , respectively , through background subtraction or depth - based segmentation , presenting therefore segmentation errors .
this leads us to the conclusion that the visual feature from   is strongly dependant on the quality of the silhouettes . 

table 2 also shows the results that have been obtained with the different summary functions from our proposal . the variance summary representation , which only encodes the local dispersion but not reflects the actual distance to the centroid , achieves an improvement in some tests at the cost of obtaining poor results on the muhavi actor - invariance tests ( loao ) and the dai rgbd dataset .
the max value summary representation solves this problem and returns acceptable rates for all tests .
finally , with frange , the range summary representation obtains the best overall recognition rates , achieving our highest rates for the weizmann dataset , the muhavi loso tests , and the dai rgbd dataset . in conclusion ,
the proposed radial silhouette - based feature not only achieves to substantially improve the results obtained with similar features as [ 9 , 10 ] but its low - dimensionality also offers an additional advantage in computational cost ( feature size is reduced from ~300 points in   to ~20 radial bins in our approach ) .
the presented method uses two parameters which are not given by the constraints of the dataset and the action classes which have to be recognized and therefore have to be established by design .
the first one is found at the feature extraction stage , that is , the number of radial bins s. a lower value of s leads to a lower dimensionality which reduces the computational cost and may also improve noise filtering , but , at the same time , it will reduce the amount of characteristic data .
the second parameter is the number of key poses per action class and view k. in this case , the appropriate amount of representatives needs to be found to capture the most relevant characteristics of the sample distribution in the feature space , discarding outlier and nonrelevant areas .
again , higher values will lead to an increase of the computational cost of the classification .
therefore , a compromise needs to be reached between classification time and accuracy . in order to analyse the behavior of the proposed algorithm with respect to these two parameters
, a statistic analysis has been performed . due to the nondeterministic behavior of the k - means algorithm , classification rates vary among executions .
we executed ten repetitions of each test ( muhavi-8 loao cross validation ) and obtained the median value ( see figure 4 ) .
it can be observed that a high value of key poses , that is , feature space representatives , only leads to a good classification rate if the feature dimensionality is not too low ; otherwise , a few key poses are enough to capture the relevant areas of the feature space .
note also that a higher feature dimensionality does not necessarily require a higher number of key poses , since it does not imply a broader sample distribution of the feature space .
finally , with the purpose of obtaining high and reproducible results , the parameter values have been chosen based on the highest median success rate ( 92.6% ) , which has been obtained with s = 12 and k = 5 in this case .
since lower values are preferred for both parameters , the lowest parameter values are used if several combinations reach the same median success rate .
comparison between different approaches can be difficult due to the diverse goals human action recognition methods may pursue , the different types of input data , and the chosen evaluation methods . in our case , multiview human action recognition is aimed at an indoor scenario related to aal services .
therefore , the system is required to perform in real time as other services will rely on the action recognition output .
a comparison of the obtained classification and recognition speed rates for the publicly available weizmann and muhavi - mas datasets is provided in this section .
performance has been tested on a standard pc with an intel core 2 duo cpu at 3  ghz and 4  gb of ram with windows 7 64-bit .
all tests have been performed using binary silhouette images as input , and no further hardware optimizations have been performed . 

it can be seen that while perfect recognition has been achieved for the weizmann dataset , our method places itself well in terms of both recognition accuracy and recognition speed when comparing it to methods that target fast human action recognition .
on the muhavi-14 and muhavi-8 datasets , our approach achieves to significantly outperform the known recognition rates of the state of the art ( see tables 4 and 5 ) .
to the best of our knowledge , this is the first work to report a perfect recognition on the muhavi-8 dataset performing the leave - one - sequence - out cross validation test .
the equivalent test on the muhavi-14 dataset returned an improvement of 9.6% in comparison with the work from cheema et al . , which also shows real - time suitability .
furthermore , our approach presents very high robustness to actor - variance as the leave - one - actor - out cross validation tests show , and it achieves to perform at over 90  fps with the higher resolution images from the muhavi dataset .
it is also worth mentioning that the training stage of the presented approach runs at similar rates between 92 and 221  fps . with these results
it is known that silhouette extraction with admissible quality can be performed in real time through background subtraction techniques [ 47 , 48 ] .
furthermore , recent advances in depth sensors make it possible to obtain human poses of substantial higher quality by means of real - time depth based segmentation .
in addition , depth , infrared , or laser sensors allow preserving privacy as rgb information is not essential for silhouette - based human action recognition .
in this work , a low - dimensional radial silhouette - based feature has been proposed , which in combination with a simple , yet effective , multiview learning approach based on a bag of key poses and sequence matching shows to be a very robust and efficient technique for human action recognition in real time . by means of a radial scheme ,
contour parts are spatially aligned , and , through the summary function , dimensionality is drastically reduced .
this proposal achieves to significantly improve recognition accuracy and speed and is proficient with both single- and multiview scenarios . in comparison with the state of the art ,
our approach presents high results on the weizmann dataset and , to the best of our knowledge , the best rates achieved so far on the muhavi dataset .
real - time suitability is confirmed , since performance tests returned results clearly above video frequency .
future works include finding an optimal summary representation or the appropriate combination of summary representations based on a multiclassifier system . tests with a greater number of visual sensors need to be performed so as to see how many views can be handled by the learning approach based on model fusion and to which limit multiview data improves the recognition . for this purpose , multiview datasets such as ixmas   and i3dpost   can be employed .
the proposed approach does not require that each viewing angle matches with a specific orientation of the subject because different orientations can be modelled if seen at the training stage .
nevertheless , since the method is not explicitly addressing view - invariance , it can not deal with cross - view scenarios .
 this paper presents a novel silhouette - based feature for vision - based human action recognition , which relies on the contour of the silhouette and a radial scheme . 
 its low - dimensionality and ease of extraction result in an outstanding proficiency for real - time scenarios . 
 this feature is used in a learning algorithm that by means of model fusion of multiple camera streams builds a bag of key poses , which serves as a dictionary of known poses and allows converting the training sequences into sequences of key poses . 
 these are used in order to perform action recognition by means of a sequence matching algorithm . 
 experimentation on three different datasets returns high and stable recognition rates . to the best of our knowledge 
 , this paper presents the highest results so far on the muhavi - mas dataset . 
 real - time suitability is given , since the method easily performs above video frequency . 
 therefore , the related requirements that applications as ambient - assisted living services impose are successfully fulfilled . 
1. Introduction
2. Related Work
3. Pose Representation Feature
4. Multiview Learning Algorithm
5. Action Recognition
6. Experimental Results
7. Conclusion