2D Euclidean distance transform algorithms: A comparative survey
The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this wo...
Gespeichert in:
| Veröffentlicht in: | ACM computing surveys 2008-02, Vol.40 (1), p.2 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | 1 |
| container_start_page | 2 |
| container_title | ACM computing surveys |
| container_volume | 40 |
| creator | Fabbri, Ricardo Costa, Luciano Da F Torelli, Julio C Bruno, Odemir M |
| description | The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness. Six of the best algorithms were fully implemented and compared in practice. [PUBLICATION ABSTRACT] |
| format | Article |
| fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_195184206</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1455036761</sourcerecordid><originalsourceid>FETCH-proquest_journals_1951842063</originalsourceid><addsrcrecordid>eNqNyksKwjAUQNEgCtbPHh7OCy9NP-pI8YMLcF5Cm2pKm9S8pODudeACHN3BuRMW8Swr4kKkfMoiFDnGKBDnbEHUImKS8jxih-QMl1B1ulbSQK3JS1Mp8E4aaqzrQXYP67R_9rSHI1S2H6STXo8KKLhRvVds1siO1PrXJdtcL_fTLR6cfQVFvmxtcOZLJd9lfJsmmIu_pg-cPTna</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>195184206</pqid></control><display><type>article</type><title>2D Euclidean distance transform algorithms: A comparative survey</title><source>ACM Digital Library Complete</source><creator>Fabbri, Ricardo ; Costa, Luciano Da F ; Torelli, Julio C ; Bruno, Odemir M</creator><creatorcontrib>Fabbri, Ricardo ; Costa, Luciano Da F ; Torelli, Julio C ; Bruno, Odemir M</creatorcontrib><description>The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness. Six of the best algorithms were fully implemented and compared in practice. [PUBLICATION ABSTRACT]</description><identifier>ISSN: 0360-0300</identifier><identifier>EISSN: 1557-7341</identifier><language>eng</language><publisher>Baltimore: Association for Computing Machinery</publisher><subject>Algorithms ; Comparative studies ; Computer graphics ; Digital imaging ; Euclidean space</subject><ispartof>ACM computing surveys, 2008-02, Vol.40 (1), p.2</ispartof><rights>Copyright Association for Computing Machinery Feb 2008</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780</link.rule.ids></links><search><creatorcontrib>Fabbri, Ricardo</creatorcontrib><creatorcontrib>Costa, Luciano Da F</creatorcontrib><creatorcontrib>Torelli, Julio C</creatorcontrib><creatorcontrib>Bruno, Odemir M</creatorcontrib><title>2D Euclidean distance transform algorithms: A comparative survey</title><title>ACM computing surveys</title><description>The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness. Six of the best algorithms were fully implemented and compared in practice. [PUBLICATION ABSTRACT]</description><subject>Algorithms</subject><subject>Comparative studies</subject><subject>Computer graphics</subject><subject>Digital imaging</subject><subject>Euclidean space</subject><issn>0360-0300</issn><issn>1557-7341</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2008</creationdate><recordtype>article</recordtype><recordid>eNqNyksKwjAUQNEgCtbPHh7OCy9NP-pI8YMLcF5Cm2pKm9S8pODudeACHN3BuRMW8Swr4kKkfMoiFDnGKBDnbEHUImKS8jxih-QMl1B1ulbSQK3JS1Mp8E4aaqzrQXYP67R_9rSHI1S2H6STXo8KKLhRvVds1siO1PrXJdtcL_fTLR6cfQVFvmxtcOZLJd9lfJsmmIu_pg-cPTna</recordid><startdate>20080201</startdate><enddate>20080201</enddate><creator>Fabbri, Ricardo</creator><creator>Costa, Luciano Da F</creator><creator>Torelli, Julio C</creator><creator>Bruno, Odemir M</creator><general>Association for Computing Machinery</general><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20080201</creationdate><title>2D Euclidean distance transform algorithms: A comparative survey</title><author>Fabbri, Ricardo ; Costa, Luciano Da F ; Torelli, Julio C ; Bruno, Odemir M</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_1951842063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Algorithms</topic><topic>Comparative studies</topic><topic>Computer graphics</topic><topic>Digital imaging</topic><topic>Euclidean space</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fabbri, Ricardo</creatorcontrib><creatorcontrib>Costa, Luciano Da F</creatorcontrib><creatorcontrib>Torelli, Julio C</creatorcontrib><creatorcontrib>Bruno, Odemir M</creatorcontrib><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>ACM computing surveys</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fabbri, Ricardo</au><au>Costa, Luciano Da F</au><au>Torelli, Julio C</au><au>Bruno, Odemir M</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>2D Euclidean distance transform algorithms: A comparative survey</atitle><jtitle>ACM computing surveys</jtitle><date>2008-02-01</date><risdate>2008</risdate><volume>40</volume><issue>1</issue><spage>2</spage><pages>2-</pages><issn>0360-0300</issn><eissn>1557-7341</eissn><abstract>The distance transform (DT) is a general operator forming the basis of many methods in computer vision and geometry, with great potential for practical applications. However, all the optimal algorithms for the computation of the exact Euclidean DT (EDT) were proposed only since the 1990s. In this work, state-of-the-art sequential 2D EDT algorithms are reviewed and compared, in an effort to reach more solid conclusions regarding their differences in speed and their exactness. Six of the best algorithms were fully implemented and compared in practice. [PUBLICATION ABSTRACT]</abstract><cop>Baltimore</cop><pub>Association for Computing Machinery</pub></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0360-0300 |
| ispartof | ACM computing surveys, 2008-02, Vol.40 (1), p.2 |
| issn | 0360-0300 1557-7341 |
| language | eng |
| recordid | cdi_proquest_journals_195184206 |
| source | ACM Digital Library Complete |
| subjects | Algorithms Comparative studies Computer graphics Digital imaging Euclidean space |
| title | 2D Euclidean distance transform algorithms: A comparative survey |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-09T21%3A53%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=2D%20Euclidean%20distance%20transform%20algorithms:%20A%20comparative%20survey&rft.jtitle=ACM%20computing%20surveys&rft.au=Fabbri,%20Ricardo&rft.date=2008-02-01&rft.volume=40&rft.issue=1&rft.spage=2&rft.pages=2-&rft.issn=0360-0300&rft.eissn=1557-7341&rft_id=info:doi/&rft_dat=%3Cproquest%3E1455036761%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=195184206&rft_id=info:pmid/&rfr_iscdi=true |