Bangjun Wang1, Li Zhang1, Zhiwei Tao1
13:30 - 15:30 | Tue 22 Mar | Poster Area E | MLSP-P1.1
The typical classification rule for kernel sparse representation-based classifier (KSRC) is the reconstruction error minimization rule. Its computational complexity mainly depends on both the dimensionality of a subspace and the number of training samples. This paper presents an alternative classification rule, called reconstruction coefficient energy maximization, for KSRC and applies it to target recognition in synthetic aperture radar (SAR) images. The computational complexity of this rule is related to only the number of training samples, which is smaller than that of the reconstruction error minimization rule. Experimental results on the MSTAR public database indicate that KSRC is very promising in SAR image target recognition.