An adaptive norm algorithm for image restoration

14Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose an adaptive norm strategy designed for the re-storation of images contaminated by blur and noise. Standard Tikhonov regularization can give good results with Gaussian noise and smooth images, but can over-smooth the output. On the other hand, L 1-TV (Total Variation) regularization has superior performance with some non-Gaussian noise and controls both the size of jumps and the geometry of the object boundaries in the image but smooth parts of the recovered images can be blocky. According to a coherence map of the image which is obtained by a threshold structure tensor, and can detect smooth regions and edges in the image, we apply L 2-norm or L 1-norm regularization to different parts of the image. The solution of the resulting minimization problem is obtained by a fast algorithm based on the half-quadratic technique recently proposed in [2] for L 1-TV regularization. Some numerical results show the effectiveness of our adaptive norm image restoration strategy. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Bertaccini, D., Chan, R. H., Morigi, S., & Sgallari, F. (2012). An adaptive norm algorithm for image restoration. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6667 LNCS, pp. 194–205). https://doi.org/10.1007/978-3-642-24785-9_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free