Abstract
The sparse representation classification method has been widely concerned and studies in pattern recognition because of its good recognition effect and classification performance. Using the minimized l1 norm to solve the sparse coefficient, all the training samples are selected as the redundant to calculate, but the computational complexity is higher. Aiming at the problem of high computational complexity of the l1 norm based solving algorithm, l2 norm local sparse representation classification algorithm is proposed. This algorithm uses the minimum l2 norm method to select the local dictionary. Then the minimum l1 norm is used in the dictionary to solve sparse coefficients for classifying them, and the algorithm is used to verify the gesture recognition on the constructed gesture database. The experimental results show that the algorithm can effectively reduce the calculation time while ensuring the recognition rate, and the performance of the algorithm is slightly better than KNN-SRC algorithm.
Original language | English |
---|---|
Number of pages | 12 |
Journal | Cluster Computing |
Early online date | 10 Oct 2017 |
DOIs | |
Publication status | Early online - 10 Oct 2017 |
Keywords
- gesture recognition
- l2 norm
- sparse representation
- classification algorithm