Compression-Based Template Matching
نویسندگان
چکیده
Textual image compression is a method of both lossy and lossless image compression that is particularly effective for images containing repeated sub-images, notably pages of text (Mohiuddin et al., 1984; Witten et al., 1992). The process comprises three main steps: Extracting all the characters from an image; Building a library that contains one representative for each character class; Compressing the image with respect to the library.
منابع مشابه
Evaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کاملA New RSTB Invariant Image Template Matching Based on Log-Spectrum and Modified ICA
Template matching is a widely used technique in many of image processing and machine vision applications. In this paper we propose a new as well as a fast and reliable template matching algorithm which is invariant to Rotation, Scale, Translation and Brightness (RSTB) changes. For this purpose, we adopt the idea of ring projection transform (RPT) of image. In the proposed algorithm, two novel s...
متن کاملEnhancing the Stability of Speaker Verification with Compressed Templates
Time-domain template compression is an effective means to reduce storage and computation complexity of speaker verification systems based on template matching. Yet this compression may cause severe performance deterioration. In this paper we propose a frame-level verification method to cut down this deterioration. A frame discrimination procedure is then introduced to further improve the verifi...
متن کاملReal-Time Facial Feature Detection By Statistical Template Matching
This paper addresses a problem of robust, accurate and fast object detection in complex environments, such as cluttered backgrounds and low-quality images. A new method called Statistical Template Matching is proposed to detect objects, represented by a set of template regions. A similarity measure between the image and a template is derived from the Fisher criterion. We show how to apply our m...
متن کاملNew Methods for Template Selection and Compression in Continuous Speech Recognition
We propose a maximum likelihood method for selecting template representatives, and in order to include more information in the selected template representatives, we further propose to create compressed template representatives by Gaussian mixture model (GMM) merging algorithm. A Kullback-Leibler (KL) divergence based local distance is proposed for Dynamic Time Warping (DTW) in template matching...
متن کامل