Advertisement

Unsupervised Learning Using the Tensor Voting Graph

  • Shay Deutsch
  • Gérard Medioni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9087)

Abstract

Tensor Voting is a local, non parametric method that provides an efficient way to learn the complex geometric manifold structure under a significant amount of outlier noise. The main limitation of the Tensor Voting framework is that it is strictly a local method, thus not efficient to infer the global properties of complex manifolds. We therefore suggest constructing a unique graph which we call the Tensor Voting Graph, in which the affinity is based on the contribution of neighboring points to a point local tangent space estimated by Tensor Voting. The Tensor Voting Graph compactly and effectively represents the global structure of the underlying manifold. We experimentally demonstrate that we can accurately estimate the geodesic distance on complex manifolds, and substantially outperform all state of the art competing approaches, especially when outliers are present. We also demonstrate our method’s superior ability to segment manifolds, first on synthetic data, then on standard data sets for a motion segmentation, with graceful degradation in the presence of noise.

Keywords

Tensor voting Manifold learning Intersecting manifolds 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Belkin, M., Niyogi, P.: Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15(6), 1373–1396 (2003)CrossRefzbMATHGoogle Scholar
  2. 2.
    Coifman, R.R., Lafon, S., Lee, A.B., Maggioni, M., Warner, F., Zucker, S.: Geometric diffusions as a tool for harmonic analysis and structure definition of data: diffusion maps. In: Proceedings of the National Academy of Sciences, pp. 7426–7431 (2005)Google Scholar
  3. 3.
    Dijkstra, E.: Communication with an Automatic Computer. Ph.D thesis, University of Amsterdam (1959)Google Scholar
  4. 4.
    Donoho, D., Grimes, C.: Hessian eigenmaps: Locally linear embedding techniques for high dimensional data. Proceedings of the National Academy of Sciences of the United States of America 100, 5591–5596 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Elhamifar, E., Vidal, R.: Sparse subspace clustering. In: CVPR, pp. 2790–2797 (2009)Google Scholar
  6. 6.
    Gong, D., Zhao, X., Medioni, G.: Robust multiple manifold structure learning. In: ICML (2012)Google Scholar
  7. 7.
    Mordohai, P., Medioni, G.: Tensor Voting: A Perceptual Organization Approach to Computer Vision and Machine Learning. Morgan & Claypool Publishers (2006)Google Scholar
  8. 8.
    Mordohai, P., Medioni, G.: Dimensionality estimation, manifold learning and function approximation using tensor voting. Journal of Machine Learning Research 11, 411–450 (2010)zbMATHMathSciNetGoogle Scholar
  9. 9.
    Ng, A., Jordan, M., Weiss, Y.: On spectral clustering: analysis and an algorithm. In: Advances in Neural Information Processing Systems, pp. 849–856 (2001)Google Scholar
  10. 10.
    Niyogi, P., Smale, S., Weinberger, S.: Finding the homology of submanifolds with high confidence from random samples. Discrete & Computational Geometry 39(1), 419–441 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Roweis, S., Saul, L.: Nonlinear dimensionality reduction by locally linear embedding. SCIENCE 290, 2323–2326 (2000)CrossRefGoogle Scholar
  12. 12.
    Singer, A., Wu, H.: Vector diffusion maps and the connection laplacian. Communications on Pure and Applied Mathematics 65(8), 1067–1144 (2012)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Tenenbaum, J., de Silva, V., Langford, J.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290(5500), 2319–2323 (2000)CrossRefGoogle Scholar
  14. 14.
    Vidal, R., Ma, Y., Sastry, S.: Generalized principal component analysis (gpca) (2003)Google Scholar
  15. 15.
    Wang, Y., Jiang, Y., Wu, Y., Zhou, Z.: Spectral clustering on multiple manifolds. IEEE Transactions on Neural Networks 22(7), 1149–1161 (2011)CrossRefGoogle Scholar
  16. 16.
    Zhang, Z., Zha, H.: Principal manifolds and nonlinear dimensionality reduction via tangent space alignment. SIAM Journal on Scientific Computing 26(1), 313–338 (2005)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Computer Science DepartmentInstitute for Robotics and Intelligent Systems, University of Southern CaliforniaLos AngelesUSA

Personalised recommendations