256 search results - page 26 / 52 » Graph cut based segmentation of convoluted objects |
MIAR
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract. This paper proposes a new method to compute connectivity information from diffusion weighted images. It is inspired by graphbased approaches to connectivity definition,...
CVPR
2000
IEEE
14 years 6 days ago
2000
IEEE
We use cluster analysis as a unifying principle for problems from low, middle and high level vision. The clustering problem is viewed as graph partitioning, where nodes represent ...
PAMI
2006
13 years 7 months ago
2006
Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications....
PAMI
2010
13 years 6 months ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...
PAMI
2010
13 years 2 months ago
2010
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...