302 search results - page 25 / 61 » Reducing graphs in graph cut segmentation |
CVPR
2008
IEEE
16 years 1 months ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
SMI
2006
IEEE
15 years 5 months ago
2006
IEEE
There is a growing need to extract features from point sets for purposes like model classification, matching, and exploration. We introduce a technique for segmenting a point-sam...
101
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
ECCV
2010
Springer
15 years 5 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...
CVPR
2007
IEEE
16 years 1 months ago
2007
IEEE
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...