843 search results - page 11 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
ICIG
2009
IEEE
13 years 5 months ago
2009
IEEE
Optical flow estimation is one of the main subjects in computer vision. Many methods developed to compute the motion fields are built using standard heuristic formulation. In this...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
PAMI
2008
13 years 7 months ago
2008
Among the most exciting advances in early vision has been the development of efficient energy minimization algorithms for pixel-labeling tasks such as depth or texture computation....
ECCV
2010
Springer
13 years 9 months ago
2010
Springer
This paper proposes a framework that provides significant speed-ups and also improves the effectiveness of general message passing algorithms based on dual LP relaxations. It is ap...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. This article presents a novel method for acquiring high-quality solid models of complex 3D shapes from multiple calibrated photographs. After the purely geometric constra...