A fast quantum mechanical algorithm for database search
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The Development and Comparison of Robust Methodsfor Estimating the Fundamental Matrix
International Journal of Computer Vision
Multiple view geometry in computer visiond
Multiple view geometry in computer visiond
Quantum computation and quantum information
Quantum computation and quantum information
Polynomial time quantum computation with advice
Information Processing Letters
Preemptive RANSAC for live structure and motion estimation
Machine Vision and Applications
Hybrid quantum-classical computing with applications to computer graphics
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Quantum Computer Science: An Introduction
Quantum Computer Science: An Introduction
Algorithms for quantum computation: discrete logarithms and factoring
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Quantum computation and image processing: new trends in artificial intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Quantum Information Processing
Strategies for designing geometric transformations on quantum images
Theoretical Computer Science
Watermarking and authentication of quantum images based on restricted geometric transformations
Information Sciences: an International Journal
A two-tier scheme for greyscale quantum image watermarking and recovery
International Journal of Innovative Computing and Applications
Histogram-based segmentation of quantum images
Theoretical Computer Science
| Hi-index | 0.00 |
The inherent parallelism of quantum systems determined not only the investigation of innovative applications that can be developed using these high performance computing systems, but also of ways to improve the performances over the classical case. Exploiting this parallelism recently led to the emergence of innovative ideas in the field of computer graphics, sketching the development of quantum rendering and quantum computational geometry. Following these tracks, we propose a new quantum algorithm for the RANdom SAmple Consensus (RANSAC) voting scheme. In this paper we show that by exploiting the unique features of quantum computing, generating uniform superpositions of states in the problem space and applying quantum operators to all states simultaneously, the performance of our quantum algorithm is orders of magnitude faster than the classical variant.