Finding point correspondence and determining motion of a rigid object from two weak perspective views

Chia-Hoang Lee, Thomas Huang
{"title":"Finding point correspondence and determining motion of a rigid object from two weak perspective views","authors":"Chia-Hoang Lee,&nbsp;Thomas Huang","doi":"10.1016/0734-189X(90)90078-A","DOIUrl":null,"url":null,"abstract":"<div><p>Given two images of an <em>n</em>-point configuration which undergoes 3D rotation, translation, and scaling, our problems are (i) How can we match the corresponding points in the two images? Can all the possible mapping be found? (ii) What underlying motions and associated depth components of these points could account for the two images? (iii) Can the object be recovered uniquely? This formulation of the <em>n</em>-point problem is in the most general setting and does not assume attributes or features. A natural question to ask is whether an <em>n</em>-point problem is equivalent to a set of fewer-point problems. This paper presents a method which reduces an <em>n</em>-point problem to a set of 4-point problems. The effort of reduction takes <em>O(n)</em> steps and it also takes <em>O(n)</em> steps to construct all possible mappings of an <em>n</em>-point set from the solution to a 4-point problem. Other results include (1) coplanarity condition of four points in two views, (2) recovering the tilt direction of the rotational axis using four points in two views, (3) recovering the scaling factor.</p></div>","PeriodicalId":100319,"journal":{"name":"Computer Vision, Graphics, and Image Processing","volume":"52 3","pages":"Pages 309-327"},"PeriodicalIF":0.0000,"publicationDate":"1990-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0734-189X(90)90078-A","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Vision, Graphics, and Image Processing","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0734189X9090078A","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Given two images of an n-point configuration which undergoes 3D rotation, translation, and scaling, our problems are (i) How can we match the corresponding points in the two images? Can all the possible mapping be found? (ii) What underlying motions and associated depth components of these points could account for the two images? (iii) Can the object be recovered uniquely? This formulation of the n-point problem is in the most general setting and does not assume attributes or features. A natural question to ask is whether an n-point problem is equivalent to a set of fewer-point problems. This paper presents a method which reduces an n-point problem to a set of 4-point problems. The effort of reduction takes O(n) steps and it also takes O(n) steps to construct all possible mappings of an n-point set from the solution to a 4-point problem. Other results include (1) coplanarity condition of four points in two views, (2) recovering the tilt direction of the rotational axis using four points in two views, (3) recovering the scaling factor.

从两个弱透视图中寻找点对应并确定刚体的运动
给定两张经过三维旋转、平移和缩放的n点构型图像,我们的问题是(i)如何匹配两张图像中对应的点?能找到所有可能的映射吗?(ii)这些点的哪些潜在运动和相关深度分量可以解释这两幅图像?(iii)该物体能否被唯一地回收?n点问题的这种表述是在最一般的情况下,不假设属性或特征。一个自然要问的问题是,一个n点问题是否等同于一组更少点的问题。本文提出了一种将n点问题简化为4点问题集的方法。约简的努力需要O(n)个步骤,它也需要O(n)个步骤来构建从解到4点问题的n点集合的所有可能映射。其他结果包括:(1)两个视图中四个点的共面性条件,(2)使用两个视图中的四个点恢复旋转轴的倾斜方向,(3)恢复比例因子。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信