期刊文献+

一种基于边缘线的三目立体匹配方法 被引量:3

Trinocular stereo matching method based on edge segment
下载PDF
导出
摘要 为实现准确的三维场景匹配,提出了一种基于边缘线的三目立体匹配方法。Canny边缘是一种常用的视觉特征,通过对Canny算子加以改进,提高了边缘线条匹配的可靠性。匹配过程分层次进行,首先通过边缘上少量点的成功匹配确定边缘线条间的对应关系,然后以此来约束该边缘上其他点的匹配。详细介绍了对应特征匹配所用的约束条件。首先,使用三目系统中第三个摄像机提供的额外极线约束,有效地减少了误匹配。由于常规所用的三目极线约束条件给出的匹配效果并不理想,提出了另外一种更加有效的三目极线约束应用方法。此外还介绍了边缘点的梯度方向约束,给出了基于以上约束条件的边缘线匹配算法。实验结果表明,该算法具有较高的匹配正确率,是一种有效的立体匹配算法。 To realize accurate 3D scene matching, a trinocular stereo matching scheme based on edge segment was developed. Canny edge was one of most popular vision features in image, and improvement of canny operator made the matching of line segments more reliable. Matching process was conducted hierarchically. Correspondence between line segments was firstly validated by successful matching of a few points on edges, which in turn instructed matching of other edge points. Constraints employed in matching of corresponding feature were discussed in detail. Firstly, the extra epipolar constraint given by the 3rd camera in trinocular vision was applied to reduce mismatch effectively. Since conventional matching methods utilizing trinocular epipolar constraint performed faultily, another practical trinocular constraint treatment method was presented. In addition; gradient direction constraint of edge point was introduced. Matching algorithm based on aforementioned constraints was proposed. Experimental results show that the proposed algorithm has the high probability of correct matching.
出处 《光电工程》 EI CAS CSCD 北大核心 2007年第2期22-26,共5页 Opto-Electronic Engineering
基金 武器装备预研重点基金资助
关键词 三目视觉 立体匹配 极线约束 梯度方向 Canny边缘 Trinocular vision Stereo match Epipolar constraint Gradient direction Canny edge
  • 相关文献

参考文献8

二级参考文献24

  • 1丁震,胡钟山,唐振民,杨静宇.从二维图象中恢复距离信息的体视匹配方法[J].南京理工大学学报,1996,20(5):449-452. 被引量:4
  • 2[1]Okutomi M and Kanade T, A multiple-baseline stereo [A]. In: Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition[C], Osaka, Japan, 1991:63-69.
  • 3[2]Kanada T and Okutomi M, A stereo matching algorithm with an adptive window: theory and experiment [J]. IEEE Transactions on Pattern Analysis and machine Intelligence, 1994, 16(9): 920-932.
  • 4[3]Lew M S and Huang T S, Learning and feature selection in stereo matching [J]. IEEE Transaction on Pattern Analysis and machine Intelligence, 1994, 16(9): 869-881.
  • 5[4]Hu X and Ahuja N, matching point features with ordered geometric, rigidity, and disparity constrains [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1994, 16(10): 1041-1049.
  • 6[5]Chen Y S, Hung Y H and Fuh C S, Fast block matching algorithm based on the winner-update strategy [J]. IEEE Transactions on Image Processing, 2001, 10(8): 1212-1222.
  • 7[6]Okutomi M, Kanade T, A locally adaptive window for signal matching [A]. In: Proceedings of the Third International Conference on Computer Vision [C], Osaka, Japan, 1990: 190-199.
  • 8[7]Atallah M J, Faster image template matching in the sum of the absolute value of differences measure [J]. IEEE Trans. on Image Processing, 2001,10(4): 659-663.
  • 9[8]Brunig M, Niehsen W, Fast full-search block matching [J]. IEEE Trans. on Circuits and Systems for Video Technology, 2001,11(2): 241-247.
  • 10[9]Kweon J J, Kang K and Kim S D, A stereo matching algorithm using line segment features [A]. In: Fourth IEEE Region 10 International Conference, TENCON '89 [C], Bombay, India, 1989:589-592.

共引文献34

同被引文献92

引证文献3

二级引证文献126

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部