Towards quantum template matching

被引：24

作者：

Curtis, D ^{[1
]}

Meyer, DA ^{[1
]}

机构：

[1] Univ Calif San Diego, Dept Math, La Jolla, CA 92093 USA

来源：

QUANTUM COMMUNICATIONS AND QUANTUM IMAGING | 2004年 / 5161卷

关键词：

image processing; Fourier transform; phase-only correlation;

D O I：

10.1117/12.506669

中图分类号：

O43 [光学];

学科分类号：

070207 ; 0803 ;

摘要：

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.

引用

页码：134 / 141

页数：8

共 25 条

[1]

Barg A., 1998, Proceedings. Thiry-Sixth Annual Allerton Conference on Communication, Control, and Computing, P359

[2] Quantum complexity theory [J].

Bernstein, E ;

Vazirani, U .

SIAM JOURNAL ON COMPUTING, 1997, 26 (05) :1411-1473

[3] An exact quantum polynomial-time algorithm for Simon's problem [J].

Brassard, G ;

Hoyer, P .

PROCEEDINGS OF THE FIFTH ISRAELI SYMPOSIUM ON THEORY OF COMPUTING AND SYSTEMS, 1997, :12-23

[4]

BRASSARD G, QUANTPH0005055

[5]

BRASSARD G, QUANTPH9704027

[6] Nested quantum search and structured problems [J].

Cerf, NJ ;

Grover, LK ;

Williams, CP .

PHYSICAL REVIEW A, 2000, 61 (03) :14

[7]

Cleve R, 1998, P ROY SOC A-MATH PHY, V454, P339, DOI 10.1002/(SICI)1099-0526(199809/10)4:1<33::AID-CPLX10>3.0.CO

[8]

2-U

[9]

COPPERSMITH D, 1994, 19642 IBM

[10]

FARHI E, QUANTPH9711035

← 1 2 3 →