K nearest neighbor based local sparse representation classifier

2010 Chinese Conference on Pattern Recognition, CCPR 2010 - Proceedings

Volumn , Issue , 2010, Pages 400-404

  Zhang, Nan ^a   Yang, Jian ^a  

^a NANJING UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

KNN; Pattern classification; Sparse representation

Indexed keywords

GLOBAL REPRESENTATION; K-NEAREST NEIGHBORS; KNN; PATTERN CLASSIFICATION; SPARSE REPRESENTATION; TESTING SAMPLES; TRAINING SAMPLE;

CLASSIFIERS; MOTION COMPENSATION; PATTERN RECOGNITION; TRACKING (POSITION);

SAMPLING;

EID: 78651445352     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCPR.2010.5659128     Document Type: Conference Paper

References (21)

1. T. M. Cover and P. E. Hart. Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13(1):21-27, 1967.
2. K. Fukunaga. Introduction to Statistical Pattern Recognition. Academic Press, second edition, 1990.
3. J. Wright, Y. Ma, J. Mairal, et al. Sparse representation for computer vision and pattern recognition. Proceedings of IEEE, March 2009.
4. J. Wright, A. Yang, A. Ganesh, S. Sastry, and Y. Ma. Robust face recognition via sparse representation. IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol. 31, No. 2, pp. 210-227, 2009.
5. D. Donoho. For Most Large Underdetermined Systems of Linear Equations the Minimal l1-Norm Solution Is Also the Sparsest Solution. Comm. Pure and Applied Math., vol. 59, no. 6, pp. 797-829, 2006.
6. E. Candès, J. Romberg, and T. Tao. Stable Signal Recovery from Incomplete and Inaccurate Measurements. Comm. Pure and Applied Math., vol. 59, no. 8, pp. 1207-1223, 2006.
7. E. Candès and T. Tao. Near-Optimal Signal Recovery from Random Projections: Universal Encoding Strategies? IEEE Trans. Information Theory, vol. 52, no. 12, pp. 5406-5425, 2006.
8. E. Amaldi and V. Kann. On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems. Theoretical Computer Science, vol. 209, pp. 237-260, 1998.
9. Wenming Zheng, Li Zhao and Cairong Zou. Locally nearest neighbor classifiers for pattern classification. PatternRecognition, 37(2004)1307-1309. (Pubitemid 38549829)
10. C.Y. Suen et al., Computer recognition of unconstrained handwritten numerals. Proc. IEEE 80 7 (1992), pp. 1162-1180.
11. S.X. Liao, M. Pawlak. On image analysis by moments. IEEE Trans. Pattern Anal. Machine Intell. 18(3) (1996) 254-266.
12. R. O. Duda, P.E. Hart and D.G. Stork. Pattern Classification. 2nd Edition, John Wiley & Sons, Inc., 2000.
13. Y.T.Tang et al. Offline Recognition of Chinese Handwriting by Multifeature and Multilevel Classification. IEEE Trans. Pattern Anal. Machine Intell. 20(5) (1998) 556-561.
14. A.Georghiades, P.Belhumeur, and D.Kriegman. From Few to Many: Illumination Cone Models for Face Recognition under Variable Lighting and Pose. IEEE Trans.Pattern Analysis and Machine Intelligence, vol.23,no.6, pp.643-660,June2001.
15. K.Lee, J.Ho, and D.Kriegman. Acquiring Linear Subspaces for Face Recognition under Variable Lighting. IEEE Trans. Pattern Analysis and Machine Intelligence, vol.27, no.5, pp.684-698, 2005.
16. S. Chen, D. Donoho, and M.Saunders. Atomic Decomposition by Basis Pursuit. SIAM Rev., vol.43, no.1, pp.129-159, 2001.
17. Narendra Karmarkar. A New Polynomial Time Algorithm for Linear Programming. Combinatorica, Vol 4, nr. 4, p. 373-395, 1984.
18. P. N. Belhumeur, J. P. Hespanha, and D. J. Kriengman, Eigenfaces vs. Fisherfaces: Recognition using class specific linear projection, IEEE Trans. Pattern Anal. Machine Intell. 1997, 19 (7), 711-720.
19. A.Martinez and R.Benavente. The AR Face Database, CVC Technical Report 24, 1998.
20. E. Candès, J. Romberg, l1 -magic: recovery of sparse signals via convex programming, http://www.acm.caltech.edu/l1magic/
21. S.-J. Kim, K. Koh, M. Lustig, S. Boyd, and D. Gorinevsky, A method for large-scale l1-regularized least squares. IEEE Journal on Selected Topics in Signal Processing, 1(4):606-617, 2007.