Efficient Suboptimal Solutions to the Optimal Triangulation
文献类型：期刊论文
| 作者 | Wu, F. C. ; Zhang, Q.; Hu, Z. Y.
|
| 刊名 | INTERNATIONAL JOURNAL OF COMPUTER VISION
 |
| 出版日期 | 2011 |
| 卷号 | 91期号:1页码:77-106 |
| 关键词 | Fundamental cone Optimal triangulation Suboptimal triangulation Sampson sequence |
| 英文摘要 | Given two images, the optimal triangulation of a measured corresponding point pair is to basically find out the real roots of a 6-degree polynomial. Since for each point pair, this root finding process should be done, the optimal triangulation for the whole image is computationally intensive. In this work, via the 3D cone expression of fundamental matrix, called the fundamental cone, together with the Lagrange's multiplier method, the optimal triangulation problem is reformulated. Under this new formulation, the optimal triangulation for a measured point pair is converted to finding out the closest point on the fundamental cone to the measured point in the joint image space, then 3 efficient suboptimal algorithms, each of them can satisfy strictly the epipolar constraint of the two images, are proposed. In our first suboptimal algorithm, the closest point on the generating cone to the measured point is used as the approximation of the optimal solution, which is to find out the real roots of a 4-degree polynomial; in our second suboptimal algorithm, the closest point on the generating line to the measured point is used as the approximation of the optimal solution, which is to find out the real roots of a 2-degree polynomial. Finally, in our third suboptimal algorithm, the converging point of the Sampson approximation sequence is used as the approximation of the optimal solution. Experiments with simulated data as well as real images show that our proposed 3 suboptimal algorithms can achieve comparable estimation accuracy compared with the original optimal triangulation, but with much less computational load. For example, our second and third suboptimal algorithms take only about a 1/5 runtime of the original optimal solution. Besides, under our new formulation, rather than recompute the two Euclidian transformation matrices for each measured point pair, a fixed Euclidian transformation matrix is used for all image point pairs, which, in addition to its mathematical elegance and computational efficiency, is able to remove the dependency of the resulting polynomial's degree on the parameterization of the epipolar pencil in either the first image or in the second image, a drawback in the original optimal triangulation. |
| WOS标题词 | Science & Technology ; Technology |
| 类目[WOS] | Computer Science, Artificial Intelligence |
| 研究领域[WOS] | Computer Science |
| 关键词[WOS] | GEOMETRIC RECONSTRUCTION ; OPTIMIZATION |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS记录号 | WOS:000286118400005 |
| 源URL | [http://ir.ia.ac.cn/handle/173211/2955]  |
| 专题 | 自动化研究所_模式识别国家重点实验室_机器人视觉团队 |
| 作者单位 | Chinese Acad Sci, Natl Lab Pattern Recognit, Inst Automat, Beijing 100190, Peoples R China |
| 推荐引用方式 GB/T 7714 | Wu, F. C.,Zhang, Q.,Hu, Z. Y.. Efficient Suboptimal Solutions to the Optimal Triangulation[J]. INTERNATIONAL JOURNAL OF COMPUTER VISION,2011,91(1):77-106. |
| APA | Wu, F. C.,Zhang, Q.,&Hu, Z. Y..(2011).Efficient Suboptimal Solutions to the Optimal Triangulation.INTERNATIONAL JOURNAL OF COMPUTER VISION,91(1),77-106. |
| MLA | Wu, F. C.,et al."Efficient Suboptimal Solutions to the Optimal Triangulation".INTERNATIONAL JOURNAL OF COMPUTER VISION 91.1(2011):77-106. |
入库方式： OAI收割
来源：自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。