This thesis makes several contributions to the field of data compression. Lossless data compression algorithms shorten the description of input objects, such as sequences of text, in a way that allows perfect recovery of the original object. Such algorithms exploit the fact that input objects are not uniformly distributed: by allocating shorter descriptions to more probable objects and longer d...

Using Focus of Attention (FoA) as a perceptual process in image and video compression belongs to well-known approaches to increase coding efficiency. It has been shown that foveated coding, when compression quality varies across the image according to region of interest, is more efficient than the alternative coding, when all region are compressed in a similar way. However, widespread use of su...

Wavelets offer an elegant technique for representing the levels of details present in an image. When an image is decomposed using wavelets, the high pass component carry less information, and vice-versa. The possibility of elimination of the high pass components gives higher compression ratio in the case of wavelet based image compression. To achieve higher compression ratio, various coding sch...

This paper deals with predictive coding techniques for efficient transmission or storage of two-level (black and white) digital images. Part I discusses algorithms for prediction. A predictor transforms the two-dimensional dependence in the original data into a form which can be handled by coding techniques for one-dimensional data. The implementation and performance of a fixed predictor, an ad...

Micropolar plasticity provides the capability to carry out post-failure simulations of geo-structures due to microstructural considerations and embedded length scale in its formulation. An essential part of the numerical implementation of a micropolar plasticity model is the integration of the rate constitutive equations. Efficiency and robustness of the implementation hinge on the type of int...

Packetized image communication over lossy channels presents a reconstruction problem at the decoder. To date, reconstruction algorithms have been developed for fixed coding techniques. This paper examines the dual problem — a block-based coding technique, namely a family of lapped orthogonal transforms (LOTs), is designed to maximize the reconstruction performance of a fixed reconstruction algo...

The implicit prerequisite for using HRRS images is that the can be trusted. Otherwise, their value would greatly reduced. As a new data security technology, subject-sensitive hashing overcomes shortcomings of existing integrity authentication methods and could realize images. However, algorithm, in terms robustness, limit its application. For example, lack robustness against JPEG compression ma...

 In this paper, utilization of clustering algorithms for data fusion in decision level is proposed. The results of automatic isolated word recognition, which are derived from speech spectrograph and Linear Predictive Coding (LPC) analysis, are combined with each other by using fuzzy clustering algorithms, especially fuzzy k-means and fuzzy vector quantization. Experimental results show that the...

A three-dimensional (3-D) image-compression algorithm based on integer wavelet transforms and zerotree coding is presented. The embedded coding of zerotrees of wavelet coefficients (EZW) algorithm is extended to three dimensions, and context-based adaptive arithmetic coding is used to improve its performance. The resultant algorithm, 3-D CB-EZW, efficiently encodes 3-D image data by the exploit...