296 search results - page 8 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
ICIP
2010
IEEE
14 years 7 months ago
2010
IEEE
In few years, graph cuts have become a leading method for solving a wide range of problems in computer vision. However, graph cuts involve the construction of huge graphs which so...
CVPR
2004
IEEE
15 years 11 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
132
click to vote
CORR
2011
Springer
14 years 1 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...
CRV
2007
IEEE
15 years 3 months ago
2007
IEEE
This paper presents the design and implementation of a multi-resolution graph cuts (MRGC) for stereo-motion framework that produces dense disparity maps. Both stereo and motion ar...
FSTTCS
2004
Springer
15 years 3 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...