全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于最小路由代价树的大规模显微图像拼接方法

DOI: 10.11834/jig.20090627

Keywords: 图像拼接,全景图,拼接图,空间聚类,最小路由代价生成树

Full-Text   Cite this paper   Add to My Lib

Abstract:

为了对大规模显微图像进行高质量的拼接,首先提出拼接图的概念及获得高质量全景图像的3个原则,然后采用分块-空间聚类算法配准相邻图像,同时评估配准质量,并计算拼接图的边的权值;最后在此基础上,提出了一种基于最小路由代价生成树的图像拼接方法,该方法通过计算拼接图的最小路由代价生成树来确定所有图像的全局位置,并用来生成全景图像。实验结果表明,该方法可获得高质量的全景图像。

References

[1]  Gledhill D, Tian Gui-yun, Taylor D, et al. Panoramic imaging--A review [J]. Computers and Graphics,2003,27 ( 3 ) : 435-445.
[2]  Zitova B, Flusser J. Image registration methods : A survey [J]. Image and Vision Computing, 2003,21 ( 11 ) : 977-1000.
[3]  Brown L G. A survey of image registration techniques [J]. ACM Computing Surveys, 1992, 24(4) : 325-376.
[4]  Chert S E. Quick-Time VR-An image-based approach to virtual environment navigation [ A ] . In: Proceedings of the 22nd Annual Conference on Computer Graphics and Interactive Techniques [C], Los Angeles, CA, USA, 1995: 29-38.
[5]  Skerl D, Likar B, Pernug F. A protocol for evaluation of similarity measures for rigid registration [J]. IEEE Transactions on Medical Imaging, 2006, 25(6) : 779-791.
[6]  Thevenaz P, Ruttimann U E, Unser M. A pyramid approach to subpixel registration based on intensity [J]. IEEE Transactions on Image Processing, 1998, 7( 1 ) : 27-41.
[7]  Xu P, Yao D Z. A study on medical image registration by mutual information with pyramid data structure [J]. Computers in Biology and Medicine, 2007, 37 (3) : 320-327.
[8]  Barnea D I, Silverman H F. A class of algorithms for fast digital image registration [J]. IEEE Transactions on Computer, 1972, 21 (2) : 179-186.
[9]  Kim D H, Yoon Y I, Choi J S. An efficient method to build panoramic image mosaics [J]. Pattern Recognition Letters, 2003, 24(14) : 2421-2429.
[10]  Kang S B, Weiss R. Characterization of errors in compositing panoramic images [J]. Computer Vision and Image Understanding, 1999, 73(2): 269-280.
[11]  McLauchlan P F, Jaenicke A. Image mosaicing using sequential bundle adjustment [J]. Image and Vision Computing, 2002, 20 (9) : 751-759.
[12]  Xiong Y, Turkowski K. Registration, calibration and blending in creating high quality panoramas [ A ] . In: Proceedings of the 4th IEEE Workshop on Applications of Computer Vision [C], Princeton, New Jersey, USA, 1998: 69-74.
[13]  Hsu S, Sawhney H S, Kumar R. Automated mosaics via topology inference [J].IEEE Computer Graphics and Applications, 2002, 22(2) : 44-54.
[14]  Szeliski R, Shum H Y. Creating full view panoramic image mosaics and environment maps [ A ] . In: Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques [C], Atlanta, Georgia, USA, 1997 : 251-257.
[15]  Park J S, Chang D H, Park S G. Automatic generation of photorealistic mosaic image [A]. In : Proceedings of I st IEEE International Workshop on Biologically Motivated Computer Vision [C], Seoul, Korea, 2000: 243-252.
[16]  Davis J. Mosaics of scenes with moving objects [ A ]. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition [C] , Santa Barbara, California, USA, 1998 : 354-360.
[17]  Shum H Y, Szeliski R. Systems and experiment paper: Construction of panoramic image mosaics with global and local alignment [J]. International Journal of Computer Vision, 2000, 36 (2) : 101-130.
[18]  Zhou H. Graph-based global optimization for the registration of a set of images [ A ]. In: Advances in Image and Video Technology [C],Heidelberg, Berlin : Springer, 2006 : 1206-1214.
[19]  Choe T E, Cohen I. Registration of muhimodal fluoresce in images sequence of the retina [ A ]. In: Proceedings of the 10th IEEE International Conference on Computer Vision [C] , Beijing, China, 2005, 1: 106-113.
[20]  Nikolaidis N, Pitas I. Computationally efficient image mosaicing using spanning tree representations [A]. In: Proceedings of the 10th Panhellenic Conference on lnformatics [C], Volas, Greece, 2005: 716-724.
[21]  更多...
[22]  Thomas H C, Charles E L, Ronald L R, et al. Introduction to Algorithms (Second Edition) [M]. Cambridge, MA, USA: MIT Press, 2001.
[23]  Sawhney H S, Hsu S, Kumar R. Robust video mosaicing through topology inference and local to global alignment [A]. In : Proceedings of the 5th European Conference on Computer Vision [C], Freiburg, Germany, 1998, 11: 103-119.
[24]  Kang E Y, Cohen I, Medioni G. A graph-based global registration for 2D mosaics [A]. In: Proceedings of the 15th International Conference on Pattern Recognition [C]. Bareelrona, Catalonia, Spain, 2000: 257-260.
[25]  Kim D W, Hong K S. Fast global registration for image mosaicing [A]. In: Proceedings of the International Conference on Image Processing [C], Barcelona, Catalonia, Spain, 2003,11 : 295-298.
[26]  Marzotto R, Fusiello A, Murino V. High resolution video mosaicing with global alignment [A]. In: Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition [C]. Washington, DC, USA, 2004, 1:692-698.
[27]  Wu B Y, Chao K M. Spanning Trees and Optimization Problems [M]. New York, USA : Chapman & Hall/CRC, 2003 : 41-84.
[28]  Choe T E, Cohen I, Lee M, et al. Optimal global mosaic generation from retinal images [A], In: Proceedings of the 18th International Conference on Pattern Recognition [C], Hong Kong, China, 2006 : 681 - 684.
[29]  Zhang P, Milios E E, Gu J. Graph-based automatic consistent image mosaicking [A]. In: Proceedings of the 2004 IEEE International Conference on Robotics and Biomimetics [C], Shenyang, China,2004 : 558-563.
[30]  邬伦 刘瑜 张晶等.地理信息系统原理、方法及应用[M].北京:科学出版社,2001.95-96.
[31]  龚咏喜 刘瑜 谢玉波等.基于分块-空间聚类的图像配准算法[J].计算机工程与应用,2007,43(29):53-55.
[32]  Huang Y W, Chen C Y, Tsai C H. Survey on block matching motion estimation algorithms and architectures with new results [J]. Journal of VLSI Signal Processing, 2006, 42(3): 297-320.
[33]  HANJ KAMBERM.数据挖掘:概念与技术[M].北京:机械工业出版社,2001.
[34]  Garey M R & Johnson D S. Computer and Intractability: A Guide to the Theory of NP-Completeness [M]. New York, USA: Freeman, 1979.
[35]  Wu F Y. Number of spanning trees on a lattice [J]. Journal of Physics A : Mathematical and General, 1977, 10 (6) : L113- L115.
[36]  Wong R. Womt-case analysis of network design problem heuristics [J]. SIAM Journal on Algebraic and Discrete Methods, 1980, 1 (1) : 51-63.
[37]  Wu B Y, Lancia G, Bafna V, et al. A polynomial-time approximation scheme for minimum routing cost spanning tree [J]. SIAM Society for Industrial and Applied Mathema tics Journal on Computing, 1999, 29(3) : 761-778.
[38]  Fischetti M, Lancia G, Serafini P. Exact algorithms for minimum routing cost trees [J]. Networks, 2002, 39(3) : 161-173.
[39]  何斌 马天予 王运坚.Visual C++数字图像处理(第二版)[M].北京:人民邮电出版社,2002.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133