File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: The convex relaxation method on deconvolution model with multiplicative noise

TitleThe convex relaxation method on deconvolution model with multiplicative noise
Authors
KeywordsDeblurring
Convergence
Alternating minimization
Non-convex model
Multiplicative noise
Issue Date2013
Citation
Communications in Computational Physics, 2013, v. 13, n. 4, p. 1066-1092 How to Cite?
AbstractIn this paper, we consider variational approaches to handle the multiplicative noise removal and deblurring problem. Based on rather reasonable physical blurring-noisy assumptions, we derive a new variational model for this issue. After the study of the basic properties, we propose to approximate it by a convex relaxation model which is a balance between the previous non-convex model and a convex model. The relaxed model is solved by an alternating minimization approach. Numerical examples are presentedto illustrate the effectivenessand efficiencyof the proposed method. © 2013 Global-Science Press.
Persistent Identifierhttp://hdl.handle.net/10722/276941
ISSN
2023 Impact Factor: 2.6
2023 SCImago Journal Rankings: 1.176
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHuang, Yumei-
dc.contributor.authorNg, Michael-
dc.contributor.authorZeng, Tieyong-
dc.date.accessioned2019-09-18T08:35:07Z-
dc.date.available2019-09-18T08:35:07Z-
dc.date.issued2013-
dc.identifier.citationCommunications in Computational Physics, 2013, v. 13, n. 4, p. 1066-1092-
dc.identifier.issn1815-2406-
dc.identifier.urihttp://hdl.handle.net/10722/276941-
dc.description.abstractIn this paper, we consider variational approaches to handle the multiplicative noise removal and deblurring problem. Based on rather reasonable physical blurring-noisy assumptions, we derive a new variational model for this issue. After the study of the basic properties, we propose to approximate it by a convex relaxation model which is a balance between the previous non-convex model and a convex model. The relaxed model is solved by an alternating minimization approach. Numerical examples are presentedto illustrate the effectivenessand efficiencyof the proposed method. © 2013 Global-Science Press.-
dc.languageeng-
dc.relation.ispartofCommunications in Computational Physics-
dc.subjectDeblurring-
dc.subjectConvergence-
dc.subjectAlternating minimization-
dc.subjectNon-convex model-
dc.subjectMultiplicative noise-
dc.titleThe convex relaxation method on deconvolution model with multiplicative noise-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.4208/cicp.310811.090312a-
dc.identifier.scopuseid_2-s2.0-84869750298-
dc.identifier.volume13-
dc.identifier.issue4-
dc.identifier.spage1066-
dc.identifier.epage1092-
dc.identifier.eissn1991-7120-
dc.identifier.isiWOS:000322065200006-
dc.identifier.issnl1815-2406-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats