Nonlinear subband decomposition structures in GF-(N) arithmetic

Cataloged from PDF version of article.In this paper, perfect reconstruction filter bank structures for GF-(N) fields are developed. The new filter banks are based on the nonlinear subband decomposition and they are especially useful to process binary images such as document and fingerprint images. (C) 1998 Elsevier Science B.V. All rights reserved

Morphological subband decomposition structure using GF(N) arithmetic

Linear filter banks with critical subsampling and perfect reconstruction (PR) property have received much interest and found numerous applications in signal and image processing. Recently, nonlinear filter bank structures with PR and critical subsampling have been proposed and used in image coding. In this paper, it is shown that PR nonlinear subband decomposition can be performed using the Gallois Field (GF) arithmetic. The result of the decomposition of an n-ary (e.g. 256-ary) input signal is still n-ary at different resolutions. This decomposition structure can be utilized for binary and 2k (k is an integer) level signal decompositions. Simulation studies are presented

Subband domain coding of binary textual images for document archiving

Cataloged from PDF version of article.In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands and the symbol library consisting of the character images are encoded. The method is suitable for keyword search in the compressed data. It is observed that very high compression ratios are obtained with this method. Simulation studies are presented

Coding of fingerprint images using binary subband decomposition and vector quantization

In this paper, compression of binary digital fingerprint images is considered. High compression ratios for fingerprint images is essential for handling huge amount of images in databases. In our method, the fingerprint image is first processed by a binary nonlinear subband decomposition filter bank and the resulting subimages are coded using vector quantizers designed for quantizing binary images. It is observed that the discriminating properties of the fingerprint, images are preserved at very low bit rates. Simulation results are presented

Subband coding of binary textual images for document retrieval

Efficient compression of binary textual images is very important for applications such as document archiving and retrieval, digital libraries and facsimile. The basic property of a textual image is the repetitions of small character images and curves inside the document. Exploiting the redundancy of these repetitions is the key step in most of the coding algorithms. In this paper, we use a similar compression method in subband domain. Four different subband decomposition schemes are described and their performances on textual image compression algorithm is examined. Experimentally, it is found that the described methods accomplish high compression ratios and they are suitable for fast database access and keyword search

Subband domain coding of binary textual images for document archiving

In this work, a subband domain textual image compression method is developed. The document image is first decomposed into subimages using binary subband decompositions. Next, the character locations in the subbands and the symbol library consisting of the character images are encoded. The method is suitable for keyword search in the compressed data. It is observed that very high compression ratios are obtained with this method. Simulation studies are presented

Orthonormal and biorthonormal filter banks as convolvers, and convolutional coding gain

Convolution theorems for filter bank transformers are introduced. Both uniform and nonuniform decimation ratios are considered, and orthonormal as well as biorthonormal cases are addressed. All the theorems are such that the original convolution reduces to a sum of shorter, decoupled convolutions in the subbands. That is, there is no need to have cross convolution between subbands. For the orthonormal case, expressions for optimal bit allocation and the optimized coding gain are derived. The contribution to coding gain comes partly from the nonuniformity of the signal spectrum and partly from nonuniformity of the filter spectrum. With one of the convolved sequences taken to be the unit pulse function,,e coding gain expressions reduce to those for traditional subband and transform coding. The filter-bank convolver has about the same computational complexity as a traditional convolver, if the analysis bank has small complexity compared to the convolution itself

Image coding for digitized libraries

Ankara : The Department of Electrical and Electronics Engineering and the Institute of Engineering and Sciences of Bilkent Univ., 1998.Thesis (Ph.D.) -- Bilkent University, 1998.Includes bibliographical references leaves 104-113III this thesis, image coding methods for two basic image types are developed under a digitized library framework. The two image types are gray tone or color images, and binary textual images, which are the digitized image versions of text documents. The grciy tone images are encoded using an adaptive subband decomposition followed by zerotree quantizers. The adaptive sub- l)and decomposition filter bank adaptively updates the filter bank coefficients in which the values of one of the subbands is predicted from the other sub- band. It is observed that the adaptive subband decomposition performs better than a regulcir subband decomposition with a fixed filter bank in terms of compression. For the binary textual images, a compression algorithm using binary subband decomposition followed by a textual image compression (TIC) method that exploits the redundancy in repeating characters is developed. The binary subband decomposition yields binary sub-images, and the TIC method is applied to the low band sub-image. Obtaining binary sub-images improves compression results as well as pattern matching time of the TIC method. Simulation results for both adaptive subband decomposition and multiresolution TIC methods indicate improvements over the methods described in the literature.Gerek, Ömer NezihPh.D