138 search results - page 6 / 28 » Efficient Planar Graph Cuts with Applications in Computer Vi... |
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Illumination changes are a ubiquitous problem in computer vision. They present a challenge in many applications, including tracking: for example, an object may move in and out of ...
CVPR
2008
IEEE
14 years 9 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...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
ECCV
2010
Springer
14 years 1 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
2004
IEEE
14 years 9 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...