Sciweavers

824 search results - page 25 / 165
» Efficient Distance Computation Between Non-Convex Objects
Sort
View
ACSC
2006
IEEE
14 years 2 months ago
Improvements of TLAESA nearest neighbour search algorithm and extension to approximation search
Nearest neighbour (NN) searches and k nearest neighbour (k-NN) searches are widely used in pattern recognition and image retrieval. An NN (k-NN) search finds the closest object (...
Ken Tokoro, Kazuaki Yamaguchi, Sumio Masuda
PAMI
2008
208views more  PAMI 2008»
13 years 8 months ago
BoostMap: An Embedding Method for Efficient Nearest Neighbor Retrieval
This paper describes BoostMap, a method for efficient nearest neighbor retrieval under computationally expensive distance measures. Database and query objects are embedded into a v...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
CVPR
2007
IEEE
14 years 10 months ago
Multiple Instance Learning of Pulmonary Embolism Detection with Geodesic Distance along Vascular Structure
We propose a novel classification approach for automatically detecting pulmonary embolism (PE) from computedtomography-angiography images. Unlike most existing approaches that req...
Jinbo Bi, Jianming Liang
CAD
2006
Springer
13 years 8 months ago
Trimming local and global self-intersections in offset curves/surfaces using distance maps
A robust and efficient algorithm for trimming both local and global self-intersections in offset curves and surfaces is presented. Our scheme is based on the derivation of a ratio...
Joon-Kyung Seong, Gershon Elber, Myung-Soo Kim
SMA
2006
ACM
101views Solid Modeling» more  SMA 2006»
14 years 2 months ago
A higher dimensional formulation for robust and interactive distance queries
We present an efficient and robust algorithm for computing the minimum distance between a point and freeform curve or surface by lifting the problem into a higher dimension. This...
Joon-Kyung Seong, David E. Johnson, Elaine Cohen