This paper describes a low complexity variable bit-rate (VBR) control method that achieves excellent and constant visual quality for single-pass, real time MPEG-2 encoding in DVD recorders. The bit-rate is controlled ...
详细信息
This paper describes a low complexity variable bit-rate (VBR) control method that achieves excellent and constant visual quality for single-pass, real time MPEG-2 encoding in DVD recorders. The bit-rate is controlled in a very accurate way.
lowbitrate audio coding often relies on Fourier representation despite its limitations for transient signal modeling. This study proposes alternative decompositions and expansion strategies that lead to more accurat...
详细信息
In this paper, we propose a new wavelet imtra-frame coding algorithm based on Information Source Partition Theorem. The algorithm is motivated by SPIHT algorithm, but it is more efficient than SPIHT codec and can also...
详细信息
Previously, we have proposed a very simple zerotree coding algorithm called listless zerotree coding (LZC) whose coding memory requirement is significantly lower than SPIHT's. In common with SPIHT, LZC performs a ...
详细信息
ISBN:
(纸本)0780371011
Previously, we have proposed a very simple zerotree coding algorithm called listless zerotree coding (LZC) whose coding memory requirement is significantly lower than SPIHT's. In common with SPIHT, LZC performs a recursive tree search that is likely to discard some important coefficients when the bitrate is low. Therefore, in this paper we propose a new LZC algorithm that uses a raster tree search to minimize important information loss. The zerotree structure is embedded into the recursive tree search but for the raster tree search the zerotree structure will need to be stored in the buffer memory. The new LZC utilizes a flag bit-map to store the matrix-wide zerotree structure that is conventionally stored in coordinate lists by other raster tree search zerotree algorithms. Consequently, the new LZC exhibits not only a dramatically lowcoding memory requirement but also a very lowcoding complexity.
Previously, we have proposed a very simple zerotree coding algorithm called listless zerotree coding (LZC) whose coding memory requirement is significantly lower than that of SPIHT. In common with SPIHT, LZC performs ...
详细信息
Previously, we have proposed a very simple zerotree coding algorithm called listless zerotree coding (LZC) whose coding memory requirement is significantly lower than that of SPIHT. In common with SPIHT, LZC performs a recursive tree search that is likely to discard some important coefficients when the bitrate is low. Therefore, we propose a new LZC algorithm that uses a raster tree search to minimize important information loss. The zerotree structure is embedded into the recursive tree search but for the raster tree search the zerotree structure will need to be stored in the buffer memory. The new LZC utilizes a flag bitmap to store the matrix-wide zerotree structure that is conventionally stored in coordinate lists by other raster tree search zerotree algorithms. Consequently, the new LZC exhibits not only a dramatically lowcoding memory requirement but also a very lowcoding complexity.
The proceedings contains 6 papers from the iee colloquium on lowbitrateimagecoding organized by the Professional Group E4 (image processing and vision) and held at the Savoy Place on June 6, 1995. Topics discussed...
详细信息
The proceedings contains 6 papers from the iee colloquium on lowbitrateimagecoding organized by the Professional Group E4 (image processing and vision) and held at the Savoy Place on June 6, 1995. Topics discussed include vector quantization;motion compensation;neural networks;motion compensation;deformation estimation;image segmentation;and interframe coding.
The discrete wavelet decomposition of wide-sense stationary Markov processes is investigated with application to imagecoding. It is shown that the wavelet coefficients of the decomposition are a set wide-sense statio...
详细信息
A novel IFS coding scheme is proposed for image compression. The present method is based on hierarchical structure or the Gaussian pyramid of contracted images. In comparison with the conventional scheme (IFS or JPEG)...
详细信息
A novel IFS coding scheme is proposed for image compression. The present method is based on hierarchical structure or the Gaussian pyramid of contracted images. In comparison with the conventional scheme (IFS or JPEG), the presently introduced hierarchical scheme is found to be useful, especially for relatively low-bitrates. This is considered to be as a result of the subband division of the original image and the existence of the redundancy between the range and domain characteristics in the image. On the basis of the present scheme, it is found that the bitrate may be reduced up to the conventional scheme with the transform coding scheme, for the original monochrome image with 256 x 256 size and 8-bit gray-scale levels.
In the paper,a new method based on wavelet theory have been developed for lowbitratecoding of *** transform results in logarithmic division of frequency space which can be justified by relevance to human visual sys...
详细信息
In the paper,a new method based on wavelet theory have been developed for lowbitratecoding of *** transform results in logarithmic division of frequency space which can be justified by relevance to human visual system models and allows each frequency band to be efficiently *** order to achieve lowbitrate,two new coding schemes respectively based on SQ and VQ have been *** comparison with other previously published results indicates that these tow new methods are competitive.
暂无评论