© The Institution of Engineering and Technology
Sparse representations for classification (SRC) are considered a relevant advance to the biometrics field, but are particularly sensitive to data misalignments. In previous studies, such misalignments were compensated for by finding appropriate geometric transforms between the elements in the dictionary and the query image, which is costly in terms of computational burden. This study describes an algorithm that compensates for data misalignments in SRC in an implicit way, that is, without finding/applying any geometric transform at every recognition attempt. The authors' study is based on three concepts: (i) sparse representations; (ii) projections on orthogonal subspaces; and (iii) discriminant locality preserving with maximum margin projections. When compared with the classical SRC algorithm, apart from providing slightly better performance, the proposed method is much more robust against global/local data misalignments. In addition, it attains performance close to the state-of-the-art algorithms at a much lower computational cost, offering a potential solution for real-time scenarios and large-scale applications.
References
-
-
1)
-
21. vd-Berg, E., Friedlander, M.P.: ‘Probing the Pareto frontier for basis pursuit solutions’. , 2008.
-
2)
-
11. Kumar, A., Chan, T., Tan, C.: ‘Human identification from at-a-distance face images using sparse representation of local iris features’. Proc. Fifth IAPR Int. Conf. Biometrics (ICB), 2012, pp. 303–309.
-
3)
-
19. Matej, K., Ales, L., Danijel, S.: ‘Multivariate online kernel density estimation with Gaussian kernels’, Pattern Recognit., 2011, 44, pp. 2630–2642 (doi: 10.1016/j.patcog.2011.03.019).
-
4)
-
8. Pillai, J.K., Patel, V.M., Chellappa, R., Ratha, N.K.: ‘Secure and robust iris recognition using random projections and sparse representations’, IEEE Trans. Pattern Anal. Mach. Intell., 2011, 33, (9), pp. 1877–1893 (doi: 10.1109/TPAMI.2011.34).
-
5)
-
17. Lu, G., Lin, Z., Jin, Z.: ‘Face recognition using discriminant locality preserving projections based on maximum margin criterion’, Pattern Recognit., 2010, 43, pp. 3572–3579 (doi: 10.1016/j.patcog.2010.04.007).
-
6)
-
9. Khorsandi, R., Cadavid, S., Mottaleb, M.: ‘Ear recognition via sparse representation and Gabor filters’. Proc. IEEE Fifth Int. Conf. Biometrics: Theory, Applications and Systems (BTAS), 2012, pp. 278–282.
-
7)
-
4. Elad, M., Yavneh, I.: ‘A plurality of sparse representations is better that the sparsest one alone’, IEEE Trans. Inf. Theory, 2009, 55, (10), pp. 4701–4714 (doi: 10.1109/TIT.2009.2027565).
-
8)
-
2. Wagner, A., Wright, J., Ganesh, A., Zhou, Z., Mabahi, H., Ma, Y.: ‘Toward a practical face recognition system: robust alignment and illumination by sparse representation’, IEEE Trans. Pattern Anal. Mach. Intell., 2009, 34, (2), pp. 371–386.
-
9)
-
14. Huang, J., Huang, X., Metaxas, D.: ‘Simultaneous image transformation and sparse representation recovery’. Proc. IEEE Conf. Computer Vision and Pattern Recognition (CVPR), 2008, pp. 1–8.
-
10)
-
J. Kittler
.
On combining classifiers.
IEEE Trans. Pattern Anal. Mach. Intell.
,
3 ,
226 -
239
-
11)
-
16. Friedman, J., Tukey, J.: ‘A projection pursuit algorithm for exploratory data analysis’, IEEE Trans. Comput., 1974, C-23, (9), pp. 881–890 (doi: 10.1109/T-C.1974.224051).
-
12)
-
3. Johnson, W., Lindenstrauss, J.: ‘Extensions of Lipschitz mappings into a Hilbert space’. Proc. Conf. Modern Analysis and Probability, American Mathematical Society, 1984, vol. 26, pp. 189–206.
-
13)
-
S.B. Chen ,
D. Donoho ,
M.A. Saunders
.
Atomic decomposition by basis pursuit.
SIAM Rev.
,
1 ,
129 -
159
-
14)
-
15. Achlioptas, D.: ‘Database-friendly random projections’. Proc. Twentieth ACM SIGMOD-SIGACT-SIGART Symp. Principles of Database Systems, 2001, pp. 274–281.
-
15)
-
20. Martinez, A., Benavente, R.: ‘The AR face database’. , 1998.
-
16)
-
24. Shejin, T., Sao, A.: ‘Significance of dictionary for sparse coding based face recognition’. Proc. Int. Conf. Biometrics Special Interest Group (BIOSIG), 2012, pp. 1–6.
-
17)
-
23. Posse, C.: ‘Projection pursuit exploratory data analysis’, Comput. Stat. Data Anal., 1995, 20, pp. 669–687 (doi: 10.1016/0167-9473(95)00002-8).
-
18)
-
13. Jittorntrum, K., Osborne, M.: ‘Strong uniqueness and second order convergence in nonlinear discrete approximation’, Numer. Math., 1980, 34, pp. 439–455 (doi: 10.1007/BF01403680).
-
19)
-
12. Wong, Y., Harandi, M., Sanderson, C., Lovell, B.: ‘Expression recognition using elastic graph matching’. Proc. Int. Joint Conf. Neural Networks (IJCNN), 2012, pp. 1–8.
-
20)
-
35. Patel, V.M., Wu, T., Biswas, S., Phillips, P.J., Chellappa, R.: ‘Dictionary-based face recognition under variable lighting and pose’, IEEE Trans. Inf. Forensics Sec., 2012, 7, (3), pp. 954–965 (doi: 10.1109/TIFS.2012.2189205).
-
21)
-
J. Wright ,
A.Y. Yang ,
A. Ganesh ,
S.S. Sastry ,
Y. Ma
.
Robust face recognition via sparse representation.
IEEE Trans. Pattern Anal. Mach. Intell.
,
210 -
227
-
22)
-
10. Gong, M., Xu, Y., Yang, X., Zhang, W.: ‘Gait identification by sparse representation’. Proc. Eighth Int. Conf. Fuzzy Systems and Knowledge Discovery (FSKD), 2011, pp. 1719–1723.
-
23)
-
8. Guo, Z.: ‘Palmprint recognition by a two-phase test sample sparse representation’. Proc. Int. Conf. Hand-Based Biometrics (ICHB), 2011, pp. 1–4.
-
24)
-
7. Buyssens, P., Revenu, M.: ‘IR and visible face identification via sparse representation’. Proc. Fourth IEEE Int. Conf. Biometrics: Theory Applications and Systems (BTAS), 2010, pp. 1–6.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-cvi.2014.0039
Related content
content/journals/10.1049/iet-cvi.2014.0039
pub_keyword,iet_inspecKeyword,pub_concept
6
6