Sciweavers

10 search results - page 2 / 2
» Practical Methods For Convex Multi-View Reconstruction
Sort
View
CVPR
2004
IEEE
14 years 6 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden
SIAMJO
2008
136views more  SIAMJO 2008»
13 years 4 months ago
Relaxed Alternating Projection Methods
Let A and B be nonempty, convex and closed subsets of a Hilbert space H. In the practical considerations we need to find an element of the intersection A B or, more general, to s...
Andrzej Cegielski, Agnieszka Suchocka
SCIA
2009
Springer
305views Image Analysis» more  SCIA 2009»
13 years 11 months ago
A Convex Approach to Low Rank Matrix Approximation with Missing Data
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
Carl Olsson, Magnus Oskarsson
IJCV
2006
194views more  IJCV 2006»
13 years 4 months ago
Reconstructing Open Surfaces from Image Data
In this paper a method for fitting open surfaces to data obtained from images is presented using a level set representation of the surface. This is done by tracking a curve, repres...
Jan Erik Solem, Anders Heyden
SIAMIS
2008
174views more  SIAMIS 2008»
13 years 4 months ago
Efficient Reconstruction of Piecewise Constant Images Using Nonsmooth Nonconvex Minimization
We consider the restoration of piecewise constant images where the number of the regions and their values are not fixed in advance, with a good difference of piecewise constant val...
Mila Nikolova, Michael K. Ng, Shuqin Zhang, Wai-Ki...