Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/93923
DC Field | Value | Language |
---|---|---|
dc.contributor | Department of Applied Mathematics | en_US |
dc.creator | He, F | en_US |
dc.creator | Wang, X | en_US |
dc.creator | Chen, X | en_US |
dc.date.accessioned | 2022-08-03T01:24:13Z | - |
dc.date.available | 2022-08-03T01:24:13Z | - |
dc.identifier.uri | http://hdl.handle.net/10397/93923 | - |
dc.language.iso | en | en_US |
dc.publisher | Society for Industrial and Applied Mathematics | en_US |
dc.rights | © 2021 Society for Industrial and Applied Mathematics | en_US |
dc.rights | The following publication He, F., Wang, X., & Chen, X. (2021). A Penalty Relaxation Method for Image Processing Using Euler's Elastica Model. SIAM Journal on Imaging Sciences, 14(1), 389-417 is available at https://doi.org/10.1137/20M1335601 | en_US |
dc.subject | Euler's elastica model | en_US |
dc.subject | Smoothing relaxation | en_US |
dc.subject | Exact penalty | en_US |
dc.subject | Block coordinate descent | en_US |
dc.subject | Convergence | en_US |
dc.subject | OCT images | en_US |
dc.title | A penalty relaxation method for image processing using Euler's elastica model | en_US |
dc.type | Journal/Magazine Article | en_US |
dc.identifier.spage | 389 | en_US |
dc.identifier.epage | 417 | en_US |
dc.identifier.volume | 14 | en_US |
dc.identifier.issue | 1 | en_US |
dc.identifier.doi | 10.1137/20M1335601 | en_US |
dcterms.abstract | Euler's elastica model has been widely used in image processing. Since it is a challenging nonconvex and nonsmooth optimization model, most existing algorithms do not have convergence theory for it. In this paper, we propose a penalty relaxation algorithm with mathematical guarantee to find a stationary point of Euler's elastica model. To deal with the nonsmoothness of Euler's elastica model, we first introduce a smoothing relaxation problem, and then propose an exact penalty method to solve it. We establish the relationships between Euler's elastica model, the smoothing relaxation problem, and the penalty problem in theory regarding optimal solutions and stationary points. Moreover, we propose an efficient block coordinate descent algorithm to solve the penalty problem by taking advantage of convexity of its subproblems. We prove global convergence of the algorithm to a stationary point of the penalty problem. Finally we apply the proposed algorithm to denoise the optical coherence tomography images with real data from an optometry clinic and show the efficiency of the method for image processing using Euler's elastica model. | en_US |
dcterms.accessRights | open access | en_US |
dcterms.bibliographicCitation | SIAM journal on imaging sciences, 2021, v. 14, no. 1, p. 389-417 | en_US |
dcterms.isPartOf | SIAM journal on imaging sciences | en_US |
dcterms.issued | 2021 | - |
dc.identifier.eissn | 1936-4954 | en_US |
dc.description.validate | 202208 bcfc | en_US |
dc.description.oa | Version of Record | en_US |
dc.identifier.FolderNumber | AMA-0063 | - |
dc.description.fundingSource | RGC | en_US |
dc.description.pubStatus | Published | en_US |
dc.identifier.OPUS | 54857013 | - |
Appears in Collections: | Journal/Magazine Article |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
20m1335601.pdf | 15.58 MB | Adobe PDF | View/Open |
Page views
51
Last Week
1
1
Last month
Citations as of May 12, 2024
Downloads
74
Citations as of May 12, 2024
SCOPUSTM
Citations
5
Citations as of May 17, 2024
WEB OF SCIENCETM
Citations
3
Citations as of May 16, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.