Fast matching of large point sets under occlusions

The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be ‘globally rigid’. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a sin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Pattern recognition 2012, Vol.45 (1), p.563-569
Hauptverfasser: McAuley, Julian J., Caetano, Tibério S.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 569
container_issue 1
container_start_page 563
container_title Pattern recognition
container_volume 45
creator McAuley, Julian J.
Caetano, Tibério S.
description The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be ‘globally rigid’. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a single missing point may ‘break’ the rigidity of the graph in question. In addition, such models can efficiently handle point sets of only moderate size. In this paper, we propose a new graphical model that is not only adapted to handle occlusions but is much faster than previous approaches for solving the isometric point-pattern matching problem. We can match point-patterns with thousands of points in a few seconds. ► We introduce a new graphical model for near-isometric point-pattern matching. ► We extend methods based on global rigidity to handle occlusions. ► Previous models cannot handle occlusions, as they ‘break’ the rigidity results. ► Our method is faster and uses less memory than previous approaches. ► This allows our method to be run on much larger graphs than previous approaches.
doi_str_mv 10.1016/j.patcog.2011.05.008
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_926323006</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S003132031100207X</els_id><sourcerecordid>926323006</sourcerecordid><originalsourceid>FETCH-LOGICAL-c368t-3b0cbeef3e9413cbd735b0844f530d83f14dd56e15be1ef9b8fa1c413ce2bd383</originalsourceid><addsrcrecordid>eNp9kMFKxDAQhoMouK6-gYdexFPrpGna7kUQcVVY8KLnkCaTNUu3qZlW8O3t0sWjc5nDfP8M8zF2zSHjwMu7XdbrwYRtlgPnGcgMoD5hC15XIpW8yE_ZAkDwVOQgztkF0Q6AV9NgwfK1piHZT_FP322T4JJWxy0mffDdkBAOlIydxZgEY9qRfOjokp053RJeHfuSfayf3h9f0s3b8-vjwyY1oqyHVDRgGkQncFVwYRpbCdlAXRROCrC1cLywVpbIZYMc3aqpnebmgGLeWFGLJbud9_YxfI1Ig9p7Mti2usMwklrlpcgFQDmRxUyaGIgiOtVHv9fxR3FQB0Nqp2ZD6mBIgVSToSl2czygyejWRd0ZT3_ZvKikFFMt2f3M4fTtt8eoyHjsDFof0QzKBv__oV84n322</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>926323006</pqid></control><display><type>article</type><title>Fast matching of large point sets under occlusions</title><source>Elsevier ScienceDirect Journals</source><creator>McAuley, Julian J. ; Caetano, Tibério S.</creator><creatorcontrib>McAuley, Julian J. ; Caetano, Tibério S.</creatorcontrib><description>The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be ‘globally rigid’. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a single missing point may ‘break’ the rigidity of the graph in question. In addition, such models can efficiently handle point sets of only moderate size. In this paper, we propose a new graphical model that is not only adapted to handle occlusions but is much faster than previous approaches for solving the isometric point-pattern matching problem. We can match point-patterns with thousands of points in a few seconds. ► We introduce a new graphical model for near-isometric point-pattern matching. ► We extend methods based on global rigidity to handle occlusions. ► Previous models cannot handle occlusions, as they ‘break’ the rigidity results. ► Our method is faster and uses less memory than previous approaches. ► This allows our method to be run on much larger graphs than previous approaches.</description><identifier>ISSN: 0031-3203</identifier><identifier>EISSN: 1873-5142</identifier><identifier>DOI: 10.1016/j.patcog.2011.05.008</identifier><identifier>CODEN: PTNRA8</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Applied sciences ; Exact sciences and technology ; Exact solutions ; Global rigidity ; Graphical models ; Graphs ; Handles ; Information, signal and communications theory ; Matching ; Mathematical analysis ; Occlusion ; Pattern recognition ; Planes ; Point-pattern matching ; Signal processing ; Telecommunications and information theory</subject><ispartof>Pattern recognition, 2012, Vol.45 (1), p.563-569</ispartof><rights>2011 Elsevier Ltd</rights><rights>2015 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c368t-3b0cbeef3e9413cbd735b0844f530d83f14dd56e15be1ef9b8fa1c413ce2bd383</citedby><cites>FETCH-LOGICAL-c368t-3b0cbeef3e9413cbd735b0844f530d83f14dd56e15be1ef9b8fa1c413ce2bd383</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S003132031100207X$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,4010,27900,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=24755333$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>McAuley, Julian J.</creatorcontrib><creatorcontrib>Caetano, Tibério S.</creatorcontrib><title>Fast matching of large point sets under occlusions</title><title>Pattern recognition</title><description>The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be ‘globally rigid’. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a single missing point may ‘break’ the rigidity of the graph in question. In addition, such models can efficiently handle point sets of only moderate size. In this paper, we propose a new graphical model that is not only adapted to handle occlusions but is much faster than previous approaches for solving the isometric point-pattern matching problem. We can match point-patterns with thousands of points in a few seconds. ► We introduce a new graphical model for near-isometric point-pattern matching. ► We extend methods based on global rigidity to handle occlusions. ► Previous models cannot handle occlusions, as they ‘break’ the rigidity results. ► Our method is faster and uses less memory than previous approaches. ► This allows our method to be run on much larger graphs than previous approaches.</description><subject>Applied sciences</subject><subject>Exact sciences and technology</subject><subject>Exact solutions</subject><subject>Global rigidity</subject><subject>Graphical models</subject><subject>Graphs</subject><subject>Handles</subject><subject>Information, signal and communications theory</subject><subject>Matching</subject><subject>Mathematical analysis</subject><subject>Occlusion</subject><subject>Pattern recognition</subject><subject>Planes</subject><subject>Point-pattern matching</subject><subject>Signal processing</subject><subject>Telecommunications and information theory</subject><issn>0031-3203</issn><issn>1873-5142</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><recordid>eNp9kMFKxDAQhoMouK6-gYdexFPrpGna7kUQcVVY8KLnkCaTNUu3qZlW8O3t0sWjc5nDfP8M8zF2zSHjwMu7XdbrwYRtlgPnGcgMoD5hC15XIpW8yE_ZAkDwVOQgztkF0Q6AV9NgwfK1piHZT_FP322T4JJWxy0mffDdkBAOlIydxZgEY9qRfOjokp053RJeHfuSfayf3h9f0s3b8-vjwyY1oqyHVDRgGkQncFVwYRpbCdlAXRROCrC1cLywVpbIZYMc3aqpnebmgGLeWFGLJbud9_YxfI1Ig9p7Mti2usMwklrlpcgFQDmRxUyaGIgiOtVHv9fxR3FQB0Nqp2ZD6mBIgVSToSl2czygyejWRd0ZT3_ZvKikFFMt2f3M4fTtt8eoyHjsDFof0QzKBv__oV84n322</recordid><startdate>2012</startdate><enddate>2012</enddate><creator>McAuley, Julian J.</creator><creator>Caetano, Tibério S.</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>2012</creationdate><title>Fast matching of large point sets under occlusions</title><author>McAuley, Julian J. ; Caetano, Tibério S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c368t-3b0cbeef3e9413cbd735b0844f530d83f14dd56e15be1ef9b8fa1c413ce2bd383</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Applied sciences</topic><topic>Exact sciences and technology</topic><topic>Exact solutions</topic><topic>Global rigidity</topic><topic>Graphical models</topic><topic>Graphs</topic><topic>Handles</topic><topic>Information, signal and communications theory</topic><topic>Matching</topic><topic>Mathematical analysis</topic><topic>Occlusion</topic><topic>Pattern recognition</topic><topic>Planes</topic><topic>Point-pattern matching</topic><topic>Signal processing</topic><topic>Telecommunications and information theory</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>McAuley, Julian J.</creatorcontrib><creatorcontrib>Caetano, Tibério S.</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><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>Pattern recognition</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>McAuley, Julian J.</au><au>Caetano, Tibério S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast matching of large point sets under occlusions</atitle><jtitle>Pattern recognition</jtitle><date>2012</date><risdate>2012</risdate><volume>45</volume><issue>1</issue><spage>563</spage><epage>569</epage><pages>563-569</pages><issn>0031-3203</issn><eissn>1873-5142</eissn><coden>PTNRA8</coden><abstract>The problem of isometric point-pattern matching can be modeled as inference in small tree-width graphical models whose embeddings in the plane are said to be ‘globally rigid’. Although such graphical models lead to efficient and exact solutions, they cannot generally handle occlusions, as even a single missing point may ‘break’ the rigidity of the graph in question. In addition, such models can efficiently handle point sets of only moderate size. In this paper, we propose a new graphical model that is not only adapted to handle occlusions but is much faster than previous approaches for solving the isometric point-pattern matching problem. We can match point-patterns with thousands of points in a few seconds. ► We introduce a new graphical model for near-isometric point-pattern matching. ► We extend methods based on global rigidity to handle occlusions. ► Previous models cannot handle occlusions, as they ‘break’ the rigidity results. ► Our method is faster and uses less memory than previous approaches. ► This allows our method to be run on much larger graphs than previous approaches.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.patcog.2011.05.008</doi><tpages>7</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0031-3203
ispartof Pattern recognition, 2012, Vol.45 (1), p.563-569
issn 0031-3203
1873-5142
language eng
recordid cdi_proquest_miscellaneous_926323006
source Elsevier ScienceDirect Journals
subjects Applied sciences
Exact sciences and technology
Exact solutions
Global rigidity
Graphical models
Graphs
Handles
Information, signal and communications theory
Matching
Mathematical analysis
Occlusion
Pattern recognition
Planes
Point-pattern matching
Signal processing
Telecommunications and information theory
title Fast matching of large point sets under occlusions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T12%3A40%3A14IST&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=Fast%20matching%20of%20large%20point%20sets%20under%20occlusions&rft.jtitle=Pattern%20recognition&rft.au=McAuley,%20Julian%20J.&rft.date=2012&rft.volume=45&rft.issue=1&rft.spage=563&rft.epage=569&rft.pages=563-569&rft.issn=0031-3203&rft.eissn=1873-5142&rft.coden=PTNRA8&rft_id=info:doi/10.1016/j.patcog.2011.05.008&rft_dat=%3Cproquest_cross%3E926323006%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=926323006&rft_id=info:pmid/&rft_els_id=S003132031100207X&rfr_iscdi=true