Data fusion and multicue data matching by diffusion maps

被引:227
作者
Lafon, Stephane
Keller, Yosi
Coifman, Ronald R.
机构
[1] Google Inc, Mountain View, CA 94043 USA
[2] Yale Univ, Dept Appl Math, New Haven, CT 06511 USA
关键词
pattern matching; graph theory; graph algorithms; Markov processes; machine learning; data mining; image databases;
D O I
10.1109/TPAMI.2006.223
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Data fusion and multicue data matching are fundamental tasks of high-dimensional data analysis. In this paper, we apply the recently introduced diffusion framework to address these tasks. Our contribution is three-fold: First, we present the Laplace-Beltrami approach for computing density invariant embeddings which are essential for integrating different sources of data. Second, we describe a refinement of the Nystrom extension algorithm called "geometric harmonics." We also explain how to use this tool for data assimilation. Finally, we introduce a multicue data matching scheme based on nonlinear spectral graphs alignment. The effectiveness of the presented schemes is validated by applying it to the problems of lipreading and image sequence alignment.
引用
收藏
页码:1784 / 1797
页数:14
相关论文
共 42 条
[1]  
AHARON M, IN PRESS INT J COMPU
[2]   Graph matching using spectral embedding and alignment [J].
Bai, X ;
Yu, H ;
Hancock, ER .
PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION, VOL 3, 2004, :398-401
[3]   Towards a theoretical foundation for Laplacian-based manifold methods [J].
Belkin, M ;
Niyogi, P .
LEARNING THEORY, PROCEEDINGS, 2005, 3559 :486-500
[4]  
Belkin M, 2002, ADV NEUR IN, V14, P585
[5]   Laplacian eigenmaps for dimensionality reduction and data representation [J].
Belkin, M ;
Niyogi, P .
NEURAL COMPUTATION, 2003, 15 (06) :1373-1396
[6]  
Belkin M., 2004, TR200406 U CHIC
[7]  
BENGIO Y, 2003, 1238 U MONTR
[8]  
Borg I., 1997, Modern Multidimensional Scaling
[9]  
BREGLER C, 1998, COMPUTER VISION MAN
[10]  
BREGLER C, 1993, P IEEE INT C AC SPEE