KEYWORDS: Chemical species, Associative arrays, Algorithm development, Interference (communication), Signal analyzers, Data modeling, Algorithms, Wavelets, Signal analysis, Reconstruction algorithms
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.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.