Sciweavers

MICCAI
2008
Springer
14 years 10 months ago
Weights and Topology: A Study of the Effects of Graph Construction on 3D Image Segmentation
Abstract. Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content t...
Leo Grady, Marie-Pierre Jolly
ICPR
2008
IEEE
14 years 10 months ago
Object recognition and segmentation using SIFT and Graph Cuts
In this paper, we propose a method of object recognition and segmentation using Scale-Invariant Feature Transform (SIFT) and Graph Cuts. SIFT feature is invariant for rotations, s...
Akira Suga, Keita Fukuda, Tetsuya Takiguchi, Yasuo...
ICPR
2008
IEEE
14 years 10 months ago
Saliency Cuts: An automatic approach to object segmentation
Interactive graph cuts are widely used in object segmentation but with some disadvantages: 1) Manual interactions may cause inaccurate or even incorrect segmentation results and i...
Yu Fu, Jian Cheng, Zhenglong Li, Hanqing Lu
ECCV
2002
Springer
14 years 11 months ago
What Energy Functions Can Be Minimized via Graph Cuts?
In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs...
Vladimir Kolmogorov, Ramin Zabih
ICCV
2001
IEEE
14 years 11 months ago
Computing Visual Correspondence with Occlusions via Graph Cuts
Several new algorithms for visual correspondence based on graph cuts [6, 13, 16] have recently been developed. While these methods give very strong results in practice, they do no...
Vladimir Kolmogorov, Ramin Zabih
ICCV
2003
IEEE
14 years 11 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
ICCV
2003
IEEE
14 years 11 months ago
Visual Correspondence Using Energy Minimization and Mutual Information
We address visual correspondence problems without assuming that scene points have similar intensities in different views.This situation is common, usually due to non-lambertian sc...
Junhwan Kim, Vladimir Kolmogorov, Ramin Zabih
ICCV
2003
IEEE
14 years 11 months ago
Computing Geodesics and Minimal Surfaces via Graph Cuts
Yuri Boykov, Vladimir Kolmogorov
ICCV
2005
IEEE
14 years 11 months ago
A Graph Cut Algorithm for Generalized Image Deconvolution
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
Ashish Raj, Ramin Zabih
ICCV
2007
IEEE
14 years 11 months ago
A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
Ali Kemal Sinop, Leo Grady