Dimensionality estimation, manifold learning and function approximation using tensor voting

Philippos Mordohai, Gérard Medioni

Research output: Contribution to journalArticlepeer-review

93 Scopus citations

Abstract

We address instance-based learning from a perceptual organization standpoint and present methods for dimensionality estimation, manifold learning and function approximation. Under our approach, manifolds in high-dimensional spaces are inferred by estimating geometric relationships among the input instances. Unlike conventional manifold learning, we do not perform dimensionality reduction, but instead perform all operations in the original input space. For this purpose we employ a novel formulation of tensor voting, which allows an N-D implementation. Tensor voting is a perceptual organization framework that has mostly been applied to computer vision problems. Analyzing the estimated local structure at the inputs, we are able to obtain reliable dimensionality estimates at each instance, instead of a global estimate for the entire data set. Moreover, these local dimensionality and structure estimates enable us to measure geodesic distances and perform nonlinear interpolation for data sets with varying density, outliers, perturbation and intersections, that cannot be handled by state-of-the-art methods. Quantitative results on the estimation of local manifold structure using ground truth data are presented. In addition, we compare our approach with several leading methods for manifold learning at the task of measuring geodesic distances. Finally, we show competitive function approximation results on real data.

Original languageEnglish
Pages (from-to)411-450
Number of pages40
JournalJournal of Machine Learning Research
Volume11
StatePublished - 2010

Keywords

  • Dimensionality estimation
  • Function approximation
  • Geodesic distance
  • High-dimensional processing
  • Manifold learning
  • Tensor voting

Fingerprint

Dive into the research topics of 'Dimensionality estimation, manifold learning and function approximation using tensor voting'. Together they form a unique fingerprint.

Cite this