Highly coherent sensing matrices arise in discretization of continuum problems such as radar and medical
imaging when the grid spacing is below the Rayleigh threshold as well as in using highly coherent, redundant
dictionaries as sparsifying operators.
Algorithms (BOMP, BLOOMP) based on techniques of band exclusion and local optimization are proposed
to enhance Orthogonal Matching Pursuit (OMP) and deal with such coherent sensing matrices.
BOMP and BLOOMP have provably performance guarantee of reconstructing sparse, widely separated
objects independent of the redundancy and have a sparsity constraint and computational cost similar to
OMP's.
Numerical study demonstrates the effectiveness of BLOOMP for compressed sensing with highly coherent,
redundant sensing matrices.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.