Sciweavers

591 search results - page 17 / 119
» An Efficient Algorithm for Local Distance Metric Learning
Sort
View
IJBIDM
2007
91views more  IJBIDM 2007»
14 years 9 months ago
An efficient weighted nearest neighbour classifier using vertical data representation
: The k-nearest neighbour (KNN) technique is a simple yet effective method for classification. In this paper, we propose an efficient weighted nearest neighbour classification algo...
William Perrizo, Qin Ding, Maleq Khan, Anne Denton...
STOC
2002
ACM
140views Algorithms» more  STOC 2002»
15 years 10 months ago
Finding nearest neighbors in growth-restricted metrics
Most research on nearest neighbor algorithms in the literature has been focused on the Euclidean case. In many practical search problems however, the underlying metric is non-Eucl...
David R. Karger, Matthias Ruhl
83
Voted
CAD
2006
Springer
14 years 9 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
ICPR
2008
IEEE
15 years 10 months ago
Circular Earth Mover's Distance for the comparison of local features
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...
Julie Delon, Julien Rabin, Yann Gousseau
CVPR
2006
IEEE
15 years 3 months ago
Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion
The performance of many computer vision and machine learning algorithms critically depends on the quality of the similarity measure defined over the feature space. Previous works...
Xiaoyang Tan, Songcan Chen, Jun Li, Zhi-Hua Zhou