Sciweavers

80 search results - page 10 / 16
» A learning framework for nearest neighbor search
Sort
View
79
Voted
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
15 years 3 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka
ICMCS
2007
IEEE
214views Multimedia» more  ICMCS 2007»
15 years 3 months ago
Exploring Discriminative Learning for Text-Independent Speaker Recognition
Speaker verification is a technology of verifying the claimed identity of a speaker based on the speech signal from the speaker (voice print). To learn the score of similarity be...
Ming Liu, Zhengyou Zhang, Mark Hasegawa-Johnson, T...
IJCV
2010
194views more  IJCV 2010»
14 years 8 months ago
Improving Bag-of-Features for Large Scale Image Search
This article improves recent methods for large scale image search. We first analyze the bag-of-features approach in the framework of approximate nearest neighbor search. This lea...
Herve Jegou, Matthijs Douze, Cordelia Schmid
ICML
2007
IEEE
15 years 10 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ICCBR
2007
Springer
15 years 3 months ago
Label Ranking in Case-Based Reasoning
The problem of label ranking has recently been introduced as an extension of conventional classification in the field of machine learning. In this paper, we argue that label ran...
Klaus Brinker, Eyke Hüllermeier