Showing papers by "William A. Pearlman published in 2001"

Trends of Tree-Based, Set-Partitioning Compression Techniques in Still and Moving Image Systems

Abstract: In addition to high compression efficiency, future still and moving image coding systems will require many other features They include fidelity and resolution scalability, region of interest enhancement, random access decoding, resilience to errors due to channel noise or packet loss, fast encoding and/or decoding speed, and low computational and hardware complexity Moreover, there are emerging new venues for the application of image compression techniques to data associated with points of a two or three-dimensional grid that will demand these features and perhaps others We shall discuss these new venues along with the usual ones and show how tree-based, set-partitioning wavelet coding methods, such as SPIHT (Set Partitioning in Hierarchical Trees) and SPECK (Set Partitioning Embedded bloCK) will fulfill most of the demands of current and future applications We shall also discuss the emerging JPEG-2000 in this framework

Algorithmic modifications to SPIHT

Abstract: This paper proposes several low complexity algorithmic modifications to the SPIHT (set partitioning in hierarchical trees) image coding method of Said and Pearlman (1996). The modifications exploit universal traits common to the real world images. Approximately 1-2% compression gain (bit rate reduction for a given mean squared error) has been obtained for the images in our test suite by incorporating all of the proposed modifications into SPIHT.

Approach to the joint optimization of video communications and video signal processing

Abstract: Compressed video bitstreams require protection from channel errors in a wireless channel. The three-dimensional (3-D) SPIHT coder has proved its efficiency and its real-time capability in compression of video. A forward-error- correcting (FEC) channel (RCPR) code combined with a single ARQ (Automatic-repeat-request) proved to be an effective means for protecting the bitstream. In this paper, the need for ARQ is eliminated by making the 3D SPIHT bitstream more robust and resistant to channel errors. Packetization of the bitstream and the reorganization of these packets to achieve scalability in bit rate and/or resolution in addition to robustness is demonstrated and combined with channel coding to not only protect the integrity of the packets, but also allow detection of packet decoding failures, so that only the cleanly recovered packets are reconstructed. In extensive comparative tests, the reconstructed video is shown to be superior to that of MPEG- 2, with the margin of superiority growing substantially as the channel becomes noisier.© (2001) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.

Unequal error protection of embedded video bitstreams

Abstract: This paper presents an unequal error protection of embedded video bitstreams using three dimensional SPIHT (3-D SPIHT) algorithm and Spatio-Temporal Tree Preserving 3-D SPIHT (STTP-SPIHT) algorithm. We have already proved the efficiency and robustness of the STTP-SPIHT in both of noisy and noiseless channels by modifying the 3-D SPIHT algorithm. We demonstrate that the 3-D SPIHT can also be error resilient against channel bit errors by dividing the embedded video bitstreams, and more error resilient when we divide the STTP-SPIHT bitstreams.