Academic Journal
Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition
| العنوان: | Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition |
|---|---|
| المؤلفون: | Y. C. Pati, R. Rezaiifar, Y. C. Pati R. Rezaiifar, P. S. Krishnaprasad |
| المساهمون: | The Pennsylvania State University CiteSeerX Archives |
| المصدر: | http://www.glue.umd.edu/~ramin/papers/Asilomar_2.ps. |
| سنة النشر: | 1993 |
| المجموعة: | CiteSeerX |
| الوصف: | In this paper we describe a recursive algorithm to compute representations of functions with respect to nonorthogonal and possibly overcomplete dictionaries of elementary building blocks e.g. affine (wavelet) frames. We propose a modification to the Matching Pursuit algorithm of Mallat and Zhang (1992) that maintains full backward orthogonality of the residual (error) at every step and thereby leads to improved convergence. We refer to this modified algorithm as Orthogonal Matching Pursuit (OMP). It is shown that all additional computation required for the OMP algorithm may be performed recursively. 1 Introduction and Background Given a collection of vectors D = fx i g in a Hilbert space H, let us define V = Spanfxn g; and W = V ? (in H): We shall refer to D as a dictionary, and will assume the vectors xn , are normalized (kxn k = 1). In [3] Mallat and Zhang proposed an iterative algorithm that they termed Matching Pursuit (MP) to construct representations of the form P V f = X. |
| نوع الوثيقة: | text |
| وصف الملف: | application/postscript |
| اللغة: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.1254; http://www.glue.umd.edu/~ramin/papers/Asilomar_2.ps |
| الاتاحة: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.1254 http://www.glue.umd.edu/~ramin/papers/Asilomar_2.ps |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| رقم الانضمام: | edsbas.ED58EEB3 |
| قاعدة البيانات: | BASE |
| الوصف غير متاح. |