Smart Mapping for Quick Detection of Dissimilar Binary Images

In previous work, a probabilistic image matching model for binary images was developed that predicts the number of mappings required to detect dissimilarity between any pair of binary images based on the amount of similarity between them. The model showed that dissimilarity can be detected quickly by randomly comparing corresponding points between two binary images. In this paper, we improve on this quickness for images that have dissimilarity concentrated near their centers. We apply smart mapping schemes to different image sets and analyze the results to show the effectiveness of this mapping scheme for images that have dissimilarity concentrated near their center. We compare three different smart mapping schemes with three different mapping densities to find the best mapping / best density performance.