Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Sign preservation analysis of orthogonal greedy algorithms

Abstract : We bring a contribution to the exact recovery theory of a K-sparse vector in the noiseless setting under the standard condition mu < 1/(2K − 1), where mu denotes the mutual coherence. While it is known that Orthogonal Matching Pursuit (OMP) and Orthogonal Least Squares (OLS) identify the true support in K iterations, we prove that the weights of the selected atoms have the correct sign in the best current approximation at any of the K iterations. Therefore, OMP and OLS identify with their sign-aware versions, which allows us to establish an exact support recovery property based on mutual coherence for non-negative versions of OMP and OLS).
Complete list of metadatas

Cited literature [41 references]  Display  Hide  Download
Contributor : Charles Soussen <>
Submitted on : Monday, January 7, 2019 - 11:52:45 AM
Last modification on : Wednesday, April 8, 2020 - 3:53:32 PM
Document(s) archivé(s) le : Monday, April 8, 2019 - 2:47:20 PM


Files produced by the author(s)


  • HAL Id : hal-01971697, version 1


Thi Thanh Nguyen, Charles Soussen, Jérôme Idier, El-Hadi Djermoune. Sign preservation analysis of orthogonal greedy algorithms. 2019. ⟨hal-01971697⟩



Record views


Files downloads