Abstract
The Lorentzian hard thresholding pursuit algorithm is proposed in this paper to achieve efficient reconstruction for compressed sensing in the presence of impulsive noise. In the Lorentzian hard thresholding pursuit algorithm, the minimum LL <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sub> norm problem is solved with respect to a support which is obtained through the hard thresholding operator. The convergence and reconstruction performance of the Lorentzian hard thresholding pursuit algorithm is proved in theory in this paper. Experimental results show that the reconstruction performance of the Lorentizian hard thresholding pursuit algorithm is superior to the Lorentzian iterative hard thresholding algorithm which is also an effective algorithm for sparse reconstruction of compressed sensing in the impulsive noise environment.
Published Version
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 call