Multiscale Modeling and Constraints for Max-flow/Min-cut Problems in Computer Vision

2006 ◽  
Author(s):  
M.W. Turek ◽  
D. Freedman
Keyword(s):  
Computer Vision ◽  
Multiscale Modeling ◽  
Cut Problems ◽  
Min Cut

scholarly journals Potential method of nonlinear resistive circuits to solve max-flow/min-cut problems

2016 ◽  
Vol 7 (4) ◽  
pp. 509-522
Author(s):  
Masatoshi Sato ◽  
Hisashi Aomori ◽  
Tsuyoshi Otake ◽  
Mamoru Tanaka
Keyword(s):  
Potential Method ◽  
Cut Problems ◽  
Min Cut

scholarly journals Complexity of the min–max (regret) versions of min cut problems

2008 ◽  
Vol 5 (1) ◽  
pp. 66-73 ◽  
Author(s):  
Hassene Aissi ◽  
Cristina Bazgan ◽  
Daniel Vanderpooten
Keyword(s):  
Cut Problems ◽  
Min Cut

scholarly journals A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers

Entropy ◽  
2018 ◽  
Vol 20 (10) ◽  
pp. 786 ◽  
Author(s):  
William Cruz-Santos ◽  
Salvador Venegas-Andraca ◽  
Marco Lanzagorta
Keyword(s):  
Computer Vision ◽  
Experimental Validation ◽  
Stereo Matching ◽  
Stereo Pair ◽  
Quantum Annealing ◽  
Matching Problem ◽  
Random Dot Stereograms ◽  
Qubo Formulation ◽  
Min Cut ◽  
D Wave

In this paper, we propose a methodology to solve the stereo matching problem through quantum annealing optimization. Our proposal takes advantage of the existing Min-Cut/Max-Flow network formulation of computer vision problems. Based on this network formulation, we construct a quadratic pseudo-Boolean function and then optimize it through the use of the D-Wave quantum annealing technology. Experimental validation using two kinds of stereo pair of images, random dot stereograms and gray-scale, shows that our methodology is effective.

Combinatorial and geometric properties of the Max-Cut and Min-Cut problems

2013 ◽  
Vol 88 (2) ◽  
pp. 516-517 ◽  
Author(s):  
V. A. Bondarenko ◽  
A. V. Nikolaev
Keyword(s):  
Geometric Properties ◽  
Cut Problems ◽  
Min Cut

scholarly journals On Graphs of the Cone Decompositions for the Min-Cut and Max-Cut Problems

2016 ◽  
Vol 2016 ◽  
pp. 1-6 ◽  
Author(s):  
Vladimir Bondarenko ◽  
Andrei Nikolaev
Keyword(s):  
Time Complexity ◽  
Broad Class ◽  
Clique Number ◽  
Minimum Cut ◽  
Max Cut Problem ◽  
Cut Problems ◽  
Min Cut

We consider maximum and minimum cut problems with nonnegative weights of edges. We define the graphs of the cone decompositions and find a linear clique number for the min-cut problem and a superpolynomial clique number for the max-cut problem. These values characterize the time complexity in a broad class of algorithms based on linear comparisons.

Sign in / Sign up

Export Citation Format

Share Document