SIA OpenIR  > 机器人学研究室
一种高精度的对极几何恢复方法的研究
Alternative TitleStudy of a high-accuracy eppolar geometry restoration method
高宏伟; 吴成东; 李斌
Department机器人学研究室
Source Publication高技术通讯
ISSN1002-0470
2006
Volume16Issue:1Pages:51-54
Indexed ByEI ; CSCD
EI Accession number2006209882740
CSCD IDCSCD:2253260
Contribution Rank1
Funding Organization国家科技攻关项目;
Keyword双目视觉 对极几何 角点检测 退化问题 迭代优化
Abstract在分析平行双目立体视觉系统的对极几何问题的基础上,提出了采用普通标定板实现图像角点对自动准确匹配的方法,并对对极几何进行了高精度的恢复.给出了角点检测算法、退化问题的避免措施以及基于秩2约束的基础矩阵迭代优化求解的方法.试验结果证明所提出的方法有效可行,有助于提高后续立体匹配的准确率与三维重建的精度。
Other AbstractAccording to the parallel binocular vision system, a method that uses common calibration board to realize automatic and accurate matching of the image corner pairs was developed, and the epipolar geometry of the system was restored accurately. The coiner detection algorithm, the avoidance of the degeneration problem and the fundamental matrix iterative optimization algorithm based on rank-2 constraint were introduced. Experiment results proved the validity of the proposed method.
Language中文
Citation statistics
Document Type期刊论文
Identifierhttp://ir.sia.cn/handle/173321/2722
Collection机器人学研究室
Affiliation1.中国科学院沈阳自动化研究所机器人学重点实验室
2.中国科学院研究生院
3.沈阳建筑大学信息与控制学院
Recommended Citation
GB/T 7714
高宏伟,吴成东,李斌. 一种高精度的对极几何恢复方法的研究[J]. 高技术通讯,2006,16(1):51-54.
APA 高宏伟,吴成东,&李斌.(2006).一种高精度的对极几何恢复方法的研究.高技术通讯,16(1),51-54.
MLA 高宏伟,et al."一种高精度的对极几何恢复方法的研究".高技术通讯 16.1(2006):51-54.
Files in This Item:
File Name/Size DocType Version Access License
ZWQKQW0000507.pdf(631KB)期刊论文出版稿开放获取ODC PDDLView Application Full Text
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[高宏伟]'s Articles
[吴成东]'s Articles
[李斌]'s Articles
Baidu academic
Similar articles in Baidu academic
[高宏伟]'s Articles
[吴成东]'s Articles
[李斌]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[高宏伟]'s Articles
[吴成东]'s Articles
[李斌]'s Articles
Terms of Use
No data!
Social Bookmark/Share
File name: ZWQKQW0000507.pdf
Format: Adobe PDF
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.