2018
DOI: 10.3390/e20100786
|View full text |Cite
|
Sign up to set email alerts
|

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

Abstract: 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 me… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
7
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
4
3
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 49 publications
0
7
0
Order By: Relevance
“…Quantum annealing [5,12] has demonstrated its ability to solve a broad range of combinatorial optimization problems, not only in computer science [6,17,27,31,[40][41][42][43][44], but also in other fields, such as quantum chemistry [45], bioinformatics [15,46], and vehicle routing [34,39,47,48], to name just a few. All these problems aim at minimizing a cost function, which can be "physically" interpreted as finding the ground state of a typical Ising Hamiltonian [33].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Quantum annealing [5,12] has demonstrated its ability to solve a broad range of combinatorial optimization problems, not only in computer science [6,17,27,31,[40][41][42][43][44], but also in other fields, such as quantum chemistry [45], bioinformatics [15,46], and vehicle routing [34,39,47,48], to name just a few. All these problems aim at minimizing a cost function, which can be "physically" interpreted as finding the ground state of a typical Ising Hamiltonian [33].…”
Section: Related Workmentioning
confidence: 99%
“…The possible superiority of quantum computation could be translated into either providing a better solution (i.e., closer to the optimal one) or arriving at a solution faster or producing a diverse set of solutions (for the multiobjective case). Some known cases where such methods work well are spin glasses [52], graph coloring [53], job-shop scheduling [54], machine learning [17,55], graph partitioning [31], 3-SAT [56], vehicle routing and scheduling [34,39,47,48], neural networks [57], and image processing [42], where the problem parameters can be expressed as boolean variables. Adiabatic quantum annealing techniques are also used to address multiobjective optimization problems [58].…”
Section: Related Workmentioning
confidence: 99%
“…Quantum annealing [5,11] has been shown to provide solutions to a broad range of combinatorial optimization problems, not only in computer science [6,16,26,30,[39][40][41], but also in other fields, such as quantum chemistry [42], protein folding [14], vehicle routing [33,38,43,44], etc. This kind of problems aim at minimizing a cost function, which can be interpreted as finding the ground state of a typical Ising Hamiltonian [32].…”
Section: Related Workmentioning
confidence: 99%
“…A lot of research is being carried out in this topics, such as 3D scene reconstruction [8,9], depth detection [10], or autonomous navigation of unmanned vehicles in environments without GPS [11]. Stereo-vision is also used as work validation [12]. The work on stereo-vision consists of the analysis and processing of digital images obtained from two or more than two digital cameras (multi-vision stereo) [13][14][15].…”
Section: Introductionmentioning
confidence: 99%