Skip to main content

Performance Analysis of Generalized Zerotree Coders Varying the Maximum Zerotree Degree

  • Conference paper
Advanced Concepts for Intelligent Vision Systems (ACIVS 2008)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 5259))

Abstract

Despite the release of the JPEG-2000 standard, wavelet-based zerotree coders keep being object of intense research because of their conceptual simplicity and excellent performance. Recently, it has been shown that all zerotree coders can be described by specifying the involved data structures (typically, degree-k zerotrees) and a very limited set of tree decomposition rules, leading to the class of generalized zerotree coders (GZC). Thanks to this abstraction, defining and implementing new coders of this class becomes straightforward. In this work, we then investigate, by means of numerical experiments on various types of visual sources, the performance achievable by such coders as a function of the degree of the underlying zerotrees.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Said, A., Pearlman, W.A.: New fast and efficient image codec based on set partioning in hierarchical tree. IEEE Trans. on Circuits and Systems on Video Technology 6(3), 243–250 (1996)

    Article  Google Scholar 

  2. Taubman, D.: High performance scalable image compression with ebcot. IEEE Trans. on Image Processing 9(7), 1158–1170 (2000)

    Article  Google Scholar 

  3. Liu, J., Moulin, P.: Information-theoretic analysis of interscale and intrascale dependencies between image wavelet coefficients. IEEE Trans. On Image Processing 10(11), 1647–1658 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  4. Shapiro, J.M.: Embedded image coding using zerotrees of wavelet coefficients. IEEE Trans. on Signal Processing 41(12), 3445–3463 (1993)

    Article  MATH  Google Scholar 

  5. Kim, B.-J., Xiong, Z., Pearlman, W.A.: Low bit-rate, scalable video coding with 3d set partioning in hierarchical trees (3d spiht). IEEE Trans. On Circuits and Systems on Video Technology 10(8), 1374–1387 (2000)

    Article  Google Scholar 

  6. Dragotti, P.L., Poggi, G., Ragozini, A.R.P.: Compression of multispectral images by three-dimensional spiht algorithm. IEEE Trans. On Geoscience and Remote Sensing 38(1), 416–428 (2000)

    Article  Google Scholar 

  7. He, C., Dong, J., Zheng, Y.F., Gao, Z.: Optimal 3d coefficient tree structure for 3d wavelet video coding. IEEE Trans. On Circuits and Systems on Video Technology 13(10), 961–972 (2003)

    Article  Google Scholar 

  8. Cagnazzo, M., Poggi, G., Verdoliva, L.: Region-based transform coding of multispectral images. IEEE Trans. on Image Processing 16(12), 2916–2926 (2007)

    Article  MathSciNet  Google Scholar 

  9. Danyali, H., Mertins, A.: Highly scalable image compression based on spiht for network applications. In: IEEE International Conference on Image Processing, Rochester,NY, USA (September 2002)

    Google Scholar 

  10. Danyali, H., Mertins, A.: Flexible, highly scalable, object-based wavelet image compression algorithm for network applications. Vision, Image and Signal Processing, IEE Proceedings 151(6), 498–510 (2004)

    Article  Google Scholar 

  11. Cho, Y., Pearlman, W.A.: Quantifying the performance of zerotrees of wavelet coefficients: degree-k zerotree model. IEEE Trans. on Signal Processing 55(6), 2425–2431 (2007)

    Google Scholar 

  12. Cicala, L., Poggi, G.: A generalization of zerotree coding algorithms. In: Picture Coding Symposium, Lisbon, Portugal (November 2007)

    Google Scholar 

  13. Pearlman, W.A., Islam, A., Nagaraj, N., Said, A.: Efficient, low-complexity image coding with a set-partitioning embedded block coder. IEEE Trans. Circuits and Systems for Video Technology 14(11), 1219–1235 (2004)

    Article  Google Scholar 

  14. Secker, A., Taubman, D.: Lifting-based invertible motion adaptive transform (limat) framework for highly scalable video compression. IEEE Trans. On Image Processing 12(12), 1530–1542 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cicala, L. (2008). Performance Analysis of Generalized Zerotree Coders Varying the Maximum Zerotree Degree. In: Blanc-Talon, J., Bourennane, S., Philips, W., Popescu, D., Scheunders, P. (eds) Advanced Concepts for Intelligent Vision Systems. ACIVS 2008. Lecture Notes in Computer Science, vol 5259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88458-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88458-3_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88457-6

  • Online ISBN: 978-3-540-88458-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics