A new fast 3D wavelet transform algorithm for video compression

A new fast 3D wavelet transform based algorithm for video compression is presented. The main difference between it and the classical video compression algorithms is the temporal decomposition. The new algorithm reduces heavily the processing time for compression and decompression of video sequences, keeping or overcoming the quality of the reconstructed sequences. In addition, it cuts the memory demands heavily. Some figures show the experimental results.

[1]  Stéphane Mallat,et al.  Multifrequency channel decompositions of images and wavelet models , 1989, IEEE Trans. Acoust. Speech Signal Process..

[2]  Michel Barlaud,et al.  Image coding using wavelet transform , 1992, IEEE Trans. Image Process..

[3]  Jens-Rainer Ohm,et al.  Three-dimensional subband coding with motion compensation , 1994, IEEE Trans. Image Process..

[4]  William A. Pearlman,et al.  An embedded wavelet video coder using three-dimensional set partitioning in hierarchical trees (SPIHT) , 1997, Proceedings DCC '97. Data Compression Conference.

[5]  Andreas Uhl,et al.  Hardware and Software Aspects for 3-D Wavelet Decomposition on Shared Memory MIMD Computers , 1999, ACPC.

[6]  Francisco Guindos Rojas,et al.  Tratamiento digital de imágenes con IMtdi , 2001 .

[7]  José Duato,et al.  Efficient 3D wavelet transform decomposition for video compression , 2001, Proceedings Second International Workshop on Digital and Computational Video.