File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Fast nonconvex nonsmooth minimization methods for image restoration and reconstruction

TitleFast nonconvex nonsmooth minimization methods for image restoration and reconstruction
Authors
Keywordsimage restoration
fast Fourier transform
total variation
nonconvex nonsmooth regularization
nonconvex nonsmooth global minimization
image reconstruction
Continuation methods
Issue Date2010
Citation
IEEE Transactions on Image Processing, 2010, v. 19, n. 12, p. 3073-3088 How to Cite?
AbstractNonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficulty of the computational stage which requires a nonconvex nonsmooth minimization. In this paper, we deal with nonconvex nonsmooth minimization methods for image restoration and reconstruction. Our theoretical results show that the solution of the nonconvex nonsmooth minimization problem is composed of constant regions surrounded by closed contours and neat edges. The main goal of this paper is to develop fast minimization algorithms to solve the nonconvex nonsmooth minimization problem. Our experimental results show that the effectiveness and efficiency of the proposed algorithms. © 2010 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/276481
ISSN
2023 Impact Factor: 10.8
2023 SCImago Journal Rankings: 3.556
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorNikolova, Mila-
dc.contributor.authorNg, Michael K.-
dc.contributor.authorTam, Chi Pan-
dc.date.accessioned2019-09-18T08:33:44Z-
dc.date.available2019-09-18T08:33:44Z-
dc.date.issued2010-
dc.identifier.citationIEEE Transactions on Image Processing, 2010, v. 19, n. 12, p. 3073-3088-
dc.identifier.issn1057-7149-
dc.identifier.urihttp://hdl.handle.net/10722/276481-
dc.description.abstractNonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficulty of the computational stage which requires a nonconvex nonsmooth minimization. In this paper, we deal with nonconvex nonsmooth minimization methods for image restoration and reconstruction. Our theoretical results show that the solution of the nonconvex nonsmooth minimization problem is composed of constant regions surrounded by closed contours and neat edges. The main goal of this paper is to develop fast minimization algorithms to solve the nonconvex nonsmooth minimization problem. Our experimental results show that the effectiveness and efficiency of the proposed algorithms. © 2010 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Image Processing-
dc.subjectimage restoration-
dc.subjectfast Fourier transform-
dc.subjecttotal variation-
dc.subjectnonconvex nonsmooth regularization-
dc.subjectnonconvex nonsmooth global minimization-
dc.subjectimage reconstruction-
dc.subjectContinuation methods-
dc.titleFast nonconvex nonsmooth minimization methods for image restoration and reconstruction-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TIP.2010.2052275-
dc.identifier.pmid20542766-
dc.identifier.scopuseid_2-s2.0-78649252763-
dc.identifier.volume19-
dc.identifier.issue12-
dc.identifier.spage3073-
dc.identifier.epage3088-
dc.identifier.isiWOS:000284362400001-
dc.identifier.issnl1057-7149-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats