首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于形态学与Dijkstra相结合的影像镶嵌线方法
引用本文:桂新,程朋根,聂运菊,郑守住,冯圣峰.基于形态学与Dijkstra相结合的影像镶嵌线方法[J].测绘与空间地理信息,2015(7):18-20.
作者姓名:桂新  程朋根  聂运菊  郑守住  冯圣峰
作者单位:1. 江西省基础测绘院,江西南昌330209; 东华理工大学测绘工程学院,江西南昌330013;2. 东华理工大学测绘工程学院,江西南昌,330013;3. 东华理工大学测绘工程学院,江西南昌330013; 桂林理工大学广西空间信息与测绘重点实验室,广西桂林541004
基金项目:国家自然科学基金项目(41161069);广西空间信息与测绘重点实验室课题
摘    要:镶嵌线自动搜索是实现影像重叠区域无缝拼接的关键步骤,而目前随着无人机技术的日益成熟及无人机能够快速获取高清的遥感图像数据,迫切需要寻找一种既有质量、又有效率的镶嵌线自动搜索的方法。本文提出一种基于形态学与Dijkstra相结合的影像镶嵌线方法,该方法首先确定两幅影像重叠部分的差分影像,然后在差分影像的基础上进行形态学膨胀处理,同时根据稀疏矩阵构建八邻域稀疏矩阵,最后使用Dijkstra算法在差分影像上进行镶嵌线的自动搜索,得到最优路径镶嵌线。实验结果证明,改进算法与未经过形态学处理的Dijkstra方法相比,其自动搜索镶嵌线过程在耗时少(耗时为3.72 s)的情况下,能够很好地避开房屋等高亮度区。

关 键 词:镶嵌线  数字正射影像(DOM)  Dijkstra算法

Image Mosaci king Seamline ApproachB ased on the Morphological and Dijksstra Algorithm
GUI Xin,CHENG Peng-gen,NIE Yun-ju,ZHENG Shou-zhu,FENG Sheng-feng.Image Mosaci king Seamline ApproachB ased on the Morphological and Dijksstra Algorithm[J].Geomatics & Spatial Information Technology,2015(7):18-20.
Authors:GUI Xin  CHENG Peng-gen  NIE Yun-ju  ZHENG Shou-zhu  FENG Sheng-feng
Abstract:Automatic mosaic seamline selection is the critical process of achieving seamless mosaic of images overlapping areas .Also, we easily, with the growing maturity of Unmanned Aerial Vehicle (Called UAV),obtain high resolution images.Therefore, we should have to search a method which includes not only quality but also efficient of automatic selection of seamline becomes an urgent need . This article presents an improved approach based on the morphological and Dijkstra algorithm combination .The approach firstly deter-mines the differential image of both overlapping area , then the morphological expansion is applied on the differential image .Secondly , eight neighborhood sparse matrix is built on the differential image while according to sparse matrix theory .Finally, use Dijkstra algo-rithm to automatically search for seamline we get which is the optimal path seamline .Experimental results show that the improved ap-proach which compares with the Dijkstra approach without the morphological processing , it needs less time-consuming (takes 3.72 s) and it can effectively avoid traversing high brightness areas such as building , etc.
Keywords:seamline  DOM  Dijkstra algorithm
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号