An efficient encoding algorithm for vector quantization based on subvector technique
In this paper, a new and fast encoding algorithm for vector quantization is presented. This algorithm makes full use of two characteristics of a vector: the sum and the variance. A vector is separated into two subvectors: one is composed of the first ...
A low memory zerotree coding for arbitrarily shaped objects
The set partitioning in hierarchical trees (SPIHT) algorithm is a computationally simple and efficient zerotree coding technique for image compression. However, the high working memory requirement is its main drawback for hardware realization. We ...
Adaptive vector quantization with codebook updating based on locality and history
We propose two techniques that are applicable to any adaptive vector quantization (AVQ) systems. The first one is called the locality-based codebook updating: when performing a codebook updating, we update the operational codebook using not only the ...
Structure and texture filling-in of missing image blocks in wireless transmission and compression applications
An approach for filling-in blocks of missing data in wireless image transmission is presented. When compression algorithms such as JPEG are used as part of the wireless transmission process, images are first tiled into blocks of 8 × 8 pixels. When ...
A cellular coevolutionary algorithm for image segmentation
Clustering is inherently a difficult problem, both with respect to the definition of adequate models as well as to the optimization of the models. We present a model for the cluster problem that does not need knowledge about the number of clusters a ...
Two Bayesian methods for junction classification
We propose two Bayesian methods for junction classification which evolve from the Kona method: a region-based method and an edge-based method. Our region-based method computes a one-dimensional (1-D) profile where wedges are mapped to intervals with ...
Refreshment need metrics for improved shape and texture object-based resilient video coding
Video encoders may use several techniques to improve error resilience. In particular, for video encoders that rely on predictive (inter) coding to remove temporal redundancy, intra coding refreshment is especially useful to stop error propagation when ...
Motion analysis and segmentation through spatio-temporal slices processing
This paper presents new approaches in characterizing and segmenting the content of video. These approaches are developed based upon the pattern analysis of spatio-temporal slices. While traditional approaches to motion sequence analysis tend to ...
Rate-distortion modeling for multiscale binary shape coding based on Markov random fields
The purpose of this paper it to explore the relationship between the rate-distortion characteristics of multiscale binary shape and Markov random field (MRF) parameters. For coding, it is important that the input parameters that will be used to define ...
Compression of the layered depth image
A layered depth image (LDI) is a new popular representation and rendering method for objects with complex geometries. Similar to a two-dimensional (2-D) image, the LDI consists of an array of pixels. However, unlike the 2-D image, an LDI pixel has depth ...
FIRE: fractal indexing with robust extensions for image databases
As already documented in the literature, fractal image encoding is a family of techniques that achieves a good compromise between compression and perceived quality by exploiting the self-similarities present in an image. Furthermore, because of its ...
