A Geometrical Study of Matching Pursuit Parametrization

Mathematics – Differential Geometry

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

26 pages, 8 figures

Scientific paper

10.1109/TSP.2008.917379

This paper studies the effect of discretizing the parametrization of a dictionary used for Matching Pursuit decompositions of signals. Our approach relies on viewing the continuously parametrized dictionary as an embedded manifold in the signal space on which the tools of differential (Riemannian) geometry can be applied. The main contribution of this paper is twofold. First, we prove that if a discrete dictionary reaches a minimal density criterion, then the corresponding discrete MP (dMP) is equivalent in terms of convergence to a weakened hypothetical continuous MP. Interestingly, the corresponding weakness factor depends on a density measure of the discrete dictionary. Second, we show that the insertion of a simple geometric gradient ascent optimization on the atom dMP selection maintains the previous comparison but with a weakness factor at least two times closer to unity than without optimization. Finally, we present numerical experiments confirming our theoretical predictions for decomposition of signals and images on regular discretizations of dictionary parametrizations.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Geometrical Study of Matching Pursuit Parametrization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Geometrical Study of Matching Pursuit Parametrization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Geometrical Study of Matching Pursuit Parametrization will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-95467

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.