Open Access Open Access  Restricted Access Subscription or Fee Access

A Parallel Unit Encoding Stage for BCWT using GPGPU

E Sudarshan, Ch. Satyanarayana, C. Shoba Bindu



A backward coding of wavelet trees (BCWT) algorithm begins the coding process from the lower-level to the higher-level of the wavelet tree. While processing, it builds up the maximum quantization levels of the descendant (MQD) map and maximum quantization level (MQL) by the support of the wavelet coefficients of the corresponding image. In the processes of making the serial encoding stages into parallel stages, primarily we deal with a prominent prospect called parallel unit encoding. The parallel unit encoding stage will save the memory up to 30% by avoiding the contiguous zero bits from the original element bit-string before storing into the output stream. The algorithm velocity improved up to 17% by the inclusion of the parallelism on the development of the GPGPU platform using CUDA architecture over the CPU based BCWT encoding procedure. 

Keywords: Parallelism, BCWT, MQD map, CUDA, maximum quantization level, GPGPU

Cite this Article

Sudarshan E, Ch. Satyanarayana, Shoba Bindu C. A Parallel Unit Encoding Stage for BCWT using GPGPU. Journal of Image Processing & Pattern Recognition Progress. 2017; 4(3): 13–23p.


Parallelism, BCWT, MQD map, CUDA, Maximum quantization Level, GPGPU.

Full Text:



J.M. Shaprio, “Embedded Image Coding Using Zerotrees of Wavelet Coefficients,” IEEE Trans. on Signal Processing, vol. 41, pp. 3445-3459, Dec. 1993.

Said and W.A. Pearlman, “A New Fast and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees,” IEEE Trans. on Circuits and Systems for Video Technology, vol. 6, pp. 243-250, 1996.

W.A. Pearlman, “Trends of Tree-Based, Set Partitioning Compression Techniques in Still and Moving Image Systems (Invited, keynote paper),” Proc. of Picture Coding Symposium, Seoul, Korea, pp. 1-8, April 2001.

M.G. Ramos and S.S. Hemami, “Activity Selective SPIHT Coding,” Proc. of SPIE Visual Comm. and Image, San Jose, CA, Jan. 1999.

H. Danyali and A. Mertins, “Highly Scalable Image Compression Based on SPIHT for Network Applications,” Proc. of IEEE Int. Conf. on Image Processing, Rochester, NY, pp. 217-220, Sept. 2002.

J. Oliver and M.P. Malumbres, “Fast and Efficient Spatial Scalable Image Compression using Wavelet Lower Trees,” Proc. of IEEE Data Compression Conf., pp. 133-142, Mar. 2003.

F.W. Wheeler and W.A. Pearlman. “SPIHT image compression without lists”, Proc. of IEEE ICASSP 2000.

W.-K. Lin and N. Burgess, “Listless zerotree coding for color images”, Proc. of the 32nd Asilomar Conf. on Signals, Systems and Computers, vol. 1, pp. 231-235, Nov.1998.

J.M. Shapiro, “A fast technique for identifying zerotrees in the EZW algorithm,” Proc. IEEE Int. Conf. Acoust., Speech, Signal Processing, vol. 3, pp. 1455-- 1458, May 1996.

Jiangling Guo, “A Hybrid Vector Scalar Quantization Based on Backward Coding of Wavelet Trees”, Ph. D. Dissertation, Texas Tech University, December 2005.

Nvidia, "GPU Application," [Online]. Available:

J. Matela, "GPU-Based DWT acceleration for JPEG2000," Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, pp. 136-143, 2009.

M.-C. Che and J. Liang, "GPU implementation of JPEG XR," in Proc. of SPIE-IS&T Electronic Imaging, 2010.

Abi-Chahla, Fedy (June 18, 2008). "Nvidia's CUDA: The End of the CPU?” Tom's Hardware.

"The OpenCL Specification." Khronos Group.

J. Guo, S. Mitra, B. Nutter and T. Karp, "A fast and low complexity image codec based on backward coding of wavelet trees," Data Compression Conference Proceedings, pp. 292-301, 2006.

The Internation Standards of Lossless images, benchmarks of images and respective results:

Nvidia, "CUDA Zone," [Online]. Available:


  • There are currently no refbacks.

This site has been shifted to