Hidden Markov Random Field Iterative Closest Point

Hidden Markov Random Field Iterative Closest Point

When registering point clouds resolved from an underlying 2-D pixel structure, such as those resulting from structured light and flash LiDAR sensors, or stereo reconstruction, it is expected that some points in one cloud do not have corresponding points in the other cloud, and that these would occur...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Stechschulte, John, Heckman, Christoffer
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computer Vision and Pattern Recognition
Computer Science - Robotics
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Stechschulte, John
Heckman, Christoffer
description When registering point clouds resolved from an underlying 2-D pixel structure, such as those resulting from structured light and flash LiDAR sensors, or stereo reconstruction, it is expected that some points in one cloud do not have corresponding points in the other cloud, and that these would occur together, such as along an edge of the depth map. In this work, a hidden Markov random field model is used to capture this prior within the framework of the iterative closest point algorithm. The EM algorithm is used to estimate the distribution parameters and the hidden component memberships. Experiments are presented demonstrating that this method outperforms several other outlier rejection methods when the point clouds have low or moderate overlap.
doi_str_mv 10.48550/arxiv.1711.05864
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1711_05864</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1711_05864</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-a07fda713c16074407ec6311297b521ff41f88557bf47510ea0757431d412da53</originalsourceid><addsrcrecordid>eNotzs2KwjAUhuFsXIh6Aa4mN9Ca05z01KWUcRQUh8F9OZoEwtR2SEtx7t7f1bd6Px4h5qBSLIxRC47XMKRAAKkyRY5jkW2Cta6Re46_7SB_uLHtRa6Dq63c9i5yHwYny7rtXNfL7zY0_VSMPNedm713Io7rz2O5SXaHr2252iWcEyasyFsm0GfIFSEqcudcA2RLOpkMvEfwxR1FJ49kQLl7YAg1WITMstET8fG6faKrvxguHP-rB7564vUNI1Q84g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Hidden Markov Random Field Iterative Closest Point</title><source>arXiv.org</source><creator>Stechschulte, John ; Heckman, Christoffer</creator><creatorcontrib>Stechschulte, John ; Heckman, Christoffer</creatorcontrib><description>When registering point clouds resolved from an underlying 2-D pixel structure, such as those resulting from structured light and flash LiDAR sensors, or stereo reconstruction, it is expected that some points in one cloud do not have corresponding points in the other cloud, and that these would occur together, such as along an edge of the depth map. In this work, a hidden Markov random field model is used to capture this prior within the framework of the iterative closest point algorithm. The EM algorithm is used to estimate the distribution parameters and the hidden component memberships. Experiments are presented demonstrating that this method outperforms several other outlier rejection methods when the point clouds have low or moderate overlap.</description><identifier>DOI: 10.48550/arxiv.1711.05864</identifier><language>eng</language><subject>Computer Science - Computer Vision and Pattern Recognition ; Computer Science - Robotics</subject><creationdate>2017-11</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1711.05864$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1711.05864$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Stechschulte, John</creatorcontrib><creatorcontrib>Heckman, Christoffer</creatorcontrib><title>Hidden Markov Random Field Iterative Closest Point</title><description>When registering point clouds resolved from an underlying 2-D pixel structure, such as those resulting from structured light and flash LiDAR sensors, or stereo reconstruction, it is expected that some points in one cloud do not have corresponding points in the other cloud, and that these would occur together, such as along an edge of the depth map. In this work, a hidden Markov random field model is used to capture this prior within the framework of the iterative closest point algorithm. The EM algorithm is used to estimate the distribution parameters and the hidden component memberships. Experiments are presented demonstrating that this method outperforms several other outlier rejection methods when the point clouds have low or moderate overlap.</description><subject>Computer Science - Computer Vision and Pattern Recognition</subject><subject>Computer Science - Robotics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2017</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzs2KwjAUhuFsXIh6Aa4mN9Ca05z01KWUcRQUh8F9OZoEwtR2SEtx7t7f1bd6Px4h5qBSLIxRC47XMKRAAKkyRY5jkW2Cta6Re46_7SB_uLHtRa6Dq63c9i5yHwYny7rtXNfL7zY0_VSMPNedm713Io7rz2O5SXaHr2252iWcEyasyFsm0GfIFSEqcudcA2RLOpkMvEfwxR1FJ49kQLl7YAg1WITMstET8fG6faKrvxguHP-rB7564vUNI1Q84g</recordid><startdate>20171107</startdate><enddate>20171107</enddate><creator>Stechschulte, John</creator><creator>Heckman, Christoffer</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20171107</creationdate><title>Hidden Markov Random Field Iterative Closest Point</title><author>Stechschulte, John ; Heckman, Christoffer</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-a07fda713c16074407ec6311297b521ff41f88557bf47510ea0757431d412da53</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2017</creationdate><topic>Computer Science - Computer Vision and Pattern Recognition</topic><topic>Computer Science - Robotics</topic><toplevel>online_resources</toplevel><creatorcontrib>Stechschulte, John</creatorcontrib><creatorcontrib>Heckman, Christoffer</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Stechschulte, John</au><au>Heckman, Christoffer</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Hidden Markov Random Field Iterative Closest Point</atitle><date>2017-11-07</date><risdate>2017</risdate><abstract>When registering point clouds resolved from an underlying 2-D pixel structure, such as those resulting from structured light and flash LiDAR sensors, or stereo reconstruction, it is expected that some points in one cloud do not have corresponding points in the other cloud, and that these would occur together, such as along an edge of the depth map. In this work, a hidden Markov random field model is used to capture this prior within the framework of the iterative closest point algorithm. The EM algorithm is used to estimate the distribution parameters and the hidden component memberships. Experiments are presented demonstrating that this method outperforms several other outlier rejection methods when the point clouds have low or moderate overlap.</abstract><doi>10.48550/arxiv.1711.05864</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.1711.05864
ispartof
issn
language eng
recordid cdi_arxiv_primary_1711_05864
source arXiv.org
subjects Computer Science - Computer Vision and Pattern Recognition
Computer Science - Robotics
title Hidden Markov Random Field Iterative Closest Point
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-21T22%3A40%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Hidden%20Markov%20Random%20Field%20Iterative%20Closest%20Point&rft.au=Stechschulte,%20John&rft.date=2017-11-07&rft_id=info:doi/10.48550/arxiv.1711.05864&rft_dat=%3Carxiv_GOX%3E1711_05864%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true