302 search results - page 56 / 61 » Reducing graphs in graph cut segmentation |
109
click to vote
AAAI
2007
15 years 1 months ago
2007
Recently, social text streams (e.g., blogs, web forums, and emails) have become ubiquitous with the evolution of the web. In some sense, social text streams are sensors of the rea...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
Many solutions to computer vision and image processing problems involve the minimization of multi-label energy functions with up to K variables in each term. In the minimization pr...
120
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Markov random field models provide a robust and unified framework for early vision problems such as stereo, optical flow and image restoration. Inference algorithms based on graph...
110
Voted
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
CVPR
2010
IEEE
15 years 7 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...