Skip to main content

Heegard-Berger Video Coding Using LMMSE Estimator

  • Conference paper
  • 705 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 4261))

Abstract

In this paper a novel distributed video coding scheme was proposed based on Heegard-Berger coding theorem, rather than Wyner-Ziv theorem. The main advantage of HB coding is that the decoder can still decode and output a coarse reconstruction, even if side information degrade or absent. And if side information present or upgrade at decoder, a better reconstruction can be achieved. This robust feature can solve the problem lies in Wyner-Ziv video coding that the encoder can hardly decide the bit rate because rate-distortion was affected by the side information known only at the decoder. This feature also leaded to our HB video coding scheme with 2 decoding level of which we first reconstruct a coarse reconstruction frame without side information, and do motion search in previous reconstructed frame to find side information, then reconstruct a fine reconstruction frame through HB decoding again, with side information available.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Slepian, J.D., Wolf, J.K.: Noiseless coding of correlated information sources. IEEE Trans. Inf. Theory IT-19, 471–480 (1973)

    Article  MathSciNet  Google Scholar 

  2. Wyner, A.D., Ziv, J.: The rate-distortion function for source coding with side information at the decoder. IEEE Trans. Inf. Theory IT-22(1), 1–10 (1976)

    Article  MathSciNet  Google Scholar 

  3. Wyner, A.D.: The rate-distortion function for source coding with side information at the decoder—II: general sources. Inf. Control 38(1), 60–80 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  4. Zamir, R.: The Rate Loss in the Wyner-Ziv Problem. IEEE Trans. Inf. Theory it-42(6) (November 1996)

    Google Scholar 

  5. Heegard, C., Berger, T.: Rate distortion when side information may be absent. IEEE Trans. Inform. Theory IT-31, 727–734 (1985)

    Article  MathSciNet  Google Scholar 

  6. Kaspi, A.: Rate-distortion when side-information may be present at the decoder. IEEE Trans. Information Theory 40, 2031–2034 (1994)

    Article  MATH  Google Scholar 

  7. Steinberg, Y., Merhav, N.: On successive refinement for the Wyner-Ziv problem. IEEE Trans. Information Theory 50, 1636–1654 (2004)

    Article  MathSciNet  Google Scholar 

  8. El Gamal, A.A., Cover, T.M.: Achievable rates for multiple descriptions. IEEE Trans. Inform. Theory IT-28, 851–857 (1982)

    Article  Google Scholar 

  9. Fleming, M., Effros, M.: Rate-distortion with mixed types of side information. In: Proc. IEEE Symposium Information Theory, June-July 2003, p. 144 (2003)

    Google Scholar 

  10. Pradhan, S.S., Ramchandran, K.: Distributed source coding using syndromes (DISCUS): design and construction. In: Proc. IEEE Data Compression Conf., pp. 158–167 (1999)

    Google Scholar 

  11. García-Frías, J.: Compression of correlated binary sources using turbo codes. IEEE Commun. Lett. 5(10), 417–419 (2001)

    Article  Google Scholar 

  12. Compression of binary sources with side information at the decoder using LDPC codes. IEEE Commun. Lett. 6(10), 440–442 (October 2002)

    Google Scholar 

  13. Schonberg, D., Pradhan, S.S., Ramchandran, K.: LDPC codes can approach the Slepian–Wolf bound for general binary sources. In: The Allerton Conf. Communication, Control, and Computing, Champaign, IL (2002)

    Google Scholar 

  14. Coleman, T.P., Lee, A.H., Medard, M., Effros, M.: On some new approaches to practical Slepian–Wolf compression inspired by channel coding. In: Proc. IEEE Data Compression Conf., pp. 282–291 (2004)

    Google Scholar 

  15. Stankovic, V., Liveris, A.D., Xiong, Z., Georghiades, C.N.: Design of Slepian–Wolf codes by channel code partitioning. In: Proc. IEEE Data Compression Conf., pp. 302–311 (2004)

    Google Scholar 

  16. Puri, R., Ramchandran, K.: PRISM: A ‘reversed’ multimedia coding paradigm. In: Proc. IEEE International Conference on Image Processing, Barcelona, Spain (2003)

    Google Scholar 

  17. Aaron, A., Girod, B.: Wyner-Ziv video coding with low encoder complexity. In: Proc. IEEE International Conference on Image Processing, San Francisco, CA (2004)

    Google Scholar 

  18. Varodayan, D., Aaron, A., Girod, B.: Rate-adaptive distributed source coding using Low-Density Parity Check codes. In: Proc. Asilomar Conference on Signals and Systems, Pacific Grove, CA (2005)

    Google Scholar 

  19. Aaron, A., Varodayan, D., Girod, B.: Wyner-Ziv Residual Coding of Video. In: Proc. Picture Coding Symposium, Beijing, China (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fan, X., Au, O., Chen, Y., Zhou, J. (2006). Heegard-Berger Video Coding Using LMMSE Estimator. In: Zhuang, Y., Yang, SQ., Rui, Y., He, Q. (eds) Advances in Multimedia Information Processing - PCM 2006. PCM 2006. Lecture Notes in Computer Science, vol 4261. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922162_15

Download citation

  • DOI: https://doi.org/10.1007/11922162_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48766-1

  • Online ISBN: 978-3-540-48769-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics