Loading…
Iterative Pose Computation from Line Correspondences
This paper presents a method for estimating the position and orientation of a camera with respect to a known 3-D object from line correspondences. The main idea of the method is to estimate a pose with either a weak perspective or a paraperspective camera model and to improve this pose iteratively....
Saved in:
Published in: | Computer vision and image understanding 1999-01, Vol.73 (1), p.137-144 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c422t-d524284d542e165e676122fac55b3d573a41a4f0b141e289ff337492a1b390513 |
---|---|
cites | cdi_FETCH-LOGICAL-c422t-d524284d542e165e676122fac55b3d573a41a4f0b141e289ff337492a1b390513 |
container_end_page | 144 |
container_issue | 1 |
container_start_page | 137 |
container_title | Computer vision and image understanding |
container_volume | 73 |
creator | Christy, Stéphane Horaud, Radu |
description | This paper presents a method for estimating the position and orientation of a camera with respect to a known 3-D object from line correspondences. The main idea of the method is to estimate a pose with either a weak perspective or a paraperspective camera model and to improve this pose iteratively. At convergence the result is compatible with a perspective camera model. This iterative improvement of a linear (affine) camera model has already been used for points but has never been extended to lines. Known methods which compute pose from line correspondences deal with a set of nonlinear equations which are solved either in closed-form or using minimization techniques. These methods have to deal with multiple solutions. In contrast our method starts with a solution which is very close to the true solution and converges in very few iterations (typically three to five iterations). The rank analysis of the linear system to be solved at each iteration allows us to characterize geometric configurations which defeat the algorithm. |
doi_str_mv | 10.1006/cviu.1998.0717 |
format | article |
fullrecord | <record><control><sourceid>proquest_hal_p</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_inria_00590104v1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1077314298907172</els_id><sourcerecordid>27198402</sourcerecordid><originalsourceid>FETCH-LOGICAL-c422t-d524284d542e165e676122fac55b3d573a41a4f0b141e289ff337492a1b390513</originalsourceid><addsrcrecordid>eNp1kE1Lw0AQhoMoWKtXzz2IF0nc2Y8keyxFbaGgBwVvy3YzwZUkG3fTgP_eLil68jTD8Mw7w5Mk10AyICS_N6PdZyBlmZECipNkBkSSlDLxfhr7okgZcHqeXITwSQgAlzBL-GZArwc74uLFBVysXNvvh8PAdYvau3axtV2ceo-hd12FncFwmZzVugl4dazz5O3x4XW1TrfPT5vVcpsaTumQVoJyWvJKcIqQC8yLHCittRFixypRMM1B85rsgAPSUtY1YwWXVMOOSSKAzZO7KfdDN6r3ttX-Wzlt1Xq5VbbzVitChCRA-Bjp24nuvfvaYxhUa4PBptEdun1QtABZckIPYDaBxrsQPNa_2UBUVKmiShVVqqjysHBzTNbB6Kb2ujM2_G3lgjMeHygnDA9ORoteBWOjsMp6NIOqnP3vwg8YRoUI</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27198402</pqid></control><display><type>article</type><title>Iterative Pose Computation from Line Correspondences</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Christy, Stéphane ; Horaud, Radu</creator><creatorcontrib>Christy, Stéphane ; Horaud, Radu</creatorcontrib><description>This paper presents a method for estimating the position and orientation of a camera with respect to a known 3-D object from line correspondences. The main idea of the method is to estimate a pose with either a weak perspective or a paraperspective camera model and to improve this pose iteratively. At convergence the result is compatible with a perspective camera model. This iterative improvement of a linear (affine) camera model has already been used for points but has never been extended to lines. Known methods which compute pose from line correspondences deal with a set of nonlinear equations which are solved either in closed-form or using minimization techniques. These methods have to deal with multiple solutions. In contrast our method starts with a solution which is very close to the true solution and converges in very few iterations (typically three to five iterations). The rank analysis of the linear system to be solved at each iteration allows us to characterize geometric configurations which defeat the algorithm.</description><identifier>ISSN: 1077-3142</identifier><identifier>EISSN: 1090-235X</identifier><identifier>DOI: 10.1006/cviu.1998.0717</identifier><identifier>CODEN: CVIUF4</identifier><language>eng</language><publisher>San Diego, CA: Elsevier Inc</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Artificial intelligence ; Computer Science ; Computer science; control theory; systems ; Exact sciences and technology ; Graphics ; Pattern recognition. Digital image processing. Computational geometry ; Theoretical computing</subject><ispartof>Computer vision and image understanding, 1999-01, Vol.73 (1), p.137-144</ispartof><rights>1999 Academic Press</rights><rights>1999 INIST-CNRS</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c422t-d524284d542e165e676122fac55b3d573a41a4f0b141e289ff337492a1b390513</citedby><cites>FETCH-LOGICAL-c422t-d524284d542e165e676122fac55b3d573a41a4f0b141e289ff337492a1b390513</cites><orcidid>0000-0001-5232-024X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,776,780,881,4010,27899,27900,27901</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=1654341$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://inria.hal.science/inria-00590104$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Christy, Stéphane</creatorcontrib><creatorcontrib>Horaud, Radu</creatorcontrib><title>Iterative Pose Computation from Line Correspondences</title><title>Computer vision and image understanding</title><description>This paper presents a method for estimating the position and orientation of a camera with respect to a known 3-D object from line correspondences. The main idea of the method is to estimate a pose with either a weak perspective or a paraperspective camera model and to improve this pose iteratively. At convergence the result is compatible with a perspective camera model. This iterative improvement of a linear (affine) camera model has already been used for points but has never been extended to lines. Known methods which compute pose from line correspondences deal with a set of nonlinear equations which are solved either in closed-form or using minimization techniques. These methods have to deal with multiple solutions. In contrast our method starts with a solution which is very close to the true solution and converges in very few iterations (typically three to five iterations). The rank analysis of the linear system to be solved at each iteration allows us to characterize geometric configurations which defeat the algorithm.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Exact sciences and technology</subject><subject>Graphics</subject><subject>Pattern recognition. Digital image processing. Computational geometry</subject><subject>Theoretical computing</subject><issn>1077-3142</issn><issn>1090-235X</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1999</creationdate><recordtype>article</recordtype><recordid>eNp1kE1Lw0AQhoMoWKtXzz2IF0nc2Y8keyxFbaGgBwVvy3YzwZUkG3fTgP_eLil68jTD8Mw7w5Mk10AyICS_N6PdZyBlmZECipNkBkSSlDLxfhr7okgZcHqeXITwSQgAlzBL-GZArwc74uLFBVysXNvvh8PAdYvau3axtV2ceo-hd12FncFwmZzVugl4dazz5O3x4XW1TrfPT5vVcpsaTumQVoJyWvJKcIqQC8yLHCittRFixypRMM1B85rsgAPSUtY1YwWXVMOOSSKAzZO7KfdDN6r3ttX-Wzlt1Xq5VbbzVitChCRA-Bjp24nuvfvaYxhUa4PBptEdun1QtABZckIPYDaBxrsQPNa_2UBUVKmiShVVqqjysHBzTNbB6Kb2ujM2_G3lgjMeHygnDA9ORoteBWOjsMp6NIOqnP3vwg8YRoUI</recordid><startdate>19990101</startdate><enddate>19990101</enddate><creator>Christy, Stéphane</creator><creator>Horaud, Radu</creator><general>Elsevier Inc</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><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0001-5232-024X</orcidid></search><sort><creationdate>19990101</creationdate><title>Iterative Pose Computation from Line Correspondences</title><author>Christy, Stéphane ; Horaud, Radu</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c422t-d524284d542e165e676122fac55b3d573a41a4f0b141e289ff337492a1b390513</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1999</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Exact sciences and technology</topic><topic>Graphics</topic><topic>Pattern recognition. Digital image processing. Computational geometry</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Christy, Stéphane</creatorcontrib><creatorcontrib>Horaud, Radu</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><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Computer vision and image understanding</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Christy, Stéphane</au><au>Horaud, Radu</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Iterative Pose Computation from Line Correspondences</atitle><jtitle>Computer vision and image understanding</jtitle><date>1999-01-01</date><risdate>1999</risdate><volume>73</volume><issue>1</issue><spage>137</spage><epage>144</epage><pages>137-144</pages><issn>1077-3142</issn><eissn>1090-235X</eissn><coden>CVIUF4</coden><abstract>This paper presents a method for estimating the position and orientation of a camera with respect to a known 3-D object from line correspondences. The main idea of the method is to estimate a pose with either a weak perspective or a paraperspective camera model and to improve this pose iteratively. At convergence the result is compatible with a perspective camera model. This iterative improvement of a linear (affine) camera model has already been used for points but has never been extended to lines. Known methods which compute pose from line correspondences deal with a set of nonlinear equations which are solved either in closed-form or using minimization techniques. These methods have to deal with multiple solutions. In contrast our method starts with a solution which is very close to the true solution and converges in very few iterations (typically three to five iterations). The rank analysis of the linear system to be solved at each iteration allows us to characterize geometric configurations which defeat the algorithm.</abstract><cop>San Diego, CA</cop><pub>Elsevier Inc</pub><doi>10.1006/cviu.1998.0717</doi><tpages>8</tpages><orcidid>https://orcid.org/0000-0001-5232-024X</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1077-3142 |
ispartof | Computer vision and image understanding, 1999-01, Vol.73 (1), p.137-144 |
issn | 1077-3142 1090-235X |
language | eng |
recordid | cdi_hal_primary_oai_HAL_inria_00590104v1 |
source | ScienceDirect Freedom Collection 2022-2024 |
subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Computer Science Computer science control theory systems Exact sciences and technology Graphics Pattern recognition. Digital image processing. Computational geometry Theoretical computing |
title | Iterative Pose Computation from Line Correspondences |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-25T12%3A27%3A08IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_hal_p&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Iterative%20Pose%20Computation%20from%20Line%20Correspondences&rft.jtitle=Computer%20vision%20and%20image%20understanding&rft.au=Christy,%20St%C3%A9phane&rft.date=1999-01-01&rft.volume=73&rft.issue=1&rft.spage=137&rft.epage=144&rft.pages=137-144&rft.issn=1077-3142&rft.eissn=1090-235X&rft.coden=CVIUF4&rft_id=info:doi/10.1006/cviu.1998.0717&rft_dat=%3Cproquest_hal_p%3E27198402%3C/proquest_hal_p%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c422t-d524284d542e165e676122fac55b3d573a41a4f0b141e289ff337492a1b390513%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=27198402&rft_id=info:pmid/&rfr_iscdi=true |