229 search results - page 34 / 46 » Iterated Graph Cuts for Image Segmentation |
CVPR
2000
IEEE
15 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
14 years 9 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...
86
Voted
FGR
2008
IEEE
15 years 3 months ago
2008
IEEE
This paper presents an algorithm for measuring hair and face appearance in 2D images. Our approach starts by using learned mixture models of color and location information to sugg...
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
CVPR
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper, we propose a novel graph based clustering approach with satisfactory clustering performance and low computational cost. It consists of two main steps: tree fitting...