Superpixel sparse representation for target detection in hyperspectral imagery

Chunhua Dong; Masoud Naghedolfeizi; Dawit Aberra; Hao Qiu; Xiangyan Zeng

doi:10.1117/12.2262147

5 May 2017 Superpixel sparse representation for target detection in hyperspectral imagery

Chunhua Dong, Masoud Naghedolfeizi, Dawit Aberra, Hao Qiu, Xiangyan Zeng

Proceedings Volume 10211, Compressive Sensing VI: From Diverse Modalities to Big Data Analytics; 102110E (2017) https://doi.org/10.1117/12.2262147
Event: SPIE Commercial + Scientific Sensing and Imaging, 2017, Anaheim, CA, United States

Abstract

Sparse Representation (SR) is an effective classification method. Given a set of data vectors, SR aims at finding the sparsest representation of each data vector among the linear combinations of the bases in a given dictionary. In order to further improve the classification performance, the joint SR that incorporates interpixel correlation information of neighborhoods has been proposed for image pixel classification. However, SR and joint SR demand significant amount of computational time and memory, especially when classifying a large number of pixels. To address this issue, we propose a superpixel sparse representation (SSR) algorithm for target detection in hyperspectral imagery. We firstly cluster hyperspectral pixels into nearly uniform hyperspectral superpixels using our proposed patch-based SLIC approach based on their spectral and spatial information. The sparse representations of these superpixels are then obtained by simultaneously decomposing superpixels over a given dictionary consisting of both target and background pixels. The class of a hyperspectral pixel is determined by a competition between its projections on target and background subdictionaries. One key advantage of the proposed superpixel representation algorithm with respect to pixelwise and joint sparse representation algorithms is that it reduces computational cost while still maintaining competitive classification performance. We demonstrate the effectiveness of the proposed SSR algorithm through experiments on target detection in the in-door and out-door scene data under daylight illumination as well as the remote sensing data. Experimental results show that SSR generally outperforms state of the art algorithms both quantitatively and qualitatively.

Conference Presentation

Citation Download Citation

Chunhua Dong, Masoud Naghedolfeizi, Dawit Aberra, Hao Qiu, and Xiangyan Zeng "Superpixel sparse representation for target detection in hyperspectral imagery", Proc. SPIE 10211, Compressive Sensing VI: From Diverse Modalities to Big Data Analytics, 102110E (5 May 2017); https://doi.org/10.1117/12.2262147

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available