TY - JOUR
T1 - Improving geodesic distance estimation based on locally linear assumption
AU - Meng, Deyu
AU - Leung, Yee
AU - Xu, Zongben
AU - Fung, Tung
AU - Zhang, Qingfu
PY - 2008/5/1
Y1 - 2008/5/1
N2 - 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.
AB - 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.
KW - Geodesic distance estimation
KW - Isometric feature mapping
KW - Neighborhood graph
KW - Nonlinear dimensionality reduction
UR - http://www.scopus.com/inward/record.url?scp=40849083398&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-40849083398&origin=recordpage
U2 - 10.1016/j.patrec.2008.01.005
DO - 10.1016/j.patrec.2008.01.005
M3 - RGC 21 - Publication in refereed journal
SN - 0167-8655
VL - 29
SP - 862
EP - 870
JO - Pattern Recognition Letters
JF - Pattern Recognition Letters
IS - 7
ER -