期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于视差与基线距相关三目立体匹配法 被引量：1

Trinocular stereo matching algorithm based on correlation between disparities and baseline
在线阅读 下载PDF
导出
摘要 采用统计过程控制方法对二维图像特征点区域定位,并提取二维图像特征点。避免了提取二维图像特征点时,根据被处理图像的先验信息,利用试探方法确定阈值的局限性。在立体匹配时,将灰度相关系数小于最大灰度相关系数一定范围内的特征点作为灰度相关复峰初始匹配特征点集合。根据由正确匹配特征点组成的视差矩阵与对应的基线距矩阵存在极大相关性,从灰度相关复峰初始匹配特征点集合中确定唯一匹配特征点。通过对外形复杂的实际物体及已知精确三维坐标的标准工件的三维重建,证实了文中所提方法的有效性和可靠性。 After the area of feature points in 2-D image is located by statistical process control method, the feature points can be extracted easily. The limitation in determining threshold value with tentative algorithm according to some prior information on the image being processed can be avoided. During stereo matching, the feature points whose correlation coefficients are within certain range less than the maximal coefficient can be taken as an original matching feature point set. There is maximal correlation between the disparity matrix consisting of correct matching feature points and its corresponding baseline matrix. Based on this, by computing the correlations between disparity and the baseline matrices, the unique matching feature point can be obtained from the original matching feature point set. The images of an object with complex shape and a standard work-piece with given accurate 3-D coordinates were restored in 3-D form, which proves that the proposed algorithm is valid and reliable.
作者 管业鹏 武频 朱晓锦 陆乃将
机构地区 上海大学通信与信息工程学院 上海大学计算机学院 上海大学机电工程与自动化学院 上海科比生物识别技术有限公司
出处 《仪器仪表学报》 EI CAS CSCD 北大核心 2006年第11期1418-1422,共5页 Chinese Journal of Scientific Instrument
基金 上海市教委与教育部发展基金曙光项目(04CX72 05AZ38)资助项目。
关键词 过程控制 特征点 灰度相关 复峰集 匹配 process control feature point gray correlation multi-peak set match
分类号 TP391.41 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献25

  • 1JEON J, KIM K, KIM C, et al. A robust stereomatching algorithm using multiple-baseline cameras[A]. In: 2001 IEEE Pacific Rim Conference on Communications, Computers and signal Processing [C],2001, 1:263-266.
  • 2ZITNICK C L, KANADE T. A cooperative algorithm for stereo matching and occlusion detection [J]. IEEE Trans. PAMI, 2000, 22(7):675-684.
  • 3LI G P, HE Y. A hierarchical combined feature and area-based stereo matching algorithm [A]. In: IEEE International Symposium on Circuits and Systems[C], 2002, 2:Ⅱ-277-Ⅱ280.
  • 4OKUTOMI M, KANADE T. A locally adaptive window for signal matching [J]. International Journal of Computer Vision, 1992, 7(2) : 143-162.
  • 5KANADE T, OKUTOMI M. A stereo matching algorithm with an adaptive window. Theory and experiment [J]. IEEE Trans. PAMI, 1994, 16(9) :920-932.
  • 6FUSIELLO A, ROBERTO V, TRUCCO E. Efficient stereo with multiple windowing [A]. In: Proceedings of CVPR97 [C], 1997:858-863.
  • 7PARK J -I, INOUE S. Acquisition of sharp depth map from multiple cameras [J]. Signal Processing:Image Communication, 1998, 14 : 7-19.
  • 8OKUTOMI M, KATAYAMA Y. A simple stereo algorithm to recover precise object boundaries and smooth surfaces [A]. In. Proceedings of the IEEE Workshop on Stereo and Multi-Baseline Vision (SMBV'01) [C], 2001: 158-165.
  • 9HOW P, YIP R K K. A dynamic programming approach for stereo line matching with structural information [A]. In: Proceedings of the 13th International Conference on Pattern Recognition [C], Vienna,Austria, 1996, 1:791-794.
  • 10NASRABADI N M, CHIANG J L. A stereo vision technique using curve-segments and relaxation matehing[A]. In: 9th International Conference on Pattern Recognition [C], Rome, Italy, 1988, 1:149-151.

二级参考文献14

  • 1龙世渚,黄载禄,曹汉房.一种立体视觉图像的特征选择与匹配方法[J].华中理工大学学报,1994,22(11):28-31. 被引量：5
  • 2Okutomi M,Kanade T. A locally adaptive window for signal matching[ A]. Proceedinss of the Third International Conference on Computer Vision[ C]. Osaka, Japan: PTICCV, 1990.190 - 199.
  • 3Kanade T,Okutomi M. A stereo matching algorithm with an adaptive window: Theory and experiment[J],IEEE Trans on PAMI, 1994, 16.(9) :920 - 932.
  • 4Atallah 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.
  • 5Brunig M, Niehsen W, Fast full-search hloch matching[ J ].IEEE Trans. on Circuits and Systems for Video Technology, 2001, 11(2):241 - 247.
  • 6Kweon J J, Kang K, Kim S D.A stereo matching algorithm using line segment features[A]. Fourth IEEE Region 10 International Conference,TENCON' 89[C]. Bombay, India: IEEE. IC, 1989.589 - 592.
  • 7Bruyelle J-L,Postaire J-G. Disparity analysis for real time obstacle detection by linear stereovision[A]. Proceedings of the Intelligent Vehicle'92 Symposium[C] .Detroit, MI, USA: IVS, 1992.51 - 56.
  • 8Pilu M. A Direct Method for Stereo Correspondence based on Singular Value Decomposition[A].Proceedings of 1997 IEEE Computer Society Conference on Computer Vision and Pattern Recognition[ C ].San Juan, Puerto Rico: IEEE, 1997.261-266.
  • 9Grimson W E L. Computational experiments with a feature based stereo algorithm[J]. IEEE Trans. on PAMI, 1985,7(1) : 17 - 34.
  • 10Burt P, Julesz. A disparity gradient limit for binocular fusion [ J]. Science, 1980,208.615 - 617.

共引文献10

同被引文献101

  • 1张维中,张丽艳,王晓燕,丁志安.基于标记点的图像特征匹配的鲁棒算法[J].中国机械工程,2006,17(22):2415-2418. 被引量：9
  • 2Osher S J, Fedkiw R P. Level set methods and dynamic implicit surfaces[M]. Berlin, Germany: Springer-Verlag, 2002.
  • 3Enright D, Losasso F, Fedldw R. A fast and accurate semi- Lagrangian particle level set method[J]. Computers and Structures, 2005, 83(6/7): 479-490.
  • 4Faugeras O, Keriven R. Complete dense stereovision using level set methods[C]//European Conference on Computer Vision. Berlin, Germany: Springer-Verlag, 1998: 379-393.
  • 5Sung J, Kanade T, Kim D. A unified gradient-based approach for combining ASM into AAM[J]. International Journal of Computer Vision, 2007, 75(2): 297-309.
  • 6Solem J E, Overgaard N C. A geometric formulation of gradient descent for variational problems with moving surfaces[M]//Lecture Notes in Computer Science: vol.3459. BeNin, Germany: Springer-Verlag, 2005: 419-430.
  • 7Solem J E, Overgaard N C. A gradient descent procedure for variational dynamic surface problems with constraints[M] //Lecture Notes in Computer Science: vol.3752. Berlin, Germany: Springer-Verlag, 2005: 332-343.
  • 8Memisevie R, Hinton G. Improving dimensionality reduction with spectral gradient descent[J]. Neural Networks, 2005, 18(5/6): 702-710.
  • 9Kolmogorov V, Zabih R. Multi-camera scene reconstruction via graph cuts[C]//European Conference on Computer Vision. Berlin, Germany: Springer-Verlag, 2002: 82-96.
  • 10Paris S, SiUion F X, Quan L. A surface reconstruction method using global graph cut optimization[J]. International Journal of Computer Vision, 2006, 66(2): 141-161.

引证文献1

二级引证文献2

仪器仪表学报
2006年 第11期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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