Improving geodesic distance estimation based on locally linear assumption

Deyu Meng, Yee Leung, Zongben Xu, Tung Fung, Qingfu Zhang

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

15 Citations (Scopus)

Abstract

Geodesic distance estimation for data lying on a manifold is an important issue in many applications of nonlinear dimensionality reduction. In this paper, a method aiming at improving the precision of geodesic distance estimation is proposed. The method is constructed on the basic principle, locally linear assumption, underlying the manifold data. It presumes that the locally linear patch, expressed as a convex combination of neighbors of a vertex, approximately resides on the manifold, as well as the local neighborhood edge does. The proposed method essentially extends the search area from local edges, employed by existing methods, to local patches. This naturally leads to a more accurate geodesic distance estimation. An efficient algorithm for the method is constructed, and its computational complexity is also analyzed. Experiment results also show that the proposed method outperforms the existing methods in geodesic distance estimation. © 2008 Elsevier B.V. All rights reserved.
Original languageEnglish
Pages (from-to)862-870
JournalPattern Recognition Letters
Volume29
Issue number7
DOIs
Publication statusPublished - 1 May 2008
Externally publishedYes

Research Keywords

  • Geodesic distance estimation
  • Isometric feature mapping
  • Neighborhood graph
  • Nonlinear dimensionality reduction

Fingerprint

Dive into the research topics of 'Improving geodesic distance estimation based on locally linear assumption'. Together they form a unique fingerprint.

Cite this