Abstract

An image deconvolution approach based on regularized sparse representation is proposed. Given an observed blurred image, traditional deconvolution approach based on sparse representation constructs the -norm regularization directly by using the direct observed model and the sparsity of image decomposed on a redundant dictionary. However, the -norm regularization has large coherence because of the compactness of the blurring operator. Therefore, we multiply the blurred image with a regularizing operator and construct the -norm regularization by using the converted data. The approach, referred as regularized sparse representation, possesses the following merits: (i) it decreases the coherence of the -norm regularization; (ii) algorithm solving the regularization is fast converged due to the preconditioning strategy. Experimental results demonstrate that comparing with existed state-of-the-art approaches, the proposed approach can obtain good results in terms of speed and deconvolution performance.

Full Text
Paper version not known

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

Disclaimer: 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.