Sciweavers

510 search results - page 49 / 102
» Adaptive Distances on Sets of Vectors
Sort
View
100
Voted
ECCV
2004
Springer
16 years 14 hour ago
Many-to-Many Feature Matching Using Spherical Coding of Directed Graphs
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
M. Fatih Demirci, Ali Shokoufandeh, Sven J. Dickin...
ICML
2005
IEEE
15 years 11 months ago
Semi-supervised graph clustering: a kernel approach
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
Brian Kulis, Sugato Basu, Inderjit S. Dhillon, Ray...
ICDAR
2003
IEEE
15 years 3 months ago
Writer Identification using Innovative Binarised Features of Handwritten Numerals
The objective of this paper is to present a number of features that can be extracted from handwritten digits and used for author verification or identification of a person’s han...
Graham Leedham, Sumit Chachra
ICMCS
1999
IEEE
202views Multimedia» more  ICMCS 1999»
15 years 2 months ago
Face Detection in Color Images Using Wavelet Packet Analysis
In this paper, we propose a novel scheme for automatic and fast detection of human faces in color images where the number, the location, the orientation and the size of the faces ...
Christophe Garcia, G. Zikos, George Tziritas
132
Voted
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 2 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani