396 search results - page 11 / 80 » A Graph Cut Algorithm for Generalized Image Deconvolution |
CVPR
1999
IEEE
14 years 9 months ago
1999
IEEE
We present a stochastic clustering algorithm which uses pairwise similarity of elements, based on a new graph theoretical algorithm for the sampling of cuts in graphs. The stochas...
ISVC
2009
Springer
14 years 1 days ago
2009
Springer
Bone mineral density (BMD) measurements and fracture analysis of the spine bones are restricted to the Vertebral bodies (VBs). In this paper, we present a novel and fast 3D segment...
CVPR
1997
IEEE
13 years 11 months ago
1997
IEEE
ÐWe propose a novel approach for solving the perceptual grouping problem in vision. Rather than focusing on local features and their consistencies in the image data, our approach ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
MICCAI
2006
Springer
14 years 8 months ago
2006
Springer
The Graph Cuts method of interactive segmentation has become very popular in recent years. This method performs at interactive speeds for smaller images/volumes, but an unacceptabl...