1115 search results - page 151 / 223 » Active Graph Cuts |
112
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Conditional Random Field models have proved effective for several low-level computer vision problems. Inference in these models involves solving a combinatorial optimization probl...
138
click to vote
APPROX
2009
Springer
15 years 9 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
130
Voted
CRV
2008
IEEE
15 years 9 months ago
2008
IEEE
Dense stereo algorithms rely on matching over a range of disparities. To speed up the search and reduce match ambiguity, processing can be embedded in the hierarchical, or coarse-...
134
click to vote
ICRA
2008
IEEE
15 years 8 months ago
2008
IEEE
— This paper presents a novel human detection method based on a Bayesian fusion approach using laser range data and camera images. Laser range data analysis groups data points wi...
145
click to vote
ICASSP
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper introduces a novel energy minimization method, namely iterated cross entropy with partition strategy (ICEPS), into the Markov random field theory. The solver, which is...