Lowering frame-buffering requirements of 3-D wavelet transform coding of interactive video

Khalil, H. M.; Atiya, Amir F.; Shaheen, Samir I.

doi:10.1109/icip.1999.817258

Cited by 4 publications

(7 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…1) because the wavelet transforms are applied alternately along the , , and directions. The symmetric 3-D wavelet transform has been used in [4], [11], [17], and [28] as a straightforward extension from the popular symmetric 2-D wavelet transform in the image compression. Furthermore, since the transform is symmetric, a simple symmetric 3-D tree structure can be used directly in the following zerotree coding algorithms.…”

Section: -D Wavelet Transformmentioning

confidence: 99%

“…Motivated by the success of the zerotree methods in image compression, researchers have extended nearly all of them from two-dimensional (2-D) to 3-D for video coding [2], [4], [11], [12], [17], [19], [20], [25], [27]- [29]. The basic structure of these codecs is relatively straightforward.…”

Section: Introductionmentioning

confidence: 99%

“…Tham et al [25] use the TriZTR idea, which defines three zerotrees. In [11], a general low-delay method is proposed. The first extension of the SPIHT is the 3-D SPIHT [13].…”

Section: Introductionmentioning

confidence: 99%

“…Unfortunately, most of the existing 3-D zerotree codecs do not consider the structure of the tree systematically. A commonly used tree is the symmetric 3-D tree [4], [11], [13], [17], [19], [20], [28]. The performance of the symmetric 3-D tree is not optimal because the properties of the video signal and the wavelet coefficients are not symmetric along all three dimensions.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Optimal 3-d coefficient tree structure for 3-d wavelet video coding

Dong

Zheng

et al. 2003

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

An optimal three-dimensional (3-D) coefficient tree structure for 3-D zerotree wavelet video coding is considered in this paper. The 3-D zerotree wavelet video coding is inspired by the success of the two-dimensional (2-D) zerotree wavelet image coding. Existing 3-D zerotree wavelet video codecs use the either symmetric or symmetric-alike 3-D tree structure, which is a straightforward extension of the symmetric 2-D tree structure in the zerotree wavelet image coding. In this paper, we show that the 3-D zerotree coding does not need to be applied symmetrically along all the directions, as the 2-D zerotree image coding does. We find that an asymmetric 3-D tree structure working with a more flexible asymmetric 3-D wavelet transform can produce a higher compression ratio than traditional symmetric approaches. The new 3-D tree structure can be used to improve the rate-distortion performance of many existing 3-D zerotree wavelet video codecs without sacrificing other features such as scalability and computational efficiency. The new tree structure is applied to the 3-D set partitioning in hierarchical trees method and receives convincing peak signal-to-noise ratio improvements in experiments. Index Terms-Set partitioning in hierarchical trees (SPIHT), symmetric and symmetric-alike three-dimensional (3-D) tree structure, 3-D zerotree coding, video compression, wavelet transform.

show abstract

Section: -D Wavelet Transformmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…Tham et al [25] use the TriZTR idea, which defines three zerotrees. In [11], a general low-delay method is proposed. The first extension of the SPIHT is the 3-D SPIHT [13].…”

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal 3-d coefficient tree structure for 3-d wavelet video coding

Dong

Zheng

et al. 2003

IEEE Trans. Circuits Syst. Video Technol.

View full text Add to dashboard Cite

show abstract

“…In order to create a system that is suitable for implementation in hardware constrained environment, many research works have also been carried out to reduce the complexity of the 3DSPIHT itself. Detailed information on these works can be found in [7]- [9].…”

Section: Introductionmentioning

confidence: 99%

Three-Dimensional Binary-Uncoded Video Compression Using 3DSPIHT-ZTR

Chia

Ang

Seng

2009

2009 International Conference on Intelligent Human-Machine Systems and Cybernetics

View full text Add to dashboard Cite

In conventional video coding, motion compensation is commonly being used to remove the temporal redundancy. But the computational complexity introduced by the motion compensation can be very high, especially when the full search is adopted. The 3DSPIHT resolves this problem by replacing the motion compensation with the temporal wavelet transform, which require lower computational complexity. However, the performance of the 3DSPIHT is optimal only when Arithmetic Coding (AC) is incorporated. This contradicts the initial idea of reducing the computational complexity with the wavelet transform, because the computational complexity introduced by AC is sufficiently high. In this paper, an efficient binaryuncoded algorithm for video coding called the 3DSPIHT-ZTR is proposed. The idea is to re-introduce the use of ZTR symbol, which is initially used in the Embedded Zerotree Wavelet (EZW) algorithm, into 3DSPIHT. In addition, the significant offspring are also encoded in a slightly different way to further enhance the performance. The performance of 3DSPIHT-ZTR is approximately 1.5 dB better than the conventional 3DSPIHT in terms of PSNR. Its performance is also comparable to 3DSPIHT with AC under certain circumstances.

show abstract

A wavelet video coding algorithm with balanced significance probability tree based on energy weighting

Song

Wang

et al. 2019

Multimed Tools Appl

View full text Add to dashboard Cite

Lowering frame-buffering requirements of 3-D wavelet transform coding of interactive video

Cited by 4 publications

References 8 publications

Optimal 3-d coefficient tree structure for 3-d wavelet video coding

Optimal 3-d coefficient tree structure for 3-d wavelet video coding

Three-Dimensional Binary-Uncoded Video Compression Using 3DSPIHT-ZTR

A wavelet video coding algorithm with balanced significance probability tree based on energy weighting

Contact Info

Product

Resources

About