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

基于图割的图像匹配算法
引用本文:王年,范益政,鲍文霞,韦穗,梁栋.基于图割的图像匹配算法[J].电子学报,2006,34(2):232-236.
作者姓名:王年  范益政  鲍文霞  韦穗  梁栋
作者单位:安徽大学计算智能与信号处理教育部重点实验室,安徽合肥,230039;安徽大学计算智能与信号处理教育部重点实验室,安徽合肥,230039;安徽大学数学系,安徽合肥,230039
基金项目:中国科学院资助项目,安徽省教育厅自然科学基金,安徽大学校科研和教改项目
摘    要:用标号表示视差,建立能量函数,把匹配问题转化为能量函数最小化问题;通过构造网络,使能量与网络的割的容量相联系;利用图的网络流理论给出能量函数的最小化,从而获得图像匹配的视差数据.与目前已有基于图割的匹配算法相比,本算法将标号从1维向量推广到2维向量,适用于更一般情形下的视觉匹配,并且在全局上获得能量函数最小.实验结果表明,所提的匹配算法准确率较高.

关 键 词:匹配  能量函数  图割  网络流  视差
文章编号:0372-2112(2006)02-0232-05
收稿时间:2005-01-17
修稿时间:2005-01-172005-05-26

An Images Matching Algorithm Based on Graph Cuts
WANG Nian,FAN Yi-zheng,BAO Wen-xia,WEI Sui,LIANG Dong.An Images Matching Algorithm Based on Graph Cuts[J].Acta Electronica Sinica,2006,34(2):232-236.
Authors:WANG Nian  FAN Yi-zheng  BAO Wen-xia  WEI Sui  LIANG Dong
Affiliation:1. Key Laboratory of Intelligent Computing & Signal Processing,Anhui University,Ministry of Education, Hefei,Anhui 230039,China;2. Department of Mathematics,Anhui University,Hefei,Anhui 230039,China
Abstract:Label is denoted by disparity and the energy fimction is established. Then the problem of matching can be transformed into that of energy function minimization. A network is constructed such that the energies can be related to the capacities of the cuts of the network. Finally, the minimal energy is obtained by the network-flows theory, and hence the disparity data are solved. Comparing with some known algorithms based on graph cuts, the algorithm in this paper extends the label from 1 dimension vector to 2 dimension vector, and adapts vision matching of more general conditions ;furthermore the algorithm can gain the minimization in global. Experimental results show that the algorithm has a high accuracy.
Keywords:matching  energy function  graph cuts  network flow  disparity
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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