Fast matching pursuit with a multiscale dictionary of Gaussian chirps

R Gribonval - IEEE Transactions on signal Processing, 2001 - ieeexplore.ieee.org
We introduce a modified matching pursuit algorithm, called fast ridge pursuit, to approximate
N-dimensional signals with M Gaussian chirps at a computational cost O (MN) instead of the
expected O (MN/sup 2/logN). At each iteration of the pursuit, the best Gabor atom is first
selected, and then, its scale and chirp rate are locally optimized so as to get a" good" chirp
atom, ie, one for which the correlation with the residual is locally maximized. A ridge theorem
of the Gaussian chirp dictionary is proved, from which an estimate of the locally optimal …

[PDF][PDF] Fast Matching Pursuit with a multiscale dictionary of Gaussian chirps

R emi Gribonval - irisa.fr
We introduce a modi ed Matching Pursuit algorithm, called Fast Ridge Pursuit, to
approximate N-dimensional signals with M Gaussian chirps at a computational cost O (MN)
instead of the expected O (MN2 log N). At each iteration of the pursuit, the best Gabor atom
is rst selected, then its scale and chirp rate are locally optimized so as to get a\good" chirp
atom, ie one for which the correlation with the residual is locally maximized. A ridge theorem
of the Gaussian chirp dictionary is proved, from which an estimate of the locally optimal …
以上显示的是最相近的搜索结果。 查看全部搜索结果

Google学术搜索按钮

example.edu/paper.pdf
搜索
获取 PDF 文件
引用
References