Fast atomic decomposition by the inhibition method
Proceedings of the 15th
International Conference on Pattern Recognition:
ICPR 2000,
Barcelona, Spain, September 2-8, 2000, pp.215-218.
Authors:
Arthur E.C. Pece and
Nikolay Petkov.
E-mail: aecp@diku.dk
Abstract
A new algorithm is introduced which is related to matching pursuit
but allows updating more than one coding coefficient per iteration:
the updated coefficients correspond to
mutually orthogonal elements of the dictionary.
Coding experiments on natural images show that the new method achieves
the same trade-off as matching pursuit between
number of coding coefficients and reconstruction error,
but significantly faster convergence.
gzipped Postscript
Related publication
- A.E.C. Pece (2001)
-
The Problem of Sparse Image Coding
- Technical Report DIKU-TR-2001-2.
- A shorter, revised version has been accepted for publication
in the Journal of Mathematical Imaging and Vision.