On the use of a priori information for sparse signal approximations

@article{Escoda2006OnTU,
  title={On the use of a priori information for sparse signal approximations},
  author={{\`O}scar Divorra Escoda and Lorenzo Granai and Pierre Vandergheynst},
  journal={IEEE Transactions on Signal Processing},
  year={2006},
  volume={54},
  pages={3468-3482}
}
Recent results have underlined the importance of incoherence in redundant dictionaries for a good behavior of decomposition algorithms like matching and basis pursuit. However, appropriate dictionaries for a given application may not be able to meet the incoherence condition. In such a case, decomposition algorithms may completely fail in the retrieval of the sparsest approximation. This paper studies the effect of introducing a priori knowledge when recovering sparse approximations over… CONTINUE READING
Highly Cited
This paper has 46 citations. REVIEW CITATIONS
33 Citations
37 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 33 extracted citations

References

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

Tropp,“Greed is good : Algorithmic results for sparse approximation,

  • J A.
  • IEEE Trans. Inform. Theory,
  • 2004
Highly Influential
10 Excerpts

and M

  • S. S. Chen, D. L. Donoho
  • A. Saunders, “Atomic decomposition by basis…
  • 1999
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…