Abstract
Most signals can be represented sparsely in a basis. Recently, Compressive Sensing Theorem which offers convex optimization algorithms based on l 1 -minimization for sparse signal recovery is often being used. In this paper, some of the iterative signal recovery algorithms alternative to l 1 -minimization solution which are Orthogonal Matching Pursuit (OMP), Compressive Sampling Matching Pursuit (CoSaMP), Iterative Hard Thresholding (IHT) and Lipschitz Iterative Hard Theresholding (LIHT) are compared in noisy and noiseless conditions with various tests. Iterative algorithms alternative to the l 1 optimization method with similar performance are verified. OMP algorithm that works at higher true reconstruction rates in noisy and noiseless conditions can be preferred instead of convex optimization methods.
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.
