2527 search results - page 287 / 506 » Discrete optimization in computer vision |
159
click to vote
CVPR
2008
IEEE
16 years 7 months ago
2008
IEEE
Graph cut is a popular technique for interactive image segmentation. However, it has certain shortcomings. In particular, graph cut has problems with segmenting thin elongated obj...
137
click to vote
ICCV
2003
IEEE
16 years 6 months ago
2003
IEEE
We propose a spectral partitioning approach for large-scale optimization problems, specifically structure from motion. In structure from motion, partitioning methods reduce the pr...
150
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the sc...
163
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
We present a novel algorithm for unsupervised segmentation of natural images that harnesses the principle of minimum description length (MDL). Our method is based on observations ...
132
click to vote
ICCV
2005
IEEE
15 years 10 months ago
2005
IEEE
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...