Presentation + Paper
5 October 2017 Low-complexity multiple collaborative representations for hyperspectral image classification
Author Affiliations +
Abstract
Collaborative representation has been a popular classifier for hyperspectral image classification because it can offer excellent classification accuracy with a closed-form solution. Collaborative representation can be implemented using a dictionary with training samples of all-classes, or using class-specific sub-dictionaries. In either case, a testing pixel is assigned to the class whose training samples offer the minimum representation residual. The Collaborative Representation Optimized Classifier with Tikhonov regularization (CROCT) was developed to combine these two types of collaborative representations to achieve the balance for optimized performance. The class-specific collaborative representation involves inverse operation of matrices constructed from class-specific samples, and the all-class version requires inversion operation of the matrix constructed from all samples. In this paper, we propose a low-complexity CROCT to avoid redundant operations in all-class and class-specific collaborative representations. It can further reduce the computational cost of CROCT while maintaining its excellent classification performance.
Conference Presentation
© (2017) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yan Xu, Qian Du, Wei Li, and Nicolas H. Younan "Low-complexity multiple collaborative representations for hyperspectral image classification", Proc. SPIE 10430, High-Performance Computing in Geoscience and Remote Sensing VII, 1043003 (5 October 2017); https://doi.org/10.1117/12.2278841
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Hyperspectral imaging

Image classification

Parallel computing

Algorithm development

Back to Top