# zbMATH — the first resource for mathematics

##### Examples
 Geometry Search for the term Geometry in any field. Queries are case-independent. Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact. "Topological group" Phrases (multi-words) should be set in "straight quotation marks". au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted. Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff. "Quasi* map*" py: 1989 The resulting documents have publication year 1989. so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14. "Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic. dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles. py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses). la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

##### Operators
 a & b logic and a | b logic or !ab logic not abc* right wildcard "ab c" phrase (ab c) parentheses
##### Fields
 any anywhere an internal document identifier au author, editor ai internal author identifier ti title la language so source ab review, abstract py publication year rv reviewer cc MSC code ut uncontrolled term dt document type (j: journal article; b: book; a: book article)
Image restoration using $L_1$ norm penalty function. (English) Zbl 1258.94013
Summary: The process of estimating an original image from a given blurred and noisy image is known as image restoration. It is an ill-posed inverse problem, since one of the ways of solving it requires finding a solution to a Fredholm integral equation of convolution type in two-dimensional space. The focus of the article is to achieve a quality edge preserving image restoration using a less expensive (fast) regularization technique with $L_1$-norm penalty function. $L_1$-norm-based approaches do not penalize edges or high frequency contents in the restored image compared to $L_2$-norm-based approaches. Total variation (TV) is an established $L_1$-norm regularization approach that performs edge preserving image restoration, but at a high computational cost. TV regularization requires linearization of a highly nonlinear penalty term, which increases the restoration time considerably for large scale images. In order to reduce the computational cost, we extend least absolute shrinkage and selection operator (LASSO), an $L_1$-norm minimization statistical modeling technique to image restoration. The penalty function of LASSO is an identity matrix so it is computationally fast. The metrics, like, residual error, peak signal to noise ratio (PSNR), restoration time, edge map of the restored image, and subjective visual evaluation are used to assess the performances of both methods. Based on our experimental results, we show that LASSO achieves similar quality of edge preserving restoration as TV regularization, and is approximately two times faster in computation compared to TV regularization on the same set of images. We also analyze the impact of the different degree of blurring caused by point spread functions (PSFs) corrupted by different signal to noise ratios (SNRs) on image restoration.

##### MSC:
 94A08 Image processing (compression, reconstruction, etc.)
Full Text: