4843 search results - page 790 / 969 » The Shortcut Problem - Complexity and Approximation |
111
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
This paper presents an approach to shadow removal that preserves texture consistency between the original shadow and lit area. Illumination reduction in the shadow area not only da...
112
click to vote
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....
149
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Abstract We develop a distance metric for clustering and classification algorithms which is invariant to affine transformations and includes priors on the transformation parameters...
120
click to vote
ECCV
2002
Springer
16 years 5 months ago
2002
Springer
Abstract. Computing reflective symmetries of 2D and 3D shapes is a classical problem in computer vision and computational geometry. Most prior work has focused on finding the main ...
156
Voted
ICIP
2008
IEEE
16 years 5 months ago
2008
IEEE
Subspace learning techniques are widespread in pattern recognition research. They include PCA, ICA, LPP, etc. These techniques are generally linear and unsupervised. The problem o...