Share Email Print
cover

Proceedings Paper

Progressive band processing of simplex growing algorithm for finding endmembers in hyperspectral imagery
Author(s): Robert C. Schultz; Marissa Hobbs; Chein-I Chang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper presents a progressive band processing (PBP) version of an endmember finding algorithm, simplex growing algorithm (SGA), to be called PBP-SGA, which allows users to perform SGA band by band progressively. Several advantages can be gained from this approach. First of all, PBP-SGA does not require data dimensionality reduction since PBP begins with a lower band dimension and gradually increases band dimensions band by band progressively until it achieves the desired results. Secondly, PBP can process SGA whenever bands are available without waiting for the information from all band information to be received. As a result, PBP-SGA can be used for data transmission and communication. Thirdly, PBP-SGA can help identify which bands are crucial during the process of finding endmembers. Finally, PBP-SGA provides feasibility of being implemented in real time according to Band SeQuential (BSQ) format.

Paper Details

Date Published: 22 May 2014
PDF: 8 pages
Proc. SPIE 9124, Satellite Data Compression, Communications, and Processing X, 91240L (22 May 2014); doi: 10.1117/12.2050992
Show Author Affiliations
Robert C. Schultz, U.S. Naval Academy (United States)
Univ. of Maryland, Baltimore County (United States)
Marissa Hobbs, U.S. Naval Academy (United States)
Univ. of Maryland, Baltimore County (United States)
Chein-I Chang, Univ. of Maryland, Baltimore County (United States)


Published in SPIE Proceedings Vol. 9124:
Satellite Data Compression, Communications, and Processing X
Bormin Huang; Chein-I Chang; José Fco. López, Editor(s)

© SPIE. Terms of Use
Back to Top