Fast and robust earth mover's distances
We present a new algorithm for a robust family of Earth Mover's Distances-EMDs with
thresholded ground distances. The algorithm transforms the flow-network of the EMD so that …
thresholded ground distances. The algorithm transforms the flow-network of the EMD so that …
Gradient domain high dynamic range compression
We present a new method for rendering high dynamic range images on conventional
displays. Our method is conceptually simple, computationally efficient, robust, and easy to …
displays. Our method is conceptually simple, computationally efficient, robust, and easy to …
A linear time histogram metric for improved sift matching
We present a new metric between histograms such as SIFT descriptors and a linear time
algorithm for its computation. It is common practice to use the L 2 metric for comparing SIFT …
algorithm for its computation. It is common practice to use the L 2 metric for comparing SIFT …
The quadratic-chi histogram distance family
We present a new histogram distance family, the Quadratic-Chi (QC). QC members are
Quadratic-Form distances with a cross-bin χ 2-like normalization. The cross-bin χ 2-like …
Quadratic-Form distances with a cross-bin χ 2-like normalization. The cross-bin χ 2-like …
Texture mixing and texture movie synthesis using statistical learning
We present an algorithm based on statistical learning for synthesizing static and time-
varying textures matching the appearance of an input texture. Our algorithm is general and …
varying textures matching the appearance of an input texture. Our algorithm is general and …
Affine invariance revisited
E Begelfor, M Werman - 2006 IEEE Computer Society …, 2006 - ieeexplore.ieee.org
This paper proposes a Riemannian geometric framework to compute averages and
distributions of point configurations so that different configurations up to affine …
distributions of point configurations so that different configurations up to affine …
Active recognition through next view planning: a survey
SD Roy, S Chaudhury, S Banerjee - Pattern Recognition, 2004 - Elsevier
3-D object recognition involves using image-computable features to identify 3-D object. A
single view of a 3-D object may not contain sufficient features to recognize it unambiguously …
single view of a 3-D object may not contain sufficient features to recognize it unambiguously …
[PDF][PDF] Simulation of rain in videos
S Starik, M Werman - Texture Workshop, ICCV, 2003 - lear.inrialpes.fr
This paper treats the addition of simulated rain to a video sequence. In order to derive a fast
and simple algorithm for rain simulation that produces realistic results, we investigated …
and simple algorithm for rain simulation that produces realistic results, we investigated …
Content‐Aware Automatic Photo Enhancement
L Kaufman, D Lischinski… - Computer Graphics Forum, 2012 - Wiley Online Library
Automatic photo enhancement is one of the long‐standing goals in image processing and
computational photography. While a variety of methods have been proposed for …
computational photography. While a variety of methods have been proposed for …
An on-line agglomerative clustering method for nonstationary data
An on-line agglomerative clustering algorithm for nonstationary data is described. Three
issues are addressed. The first regards the temporal aspects of the data. The clustering of …
issues are addressed. The first regards the temporal aspects of the data. The clustering of …