270 search results - page 36 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
CVPR
2012
IEEE
11 years 11 months ago
2012
IEEE
We study the problem of segmenting multiple cell nuclei from GFP or Hoechst stained microscope images with a shape prior. This problem is encountered ubiquitously in cell biology ...
PAMI
2010
13 years 3 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...
ICIP
2010
IEEE
13 years 6 months ago
2010
IEEE
This paper deals with segmentation of the lung tissues from low dose CT (LDCT) scans of the chest. Goal is correct segmentation as well as maintaining the details of the lung regi...
CVPR
2000
IEEE
14 years 1 months 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 ...
PR
2007
13 years 8 months ago
2007
We introduce a new graph cut for clustering which we call the Information Cut. It is derived using Parzen windowing to estimate an information theoretic distance measure between p...