We have derived a new algorithm for dictionary learning for sparse coding in the ℓ1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, but rather uses the special geometry of the ℓ1 exact sparse solution to give a computationally simple yet conceptually interesting algorithm. A self-normalizing version of the algorithm is also derived, which uses negative feedback to ensure that basis vectors converge to unit norm. The operation of the algorithm is illustrated on a simple numerical example. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Plumbley, M. D. (2007). Dictionary learning for L1-exact sparse coding. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4666 LNCS, pp. 406–413). Springer Verlag. https://doi.org/10.1007/978-3-540-74494-8_51
Mendeley helps you to discover research relevant for your work.