Sciweavers

824 search results - page 4 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
SISAP
2010
IEEE
243views Data Mining» more  SISAP 2010»
13 years 5 months ago
Similarity matrix compression for efficient signature quadratic form distance computation
Determining similarities among multimedia objects is a fundamental task in many content-based retrieval, analysis, mining, and exploration applications. Among state-of-the-art sim...
Christian Beecks, Merih Seran Uysal, Thomas Seidl
PRL
2010
205views more  PRL 2010»
13 years 2 months ago
Mining outliers with faster cutoff update and space utilization
It is desirable to find unusual data objects by Ramaswamy et al's distance-based outlier definition because only a metric distance function between two objects is required. It...
Chi-Cheong Szeto, Edward Hung
VMV
2008
151views Visualization» more  VMV 2008»
13 years 9 months ago
Adaptive surface decomposition for the distance computation of arbitrarily shaped objects
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
Marc Gissler, Matthias Teschner
MICCAI
2000
Springer
13 years 11 months ago
Efficient Semiautomatic Segmentation of 3D Objects in Medical Images
Abstract. We present a fast and accurate tool for semiautomatic segmentation of volumetric medical images based on the live wire algorithm, shape-based interpolation and a new opti...
Andrea Schenk, Guido P. M. Prause, Heinz-Otto Peit...
DASFAA
2007
IEEE
208views Database» more  DASFAA 2007»
14 years 2 months ago
Probabilistic Nearest-Neighbor Query on Uncertain Objects
Nearest-neighbor queries are an important query type for commonly used feature databases. In many different application areas, e.g. sensor databases, location based services or fac...
Hans-Peter Kriegel, Peter Kunath, Matthias Renz