Abstract

In this paper, a novel regularization method for image restoration and reconstruction is introduced which is accomplished by adopting a nonconvex nonsmooth penalty that depends on the eigenvalues of structure tensor of the underlying image. At first, an alternating minimization scheme is developed in which the problem can be decomposed into three subproblems, two of them are convex and the remaining one is smooth. Then, the convergence of the sequence which generate by the alternating minimization algorithm is proved. Finally, the efficient performance of the proposed method is demonstrated through experimental results for both grayscale and vector-value images.

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.