On the public citation graph

Quantum Annealing for Computer Vision Minimization Problems

https://doi.org/10.2139/ssrn.4686015
0 signed · 55 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11744047_1openalex-extracted
Comparison of Energy Minimization Algorithms for Highly Connected Graphs
inferredcites →https://doi.org/10.1007/11744047_2openalex-extracted
A Comparative Study of Energy Minimization Methods for Markov Random Fields
inferredcites →https://doi.org/10.1007/3-540-47967-8_34openalex-extracted
Stereo Matching Using Belief Propagation
inferredcites →https://doi.org/10.1007/978-3-030-58526-6_10openalex-extracted
Quantum-Soft QUBO Suppression for Accurate Object Detection
inferredcites →https://doi.org/10.1007/978-3-031-02518-1openalex-extracted
Adiabatic Quantum Computation and Quantum Annealing
inferredcites →https://doi.org/10.1007/978-3-031-19818-2_29openalex-extracted
Quantum Motion Segmentation
inferredcites →https://doi.org/10.1007/978-3-031-20050-2_21openalex-extracted
Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization
inferredcites →https://doi.org/10.1007/978-3-319-33924-5_17openalex-extracted
Solving the Broadcast Time Problem Using a D-wave Quantum Computer
inferredcites →https://doi.org/10.1007/978-4-431-66933-3openalex-extracted
Markov Random Field Modeling in Computer Vision
inferredcites →https://doi.org/10.1007/bf00940812openalex-extracted
Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
inferredcites →https://doi.org/10.1007/s11263-006-7899-4openalex-extracted
Efficient Belief Propagation for Early Vision
inferredcites →https://doi.org/10.1007/s11263-015-0809-xopenalex-extracted
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems
inferredcites →https://doi.org/10.1016/j.compag.2018.12.022openalex-extracted
Disparity map computation of tree using stereo vision system and effects of canopy shapes and foliage density
inferredcites →https://doi.org/10.1016/j.cviu.2013.07.004openalex-extracted
Markov Random Field modeling, inference & learning in computer vision & image understanding: A survey
inferredcites →https://doi.org/10.1016/j.tcs.2017.04.016openalex-extracted
QUBO formulations for the graph isomorphism problem and related problems
inferredcites →https://doi.org/10.1023/a:1014573219977openalex-extracted
A Taxonomy and Evaluation of Dense Two-Frame Stereo Correspondence Algorithms
inferredcites →https://doi.org/10.1023/b:stco.0000021412.33763.d5openalex-extracted
Tree consistency and bounds on the performance of the max-product algorithm and its generalizations
inferredcites →https://doi.org/10.1103/physrevx.6.031015openalex-extracted
What is the Computational Value of Finite-Range Tunneling?
inferredcites →https://doi.org/10.1109/34.134040openalex-extracted
Parallel and deterministic algorithms from MRFs: surface reconstruction
inferredcites →https://doi.org/10.1109/34.969114openalex-extracted
Fast approximate energy minimization via graph cuts
inferredcites →https://doi.org/10.1109/3dv50981.2020.00068openalex-extracted
Adiabatic Quantum Graph Matching with Permutation Matrix Constraints
inferredcites →https://doi.org/10.1109/cvpr.1998.698673openalex-extracted
Markov random fields with efficient approximations
inferredcites →https://doi.org/10.1109/cvpr.2004.1315041openalex-extracted
Efficient belief propagation for early vision
inferredcites →https://doi.org/10.1109/cvpr46437.2021.01292openalex-extracted
Quantum Permutation Synchronization
inferredcites →https://doi.org/10.1109/cvpr52688.2022.00051openalex-extracted
A Hybrid Quantum-Classical Algorithm for Robust Fitting
inferredcites →https://doi.org/10.1109/cvpr52688.2022.00861openalex-extracted
Adiabatic Quantum Computing for Multi Object Tracking
inferredcites →https://doi.org/10.1109/cvpr52688.2022.01578openalex-extracted
Practical Stereo Matching via Cascaded Recurrent Network with Adaptive Correlation
inferredcites →https://doi.org/10.1109/cvpr52729.2023.01311openalex-extracted
Quantum Multi-Model Fitting
inferredcites →https://doi.org/10.1109/iccv.1999.791261openalex-extracted
Multiway cut for stereo and motion with slanted surfaces
inferredcites →https://doi.org/10.1109/iccv.2003.1238444openalex-extracted
Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters
inferredcites →https://doi.org/10.1109/iccv.2007.4408905openalex-extracted
Efficient Message Representations for Belief Propagation
inferredcites →https://doi.org/10.1109/ijcnn.2016.7727438openalex-extracted
Empirical investigation of the low temperature energy function of the Restricted Boltzmann Machine using a 1000 qubit D-Wave 2X
inferredcites →https://doi.org/10.1109/ijcnn.2018.8489746openalex-extracted
2000 Qubit D-Wave Quantum Computer Replacing MCMC for RBM Image Reconstruction and Classification
inferredcites →https://doi.org/10.1109/ivcnz54163.2021.9653310openalex-extracted
An Improved Quantum Solution for the Stereo Matching Problem
inferredcites →https://doi.org/10.1109/tit.2005.856938openalex-extracted
MAP Estimation Via Agreement on Trees: Message-Passing and Linear Programming
inferredcites →https://doi.org/10.1109/tpami.2006.200openalex-extracted
Convergent Tree-Reweighted Message Passing for Energy Minimization
inferredcites →https://doi.org/10.1109/tpami.2007.1061openalex-extracted
Approximate Labeling via Graph Cuts Based on Linear Programming
inferredcites →https://doi.org/10.1109/tpami.2007.70844openalex-extracted
A Comparative Study of Energy Minimization Methods for Markov Random Fields with Smoothness-Based Priors
inferredcites →https://doi.org/10.1109/tpami.2010.135openalex-extracted
Dynamic Programming and Graph Algorithms in Computer Vision
inferredcites →https://doi.org/10.1111/j.2517-6161.1986.tb01412.xopenalex-extracted
On the Statistical Analysis of Dirty Pictures
inferredcites →https://doi.org/10.1155/2016/8742920openalex-extracted
Literature Survey on Stereo Vision Disparity Map Algorithms
inferredcites →https://doi.org/10.1162/neco_a_00974openalex-extracted
Determination of the Lowest-Energy States for the Model Distribution of Trained Restricted Boltzmann Machines Using a 1000 Qubit D-Wave 2X Quantum Computer
inferredcites →https://doi.org/10.2200/s00585ed1v01y201407qmc008openalex-extracted
Adiabatic Quantum Computation and Quantum Annealing: Theory and Practice
inferredcites →https://doi.org/10.3389/fphy.2014.00005openalex-extracted
Ising formulations of many NP problems
inferredcites →https://doi.org/10.3390/e20100786openalex-extracted
A QUBO Formulation of the Stereo Matching Problem for D-Wave Quantum Annealers
inferredcites →https://doi.org/10.48550/arxiv.1510.06356openalex-extracted
Application of Quantum Annealing to Training of Deep Neural Networks
inferredcites →https://doi.org/10.48550/arxiv.2007.13992openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2105.00537openalex-extracted
A comparison between D-wave and a classical approximation algorithm and a heuristic for computing the ground state of an Ising spin glass
inferredcites →https://doi.org/10.48550/arxiv.2201.10110openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2202.08837openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2203.11483openalex-extracted
inferredcites →https://doi.org/10.48550/arxiv.2203.12633openalex-extracted
Q-FW: A Hybrid Classical-Quantum Frank-Wolfe for Quadratic Binary Optimization
inferredcites →https://doi.org/10.48550/arxiv.2210.08114openalex-extracted
QuAnt: Quantum Annealing with Learnt Couplings
inferredcites →https://doi.org/10.48550/arxiv.quant-ph/0001106openalex-extracted
Quantum Computation by Adiabatic Evolution
inferredcites →https://doi.org/10.7566/jpsj.88.061007openalex-extracted
Quantum Annealing amid Local Ruggedness and Global Frustration
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.