Sciweavers

180 search results - page 4 / 36
» Fingerprint matching based on distance metric learning
Sort
View
DCC
1999
IEEE
13 years 10 months ago
Complexity-Distortion Tradeoffs in Vector Matching Based on Probabilistic Partial Distance Techniques
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...
Krisda Lengwehasatit, Antonio Ortega
CVPR
2008
IEEE
14 years 8 months ago
Rank-based distance metric learning: An application to image retrieval
We present a novel approach to learn distance metric for information retrieval. Learning distance metric from a number of queries with side information, i.e., relevance judgements...
Jung-Eun Lee, Rong Jin, Anil K. Jain
IVC
2007
176views more  IVC 2007»
13 years 6 months ago
Kernel-based distance metric learning for content-based image retrieval
ct 8 For a specific set of features chosen for representing images, the performance of a content-based image retrieval (CBIR) system 9 depends critically on the similarity or diss...
Hong Chang, Dit-Yan Yeung
ICVS
2009
Springer
14 years 21 days ago
Learning Query-Dependent Distance Metrics for Interactive Image Retrieval
An approach to target-based image retrieval is described based on on-line rank-based learning. User feedback obtained via interaction with 2D image layouts provides qualitative co...
Junwei Han, Stephen J. McKenna, Ruixuan Wang
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 9 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...