Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18561
Title: Nonconvex sparse regularizer based speckle noise removal
Authors: Han, Y
Feng, XC
Baciu, G 
Wang, WW
Keywords: Alternative iteration
Augmented Lagrange multiplier
Iteratively reweighted method
Nonconvex
Sparse
Speckle noise
Issue Date: 2013
Publisher: Elsevier
Source: Pattern recognition, 2013, v. 46, no. 3, p. 989-1001 How to cite?
Journal: Pattern recognition 
Abstract: This paper focuses on the problem of speckle noise removal. A new variational model is proposed for this task. In the model, a nonconvex regularizer rather than the classical convex total variation is used to preserve edges/details of images. The advantage of the nonconvex regularizer is pointed out in the sparse framework. In order to solve the model, a new fast iteration algorithm is designed. In the algorithm, to overcome the disadvantage of the nonconvexity of the model, both the augmented Lagrange multiplier method and the iteratively reweighted method are introduced to resolve the original nonconvex problem into several convex ones. From the algorithm, we can obtain restored images as well as edge indicator of the images. Comprehensive experiments are conducted to measure the performance of the algorithm in terms of visual evaluation and a variety of quantitative indices for the task of speckle noise removal.
URI: http://hdl.handle.net/10397/18561
ISSN: 0031-3203
EISSN: 1873-5142
DOI: 10.1016/j.patcog.2012.10.010
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

24
Last Week
0
Last month
1
Citations as of Nov 2, 2018

WEB OF SCIENCETM
Citations

23
Last Week
0
Last month
0
Citations as of Nov 12, 2018

Page view(s)

62
Last Week
2
Last month
Citations as of Nov 11, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.