Abstract

Band subset selection (BSS) is one of the ways to implement band selection (BS) for a hyperspectral image (HSI). Different from conventional BS methods, which select bands one by one, BSS selects a band subset each time and preserves the best one from the collection of the band subsets. This paper proposes a BSS method, called band grouping-based sparse self-representation BSS (BG-SSRBSS), for hyperspectral image classification. It formulates BS as a sparse self-representation (SSR) problem in which the entire bands can be represented by a set of informatively complementary bands. The BG-SSRBSS consists of two steps. To tackle the issue of selecting redundant bands, it first applies band grouping (BG) techniques to pre-group the entire bands to form multiple band groups, and then performs band group subset selection (BGSS) to find the optimal band group subset. The corresponding representative bands are taken as the BS result. To efficiently find the nearly global optimal subset among all possible band group subsets, sequential and successive iterative search algorithms are adopted. Land cover classification experiments conducted on three real HSI datasets show that BG-SSRBSS can improve classification accuracy by 4–20% compared to the existing BSS methods and requires less computation time.

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.