Performance analysis of Orthogonal Matching Pursuit under general perturbations

@article{Ding2012PerformanceAO,
  title={Performance analysis of Orthogonal Matching Pursuit under general perturbations},
  author={Jie Ding and Laming Chen and Yuantao Gu},
  journal={2012 International Conference on Computing, Networking and Communications (ICNC)},
  year={2012},
  pages={892-896}
}
As a canonical greedy algorithm, Orthogonal Matching Pursuit (OMP) is used for sparse approximation. Previous studies have mainly considered non-perturbed observations y = Φx, and focused on the exact recovery of x through y and Φ. Here, Φ is a matrix with more columns than rows, and x is a sparse signal to be recovered. This paper deals with performance of OMP under general perturbations - from both y and Φ. The main contribution shows that exact recovery of the support set of x can be… CONTINUE READING
4 Citations
16 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Similar Papers

Loading similar papers…