Cargando…

Pairwise Elastic Net Representation-Based Classification for Hyperspectral Image Classification

The representation-based algorithm has raised a great interest in hyperspectral image (HSI) classification. [Formula: see text]-minimization-based sparse representation (SR) attempts to select a few atoms and cannot fully reflect within-class information, while [Formula: see text]-minimization-based...

Descripción completa

Detalles Bibliográficos
Autores principales: Li, Hao, Zhang, Yuanshu, Ma, Yong, Mei, Xiaoguang, Zeng, Shan, Li, Yaqin
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2021
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8392166/
https://www.ncbi.nlm.nih.gov/pubmed/34441096
http://dx.doi.org/10.3390/e23080956
Descripción
Sumario:The representation-based algorithm has raised a great interest in hyperspectral image (HSI) classification. [Formula: see text]-minimization-based sparse representation (SR) attempts to select a few atoms and cannot fully reflect within-class information, while [Formula: see text]-minimization-based collaborative representation (CR) tries to use all of the atoms leading to mixed-class information. Considering the above problems, we propose the pairwise elastic net representation-based classification (PENRC) method. PENRC combines the [Formula: see text]-norm and [Formula: see text]-norm penalties and introduces a new penalty term, including a similar matrix between dictionary atoms. This similar matrix enables the automatic grouping selection of highly correlated data to estimate more robust weight coefficients for better classification performance. To reduce computation cost and further improve classification accuracy, we use part of the atoms as a local adaptive dictionary rather than the entire training atoms. Furthermore, we consider the neighbor information of each pixel and propose a joint pairwise elastic net representation-based classification (J-PENRC) method. Experimental results on chosen hyperspectral data sets confirm that our proposed algorithms outperform the other state-of-the-art algorithms.