Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition Export

@misc{citeulike:1930017, abstract = {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...}, author = {Pati, Y. and Rezaiifar, R. and Krishnaprasad, P.}, citeulike-article-id = {1930017}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.1254}, keywords = {matching-pursuit}, posted-at = {2007-11-17 09:14:20}, priority = {0}, title = {Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.1254}, year = {1993} }

TY - GEN ID - citeulike:1930017 L3 - citeulike-article-id:1930017 N2 - 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... TI - Orthogonal Matching Pursuit: Recursive Function Approximation with Applications to Wavelet Decomposition KW - matching-pursuit AU - Pati, Y AU - Rezaiifar, R AU - Krishnaprasad, P PY - 1993/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.55.1254 ER -