270 search results - page 27 / 54 » Graph Cuts and Efficient N-D Image Segmentation |
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
This paper proposes an automatic foreground segmentation system based on Gaussian mixture models and dynamic graph cut algorithm. An adaptive perpixel background model is develope...
ECCV
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Markov and Conditional random fields (CRFs) used in computer vision typically model only local interactions between variables, as this is computationally tractable. In t...
ICCV
2007
IEEE
14 years 10 months ago
2007
IEEE
While the majority of competitive image segmentation methods are based on energy minimization, only few allow to efficiently determine globally optimal solutions. A graphtheoretic...
CRV
2005
IEEE
13 years 10 months ago
2005
IEEE
This paper presents a method that combines graphbased segmentation and multistage region merging to segment laparoscopic images. Starting with image preprocessing, including Gauss...
Publication
For quantitative analysis of histopathological images,
such as the lymphoma grading systems, quantification of
features is usually carried out on single cells before categorizing...