315 search results - page 52 / 63 » An Optimal Algorithm for the Maximum-Density Segment Problem |
ICCV
2009
IEEE
14 years 11 months ago
2009
IEEE
The concept of graph cuts is by now a standard method
for all sorts of low level vision problems. Its popularity is
largely due to the fact that globally or near globally optimal...
ICCV
2007
IEEE
14 years 8 months ago
2007
IEEE
We propose a method for removing non-uniform motion blur from multiple blurry images. Traditional methods focus on estimating a single motion blur kernel for the entire image. In ...
IPMI
2007
Springer
14 years 7 months ago
2007
Springer
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
PRL
2007
13 years 6 months ago
2007
Several computer vision problems, like segmentation, tracking and shape modeling, are increasingly being solved using level set methodologies. But the critical issues of stability...
ICIP
2010
IEEE
13 years 4 months ago
2010
IEEE
The 2.1D sketch is a layered representation of occluding and occluded surfaces of the scene. Extracting the 2.1D sketch from a single image is a difficult and important problem ar...