Sciweavers

10 search results - page 1 / 2
» Practical Methods For Convex Multi-View Reconstruction
Sort
View
ECCV
2010
Springer
13 years 7 months ago
Practical Methods For Convex Multi-View Reconstruction
Globally optimal formulations of geometric computer vision problems comprise an exciting topic in multiple view geometry. These approaches are unaffected by the quality of a provid...
3DPVT
2006
IEEE
199views Visualization» more  3DPVT 2006»
13 years 10 months ago
Fast Level Set Multi-View Stereo on Graphics Hardware
In this paper, we show the importance and feasibility of much faster multi-view stereo reconstruction algorithms relying almost exclusively on graphics hardware. Reconstruction al...
Patrick Labatut, Renaud Keriven, Jean-Philippe Pon...
TIP
2010
89views more  TIP 2010»
12 years 11 months ago
Fast Nonconvex Nonsmooth Minimization Methods for Image Restoration and Reconstruction
Nonconvex nonsmooth regularization has advantages over convex regularization for restoring images with neat edges. However, its practical interest used to be limited by the difficu...
Mila Nikolova, Michael K. Ng, Chi-Pan Tam
ICCV
2001
IEEE
14 years 6 months ago
Calibration with Robust Use of Cheirality by Quasi-Affine Reconstruction of the Set of Camera Projection Centres
A methodfor upgrading a projective reconstruction to metric is presented. The reconstruction is first transformed by considering cheirality so that the convex hull of the set of c...
David Nistér
AAAI
2011
12 years 4 months ago
Convex Sparse Coding, Subspace Learning, and Semi-Supervised Extensions
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
Xinhua Zhang, Yaoliang Yu, Martha White, Ruitong H...