Experiments with a very fast substring search algorithm
Software—Practice & Experience
A fast string searching algorithm
Communications of the ACM
Digital Image Processing (3rd Edition)
Digital Image Processing (3rd Edition)
Hi-index | 0.00 |
Several applications in image processing, computer vision and geographic information systems tend to deal with binary images. Few matching algorithms which search for a small image inside a large one exist in the literature. This article presents an enhancement for the Chain Code based exact match algorithm which transforms the matrices into reduced sizes [2]. The proposed enhancement utilizes a user input threshold value; i.e., miss-match or error value to allow for possible noise handling. Experiments show that the proposed modification discovers more patterns inside the search space.