File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.3233/JIFS-182759
- Scopus: eid_2-s2.0-85099018606
- WOS: WOS:000606807200005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Iterated shape-bias graph cut with application to ellipse segmentation
Title | Iterated shape-bias graph cut with application to ellipse segmentation |
---|---|
Authors | |
Keywords | Elliptical pattern Shape Graph cut |
Issue Date | 2021 |
Citation | Journal of Intelligent and Fuzzy Systems, 2021, v. 40, n. 1, p. 53-63 How to Cite? |
Abstract | © 2021 - IOS Press. All rights reserved. We present a novel graph cut method for iterated segmentation of objects with specific shape bias (SBGC). In contrast with conventional graph cut models which emphasize the regional appearance only, the proposed SBGC takes the shape preference of the interested object into account to drive the segmentation. Therefore, the SBGC can ensure a more accurate convergence to the interested object even in complicated conditions where the appearance cues are inadequate for object/background discrimination. In particular, we firstly evaluate the segmentation by simultaneously considering its global shape and local edge consistencies with the object shape priors. Then these two cues are formulated into a graph cut framework to seek the optimal segmentation that maximizing both of the global and local measurements. By iteratively implementing the optimization, the proposed SBGC can achieve joint estimation of the optimal segmentation and the most likely object shape encoded by the shape priors, and eventually converge to the candidate result with maximum consistency between these two estimations. Finally, we take the ellipse shape objects with various segmentation challenges as examples for evaluation. Competitive results compared with state-of-the-art methods validate the effectiveness of the technique. |
Persistent Identifier | http://hdl.handle.net/10722/296014 |
ISSN | 2023 Impact Factor: 1.7 2023 SCImago Journal Rankings: 0.378 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sun, Xin | - |
dc.contributor.author | Li, Dong | - |
dc.contributor.author | Wang, Wei | - |
dc.contributor.author | Yao, Hongxun | - |
dc.contributor.author | Xu, Dongliang | - |
dc.contributor.author | Du, Zhanwei | - |
dc.contributor.author | Sun, Mingui | - |
dc.date.accessioned | 2021-02-11T04:52:39Z | - |
dc.date.available | 2021-02-11T04:52:39Z | - |
dc.date.issued | 2021 | - |
dc.identifier.citation | Journal of Intelligent and Fuzzy Systems, 2021, v. 40, n. 1, p. 53-63 | - |
dc.identifier.issn | 1064-1246 | - |
dc.identifier.uri | http://hdl.handle.net/10722/296014 | - |
dc.description.abstract | © 2021 - IOS Press. All rights reserved. We present a novel graph cut method for iterated segmentation of objects with specific shape bias (SBGC). In contrast with conventional graph cut models which emphasize the regional appearance only, the proposed SBGC takes the shape preference of the interested object into account to drive the segmentation. Therefore, the SBGC can ensure a more accurate convergence to the interested object even in complicated conditions where the appearance cues are inadequate for object/background discrimination. In particular, we firstly evaluate the segmentation by simultaneously considering its global shape and local edge consistencies with the object shape priors. Then these two cues are formulated into a graph cut framework to seek the optimal segmentation that maximizing both of the global and local measurements. By iteratively implementing the optimization, the proposed SBGC can achieve joint estimation of the optimal segmentation and the most likely object shape encoded by the shape priors, and eventually converge to the candidate result with maximum consistency between these two estimations. Finally, we take the ellipse shape objects with various segmentation challenges as examples for evaluation. Competitive results compared with state-of-the-art methods validate the effectiveness of the technique. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Intelligent and Fuzzy Systems | - |
dc.subject | Elliptical pattern | - |
dc.subject | Shape | - |
dc.subject | Graph cut | - |
dc.title | Iterated shape-bias graph cut with application to ellipse segmentation | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.3233/JIFS-182759 | - |
dc.identifier.scopus | eid_2-s2.0-85099018606 | - |
dc.identifier.volume | 40 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 53 | - |
dc.identifier.epage | 63 | - |
dc.identifier.eissn | 1875-8967 | - |
dc.identifier.isi | WOS:000606807200005 | - |
dc.identifier.issnl | 1064-1246 | - |