Sciweavers

396 search results - page 17 / 80
» A Graph Cut Algorithm for Generalized Image Deconvolution
Sort
View
20
Voted
CVPR
2000
IEEE
14 years 9 months ago
Image Segmentation by Nested Cuts
We present a new image segmentation algorithm based on graph cuts. Our main tool is separation of each pixel from a special point outside the image by a cut of a minimum cost. Suc...
Olga Veksler
CVPR
2009
IEEE
15 years 2 months ago
Higher-Order Clique Reduction in Binary Graph Cut
We introduce a new technique that can reduce any higher-order Markov random field with binary labels into a first-order one that has the same minima as the original. Moreover, w...
Hiroshi Ishikawa 0002
ICCV
2003
IEEE
14 years 9 months ago
Comparison of Graph Cuts with Belief Propagation for Stereo, using Identical MRF Parameters
Recent stereo algorithms have achieved impressive results by modelling the disparity image as a Markov Random Field (MRF). An important component of an MRF-based approach is the i...
Marshall F. Tappen, William T. Freeman
CVPR
2003
IEEE
14 years 9 months ago
Extracting Dense Features for Visual Correspondence with Graph Cuts
We present a method for extracting dense features from stereo and motion sequences. Our dense feature is defined symmetrically with respect to both images, and it is extracted dur...
Olga Veksler
MM
2010
ACM
211views Multimedia» more  MM 2010»
13 years 7 months ago
Artistic paper-cut of human portraits
This paper presents a method to render artistic paper-cut of human portraits. Rendering paper-cut images from photographs can be considered as an inhomogeneous image binarization ...
Meng Meng, Mingtian Zhao, Song Chun Zhu