Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 1784-1797 |
Number of pages | 14 |
Journal | IEEE Transactions on Pattern Analysis and Machine Intelligence |
Volume | 28 |
Issue number | 11 |
DOIs | |
State | Published - Nov 2006 |
Externally published | Yes |
Keywords
- Data mining
- Graph algorithms
- Graph theory
- Image databases
- Machine learning
- Markov processes
- Pattern matching