
浏览全部资源
扫码关注微信
1. 上海大学 机电工程与自动化学院 上海,200072
2. 广西财经学院,广西 南宁,530002
收稿日期:2006-04-10,
修回日期:2006-06-06,
网络出版日期:2007-01-30,
纸质出版日期:2007-01-30
移动端阅览
谢少荣, 王东红, 罗 均, 等. 基于生物信息学中双DNA序列比对 算法的图像立体匹配及其实现[J]. 光学精密工程, 2007,15(1):106-111.
XIE Shao-rong, WANG Dong-hong, LUO Jun, et al. Novel stereo matching algorithm based on pair-wise DNA alignment algorithm in bioinformatics and its implementation[J]. Optics and precision engineering, 2007, 15(1): 106-111.
谢少荣, 王东红, 罗 均, 等. 基于生物信息学中双DNA序列比对 算法的图像立体匹配及其实现[J]. 光学精密工程, 2007,15(1):106-111. DOI:
XIE Shao-rong, WANG Dong-hong, LUO Jun, et al. Novel stereo matching algorithm based on pair-wise DNA alignment algorithm in bioinformatics and its implementation[J]. Optics and precision engineering, 2007, 15(1): 106-111. DOI:
提出了一种基于生物信息学中双DNA序列比对算法的图像立体匹配新方法。图像立体匹配和生物信息学中双DNA序列比对的实质都是在匹配准则下搜索最佳匹配基元
因而新颖地将双序列比对算法引入图像立体匹配。首先介绍了基于动态规划的双序列比对算法原理及其用于图像立体匹配的实现方法
然后根据左右摄像机的最大视差是一个有限定值
进行了算法改进
极大地减少了计算量
并给出了VC6.0中的实现流程
最后采用4组不同的图像对进行了实验验证。该方法具有较低的计算复杂度和适宜于并行计算的特点
生成的视差图效果表明双序列比对算法为图像立体匹配提供了一个实用有效的方法。
A novel stereo matching algorithm based on pair-wise DNA alignment algorithm is presented. The essential of both stereo matching and pair-wise DNA alignment in bioinformatics is that the correspondence points are searched by matching criteria
so the pair-wise DNA alignment algorithm is introduced to design a new stereo matching algorithm. Firstly
the principle of the dynamic programming and implementation of the proposed algorithm are presented. Then
this algorithm is significantly improved to reduce the calculation drastically
because there is a maximum possible disparity whose value can be derived from the field of view of the cameras
the physical distance between the two cameras
and the focal length of the cameras. The flow of the algorithm is designed in detail with VC6.0. Finally
the disparity maps of several different test images by means of this algorithm are shown
the advantages are low computer complexity and parallel processing. The results show that the proposed algorithm is useful and effective.
. BOGDAN G. Point matching under large image deformations and illuminatin changes[J]. IEEE Comput.Soc., 2004, 22(6):674-689.
. 朱明,鲁剑锋,胡硕. 采用DSP的电视测量跟踪器的研制[J]. 光学 精密工程,2005,13(Supp.):232-235. ZHU M,LU J F,HU S. Development of TV measuring and tracking system by using DSP[J]. Opt. Precision Eng.,2005,13(Supp.):232-235.(in Chinese)
. KANADE T, OKUTOMI M. A stereo matching algorithm with an adaptive window: theory and experiment[J]. IEEE Trans.Pattern Anal. Mach. Intel., 1994,16(9): 920-932.
. SUN CH. A fast stereo matching method . Digital Image Computing and Applications, 1997: 95-100.
. CANDOCIA F, ADJOUADI M A. Similarity measure for stereo feature matching[J]. IEEE Trans.Imag. Proces., 1997, 6(10): 1460-1464.
. 姜凯,陈海霞,刘立峰,汤建华. 基于模板抽样的快速图像匹配算法[J]. 光学 精密工程,2004,12(3):311-315. JIANG K,CHEN H X,LIU L F,TANG J H. Fast image matching algorithm based on template sampling[J]. Opt. Precision Eng.,2004,12(3):311-315.(in Chinese)
. 徐瑞鑫,刘伟宁. 基于自适应模板的实时跟踪算法 . 光学 精密工程,2002,10(4):365-369. XU R X,LIU W N. Adaptive model-based real time tracking algorithm[J]. Opt. Precision Eng.,2002,10(4):365-369.(in Chinese)
. FROHLINGHAUS T, BUHMANN J M. Regularizing phase-based stereo . Proceedings of the International Conference on Pattern Recognition, 1996, 451-455.
. CRESPI B, ALEX G. Analog computation for phase-based disparity estimation: continuous and discrete models[J]. Mach. Vision Appl., 1998, 11(2): 83-95.
. 叶海加,陈罡,邢渊.双目CCD结构光三维测量系统中的立体匹配[J]. 光学 精密工程,2004,12(1):71-75. YE H J,CHEN G,XIANG Y. Stereo matching in 3D measurement system using double CCD structured light[J]. Opt. Precision Eng.,2004,12(1):71-75.(in Chinese)
. 张敏. 生物序列比对算法研究现状与展望[J]. 大连大学学报, 2004, 25(4): 75-79. ZHANG M. Current and prospect of bio-sequence alignment algorithm[J]. J. Dalian Univ., 2004, 25(4): 75-79.(in Chinese)
. 王宏漫, 欧宗瑛. 进化算法在DNA序列比对中的应用 . 数据采集与处理, 2002, 17(4): 463-466. WANG H M, OU Z Y. Evolution algorithm for sequence alignment[J]. J.Data Acquis. & Proces., 2002,17(4): 463-466.(in Chinese)
. DAVID R P. A versatile divide and conquer technique for optimal string alignment[J]. Inform.Proces.Lett., 1999, 70:129-139.
. HIRSCHBERG D. A linear space algorithm for computing maximal common subsequences[J]. Comm. ACM, 1975,18(6):341-343.
. 唐玉荣, 汪懋华. 基于动态规划的快速比对算法 . 生物数学学报, 2005, 20(2):207-212. TANG Y R, WANG M H. Fast sequence alignment based on dynamic programming[J]. J.Biomath., 2005, 20(2):207-212.(in Chinese)
0
浏览量
557
下载量
3
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621