7930 search results - page 1371 / 1586 » Greedy in Approximation Algorithms |
121
click to vote
ECCV
2008
Springer
16 years 6 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....
160
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
Abstract. Volumetric structures are frequently used as shape descriptors for 3D data. The capture of such data is being facilitated by developments in multi-view video and range sc...
163
Voted
ECCV
2002
Springer
16 years 6 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...
136
click to vote
ECCV
2002
Springer
16 years 6 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 ...
136
Voted
ICIP
2006
IEEE
16 years 6 months ago
2006
IEEE
It has been demonstrated that simple and inexpensive techniques are sufficient to spoof fingerprint scanners. Previously, effective use of physiological phenomenon of perspiration...