The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing

@article{Liu2012TheOS,
  title={The Orthogonal Super Greedy Algorithm and Applications in Compressed Sensing},
  author={Entao Liu and Vladimir N. Temlyakov},
  journal={IEEE Transactions on Information Theory},
  year={2012},
  volume={58},
  pages={2040-2047}
}
The general theory of greedy approximation is well developed. Much less is known about how specific features of a dictionary can be used to our advantage. In this paper, we discuss incoherent dictionaries. We build a new greedy algorithm which is called the orthogonal super greedy algorithm (OSGA). We show that the rates of convergence of OSGA and the orthogonal matching pursuit (OMP) with respect to incoherent dictionaries are the same. Based on the analysis of the number of orthogonal… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS