Please wait a minute...
 首页  期刊介绍 期刊订阅 联系我们 横山亮次奖 百年刊庆
 
最新录用  |  预出版  |  当期目录  |  过刊浏览  |  阅读排行  |  下载排行  |  引用排行  |  横山亮次奖  |  百年刊庆
清华大学学报(自然科学版)  2014, Vol. 54 Issue (5): 568-574    
  论文 本期目录 | 过刊浏览 | 高级检索 |
基于超边图匹配的视网膜眼底图像配准算法
邓可欣()
 
Retinal image registration based on hyper-edge graph matching
Kexin DENG()
School of Electronic Engineering, Xidian University, Xi'an 710071, China
全文: PDF(2453 KB)   HTML
输出: BibTeX | EndNote (RIS)       背景资料
文章导读  
摘要 

视网膜眼底图像配准是临床眼科疾病诊断和治疗中的一个关键环节。针对眼底图像配准过程中大范围视场变化和过分割结构噪声等问题,该文提出了一种改进的基于图的视网膜图像血管匹配方法。将血管交叉点表示成图的顶点,把特征点间沿血管路径的相邻关系表示成边,进而在视网膜血管结构图中构造路径超边来刻画更高阶多元特征关系。在此基础上,实现了一种全自动的视网膜眼底图像配准算法。包括: 第一步,通过多尺度Gabor滤波算法来检测和提取视网膜血管网络; 第二步,利用一种高效的谱松弛匹配算法来求解两个路径超边图的顶点匹配对应关系。最后,通过特征匹配召回率统计和配准的血管中线距离误差两方面的实验,证明该文提出算法是有效和准确的。

服务
把本文推荐给朋友
加入引用管理器
E-mail Alert
RSS
作者相关文章
邓可欣
关键词 图匹配超边谱松弛匹配血管检测视网膜图像配准    
Abstract

Retinal fundus image registration is a key step in clinical eye disease diagnosis and treatment. Targeting the difficulties in dealing with pair of images with large field of view differences or with great structural noises caused by over-segmentation, this paper presents an improved graph-based algorithm to match retinal vessel networks by utilizing higher-order relations constructed from the vessel structural graphs whose nodes represent vascular bifurcations with the edges describing relations between feature points. The method performs in a fully automatic fashion, with a multi-scale Gabor filter first employed for detection and extraction of retinal vessels and with the correspondences then recovered between two pathwise hyper-edge graphs using an efficient pairwise spectral matching scheme. Experimental evaluation shows that the developed method is effective and accurate in terms of the feature recall rate and the vascular CEM distance.

Key wordsgraph matching    hyper-edge    spectral matching    vessel detection    retinal image registration
收稿日期: 2014-03-31      出版日期: 2014-05-15
ZTFLH:     
基金资助: 
引用本文:   
邓可欣. 基于超边图匹配的视网膜眼底图像配准算法[J]. 清华大学学报(自然科学版), 2014, 54(5): 568-574.
Kexin DENG. Retinal image registration based on hyper-edge graph matching. Journal of Tsinghua University(Science and Technology), 2014, 54(5): 568-574.
链接本文:  
http://jst.tsinghuajournals.com/CN/  或          http://jst.tsinghuajournals.com/CN/Y2014/V54/I5/568
  在较强分割噪声影响下的血管结构图模型匹配结果
  不同尺度下Gabor血管检测结果图像
  多分辨率血管检测分割结果
  超边图模型及其二阶简单图近似
  视网膜图像血管路径超边图构造与匹配图示
测试样本
序列
噪声率 匹配召回率
GA BGA SM HE-SM
R01-02 0.45 0.43 0.54 0.49 0.54
R03-04 0.42 0.67 0.58 0.23 0.82
R05-06 0.28 0.44 0.68 0.73 0.76
R07-08 0.32 0.26 0.61 0.79 0.65
R09-10 0.23 0.42 0.75 0.83 0.86
R11-12 0.55 0.13 0.30 0 0.70
R13-14 0.49 0.26 0.55 0.53 0.77
R15-16 0.53 0.11 0.33 0.44 0.81
均值 0.41 0.34 0.54 0.51 0.74
  视网膜血管结构图匹配算法对比实验
  视网膜眼底图像配准示例
测试样本
序列
图像交
叠率/%
血管中线距离/像素
GM-ICP HE-GM-ICP GDB-ICP
R01-02 63.02 0.68 0.68 0.71
R03-04 64.72 0.79 0.77 0.74
R05-06 85.49 0.74 0.74 0.73
R07-08 80.98 1.05 1.05 1.02
R09-10 83.00 0.66 0.65 0.64
R11-12 51.02 0.96 0.89 0.85
R13-14 51.62 1.22 1.14 1.03
R15-16 63.17 0.86 0.81 0.80
  视网膜眼底图像配准对比实验
