Abstract
We are concerned with the problem of recovering sparse vectors exactly by two commonly used methods, orthogonal matching pursuit (OMP) and basis pursuit (BP). Suppose that overcomplete dictionaries are unions of several orthonormal bases. Gribonval and Nielsen have provided a sufficient mutual coherence condition for BP to recover every sparse vector exactly. Then Tropp proved that it is a sharp sufficient condition for OMP by existence proofs. We establish here the sharpness of Gribonval and Nielsen’s sufficient condition for both OMP and BP by constructing several families of counterexamples. Our main tools are Hadamard matrices and mutually unbiased bases from quantum information theory.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
