Sciweavers

259 search results - page 12 / 52
» Clustering for Approximate Similarity Search in High-Dimensi...
Sort
View
87
Voted
DAGM
2007
Springer
15 years 3 months ago
Clustered Stochastic Optimization for Object Recognition and Pose Estimation
We present an approach for estimating the 3D position and in case of articulated objects also the joint configuration from segmented 2D images. The pose estimation without initial...
Juergen Gall, Bodo Rosenhahn, Hans-Peter Seidel
HOTOS
2007
IEEE
15 years 1 months ago
Hyperspaces for Object Clustering and Approximate Matching in Peer-to-Peer Overlays
Existing distributed hash tables provide efficient mechanisms for storing and retrieving a data item based on an exact key, but are unsuitable when the search key is similar, but ...
Bernard Wong, Ymir Vigfusson, Emin Gün Sirer
MICCAI
2005
Springer
15 years 10 months ago
White Matter Tract Clustering and Correspondence in Populations
We present a novel method for finding white matter fiber correspondences and clusters across a population of brains. Our input is a collection of paths from tractography in every b...
Lauren O'Donnell, Carl-Fredrik Westin
DEXA
2008
Springer
155views Database» more  DEXA 2008»
14 years 11 months ago
NM-Tree: Flexible Approximate Similarity Search in Metric and Non-metric Spaces
So far, an efficient similarity search in multimedia databases has been carried out by metric access methods (MAMs), where the utilized similarity measure had to satisfy the metric...
Tomás Skopal, Jakub Lokoc
JMLR
2010
111views more  JMLR 2010»
14 years 4 months ago
Single versus Multiple Sorting in All Pairs Similarity Search
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...
Yasuo Tabei, Takeaki Uno, Masashi Sugiyama, Koji T...