Sciweavers

180 search results - page 6 / 36
» Fingerprint matching based on distance metric learning
Sort
View
CORR
2011
Springer
243views Education» more  CORR 2011»
14 years 8 months ago
Localization from Incomplete Noisy Distance Measurements
—We consider the problem of positioning a cloud of points in the Euclidean space Rd , from noisy measurements of a subset of pairwise distances. This task has applications in var...
Adel Javanmard, Andrea Montanari
CVPR
2003
IEEE
16 years 3 months ago
Many-to-Many Graph Matching via Metric Embedding
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...
Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci...
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 1 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
ICML
2010
IEEE
15 years 2 months ago
Metric Learning to Rank
We study metric learning as a problem of information retrieval. We present a general metric learning algorithm, based on the structural SVM framework, to learn a metric such that ...
Brian McFee, Gert R. G. Lanckriet
MLMI
2007
Springer
15 years 7 months ago
Posterior-Based Features and Distances in Template Matching for Speech Recognition
The use of large speech corpora in example-based approaches for speech recognition is mainly focused on increasing the number of examples. This strategy presents some difficulties ...
Guillermo Aradilla, Hervé Bourlard