The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.11 - November (2006 vol.28)
pp: 1784-1797
S. Lafon , Google Inc., Mountain View, CA
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
INDEX TERMS
Pixel, Geometry, Data analysis, Embedded computing, Data assimilation, Image sequences, Graph theory, Machine learning algorithms, Markov processes, Machine learning,image databases., Pattern matching, graph theory, graph algorithms, Markov processes, machine learning, data mining
CITATION
S. Lafon, Y. Keller, R.R. Coifman, "Data Fusion and Multicue Data Matching by Diffusion Maps", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol.28, no. 11, pp. 1784-1797, November 2006, doi:10.1109/TPAMI.2006.223
18 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool