Sciweavers

229 search results - page 25 / 46
» Iterated Graph Cuts for Image Segmentation
Sort
View

Publication
400views
14 years 4 months ago
Partitioning Histopathological Images: An Integrated Framework for Supervised Color-Texture Segmentation and Cell Splitting
For quantitative analysis of histopathological images, such as the lymphoma grading systems, quantification of features is usually carried out on single cells before categorizing...
Hui Kong, Metin Gurcan, and Kamel Belkacem-Boussai...
DAGM
2007
Springer
15 years 1 months ago
Efficient Image Segmentation Using Pairwise Pixel Similarities
Image segmentation based on pairwise pixel similarities has been a very active field of research in recent years. The drawbacks common to these segmentation methods are the enormou...
Christopher Rohkohl, Karin Engel
CVPR
2009
IEEE
16 years 4 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
CVPR
2004
IEEE
15 years 11 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov
CVPR
2010
IEEE
15 years 2 months ago
"Lattice Cut" - Constructing superpixels using layer constraints
Unsupervised over-segmentation of an image into superpixels is a common preprocessing step for image parsing algorithms. Superpixels are used as both regions of support for featur...
Alastair Moore, Simon Prince