Share Email Print

Proceedings Paper

Greedy adaptive discrimination: component analysis by simultaneous sparse approximation
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Sparse approximation is typically concerned with generating compact representation of signals and data vectors by constructing a tailored linear combination of atoms drawn from a large dictionary. We have developed an algorithm based on simultaneous matching pursuits that facilitates the concurrent approximation of multiple signals in a common, low-dimensional representation space. The algorithm leads to an effective method of extracting signal components from collections of noisy data, and in particular is robust against jitter as well as additive noise. We illustrate its utility and compare performance in several variations by numerical examples.

Paper Details

Date Published: 17 September 2005
PDF: 9 pages
Proc. SPIE 5914, Wavelets XI, 59141R (17 September 2005); doi: 10.1117/12.626449
Show Author Affiliations
Jeffrey M. Sieracki, SR2 Group, LLC (United States)
John J. Benedetto, Univ. of Maryland, College Park (United States)

Published in SPIE Proceedings Vol. 5914:
Wavelets XI
Manos Papadakis; Andrew F. Laine; Michael A. Unser, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?