Minimizing nonsubmodular functions with graph cuts-a review

V Kolmogorov, C Rother - IEEE transactions on pattern …, 2007 - ieeexplore.ieee.org
Optimization techniques based on graph cuts have become a standard tool for many vision
applications. These techniques allow to minimize efficiently certain energy functions …

Dynamic programming and graph algorithms in computer vision

PF Felzenszwalb, R Zabih - IEEE transactions on pattern …, 2010 - ieeexplore.ieee.org
Optimization is a powerful paradigm for expressing and solving problems in a wide range of
areas, and has been successfully applied to many vision problems. Discrete optimization …

Optical flow modeling and computation: A survey

D Fortun, P Bouthemy, C Kervrann - Computer Vision and Image …, 2015 - Elsevier
Optical flow estimation is one of the oldest and still most active research domains in
computer vision. In 35 years, many methodological concepts have been introduced and …

[图书][B] Computer vision: algorithms and applications

R Szeliski - 2022 - books.google.com
Humans perceive the three-dimensional structure of the world with apparent ease. However,
despite all of the recent advances in computer vision research, the dream of having a …

A taxonomy and evaluation of dense two-frame stereo correspondence algorithms

D Scharstein, R Szeliski - International journal of computer vision, 2002 - Springer
Stereo matching is one of the most active research areas in computer vision. While a large
number of algorithms for stereo correspondence have been developed, relatively little work …

Fast approximate energy minimization via graph cuts

Y Boykov, O Veksler, R Zabih - IEEE Transactions on pattern …, 2001 - ieeexplore.ieee.org
Many tasks in computer vision involve assigning a label (such as disparity) to every pixel. A
common constraint is that the labels should vary smoothly almost everywhere while …

Computing visual correspondence with occlusions using graph cuts

V Kolmogorov, R Zabih - Proceedings Eighth IEEE International …, 2001 - ieeexplore.ieee.org
Several new algorithms for visual correspondence based on graph cuts have recently been
developed. While these methods give very strong results in practice, they do not handle …

Max-margin Markov networks

B Taskar, C Guestrin, D Koller - Advances in neural …, 2003 - proceedings.neurips.cc
In typical classification tasks, we seek a function which assigns a label to a single object.
Kernel-based approaches, such as support vector machines (SVMs), which maximize the …

Phase unwrapping via graph cuts

JM Bioucas-Dias, G Valadao - IEEE Transactions on Image …, 2007 - ieeexplore.ieee.org
Phase unwrapping is the inference of absolute phase from modulo-2pi phase. This paper
introduces a new energy minimization framework for phase unwrapping. The considered …

Robust water/fat separation in the presence of large field inhomogeneities using a graph cut algorithm

D Hernando, P Kellman, JP Haldar… - Magnetic Resonance in …, 2010 - Wiley Online Library
Water/fat separation is a classical problem for in vivo proton MRI. Although many methods
have been proposed to address this problem, robust water/fat separation remains a …