Variable length coding for binary sources and applications in video compression

Gergely Korodi; Dake He; Paul Imthurn

doi:10.1117/12.862846

7 September 2010 Variable length coding for binary sources and applications in video compression

Gergely Korodi, Dake He, Paul Imthurn

Proceedings Volume 7798, Applications of Digital Image Processing XXXIII; 779810 (2010) https://doi.org/10.1117/12.862846
Event: SPIE Optical Engineering + Applications, 2010, San Diego, California, United States

Abstract

This article introduces a lossless encoding scheme for interleaved input from a fixed number of binary sources, each one characterized by a known probability value. The algorithm achieves compression performance close to the entropy, providing very fast encoding and decoding speed. The algorithm can efficiently benefit from independent parallel decoding units, and it is demonstrated to have significant advantages in hardware implementations over previous technologies.

Citation Download Citation

Gergely Korodi, Dake He, and Paul Imthurn "Variable length coding for binary sources and applications in video compression", Proc. SPIE 7798, Applications of Digital Image Processing XXXIII, 779810 (7 September 2010); https://doi.org/10.1117/12.862846

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available