Progressive video coding for noisy channels

Beong-Jo Kim; Zixiang Xiong; William A. Pearlman

doi:10.1117/12.323191

1 October 1998 Progressive video coding for noisy channels

Beong-Jo Kim, Zixiang Xiong, William A. Pearlman

Proceedings Volume 3460, Applications of Digital Image Processing XXI; (1998) https://doi.org/10.1117/12.323191
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1998, San Diego, CA, United States

Abstract

We extend the work of Sherwood and Zeger to progressive video coding for noisy channels. By utilizing a 3D extension of the set partitioning in hierarchical trees (SPIHT) algorithm, we cascade the resulting 3D SPIHT video coder with a rate-compatible punctured convolutional channel coder for transmission of video over a binary symmetric channel. Progressive coding is achieved by increasing the target rate of the 3D embedded SPIHT video coder as the channel condition improves. The performance of our proposed coding system is acceptable at low transmission rate and bad channel conditions. Its low complexity makes it suitable for emerging applications such as video over wireless channels.

Citation Download Citation

Beong-Jo Kim, Zixiang Xiong, and William A. Pearlman "Progressive video coding for noisy channels", Proc. SPIE 3460, Applications of Digital Image Processing XXI, (1 October 1998); https://doi.org/10.1117/12.323191

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