English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse
  1. View item / 
  2. Item Summary

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Paper

A Quantum Computational Approach to Correspondence Problems on Point Sets

MPS-Authors
/persons/resource/persons239654

Golyanik,  Vladislav
Computer Graphics, MPI for Informatics, Max Planck Society;

/persons/resource/persons45610

Theobalt,  Christian       
Computer Graphics, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

arXiv:1912.12296.pdf
(Preprint), 2MB

Supplementary Material (public)
There is no public supplementary material available
Citation

Golyanik, V., & Theobalt, C. (2019). A Quantum Computational Approach to Correspondence Problems on Point Sets. Retrieved from http://arxiv.org/abs/1912.12296.


Cite as: https://hdl.handle.net/21.11116/0000-0005-7DF0-0
Abstract
Modern adiabatic quantum computers (AQC) are already used to solve difficult
combinatorial optimisation problems in various domains of science. Currently,
only a few applications of AQC in computer vision have been demonstrated. We
review modern AQC and derive the first algorithm for transformation estimation
and point set alignment suitable for AQC. Our algorithm has a subquadratic
computational complexity of state preparation. We perform a systematic
experimental analysis of the proposed approach and show several examples of
successful point set alignment by simulated sampling. With this paper, we hope
to boost the research on AQC for computer vision.