Share Email Print

Proceedings Paper

Hierarchical parallel matching pursuit
Author(s): Hans Georg Feichtinger; Andreas Turk; Thomas Strohmer
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The by now well-known matching pursuit method of S. Mallat as well as the recently proposed orthogonal matching pursuit work purely sequential and are based on the idea of choosing only one single atom at a given time. Pursuing ideas which are related to modifications of the POCS method, we suggest a new type of orthogonalization procedure which allows to operate in parallel at different 'levels'. More precisely, we assume that we have a dictionary which consists of similar 'pages', i.e. those pages are collection of functions, generated from a single function by translations along a subgroup which is the same for all such pages. Based on a certain hierarchical structure (preference of pages) we apply an appropriate Gram-Schmidt type orthogonalization procedure which allows to deal with the matching pursuit problem in parallel at different levels. After carrying out appropriate approximations at the different, now orthogonal levels, one comes back to a representation based on the given family of atoms, in a straight-forward way.

Paper Details

Date Published: 30 September 1994
PDF: 11 pages
Proc. SPIE 2302, Image Reconstruction and Restoration, (30 September 1994); doi: 10.1117/12.188061
Show Author Affiliations
Hans Georg Feichtinger, Univ. of Vienna (Austria)
Andreas Turk, Univ. of Vienna (Austria)
Thomas Strohmer, Univ. of Vienna (Austria)

Published in SPIE Proceedings Vol. 2302:
Image Reconstruction and Restoration
Timothy J. Schulz; Donald L. Snyder, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?