Paper
3 February 2004 Towards quantum template matching
Daniel Curtis, David A. Meyer
Author Affiliations +
Abstract
We consider the problem of locating a template as a subimage of a larger image. Computing the maxima of the correlation function solves this problem classically. Since the correlation can be calculated with the Fourier transform this problem is a good candidate for a superior quantum algorithmic solution. We outline how such an algorithm would work.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Daniel Curtis and David A. Meyer "Towards quantum template matching", Proc. SPIE 5161, Quantum Communications and Quantum Imaging, (3 February 2004); https://doi.org/10.1117/12.506669
Lens.org Logo
CITATIONS
Cited by 39 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fourier transforms

Quantum computing

Correlation function

Image processing

Quantum efficiency

Algorithm development

Quantum communications

RELATED CONTENT

Quaternion quantum image representation: new models
Proceedings of SPIE (April 21 2020)
Template matching using fast normalized cross correlation
Proceedings of SPIE (March 20 2001)
Quantum hidden subgroup algorithms The devil is in the...
Proceedings of SPIE (August 24 2004)
Quantum walks, automata, and structured search
Proceedings of SPIE (June 07 2007)
Irregular sampling algorithm for general subspaces
Proceedings of SPIE (December 04 2000)

Back to Top