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 条
  • [1] Fast and scalable approximate spectral graph matching for correspondence problems
    Kang, U.
    Hebert, Martial
    Park, Soonyong
    INFORMATION SCIENCES, 2013, 220 : 306 - 318
  • [2] Spectral correspondence for point pattern matching
    Carcassoni, M
    Hancock, ER
    PATTERN RECOGNITION, 2003, 36 (01) : 193 - 204
  • [3] A graph-spectral approach to correspondence matching
    Robles-Kelly, A
    Hancock, ER
    16TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITON, VOL IV, PROCEEDINGS, 2002, : 176 - 179
  • [4] Eigenvector Sign Correction for Spectral Correspondence Matching
    Haseeb, Muhammad
    Hancock, Edwin R.
    IMAGE ANALYSIS AND PROCESSING (ICIAP 2013), PT II, 2013, 8157 : 41 - 50
  • [5] A graph-spectral approach to correspondence matching
    Robles-Kelly, Antonio
    Hancock, Edwin R.
    Proceedings - International Conference on Pattern Recognition, 2002, 4 : 176 - 179
  • [6] Joint Spectral Correspondence for Disparate Image Matching
    Bansal, Mayank
    Daniilidis, Kostas
    2013 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2013, : 2802 - 2809
  • [7] Spectral Correspondence Method for Fingerprint Minutia Matching
    Fu, Xiang
    Liu, Chongjin
    Bian, Junjie
    Feng, Jufu
    2012 21ST INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR 2012), 2012, : 1743 - 1746
  • [8] Spectral correspondence method for fingerprint minutia matching
    Department of Machine Intelligence, School of Electronics Engineering and Computer Science, Peking University, Peking, 100871, China
    Proc. Int. Conf. Pattern Recognit., 1600, (1743-1746):
  • [9] Point pattern matching with robust spectral correspondence
    Carcassoni, M
    Hancock, ER
    IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, VOL I, 2000, : 649 - 655
  • [10] A Fast Block Matching Algorthim for Stereo Correspondence
    Tao, Tangfei
    Koo, Ja Choon
    Choi, Hyouk Ryeol
    2008 IEEE CONFERENCE ON CYBERNETICS AND INTELLIGENT SYSTEMS, VOLS 1 AND 2, 2008, : 215 - 218