Sciweavers

824 search results - page 5 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
CVGIP
2004
121views more  CVGIP 2004»
14 years 9 months ago
Skeleton-driven 2D distance field metamorphosis using intrinsic shape parameters
In this article a novel algorithm is presented for 2D shape interpolation using the intrinsic shape parameters of a piecewise linear curve. The skeletons of two given shapes are c...
WuJun Che, XunNian Yang, GuoZhao Wang
CIKM
2000
Springer
15 years 1 months ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
91
Voted
KDD
2008
ACM
193views Data Mining» more  KDD 2008»
15 years 10 months ago
A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
This work introduces a new family of link-based dissimilarity measures between nodes of a weighted directed graph. This measure, called the randomized shortest-path (RSP) dissimil...
Luh Yen, Marco Saerens, Amin Mantrach, Masashi Shi...
CVPR
2003
IEEE
15 years 11 months ago
Multi-modal image registration by minimizing Kullback-Leibler distance between expected and observed joint class histograms
In this paper, we present a new multimodal image registration method based on the a priori knowledge of the class label mappings between two segmented input images. A joint class ...
Ho-Ming Chan, Albert C. S. Chung, Simon C. H. Yu, ...
CIKM
2006
Springer
15 years 1 months ago
Describing differences between databases
We study the novel problem of efficiently computing the update distance for a pair of relational databases. In analogy to the edit distance of strings, we define the update distan...
Heiko Müller, Johann Christoph Freytag, Ulf L...