49 search results - page 7 / 10 » New Sparseness Results on Graph Spanners |
CVPR
2007
IEEE
15 years 11 months ago
2007
IEEE
We propose a global optimization framework for 3D shape reconstruction from sparse noisy 3D measurements frequently encountered in range scanning, sparse featurebased stereo, and ...
83
Voted
ACCV
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
115
Voted
SMA
2009
ACM
15 years 4 months ago
2009
ACM
We examine the problem of computing exactly the Delaunay graph (and the dual Voronoi diagram) of a set of, possibly intersecting, smooth convex pseudo-circles in the Euclidean pla...
66
Voted
JCP
2006
14 years 9 months ago
2006
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
92
Voted
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
Abstract. In this paper we present a new approach for establishing correspondences between sparse image features related by an unknown non-rigid mapping and corrupted by clutter an...