Sciweavers

47 search results - page 6 / 10
» What Energy Functions Can Be Minimized via Graph Cuts
Sort
View
ECCV
2008
Springer
14 years 9 months ago
Image Segmentation by Branch-and-Mincut
Efficient global optimization techniques such as graph cut exist for energies corresponding to binary image segmentation from lowlevel cues. However, introducing a high-level prior...
Victor S. Lempitsky, Andrew Blake, Carsten Rother
ICIP
2007
IEEE
14 years 1 months ago
Graph-Cut Rate Distortion Algorithm for Contourlet-Based Image Compression
The geometric features of images, such as edges, are difficult to represent. When a redundant transform is used for their extraction, the compression challenge is even more dif...
Maria Trocan, Béatrice Pesquet-Popescu, Jam...
ECCV
2010
Springer
13 years 7 months ago
Superpixels and Supervoxels in an Energy Optimization Framework
Many methods for object recognition, segmentation, etc., rely on tessellation of an image into "superpixels". A superpixel is an image patch which is better aligned with ...
Olga Veksler, Yuri Boykov, Paria Mehrani

Publication
592views
15 years 3 months ago
Coupling Graph Cuts and Level Sets
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
Xiang Zeng, Wei Chen, and Qunsheng Peng
CVPR
2008
IEEE
14 years 9 months ago
3D occlusion recovery using few cameras
We present a practical framework for detecting and modeling 3D static occlusions for wide-baseline, multi-camera scenarios where the number of cameras is small. The framework cons...
Mark A. Keck, James W. Davis