Novel algorithms for learning overcomplete dictionaries

Conference Record of the 33rd Asilomar Conference on Signals, Systems, and Computers

Volumn 2, Issue , 1999, Pages 971-975

  Kreutz Delgado, K ^a   Rao, B D ^a   Engan, K ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b ECE Dept   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

INVERSE PROBLEMS; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; MAXIMUM LIKELIHOOD; OPTIMIZATION; ALGORITHMS; APPROXIMATION THEORY; GLOSSARIES; LEARNING SYSTEMS; MAXIMUM LIKELIHOOD ESTIMATION; VECTORS;

AFFINE SCALING; BAYESIAN FRAMEWORKS; LINEAR INVERSE PROBLEMS; MAXIMUM A POSTERIORI; NOVEL ALGORITHM; OPTIMIZATION ALGORITHMS; OVER-COMPLETE DICTIONARIES; SPARSE SOLUTIONS;

LEARNING ALGORITHMS; INFORMATION THEORY;

AFFINE-SCALING TRANSFORMATION (AST) OPTIMIZATION ALGORITHMS; BAYESIAN FRAMEWORK;

EID: 0033348156     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ACSSC.1999.831854     Document Type: Conference Paper

References (18)

1. A. Basilevsky, Statistical factor analysis and related methods: Theory and applications, Wiley 1994.
2. K. Engan, B.D. Rao and K. Kreutz-Delgado, "Frame Design Using FOCUSS with Method of Optimal Directions (MOD)", Proc. NORSIG-99.
3. What is the Goal of Sensory Coding, Neuml Computation, 6, 559-99, 1994
4. H.K. Khalil, Nonlinear Systems, 2nd Ed., Prentice Hall, 1996.
5. K. Kreutz-Delgado & B.D. Rao, "A General Approach to Sparse Basis Selection: Majorization, Concavity, and Affine Scaling, " UCSD CIE Report 1997.
6. K. Kreutz-Delgado & B.D. Rao, "Measures and Algorithms for Best Basis Selection, " 1998 ICASSP.
7. K. Kreutz-Delgado & B.D. Rao, "Gradient Factorization Based Algorithm for Best-Basis Selection, " The 8th IEEE Signal Processing Workshop, Bryce Canyon, UT, 1998.
8. K. Kreutz-Delgado & B.D. Rao, "Sparse Basis Selection, ICA, and Majorization: Towards a Unified Perspective, " ICA SSP-99.
9. K. Kreutz-Delgado, B.D. Rao, K. Engan, T.-W. Lee, T. Sejnowski Convex/Schur-Convex (CSC) Log-Priors and Sparse Coding, Proc. 6th JSNC, 1999
10. K. Kreutz-Delgado, B.D. Rao, K. Engan, T.-W. Lee, and T. Sejnowski, "Learning Overcomplete Dictionaries, " Proc. 6th JSNC, 1999.
11. M. Lewicki & T. Sejnowski, "Learning Nonlinear Overcomplete Representations for Efficient Coding, " February 1998, Preprint. Submitted to Neuml Computation.
12. S. Mallat & 2. Zhang, Matching Pursuits with Time-Frequency Dictionaries, fins IEEE ASSP, 41, 12, 3397-416, 1993
13. B. Olshausen & D. Field, "Sparse Coding with an Overcomplete Basis Set: A Strategy Employed by Vl?, " December 1996, Preprint.
14. B.A. Pearlmutter and L.C. Parra, "Maximum likelihood blind source separation: A context-sensitive generalization of ICA, " P ~ cN. I PS-96, p. 613-619, 1996).
15. B.D. Rao & K. Kreutz-Delgado, "Deriving Algorithms for Computing Sparse Solutions to Linear Inverse Problems, " Pmc. 1997 Asilomar Conference on Circuits, Systems, and Computers.
16. B.D. Rao & K. Kreutz-Delgado, Basis Selection in the Presence of Noise, 1998, Asilornar Conference
17. B.D. Rao & K. Kreutz-Delgado, "An Affine Scaling Methodology for Best Basis Selection, " IEEE ns. Signal Processing, January 1999.
18. B.D. Rao, "Signal Processing with the Sparseness Constraint, " Proc. 1998 ICASSP.