Sciweavers

817 search results - page 35 / 164
» Robust Euclidean embedding
Sort
View
ICCV
2005
IEEE
15 years 3 months ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann
ICRA
2010
IEEE
165views Robotics» more  ICRA 2010»
14 years 7 months ago
Robust hand-eye calibration for computer aided medical endoscopy
Endoscopic camera for surgical navigation and 3D visualization requires precise and stable estimates of the calibration parameters. The estimation of the hand-eye transform between...
Abed Malti, João P. Barreto
VLDB
2002
ACM
126views Database» more  VLDB 2002»
14 years 9 months ago
Exact Indexing of Dynamic Time Warping
The problem of indexing time series has attracted much interest. Most algorithms used to index time series utilize the Euclidean distance or some variation thereof. However, it has...
Eamonn J. Keogh
ADCM
2008
136views more  ADCM 2008»
14 years 9 months ago
Learning and approximation by Gaussians on Riemannian manifolds
Learning function relations or understanding structures of data lying in manifolds embedded in huge dimensional Euclidean spaces is an important topic in learning theory. In this ...
Gui-Bo Ye, Ding-Xuan Zhou
ISAAC
2003
Springer
96views Algorithms» more  ISAAC 2003»
15 years 2 months ago
On the Geometric Dilation of Finite Point Sets
Let G be an embedded planar graph whose edges may be curves. For two arbitrary points of G, we can compare the length of the shortest path in G connecting them against their Euclid...
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Kl...