Abstract

Image deblurring problem is a tough work for improving the quality of images, in this paper; we develop an efficient and fast thresholding algorithm to handle such problem. We observe that the improved fast iterative thresholding algorithm (IFISTA) can be further accelerated by using a sequence of over relaxation parameters which do not satisfy the Nesterov’s rule. Our proposed algorithm preserves the simplicity of the IFISTA and fast iterative shrinkage thresholding algorithm (FISTA). In addition, we theoretically study the convergence of our proposed algorithm and obtain some improved convergence rate. Furthermore, we investigate the local variation of iterations which is still unknown in FISTA and IFISTA algorithms so far. Extensive experiments have been conducted and show that our proposed algorithm is more efficient and robust. Specifically, we compare our proposed algorithm with FISTA and IFISTA algorithms on a series of scenarios, including the different level noise signals as well as different weighting matrices. All results demonstrate that our proposed algorithm is able to achieve better recovery performance, while being faster and more efficient than others.

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.