Abstract

Due to the redundancy and sparsity of hyperspectral data, sparse representation (SR) has proven to be well-suited for hyperspectral band selection (BS). Moreover, graph regularizers can effectively incorporate local structural information of the data to improve the solution of SR. However, existing unsupervised BS approaches typically consider only a simple graph based on a single spectral metric. In contrast, the hypergraph can capture the multiple adjacencies of the bands and has significant advantages. This letter proposes a hypergraph-regularized self-representation model (HyGSR) for BS. HyGSR is innovative in that it jointly combines the spectral similarity and band index as a new similarity metric to rationalize the local structure of bands extracted by hypergraph, while using a robust <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2,1</sub> -norm to exploit the sparse properties of the data for BS. Experimental results on four real hyperspectral scenarios verify that HyGSR outperforms other competitors with high stability and usability.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.