DocumentCode
977656
Title
A polynomial time algorithm for subpattern matching
Author
Nyo, H.L. ; Minsoo Suk
Volume
74
Issue
2
fYear
1986
Firstpage
375
Lastpage
377
Abstract
An O(N3K) time algorithm for searching matches of a template of size K in an image of size N is given. It uses bounding regions and the Soviet Ellipsoid Algorithm [1]. It will work under moderately heavy shift noise.
Keywords
Ellipsoids; Image restoration; Iterative algorithms; Polynomials; Signal restoration; Testing;
fLanguage
English
Journal_Title
Proceedings of the IEEE
Publisher
ieee
ISSN
0018-9219
Type
jour
DOI
10.1109/PROC.1986.13471
Filename
1457739
Link To Document