There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 248 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 232 | - |
dc.citation.title | APPLICABLE ANALYSIS | - |
dc.citation.volume | 99 | - |
dc.contributor.author | Kim, Yunho | - |
dc.date.accessioned | 2023-12-21T18:12:16Z | - |
dc.date.available | 2023-12-21T18:12:16Z | - |
dc.date.created | 2018-11-16 | - |
dc.date.issued | 2020-01 | - |
dc.description.abstract | One important task in image segmentation is to find a region of interest, which is, in general, a solution of a nonlinear and nonconvex problem. The authors of Chan and Esedoglu (Aspects of total variation regularized (Formula presented.) function approximation. SIAM J. Appl. Math. 2005;65:1817-1837) proposed a convex (Formula presented.) problem for finding such a region Σ and proved that when a binary input f is given, a solution (Formula presented.) to the convex problem gives rise to other solutions (Formula presented.) for a.e. (Formula presented.) from which they raised a question of whether or not (Formula presented.) must be binary. The same is to ask if the two-phase Mumford-Shah model in image processing has a unique solution with a binary input. In this paper, we will discuss how to construct a non-binary solution that provides a negative answer to the question through a connection of two ideas, one from the two-phase Mumford-Shah model in image segmentation and the other from mean curvature motions discussed in some geometric problems (e.g. Alter, Caselles, Chambolle. A characterization of convex calibrable sets in (Formula presented.). Math. Ann. 2005;322:329-366; Chambolle. An algorithm for mean curvature motion. Interfaces Free Boundaries 2004;6:195-218) revealing the nature of non-uniqueness in image segmentation. | - |
dc.identifier.bibliographicCitation | APPLICABLE ANALYSIS, v.99, no.2, pp.232 - 248 | - |
dc.identifier.doi | 10.1080/00036811.2018.1489962 | - |
dc.identifier.issn | 0003-6811 | - |
dc.identifier.scopusid | 2-s2.0-85049848341 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/25301 | - |
dc.identifier.url | https://www.tandfonline.com/doi/full/10.1080/00036811.2018.1489962 | - |
dc.identifier.wosid | 000505237000003 | - |
dc.language | 영어 | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.title | Non-unique solutions for a convex TV - L-1 problem in image segmentation | - |
dc.type | Article | - |
dc.description.isOpenAccess | FALSE | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | Convex optimization | - |
dc.subject.keywordAuthor | image segmentation | - |
dc.subject.keywordAuthor | mean curvature motion | - |
dc.subject.keywordPlus | TOTAL VARIATION MINIMIZATION | - |
dc.subject.keywordPlus | CALIBRABLE SETS | - |
dc.subject.keywordPlus | ACTIVE CONTOURS | - |
dc.subject.keywordPlus | ALGORITHM | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.