[1] DENG Kexin, TIAN Jie, ZHENG Jian, et al.Retinal fundus image registration via vascular structure graph matching[J]. International Journal of Biomedical Imaging, 2010, doi:
doi: 10.1155/2010/906067
[2] Legg P, Rosin P, Marshall D, et al.Improving accuracy and efficiency of mutual information for multi-modal retinal image registration using adaptive probability density estimation[J]. Computerized Medical Imaging and Graphics, 2013, 37(7-8): 597-606.
[3] TSAI Chialing, LI Chunyi, YANG Gehua, et al.The edge-driven dual-bootstrap iterative closest point algorithm for registration of multimodal fluorescein angiogram sequence[J]. IEEE Transactions on Medical Imaging, 2010, 29(3): 636-649.
[4] Stewart C, TSAI Chialing, Roysam B. The dual-bootstrap iterative closest point algorithm with application to retinal image registration[J]. IEEE Transactions on Medical Imaging, 2003, 22(11): 1379-1394.
[5] ZHENG Yuanjie, Daniel E, Allan A, et al.Landmark matching based retinal image alignment by enforcing sparsity in correspondence matrix[J]. Medical Image Analysis, 2013, doi:
doi: 10.1016/j.media.2013.09.009
[6] Perez R A, Cabido R, Trucco E, et al.RERBEE: Robust efficient registration via bifurcations and elongated elements applied to retinal fluorescein angiogram sequences[J]. IEEE Transactions on Medical Imaging, 2012, 31(1): 140-150.
[7] Dashtbozorg B, Mendonca A M, Campilho A. An automatic graph-based approach for artery/vein classification in retinal images[J]. IEEE Transactions on Image Processing, 2014, 23(3): 1073-1083.
[8] XU Xiayu, Meindert N, QI Song, et al.Vessel boundary delineation on fundus images using graph-based approach[J]. IEEE Transactions on Medical Imaging, 2011, 30(6): 1184-1191.
[9] Serradell E, Przemyslaw G, Jan K, et al.Robust non-rigid registration of 2d and 3d graphs [C]// IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2012: 996-1003.
[10] Soares J, Leandro J, Cesar R, et al.Retinal vessel segmentation using the 2d gabor wavelet and supervised classification[J]. IEEE Transactions on Medical Imaging, 2006, 25(9): 1214-1222.
[11] Gold S, Rangarajan A. A graduated assignment algorithm for graph matching[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1996, 18(4): 377-388.
[12] Leordeanu M, Hebert M. A spectral technique for correspondence problems using pairwise constraints [C]// IEEE International Conference on Computer Vision. IEEE, 2005: 1482-1489.
[13] Cour T, Srinivasan P, SHI Jianbo. Balanced graph matching [C]// NIPS: Neural Information Processing Systems Foundation. 2006: 313-320.
[14] Schellewald C, Schnörr C. Probabilistic subgraph matching based on convex relaxation [C]// Energy Minimization Methods in Computer Vision and Pattern Recognition. Springer, 2005: 171-186.
[15] Duchenne O, Bach F, Kweon I, et al.A tensor-based algorithm for high-order graph matching[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2011, 33(12): 2383-2395.
[16] Zass R, Shashua A. Probabilistic graph and hypergraph matching [C]// IEEE Conference on Computer Vision and Pattern Recognition. IEEE, 2008: 1-8.
[17] Kang U, Hebert M, Park S. Fast and scalable approximate spectral graph matching for correspondence problems [C]// Information Sciences 220. Online Fuzzy Machine Learning and Data Mining. 2013: 306-318.
[18] CHUI Haili, Rangarajan A. A new point matching algorithm for non-rigid registration[J]. Computer Vision and Image Understanding, 2003, 89(2): 114-141.
[1] 罗之皓, 李劲, 岳昆, 毛钰源, 刘琰. 知识图谱的Top-k摘要模式挖掘方法[J]. 清华大学学报(自然科学版), 2019, 59(3): 194-202.
[2] 兰超, 张勇, 邢春晓. 分布式Top-k子图匹配技术[J]. 清华大学学报(自然科学版), 2016, 56(8): 871-877.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
版权所有 © 《清华大学学报(自然科学版)》编辑部
本系统由北京玛格泰克科技发展有限公司设计开发 技术支持:support@magtech.com.cn