Sciweavers

4212 search results - page 749 / 843
» On Compressible Pairings and Their Computation
Sort
View
SWAT
1998
Springer
110views Algorithms» more  SWAT 1998»
15 years 10 months ago
On the Number of Regular Vertices of the Union of Jordan Regions
Let C be a collection of n Jordan regions in the plane in general position, such that each pair of their boundaries intersect in at most s points, where s is a constant. Let U den...
Boris Aronov, Alon Efrat, Dan Halperin, Micha Shar...
CVPR
2003
IEEE
16 years 8 months ago
Learning Affinity Functions for Image Segmentation: Combining Patch-based and Gradient-based Approaches
This paper studies the problem of combining region and boundary cues for natural image segmentation. We employ a large database of manually segmented images in order to learn an o...
Charless Fowlkes, David R. Martin, Jitendra Malik
ICCV
2007
IEEE
16 years 8 months ago
The Joint Manifold Model for Semi-supervised Multi-valued Regression
Many computer vision tasks may be expressed as the problem of learning a mapping between image space and a parameter space. For example, in human body pose estimation, recent rese...
Ramanan Navaratnam, Andrew W. Fitzgibbon, Roberto ...
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
CHI
2009
ACM
16 years 7 months ago
Designable visual markers
Visual markers are graphic symbols designed to be easily recognised by machines. They are traditionally used to track goods, but there is increasing interest in their application ...
Enrico Costanza, Jeffrey Huang