An efficient packetization algorithm for JPEG2000

The paper presents an efficient algorithm for post compression optimal rate allocation and packetization within JPEG2000 encoding. JPEG2000, the new ISO/ITU-T standard for still image coding, has been shown to provide superior coding efficiency to the previous standard, JPEG. However, the added efficiency of JPEG2000 comes at the cost of increased computational requirements. To improve the computational efficiency of JPEG2000, we propose a new algorithm for JPEG2000 rate allocation and packetization utilizing the D-heap data structure. Implemented in Jasper and tested on five reference images, this algorithm provides a speedup for JPEG2000's rate allocation and packetization of 15.9 times on average, and enables an average overall speedup of 33% for JPEG2000 encoding.

[1]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

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

[3]  David S. Taubman,et al.  High performance scalable image compression with EBCOT , 1999, Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348).

[4]  I. Daubechies,et al.  Wavelet Transforms That Map Integers to Integers , 1998 .

[5]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[6]  Touradj Ebrahimi,et al.  The JPEG 2000 still image compression standard , 2001, IEEE Signal Process. Mag..

[7]  Touradj Ebrahimi,et al.  The JPEG2000 still image coding system: an overview , 2000, IEEE Trans. Consumer Electron..