Sparsity-motivated automatic target recognition

Applied Optics

Volumn 50, Issue 10, 2011, Pages 1425-1433

  Patel, Vishal M ^a   Nasrabadi, Nasser M ^b   Chellappa, Rama ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b U S ARMY RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MOLECULAR PHYSICS; OPTICS;

COMPRESSIVE SENSING; CONFUSION MATRICES; FORWARD LOOKING; IR DATA; MILITARY TARGETS; SIKORSKY; SPARSE REPRESENTATION; TARGET RECOGNITION;

AUTOMATIC TARGET RECOGNITION;

EID: 79958732557     PISSN: 1559128X     EISSN: 15394522     Source Type: Journal    
DOI: 10.1364/AO.50.001425     Document Type: Article

References (32)

1. F. Sadjadi, "Infrared target detection with probability density functions of wavelet transform subbands," Appl. Opt. 43, 315-323 (2004).
2. L. Wang, S. Z. Der, and N. M. Nasrabadi, "Automatic target recognition using a feature-decomposition and datadecomposition modular neural network," IEEE Trans. Image Process. 7, 1113-1121 (1998). (Pubitemid 128744217)
3. L. A. Chan and N. M. Nasrabadi, "Application of waveletbased vector quantization in target recognition," Int. J. Art. Intel. Tools 6, 165-178 (1997). (Pubitemid 127114203)
4. P. Bharadwaj and L. Carin, "Infrared image classification using hidden Markov trees," IEEE Trans. Pattern Anal. Mach. Intel. 24, 1394-1397 (2002).
5. B. Li, R. Chellappa, Q. Zheng, S. Der, N. M. Nasrabadi, L. Chan, and L. Wang, "Experimental evaluation of forwardlooking IR data set automatic target recognition approaches -a comparative study," Comput. Vision Image Underst. 84, 5-24 (2001). (Pubitemid 34220907)
6. J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma, "Robust face recognition via sparse representation," IEEE Trans. Pattern Anal. Mach. Intel. 31, 210-227 (2009).
7. V. M. Patel, N. M. Nasrabadi, and R. Chellappa, "Sparsity- Inspired automatic target recognition," Proc. SPIE 7696, 76960Q (2010).
8. D. L. Donoho and X. Huo, "Uncertainty principle and ideal atomic decomposition," IEEE Trans. Inf. Theory 47, 2845-2862 (2001). (Pubitemid 33053488)
9. D. L. Donoho and M. Elad, "On the stability of the basis pursuit in the presence of noise," EURASIP J. Adv. Signal Processing 86, 511-532 (2006). (Pubitemid 43106569)
10. E. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Comm. Pure Appl. Math. 59, 1207-1223 (2006). (Pubitemid 43988295)
11. H. Rauhut, K. Schnass, and P. Vandergheynst, "Compressed sensing and redundant dictionaries," IEEE Trans. Inf. Theory 54, 2210-2219 (2008). (Pubitemid 351689557)
12. R. Baraniuk, "Compressive sensing," IEEE Signal Process. Mag. 24, 118-121 (2007).
13. S. Chen, D. Donoho, and M. Saunders, "Atomic decomposition by basis pursuit," SIAM J. Sci. Comput. 20, 33-61 (1998). (Pubitemid 128689501)
14. 0 returns the number of nonzero elements of x.
15. J. A. Tropp and A. C. Gilbert, "Signal recovery from random measurements via orthogonal matching pursuit," IEEE Trans. Inf. Theory 53, 4655-4666 (2007).
16. R. Tibshirani, "Regression shrinkage and selection via the lasso," J. R. Stat. Soc. Ser. B. Methodol. 58, 267-288 (1996).
17. E. van der Berg and M. P. Friedlander, "Probing the Pareto frontier for basis pursuit solutions," SIAM J. Sci. Comput. 31, 890-912 (2008).
18. H. Zou and T. Hastie, "Regularization and variable selection via the elastic net," J. R. Stat. Soc. B 67, 301-320 (2005). (Pubitemid 40465877)
19. Y. C. Eldar and M. Mishali, "Robust recovery of signals from a structured union of subspaces," IEEE Trans. Inf. Theory 55, 5302-5316 (2009).
20. Y. C. Eldar, P. Kuppinger, and H. B. Bolcskei, "Block-sparse signals: uncertainty relations and efficient recovery," IEEE Trans. Signal Process. 58, 3042-3054 (2010).
21. M. Yuan and Y. Lin, "Model selection and estimation in regression with grouped variables," J. R. Stat. Soc. B 68, 49-67 (2006). (Pubitemid 43415335)
22. L. Meier, S. van der Geer, and P. Buhlman, "The group lasso for logistic regression," J. R. Stat. Soc. B 70, 53-71 (2008).
23. M. Stojnic, F. Parvaresh, and B. Hassibi, "On the reconstruction of block-sparse signals with an optimal number of measurements," IEEE Trans. Signal Process. 57, 3075-3085 (2009).
24. Given C classes, the confusion matrix is of size C × C, whose diagonal entries are the number of targets that are correctly classified, while the off-diagonal entries are the number of misclassifications.
25. Y. Tsaig and D. L. Donoho, "Extensions of compressed sensing," Signal Process. 86, 549-571 (2006). (Pubitemid 43106571)
26. E. Candès and J. K. Romberg, "Signal recovery from random projections," Proc. SPIE 5674, 76-86 (2005). (Pubitemid 40949239)
27. Exact recovery of sparse coefficients also depends on the matrix GA. That is, GA must satisfy certain properties such as the mutual coherence property and the restricted isometry property. See [11,10,20] for more details.
28. P. J. Phillips, "Matching pursuit filters applied to face identification," IEEE Trans. Image Process. 7, 1150-1164 (1998). (Pubitemid 128744220)
29. D. Needell and J. A. Tropp, "CoSaMP: iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon. Anal. 26, 301-321 (2009).
30. F. Rodriguez and G. Sapiro, "Sparse representations for image classification: learning discriminative and reconstructive nonparametric dictionaries," Tech. Report (University of Minnesota, Dec. 2007).
31. P. Sprechmann and G. Sapiro, "Dictionary learning and sparse coding for unsupervised clustering," in Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (IEEE, 2010), pp. 2042-2045.
32. F. M. Caimi, D. M. Kocak, F. Dalgleish, and J.Watson, "Underwater imaging and optics: recent advances," Oceans 2008 2008, 1-9 (2008).