Sciweavers

6568 search results - page 1192 / 1314
» Reducing the Complexity of Reductions
Sort
View
CVPR
2008
IEEE
16 years 8 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
ICCV
2007
IEEE
16 years 8 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
ECCV
2004
Springer
16 years 8 months ago
Weak Hypotheses and Boosting for Generic Object Detection and Recognition
In this paper we describe the first stage of a new learning system for object detection and recognition. For our system we propose Boosting [5] as the underlying learning technique...
Andreas Opelt, Michael Fussenegger, Axel Pinz, Pet...
ECCV
2006
Springer
16 years 8 months ago
Inter-modality Face Recognition
Recently, the wide deployment of practical face recognition systems gives rise to the emergence of the inter-modality face recognition problem. In this problem, the face images in ...
Dahua Lin, Xiaoou Tang
ECCV
2006
Springer
16 years 8 months ago
EMD-L1: An Efficient and Robust Algorithm for Comparing Histogram-Based Descriptors
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
Haibin Ling, Kazunori Okada
« Prev « First page 1192 / 1314 Last » Next »