Share Email Print

Proceedings Paper

FOCUSS-based dictionary learning algorithms
Author(s): Kenneth Kreutz-Delgado; Bhaskar D. Rao
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Algorithms for data-driven learning of domain-specific over complete dictionaries are developed to obtain maximum likelihood and maximum a posteriori dictionary estimates based on the use of Bayesian models with concave/Schur- concave negative log-priors. Such priors are appropriate for obtaining sparse representations of environmental signals within an appropriately chosen dictionary. The elements of the dictionary can be interpreted as 'concepts,' features or 'words' capable of succinct expression of events encountered in the environment. This is a generalization of vector quantization in that one is interested in a description involving a few dictionary entries, but not necessarily as succinct as one entry. To learn an environmentally-adapted dictionary capable of concise expression of signals generated by the environment, we develop algorithms that iterate between a representative set of sparse representations found by variants of FOCUSS, an affine scaling transformation (ACT)-like sparse signal representation algorithm recently developed at UCSD, and an update of the dictionary using these sparse representations.

Paper Details

Date Published: 4 December 2000
PDF: 15 pages
Proc. SPIE 4119, Wavelet Applications in Signal and Image Processing VIII, (4 December 2000); doi: 10.1117/12.408634
Show Author Affiliations
Kenneth Kreutz-Delgado, Univ. of California/San Diego (United States)
Bhaskar D. Rao, Univ. of California/San Diego (United States)

Published in SPIE Proceedings Vol. 4119:
Wavelet Applications in Signal and Image Processing VIII
Akram Aldroubi; 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?