Share Email Print

Proceedings Paper

Sparse linear filters for detection and classification in hyperspectral imagery
Author(s): James Theiler; Karen Glocer
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

We investigate the use of convex optimization to identify sparse linear filters in hyperspectral imagery. A linear filter is sparse if a large fraction of its coefficients are zero. A sparse linear filter can be advantageous because it only needs to access a subset of the available spectral channels, and it can be applied to high-dimensional data more cheaply than a standard linear detector. Finding good sparse filters is nontrivial because there is a combinatorially large number of discrete possibilities from which to choose the optimal subset of nonzero coefficients. But, by converting the optimality criterion into a convex loss function, and by employing an L1 penalty, one can obtain sparse solutions that are globally optimal. We investigate the performance of these sparse filters as a function of their sparsity, and compare the convex optimization approach with more traditional alternatives for feature selection. The methodology is applied both to the adaptive matched filter for weak signal detection, and to the Fisher linear discriminant for terrain categorization.

Paper Details

Date Published: 4 May 2006
PDF: 12 pages
Proc. SPIE 6233, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XII, 62330H (4 May 2006); doi: 10.1117/12.665994
Show Author Affiliations
James Theiler, Los Alamos National Lab. (United States)
Karen Glocer, Los Alamos National Lab. (United States)
Univ. of California/Santa Cruz (United States)

Published in SPIE Proceedings Vol. 6233:
Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery XII
Sylvia S. Shen; Paul E. Lewis, Editor(s)

© SPIE. Terms of Use
Back to Top