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;
