The computation of polygonal approximations for 2D contours based on a concavity tree
•A proposal to improve methods to obtain polygonal approximations is proposed.•The required levels of detail are achieved using the concavity tree.•The local Measurement ISE/CR is used as stop condition.•The proposed algorithm improves the methods tested. In this work, a new proposal to improve some...
Gespeichert in:
| Veröffentlicht in: | Journal of visual communication and image representation 2014-11, Vol.25 (8), p.1905-1917 |
|---|---|
| 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 | 1917 |
|---|---|
| container_issue | 8 |
| container_start_page | 1905 |
| container_title | Journal of visual communication and image representation |
| container_volume | 25 |
| creator | Aguilera-Aguilera, E.J. Carmona-Poyato, A. Madrid-Cuevas, F.J. Medina-Carnicer, R. |
| description | •A proposal to improve methods to obtain polygonal approximations is proposed.•The required levels of detail are achieved using the concavity tree.•The local Measurement ISE/CR is used as stop condition.•The proposed algorithm improves the methods tested.
In this work, a new proposal to improve some methods based on the merge approach to obtain polygonal approximations in 2D contours is presented. These methods use a set of candidate dominant points (CDPs) to obtain a polygonal approximation. Then, redundant candidate dominant points of the set of CDPs are deleted, and the remaining dominant points will be the polygonal approximation of the original contour. The main drawback of most of these methods is that they use all breakpoints as CDPs and most of these breakpoints depict only the noise of the original contour.
Our proposal, based on a concavity tree, obtains a more reduced and significant set of CDPs. When this proposal is used by some methods based on the merge approach (the Masood methods and the Carmona method), their computation times are reduced. The experimental results show that the new proposal is efficient and improves the tested methods. |
| doi_str_mv | 10.1016/j.jvcir.2014.09.012 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1651437069</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1047320314001588</els_id><sourcerecordid>1651437069</sourcerecordid><originalsourceid>FETCH-LOGICAL-c432t-1e70097ead18766ed2a24f18483952916548baafb3eccc727b2dde3f4bca73963</originalsourceid><addsrcrecordid>eNp9kMlOwzAQhiMEEqXwBFx8QeKSMF4a1wcOiF2qxKU9W44zAVdpHOy0om-Pu4gjpxnNfP8sf5ZdUygo0PJuWSw31oWCARUFqAIoO8lGFNQkVyDL010uZM4Z8PPsIsYlAHDFxShbzL-QWL_q14MZnO-Ib0jv2-2n70xLTN8H_-NW-1YkjQ-EPSW8G_w6RFKZiDVJIrOrWbNxw5YMAfEyO2tMG_HqGMfZ4uV5_viWzz5e3x8fZrkVnA05RQmgJJqaTmVZYs0MEw2diilXE6ZoORHTypim4mitlUxWrK6RN6KyRnJV8nF2e5ibzvxeYxz0ykWLbWs69Ouo0wQquIRSJZQfUBt8jAEb3Yf0WNhqCnpnol7qvYl6Z6IGpZOJSXVzXGCiNW0TTGdd_JMyBVyWlCfu_sBh-nbjMOhoHXYWaxfQDrr27t89v5n_iWk</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1651437069</pqid></control><display><type>article</type><title>The computation of polygonal approximations for 2D contours based on a concavity tree</title><source>Access via ScienceDirect (Elsevier)</source><creator>Aguilera-Aguilera, E.J. ; Carmona-Poyato, A. ; Madrid-Cuevas, F.J. ; Medina-Carnicer, R.</creator><creatorcontrib>Aguilera-Aguilera, E.J. ; Carmona-Poyato, A. ; Madrid-Cuevas, F.J. ; Medina-Carnicer, R.</creatorcontrib><description>•A proposal to improve methods to obtain polygonal approximations is proposed.•The required levels of detail are achieved using the concavity tree.•The local Measurement ISE/CR is used as stop condition.•The proposed algorithm improves the methods tested.
In this work, a new proposal to improve some methods based on the merge approach to obtain polygonal approximations in 2D contours is presented. These methods use a set of candidate dominant points (CDPs) to obtain a polygonal approximation. Then, redundant candidate dominant points of the set of CDPs are deleted, and the remaining dominant points will be the polygonal approximation of the original contour. The main drawback of most of these methods is that they use all breakpoints as CDPs and most of these breakpoints depict only the noise of the original contour.
Our proposal, based on a concavity tree, obtains a more reduced and significant set of CDPs. When this proposal is used by some methods based on the merge approach (the Masood methods and the Carmona method), their computation times are reduced. The experimental results show that the new proposal is efficient and improves the tested methods.</description><identifier>ISSN: 1047-3203</identifier><identifier>EISSN: 1095-9076</identifier><identifier>DOI: 10.1016/j.jvcir.2014.09.012</identifier><language>eng</language><publisher>Amsterdam: Elsevier Inc</publisher><subject>Applied sciences ; Approximation ; Artificial intelligence ; Breakpoints ; Computation ; Computer science; control theory; systems ; Concavity ; Concavity tree ; Contours ; Convex hull ; Digital planar curves ; Dominant points ; Exact sciences and technology ; Mathematics ; Merge methods ; Numerical analysis ; Numerical analysis. Scientific computation ; Numerical approximation ; Pattern recognition. Digital image processing. Computational geometry ; Polygonal approximation ; Proposals ; Sciences and techniques of general use ; Split methods ; Trees ; Two dimensional ; Visual</subject><ispartof>Journal of visual communication and image representation, 2014-11, Vol.25 (8), p.1905-1917</ispartof><rights>2014 Elsevier Inc.</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c432t-1e70097ead18766ed2a24f18483952916548baafb3eccc727b2dde3f4bca73963</citedby><cites>FETCH-LOGICAL-c432t-1e70097ead18766ed2a24f18483952916548baafb3eccc727b2dde3f4bca73963</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.jvcir.2014.09.012$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>315,781,785,3551,27926,27927,45997</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=29037613$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Aguilera-Aguilera, E.J.</creatorcontrib><creatorcontrib>Carmona-Poyato, A.</creatorcontrib><creatorcontrib>Madrid-Cuevas, F.J.</creatorcontrib><creatorcontrib>Medina-Carnicer, R.</creatorcontrib><title>The computation of polygonal approximations for 2D contours based on a concavity tree</title><title>Journal of visual communication and image representation</title><description>•A proposal to improve methods to obtain polygonal approximations is proposed.•The required levels of detail are achieved using the concavity tree.•The local Measurement ISE/CR is used as stop condition.•The proposed algorithm improves the methods tested.
In this work, a new proposal to improve some methods based on the merge approach to obtain polygonal approximations in 2D contours is presented. These methods use a set of candidate dominant points (CDPs) to obtain a polygonal approximation. Then, redundant candidate dominant points of the set of CDPs are deleted, and the remaining dominant points will be the polygonal approximation of the original contour. The main drawback of most of these methods is that they use all breakpoints as CDPs and most of these breakpoints depict only the noise of the original contour.
Our proposal, based on a concavity tree, obtains a more reduced and significant set of CDPs. When this proposal is used by some methods based on the merge approach (the Masood methods and the Carmona method), their computation times are reduced. The experimental results show that the new proposal is efficient and improves the tested methods.</description><subject>Applied sciences</subject><subject>Approximation</subject><subject>Artificial intelligence</subject><subject>Breakpoints</subject><subject>Computation</subject><subject>Computer science; control theory; systems</subject><subject>Concavity</subject><subject>Concavity tree</subject><subject>Contours</subject><subject>Convex hull</subject><subject>Digital planar curves</subject><subject>Dominant points</subject><subject>Exact sciences and technology</subject><subject>Mathematics</subject><subject>Merge methods</subject><subject>Numerical analysis</subject><subject>Numerical analysis. Scientific computation</subject><subject>Numerical approximation</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Polygonal approximation</subject><subject>Proposals</subject><subject>Sciences and techniques of general use</subject><subject>Split methods</subject><subject>Trees</subject><subject>Two dimensional</subject><subject>Visual</subject><issn>1047-3203</issn><issn>1095-9076</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><recordid>eNp9kMlOwzAQhiMEEqXwBFx8QeKSMF4a1wcOiF2qxKU9W44zAVdpHOy0om-Pu4gjpxnNfP8sf5ZdUygo0PJuWSw31oWCARUFqAIoO8lGFNQkVyDL010uZM4Z8PPsIsYlAHDFxShbzL-QWL_q14MZnO-Ib0jv2-2n70xLTN8H_-NW-1YkjQ-EPSW8G_w6RFKZiDVJIrOrWbNxw5YMAfEyO2tMG_HqGMfZ4uV5_viWzz5e3x8fZrkVnA05RQmgJJqaTmVZYs0MEw2diilXE6ZoORHTypim4mitlUxWrK6RN6KyRnJV8nF2e5ibzvxeYxz0ykWLbWs69Ouo0wQquIRSJZQfUBt8jAEb3Yf0WNhqCnpnol7qvYl6Z6IGpZOJSXVzXGCiNW0TTGdd_JMyBVyWlCfu_sBh-nbjMOhoHXYWaxfQDrr27t89v5n_iWk</recordid><startdate>20141101</startdate><enddate>20141101</enddate><creator>Aguilera-Aguilera, E.J.</creator><creator>Carmona-Poyato, A.</creator><creator>Madrid-Cuevas, F.J.</creator><creator>Medina-Carnicer, R.</creator><general>Elsevier Inc</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7SP</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20141101</creationdate><title>The computation of polygonal approximations for 2D contours based on a concavity tree</title><author>Aguilera-Aguilera, E.J. ; Carmona-Poyato, A. ; Madrid-Cuevas, F.J. ; Medina-Carnicer, R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c432t-1e70097ead18766ed2a24f18483952916548baafb3eccc727b2dde3f4bca73963</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Applied sciences</topic><topic>Approximation</topic><topic>Artificial intelligence</topic><topic>Breakpoints</topic><topic>Computation</topic><topic>Computer science; control theory; systems</topic><topic>Concavity</topic><topic>Concavity tree</topic><topic>Contours</topic><topic>Convex hull</topic><topic>Digital planar curves</topic><topic>Dominant points</topic><topic>Exact sciences and technology</topic><topic>Mathematics</topic><topic>Merge methods</topic><topic>Numerical analysis</topic><topic>Numerical analysis. Scientific computation</topic><topic>Numerical approximation</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Polygonal approximation</topic><topic>Proposals</topic><topic>Sciences and techniques of general use</topic><topic>Split methods</topic><topic>Trees</topic><topic>Two dimensional</topic><topic>Visual</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Aguilera-Aguilera, E.J.</creatorcontrib><creatorcontrib>Carmona-Poyato, A.</creatorcontrib><creatorcontrib>Madrid-Cuevas, F.J.</creatorcontrib><creatorcontrib>Medina-Carnicer, R.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Electronics & Communications 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>Journal of visual communication and image representation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Aguilera-Aguilera, E.J.</au><au>Carmona-Poyato, A.</au><au>Madrid-Cuevas, F.J.</au><au>Medina-Carnicer, R.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The computation of polygonal approximations for 2D contours based on a concavity tree</atitle><jtitle>Journal of visual communication and image representation</jtitle><date>2014-11-01</date><risdate>2014</risdate><volume>25</volume><issue>8</issue><spage>1905</spage><epage>1917</epage><pages>1905-1917</pages><issn>1047-3203</issn><eissn>1095-9076</eissn><abstract>•A proposal to improve methods to obtain polygonal approximations is proposed.•The required levels of detail are achieved using the concavity tree.•The local Measurement ISE/CR is used as stop condition.•The proposed algorithm improves the methods tested.
In this work, a new proposal to improve some methods based on the merge approach to obtain polygonal approximations in 2D contours is presented. These methods use a set of candidate dominant points (CDPs) to obtain a polygonal approximation. Then, redundant candidate dominant points of the set of CDPs are deleted, and the remaining dominant points will be the polygonal approximation of the original contour. The main drawback of most of these methods is that they use all breakpoints as CDPs and most of these breakpoints depict only the noise of the original contour.
Our proposal, based on a concavity tree, obtains a more reduced and significant set of CDPs. When this proposal is used by some methods based on the merge approach (the Masood methods and the Carmona method), their computation times are reduced. The experimental results show that the new proposal is efficient and improves the tested methods.</abstract><cop>Amsterdam</cop><pub>Elsevier Inc</pub><doi>10.1016/j.jvcir.2014.09.012</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1047-3203 |
| ispartof | Journal of visual communication and image representation, 2014-11, Vol.25 (8), p.1905-1917 |
| issn | 1047-3203 1095-9076 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1651437069 |
| source | Access via ScienceDirect (Elsevier) |
| subjects | Applied sciences Approximation Artificial intelligence Breakpoints Computation Computer science control theory systems Concavity Concavity tree Contours Convex hull Digital planar curves Dominant points Exact sciences and technology Mathematics Merge methods Numerical analysis Numerical analysis. Scientific computation Numerical approximation Pattern recognition. Digital image processing. Computational geometry Polygonal approximation Proposals Sciences and techniques of general use Split methods Trees Two dimensional Visual |
| title | The computation of polygonal approximations for 2D contours based on a concavity tree |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-18T10%3A17%3A57IST&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=The%20computation%20of%20polygonal%20approximations%20for%202D%20contours%20based%20on%20a%20concavity%20tree&rft.jtitle=Journal%20of%20visual%20communication%20and%20image%20representation&rft.au=Aguilera-Aguilera,%20E.J.&rft.date=2014-11-01&rft.volume=25&rft.issue=8&rft.spage=1905&rft.epage=1917&rft.pages=1905-1917&rft.issn=1047-3203&rft.eissn=1095-9076&rft_id=info:doi/10.1016/j.jvcir.2014.09.012&rft_dat=%3Cproquest_cross%3E1651437069%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=1651437069&rft_id=info:pmid/&rft_els_id=S1047320314001588&rfr_iscdi=true |