Static compression for dynamic texts

Abstract

This paper addresses the problem of pattern comparison by using an information or compression based approach. Following Mohiuddin et at. (1984), we use the amount of uncertainty or entropy between marks as the criterion for the matching process. There are two principal issues to investigate when studying template matching methods: their susceptibility to different kinds of noise, and how they respond to errors in the initial registration. Because of the computation-intensive nature of the comparison operation, many schemes have been devised to pre-filter or screen the marks in advance to determine those that will surely fail the match. We present a novel method of screening which uses a quad..