By Topic

Application of concave/Schur-concave functions to the learning of overcomplete dictionaries and sparse representations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
K. Kreutz-Delgado ; Dept. of Electr. & Comput. Eng., California Univ., San Diego, La Jolla, CA, USA ; B. D. Rao

Given a very overcomplete m/spl times/n dictionary of representation vectors a/sub i/, A=[a/sub 1/,...,a/sub n/], n/spl Gt/m, an environmentally generated signal, y, can be succinctly represented within the dictionary by obtaining a sparse solution, x, to the linear inverse problem Ax/spl ap/y using various previously proposed methodologies. In particular, sparse solutions can be found by an appropriately regularized minimization of the error e=y-Ax. In this paper we briefly discuss our investigations into the use of concave/Schur-concave functions as regularizing sparsity measures, and their application to the problem of obtaining sparse representations, x, of environmentally generated signals y, and the problem of learning environmentally adapted overcomplete dictionaries.

Published in:

Signals, Systems & Computers, 1998. Conference Record of the Thirty-Second Asilomar Conference on  (Volume:1 )

Date of Conference:

1-4 Nov. 1998