Convex Object(s) Characterization and Segmentation Using Level Set Function

In practice, the objects of interest have some shape priors, which would be destroyed by occlusions, distortions and noises. Therefore, the characterization of the shape priors attracts increasing attention. This paper is devoted to characterization of convexity prior and its applications in objects...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of mathematical imaging and vision 2022, Vol.64 (1), p.68-88
Hauptverfasser: Luo, Shousheng, Tai, Xue-Cheng, Glowinski, Roland
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 88
container_issue 1
container_start_page 68
container_title Journal of mathematical imaging and vision
container_volume 64
creator Luo, Shousheng
Tai, Xue-Cheng
Glowinski, Roland
description In practice, the objects of interest have some shape priors, which would be destroyed by occlusions, distortions and noises. Therefore, the characterization of the shape priors attracts increasing attention. This paper is devoted to characterization of convexity prior and its applications in objects segmentation in two-dimensional (2D) spaces using level set function. The shape convexity can be characterized by the Laplacian nonnegativity of the associated signed distance function on the whole image domain, zero-sublevel set and zero-superlevel set. This result is extended to characterization for multiple convex objects and ring shape object with outer, inner and both convex boundaries. One of the advantages of this method is that only one signed distance function is needed to characterize a single object, multiple objects and ring shape with boundary(ies) convexity prior. The characterization methods are incorporated into image segmentation model. In addition, some labels on the foreground and background and landmarks on the boundary of the object(s) can be taken into account as constraints to improve the accuracy of segmentation. A general and efficient numerical framework is developed to solve the proposed models using alternative direction method. Experiments on various images validated the effectiveness and efficiency of the proposed models and algorithms.
doi_str_mv 10.1007/s10851-021-01056-w
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2622611337</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2622611337</sourcerecordid><originalsourceid>FETCH-LOGICAL-c319t-ff6ddb390b4a61580bc5ee9a3f1a8de543b4a1133e33dde5c0e4d37ae794bc503</originalsourceid><addsrcrecordid>eNp9kDFPwzAQhS0EEqXwB5giscBgONtJHI8oooCo1AE6W05yKalap9guBX49LkFiYzid7t737qRHyDmDawYgbzyDImMUeCwGWU53B2TEMimozAtxSEageEqVAnlMTrxfAkDBmRyRp7K37_iRzKol1uHSXyXlq3GmDui6LxO63ibGNskzLtZow7CY-84ukim-4yoKIZlsbb0XTslRa1Yez377mMwndy_lA53O7h_L2ymtBVOBtm3eNJVQUKUmZ1kBVZ0hKiNaZooGs1REgTEhUIgmzjVg2ghpUKo0oiDG5GK4u3H92xZ90Mt-62x8qXnOeb73ykjxgapd773DVm9ctzbuUzPQ-9D0EJqOoemf0PQumsRg8hG2C3R_p_9xfQPyhnAh</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2622611337</pqid></control><display><type>article</type><title>Convex Object(s) Characterization and Segmentation Using Level Set Function</title><source>SpringerLink Journals</source><creator>Luo, Shousheng ; Tai, Xue-Cheng ; Glowinski, Roland</creator><creatorcontrib>Luo, Shousheng ; Tai, Xue-Cheng ; Glowinski, Roland</creatorcontrib><description>In practice, the objects of interest have some shape priors, which would be destroyed by occlusions, distortions and noises. Therefore, the characterization of the shape priors attracts increasing attention. This paper is devoted to characterization of convexity prior and its applications in objects segmentation in two-dimensional (2D) spaces using level set function. The shape convexity can be characterized by the Laplacian nonnegativity of the associated signed distance function on the whole image domain, zero-sublevel set and zero-superlevel set. This result is extended to characterization for multiple convex objects and ring shape object with outer, inner and both convex boundaries. One of the advantages of this method is that only one signed distance function is needed to characterize a single object, multiple objects and ring shape with boundary(ies) convexity prior. The characterization methods are incorporated into image segmentation model. In addition, some labels on the foreground and background and landmarks on the boundary of the object(s) can be taken into account as constraints to improve the accuracy of segmentation. A general and efficient numerical framework is developed to solve the proposed models using alternative direction method. Experiments on various images validated the effectiveness and efficiency of the proposed models and algorithms.</description><identifier>ISSN: 0924-9907</identifier><identifier>EISSN: 1573-7683</identifier><identifier>DOI: 10.1007/s10851-021-01056-w</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Algorithms ; Applications of Mathematics ; Computer Science ; Convexity ; Image Processing and Computer Vision ; Image segmentation ; Mathematical Methods in Physics ; Signal,Image and Speech Processing</subject><ispartof>Journal of mathematical imaging and vision, 2022, Vol.64 (1), p.68-88</ispartof><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</rights><rights>The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c319t-ff6ddb390b4a61580bc5ee9a3f1a8de543b4a1133e33dde5c0e4d37ae794bc503</citedby><cites>FETCH-LOGICAL-c319t-ff6ddb390b4a61580bc5ee9a3f1a8de543b4a1133e33dde5c0e4d37ae794bc503</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10851-021-01056-w$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10851-021-01056-w$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Luo, Shousheng</creatorcontrib><creatorcontrib>Tai, Xue-Cheng</creatorcontrib><creatorcontrib>Glowinski, Roland</creatorcontrib><title>Convex Object(s) Characterization and Segmentation Using Level Set Function</title><title>Journal of mathematical imaging and vision</title><addtitle>J Math Imaging Vis</addtitle><description>In practice, the objects of interest have some shape priors, which would be destroyed by occlusions, distortions and noises. Therefore, the characterization of the shape priors attracts increasing attention. This paper is devoted to characterization of convexity prior and its applications in objects segmentation in two-dimensional (2D) spaces using level set function. The shape convexity can be characterized by the Laplacian nonnegativity of the associated signed distance function on the whole image domain, zero-sublevel set and zero-superlevel set. This result is extended to characterization for multiple convex objects and ring shape object with outer, inner and both convex boundaries. One of the advantages of this method is that only one signed distance function is needed to characterize a single object, multiple objects and ring shape with boundary(ies) convexity prior. The characterization methods are incorporated into image segmentation model. In addition, some labels on the foreground and background and landmarks on the boundary of the object(s) can be taken into account as constraints to improve the accuracy of segmentation. A general and efficient numerical framework is developed to solve the proposed models using alternative direction method. Experiments on various images validated the effectiveness and efficiency of the proposed models and algorithms.</description><subject>Algorithms</subject><subject>Applications of Mathematics</subject><subject>Computer Science</subject><subject>Convexity</subject><subject>Image Processing and Computer Vision</subject><subject>Image segmentation</subject><subject>Mathematical Methods in Physics</subject><subject>Signal,Image and Speech Processing</subject><issn>0924-9907</issn><issn>1573-7683</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNp9kDFPwzAQhS0EEqXwB5giscBgONtJHI8oooCo1AE6W05yKalap9guBX49LkFiYzid7t737qRHyDmDawYgbzyDImMUeCwGWU53B2TEMimozAtxSEageEqVAnlMTrxfAkDBmRyRp7K37_iRzKol1uHSXyXlq3GmDui6LxO63ibGNskzLtZow7CY-84ukim-4yoKIZlsbb0XTslRa1Yez377mMwndy_lA53O7h_L2ymtBVOBtm3eNJVQUKUmZ1kBVZ0hKiNaZooGs1REgTEhUIgmzjVg2ghpUKo0oiDG5GK4u3H92xZ90Mt-62x8qXnOeb73ykjxgapd773DVm9ctzbuUzPQ-9D0EJqOoemf0PQumsRg8hG2C3R_p_9xfQPyhnAh</recordid><startdate>2022</startdate><enddate>2022</enddate><creator>Luo, Shousheng</creator><creator>Tai, Xue-Cheng</creator><creator>Glowinski, Roland</creator><general>Springer US</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>2022</creationdate><title>Convex Object(s) Characterization and Segmentation Using Level Set Function</title><author>Luo, Shousheng ; Tai, Xue-Cheng ; Glowinski, Roland</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c319t-ff6ddb390b4a61580bc5ee9a3f1a8de543b4a1133e33dde5c0e4d37ae794bc503</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Algorithms</topic><topic>Applications of Mathematics</topic><topic>Computer Science</topic><topic>Convexity</topic><topic>Image Processing and Computer Vision</topic><topic>Image segmentation</topic><topic>Mathematical Methods in Physics</topic><topic>Signal,Image and Speech Processing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Luo, Shousheng</creatorcontrib><creatorcontrib>Tai, Xue-Cheng</creatorcontrib><creatorcontrib>Glowinski, Roland</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of mathematical imaging and vision</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Luo, Shousheng</au><au>Tai, Xue-Cheng</au><au>Glowinski, Roland</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Convex Object(s) Characterization and Segmentation Using Level Set Function</atitle><jtitle>Journal of mathematical imaging and vision</jtitle><stitle>J Math Imaging Vis</stitle><date>2022</date><risdate>2022</risdate><volume>64</volume><issue>1</issue><spage>68</spage><epage>88</epage><pages>68-88</pages><issn>0924-9907</issn><eissn>1573-7683</eissn><abstract>In practice, the objects of interest have some shape priors, which would be destroyed by occlusions, distortions and noises. Therefore, the characterization of the shape priors attracts increasing attention. This paper is devoted to characterization of convexity prior and its applications in objects segmentation in two-dimensional (2D) spaces using level set function. The shape convexity can be characterized by the Laplacian nonnegativity of the associated signed distance function on the whole image domain, zero-sublevel set and zero-superlevel set. This result is extended to characterization for multiple convex objects and ring shape object with outer, inner and both convex boundaries. One of the advantages of this method is that only one signed distance function is needed to characterize a single object, multiple objects and ring shape with boundary(ies) convexity prior. The characterization methods are incorporated into image segmentation model. In addition, some labels on the foreground and background and landmarks on the boundary of the object(s) can be taken into account as constraints to improve the accuracy of segmentation. A general and efficient numerical framework is developed to solve the proposed models using alternative direction method. Experiments on various images validated the effectiveness and efficiency of the proposed models and algorithms.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10851-021-01056-w</doi><tpages>21</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0924-9907
ispartof Journal of mathematical imaging and vision, 2022, Vol.64 (1), p.68-88
issn 0924-9907
1573-7683
language eng
recordid cdi_proquest_journals_2622611337
source SpringerLink Journals
subjects Algorithms
Applications of Mathematics
Computer Science
Convexity
Image Processing and Computer Vision
Image segmentation
Mathematical Methods in Physics
Signal,Image and Speech Processing
title Convex Object(s) Characterization and Segmentation Using Level Set Function
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-13T02%3A09%3A51IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Convex%20Object(s)%20Characterization%20and%20Segmentation%20Using%20Level%20Set%20Function&rft.jtitle=Journal%20of%20mathematical%20imaging%20and%20vision&rft.au=Luo,%20Shousheng&rft.date=2022&rft.volume=64&rft.issue=1&rft.spage=68&rft.epage=88&rft.pages=68-88&rft.issn=0924-9907&rft.eissn=1573-7683&rft_id=info:doi/10.1007/s10851-021-01056-w&rft_dat=%3Cproquest_cross%3E2622611337%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2622611337&rft_id=info:pmid/&rfr_iscdi=true