Fast Brain Matching with Spectral Correspondence

被引:0
|
作者
Lombaert, Herve [1 ,2 ]
Grady, Leo [2 ]
Polimeni, Jonathan R. [3 ]
Cheriet, Farida [1 ]
机构
[1] Ecole Polytech Montreal, Montreal, PQ, Canada
[2] Siemens Corp Res, Princeton, NJ USA
[3] Massachusetts Gen Hosp, Harvard Med Sch, Athinoula A Martinos Ctr Biomed Imagi, Dept Radiol, Charlestown, MA USA
来源
基金
加拿大自然科学与工程研究理事会;
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Brain matching is an important problem in neuroimaging studies. Current surface-based methods for cortex matching and at-lasing, although quite accurate, can require long computation times. Here we propose an approach based on spectral correspondence, where spectra of graphs derived from the surface model meshes are matched. Cerebral cortex matching problems can thus benefit from the tremendous speed advantage of spectral methods, which are able to calculate a cortex matching in seconds rather than hours. Moreover, spectral methods are extended in order to use additional information that can improve matching. Additional information, such as sulcal depth, surface curvature, and cortical thickness can be represented in a flexible way into graph node weights (rather than only into graph edge weights) and as extra embedded coordinates. In control experiments, cortex matching becomes almost perfect when using additional information. With real data from 12 subjects, the results of 288 correspondence maps are 88% equivalent to (and strongly correlated with) the correspondences computed with FreeSurfer, a leading computational tool used for cerebral cortex matching. Our fast and flexible spectral correspondence method could open new possibilities for brain studies that involve different types of information and that were previously limited by the computational burden.
引用
收藏
页码:660 / 673
页数:14
相关论文
共 50 条
  • [21] Guided Matching Based on Statistical Optical Flow for Fast and Robust Correspondence Analysis
    Maier, Josef
    Humenberger, Martin
    Murschitz, Markus
    Zendel, Oliver
    Vincze, Markus
    COMPUTER VISION - ECCV 2016, PT VII, 2016, 9911 : 101 - 117
  • [22] SPECTRAL ANGLE SENSITIVE FOREST: A SOLUTION FOR FAST HYPERSPECTRAL MATCHING
    Zhou, Yuan
    Fang, Shenghui
    Fang, Xinwei
    2012 4TH WORKSHOP ON HYPERSPECTRAL IMAGE AND SIGNAL PROCESSING (WHISPERS), 2012,
  • [23] A quadratic programming based cluster correspondence projection algorithm for fast point matching
    Lian, Wei
    Zhang, Lei
    Liang, Yan
    Pan, Quan
    COMPUTER VISION AND IMAGE UNDERSTANDING, 2010, 114 (03) : 322 - 333
  • [24] A fast and efficient mathematical solution for matching brain volumes
    Juan, MC
    Montesinos, A
    Grau, V
    Monserrat, C
    Alcañiz, M
    CARS 2000: COMPUTER ASSISTED RADIOLOGY AND SURGERY, 2000, 1214 : 1012 - 1012
  • [25] Persistent Reeb Graph Matching for Fast Brain Search
    Shi, Yonggang
    Li, Junning
    Toga, Arthur W.
    MACHINE LEARNING IN MEDICAL IMAGING (MLMI 2014), 2014, 8679 : 306 - 313
  • [26] Correspondence, Matching and Recognition
    Burghardt, Tilo
    Damen, Dima
    Mayol-Cuevas, Walterio
    Mirmehdi, Majid
    INTERNATIONAL JOURNAL OF COMPUTER VISION, 2015, 113 (03) : 161 - 162
  • [27] Correspondence, Matching and Recognition
    Tilo Burghardt
    Dima Damen
    Walterio Mayol-Cuevas
    Majid Mirmehdi
    International Journal of Computer Vision, 2015, 113 : 161 - 162
  • [28] APPROXIMATELY ISOMETRIC SHAPE CORRESPONDENCE BY MATCHING POINTWISE SPECTRAL FEATURES AND GLOBAL GEODESIC STRUCTURES
    Dubrovina, Anastasia
    Kimmel, Ron
    ADVANCES IN DATA SCIENCE AND ADAPTIVE ANALYSIS, 2011, 3 (1-2) : 203 - 228
  • [29] A Probabilistic Spectral Graph Matching Algorithm for Robust Correspondence between Lunar Surface Images
    Yang, Xu
    Liu, Chuan-Kai
    Liu, Zhi-Yong
    Qiao, Hong
    Wang, Bao-Feng
    Wang, Zi-Dong
    2014 11TH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION (WCICA), 2014, : 385 - 390
  • [30] Fast and Robust 3D Correspondence Matching and Its Application to Volume Registration
    Tajima, Yuichiro
    Fudano, Kinya
    Ito, Koichi
    Aoki, Takafumi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (04): : 826 - 835