We present a method for low bit rate video coding based on wavelet lattice vector quantisation. It is shown that the overlapped block matching (OBM) motion compensation increases the efficiency of the wavelet video co...
详细信息
We present a method for low bit rate video coding based on wavelet lattice vector quantisation. It is shown that the overlapped block matching (OBM) motion compensation increases the efficiency of the wavelet video codec, by eliminating the blocking artefacts in the prediction error image introduced from the conventional block matching. The motion compensated prediction error signal is coded using a method which combines wavelet transform and lattice vector quantisation, referred to as successive approximation wavelet lattice vector quantisation (SAWLVQ). In this technique, the most important (in terms of energy) wavelet coefficients are successively coded by a series of vectors of decreasing magnitudes. The structural similarities among the bands of same orientation are exploited by incorporating a block zero-tree structure. Simulation results demonstrate that this scheme achieves very good performance for low bit rate video coding. Comparison with the standard RM8 model of the H.261 video codec, shows that the OBM-SAWLVQ codec results in improvements in both the peak signal-to-noise ratio performance and the subjective quality of the reconstructed pictures.< >
The design of a waveletimage coder can be divided into three parts: wavelet representation, quantization, and error-free encoding. We evaluate each of these parts individually and synthesize them into complete coders...
详细信息
The design of a waveletimage coder can be divided into three parts: wavelet representation, quantization, and error-free encoding. We evaluate each of these parts individually and synthesize them into complete coders. The evaluation is in the rate-distortion sense; two image quality metrics are used: a perception-based, quantitative picture quality scale (PQS) and the conventional distortion measure, peak signal-to-noise ratio (PSNR). Two representative wavelets, three quantizers, three encoders, and some combinations of these parts are comparatively evaluated. Our results provide an insight into the design issues of optimizing wavelet coders, as well as a good reference for application developers to choose from an increasingly large family of wavelet coders for their applications.
This paper develops a two-dimensional M-band translation-invariant wavelet transform (2-D MTI). Use of the MTI overcomes the shift-variance of the wavelet transform by applying a cost function over M shifts of the inp...
详细信息
This paper develops a two-dimensional M-band translation-invariant wavelet transform (2-D MTI). Use of the MTI overcomes the shift-variance of the wavelet transform by applying a cost function over M shifts of the input signal. The new transform is proven to be translation-invariant. Use of M-band wavelets enables a finer frequency partitioning and greater energy compaction in the transform representation. Examples are presented which show that the translation-invariant transforms provide superior energy concentration compared to the corresponding nominal wavelet transforms. Examples are also presented comparing the energy concentration capability of M-band wavelets and the modulated lapped transform (MLT). We explored the MTI as a tool for imageprocessing by using it to represent several different images.
Presents a fast algorithm for the computation of the wavelet transform in higher dimensional Euclidean space R/sup n/ with arbitrary shaped wavelets. The algorithm is a direct consequence of the convolution property o...
详细信息
Presents a fast algorithm for the computation of the wavelet transform in higher dimensional Euclidean space R/sup n/ with arbitrary shaped wavelets. The algorithm is a direct consequence of the convolution property of the Radon transform and shows significant improvement in speed. The authors also present a novel approach for the computation of the Daubechies type wavelet transform under the Radon transform domain where the n-dimensional multiresolution analysis (MRA) is reduced to one-dimensional MRA. They found applications of this approach on, for instance, multiresolution reconstruction of a tomographic image with the standard methods of denoising, where determination of wavelet coefficients is required under the Radon transform domain. Along with the possibility of reducing samples angularly with decreasing resolution, the efficiency can be further improved. Also, extra properties such as the "rotated" wavelet can be easily implemented with this algorithm.
A novel intraframe source coding algorithm suitable for the recording of digital high definition television signals is presented. A multi-layered, hierarchical description of the source signal is obtained by means of ...
详细信息
A novel intraframe source coding algorithm suitable for the recording of digital high definition television signals is presented. A multi-layered, hierarchical description of the source signal is obtained by means of a quad-tree, half-band wavelet transform. This transform decomposes the input signal into a collection of spectrally non-overlapping subbands. Individual subbands are quantised and entropy coded by using a novel predictive arithmetic coding technique. The algorithm is tuned to achieve bit-rate reduction ratios in the range 8:1-4:1 which is most useful for recording applications. Results obtained from simulating the coding algorithm, show noticeable improvement over the current state-of-the-art international standard algorithm for still picture encoding both in terms of subjective quality and of measured mean-square error.< >
Compares for image coding applications a low-complexity iiR wavelet based on an all-pass polyphase decomposition to a pair of linear phase biorthogonal wavelets. To code the wavelet coefficients, the authors use Shapi...
详细信息
Compares for image coding applications a low-complexity iiR wavelet based on an all-pass polyphase decomposition to a pair of linear phase biorthogonal wavelets. To code the wavelet coefficients, the authors use Shapiro's (1993) zerotree algorithm which has the virtues of being both efficient and delivering excellent performance (in a rate-distortion sense). They consider a variety of methods for eliminating filter transients at the image boundaries including circular convolution, symmetric extension (for the biorthogonal wavelets), and direct transmission (for the iiR wavelet). By also coding the filter states in a zerotree form, they find that direct transmission generally performs better than circular convolution. Finally, they show that the use of this iiR wavelet provides equivalent performance to the biorthogonal wavelets at greatly reduced computational complexity.
Reviews the characteristics of hyperspectral imaging sensors and describes several important data exploitation applications in remote sensing. The authors then focus on a particular signalprocessing application, mate...
详细信息
Reviews the characteristics of hyperspectral imaging sensors and describes several important data exploitation applications in remote sensing. The authors then focus on a particular signalprocessing application, material identification, and propose a novel algorithm based on multiresolution wavelet techniques. Finally, they demonstrate the multiresolution material identification algorithm on data collected with a all-band hyperspectral sensor.
wavelet transforms have proven to be useful tools for several applications, including signal analysis, signal coding, and image compression. This paper surveys the VLSI architectures that have been proposed for comput...
详细信息
wavelet transforms have proven to be useful tools for several applications, including signal analysis, signal coding, and image compression. This paper surveys the VLSI architectures that have been proposed for computing the discrete and continuous wavelet transforms for 1-D and 2-D signals. The proposed architectures range from SIMD arrays to folded architectures such as systolic arrays and parallel filters. The SIMD arrays have a size that is proportional to that of the data sequence and are optimal with respect to time. The folded architectures, on the other hand, support single chip implementations and are optimal with respect to both area and time under the word-serial model.
In this paper the problem of progressive lossless image coding is addressed. Many applications require a lossless compression of the image data. The possibility of progressive decoding of the bitstream adds a new func...
详细信息
In this paper the problem of progressive lossless image coding is addressed. Many applications require a lossless compression of the image data. The possibility of progressive decoding of the bitstream adds a new functionality for those applications using data browsing. In practice, the proposed scheme can be of intensive use when accessing large databases of images requiring a lossless compression (especially for medical applications). The international standard JPEG allows a lossless mode. It is based on an entropy reduction of the data using various kinds of estimators followed by source coding. The proposed algorithm works with a completely different philosophy summarized in the following four key points: 1) a perfect reconstruction hierarchical morphological subband decomposition yielding only integer coefficients, 2) prediction of the absence of significant information across scales using zerotrees of wavelet coefficients, 3) entropy-coded successive-approximation quantization, and 4) lossless data compression via adaptive arithmetic coding. This approach produces a completely embedded bitstream. Thus, it is possible to decode only partially the bitstream to reconstruct an approximation of the original image.
Discrete-time cosine modulated filter banks, or modulated lapped transforms (MLT), have been in use for some time. Due to a few of their properties, they have become quite popular. For example, all filters (basis func...
详细信息
Discrete-time cosine modulated filter banks, or modulated lapped transforms (MLT), have been in use for some time. Due to a few of their properties, they have become quite popular. For example, all filters (basis functions) of a filter bank are obtained by appropriate modulation of a single prototype filter. We present a new method for constructing local orthogonal bases, both in continuous and discrete time. The approach is very general and can handle a large variety of cases interesting for the applications.
暂无评论