Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.00146 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909592686952448 |
|---|---|
| author | Yu, Huiyuan He, Jia Cheng, Maggie |
| author_facet | Yu, Huiyuan He, Jia Cheng, Maggie |
| contents | Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension called generalized OMP (gOMP) by offering fast algorithms for the orthogonal projection of the input signal at each iteration. The proposed modifications directly reduce the computational complexity of OMP and gOMP. Experiment results verified the improvement in computation time. This paper also provides sufficient conditions for exact signal recovery. For general signals with additive noise, the approximation error is at the same order as OMP (gOMP), but is obtained within much less time. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_00146 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Fast Orthogonal Matching Pursuit through Successive Regression Yu, Huiyuan He, Jia Cheng, Maggie Computer Vision and Pattern Recognition Optimization and Control Orthogonal Matching Pursuit (OMP) has been a powerful method in sparse signal recovery and approximation. However, OMP suffers computational issues when the signal has a large number of non-zeros. This paper advances OMP and its extension called generalized OMP (gOMP) by offering fast algorithms for the orthogonal projection of the input signal at each iteration. The proposed modifications directly reduce the computational complexity of OMP and gOMP. Experiment results verified the improvement in computation time. This paper also provides sufficient conditions for exact signal recovery. For general signals with additive noise, the approximation error is at the same order as OMP (gOMP), but is obtained within much less time. |
| title | Fast Orthogonal Matching Pursuit through Successive Regression |
| topic | Computer Vision and Pattern Recognition Optimization and Control |
| url | https://arxiv.org/abs/2404.00146 |