In this paper, we propose a low complexity prioritized bit-plane coding scheme to improve the rate-distortion performance of cyclical block coding in MPEG-21 scalable video coding. Specifically, we use a block priority assignment algorithm to firstly transmit the symbols and the blocks with potentially better rate-distortion performance. Different blocks are allowed to be coded unequally in a c...

Markov chain models are commonly used for content-based appraisal of coding potential in genomic DNA. The ability of these models to distinguish coding from non-coding sequences depends on the method of parameter estimation, the validity of the estimated parameters for the species of interest, and the extent to which oligomer usage characterizes coding potential. We assessed performances of Mar...

The problem of predicting gene locations in newly sequenced DNA is well known but still far from being successfully resolved. A novel approach to the problem based on the frame dependent (non-homogeneous) Markov chain models of protein-coding regions was previously suggested. This approach is, apparently, one of the most powerful "search by content" methods. The initial idea of the method combi...

In our recent paper [9], we proposed a new hybrid genetic algorithm (NHGA) for the job shop scheduling problems. The method of encoding we used is Natural coding instead of traditional binary coding. This manner of coding has a lot of advantages but its convergence is still an open issue for years. This paper analyzes the convergence property of the NHGA by applying properties of Markov chains....

In this paper a new approach for adaptive wavelet image coding is introduced. Based on an adaptive quadtree image-block partition (similar to fractal coding) the diierent image blocks may be compressed independently in an adaptive manner. In order to adapt to local image statistics and features we present several possibilities how to optimize the transform part of a wavelet image block-coder. A...

In this article we study a special class of sliding block maps that we call variable block maps.We characterize the subsets of finite and infinite sequences that can be obtained as the image of another subset of symbolic sequences by a variable block map. On the other way, we show that the coding process induced by such kind of block maps can be reversed, even with partial knowledge about the v...

This paper presents warped discrete cosine transform (WDCT)-based low bit-rate block coding using image downsampling.While WDCT aims to improve the performance of conventional DCT by frequency warping, the WDCT has only been applicable to high bit-rate coding applications because of the overhead required to define the parameters of the warping filter. Recently, low bit-rate block coding based o...

In the first part of the correspondence we derive an upper bound on the undetected error probability of binary ( n , k ) block codes used on channels with memory described by Markov distributions. This bound is a generalization of the bound presented by Kasami et al. for the binary symmetric channel, and is given as an average value of some function of the composition of the state sequence of t...

The block bootstrap is the best known bootstrap method for time-series data when the analyst does not have a parametric model that reduces the data generation process to simple random sampling. However, the errors made by the block bootstrap converge to zero only slightly faster than those made by first-order asymptotic approximations. This paper describes a bootstrap procedure for data that ar...