Sciweavers

1337 search results - page 13 / 268
» Fast computation of distance estimators
Sort
View
SCALESPACE
2005
Springer
14 years 1 months ago
Texture Mapping via Spherical Multi-dimensional Scaling
Abstract. We present a technique for texture mapping arbitrary sphere-like surfaces with minimal distortions by spherical embedding. The embedding is computed using spherical multi...
Asi Elad (Elbaz), Yosi Keller, Ron Kimmel
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
11 years 10 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu
PODS
2005
ACM
127views Database» more  PODS 2005»
14 years 7 months ago
FTW: fast similarity search under the time warping distance
Time-series data naturally arise in countless domains, such as meteorology, astrophysics, geology, multimedia, and economics. Similarity search is very popular, and DTW (Dynamic T...
Yasushi Sakurai, Masatoshi Yoshikawa, Christos Fal...
ICCV
2001
IEEE
14 years 9 months ago
The Earth Mover's Distance is the Mallows Distance: Some Insights from Statistics
The Earth Mover's distance was first introduced as a purely empirical way to measure texture and color similarities. We show that it has a rigorous probabilistic interpretati...
Elizaveta Levina, Peter J. Bickel
IWVF
2001
Springer
14 years 4 days ago
Computational Surface Flattening: A Voxel-Based Approach
ÐA voxel-based method for flattening a surface in 3D space into 2D while best preserving distances is presented. Triangulation or polyhedral approximation of the voxel data are no...
Ruth Grossmann, Nahum Kiryati, Ron Kimmel