Showing papers by "William A. Pearlman published in 1998"
28 Dec 1998
TL;DR: The image coding algorithm developed here, apart from being embedded and of low complexity, is very efficient and is comparable to the best known low-complexity image coding schemes available today.
Abstract: We propose an embedded hierarchical image coding algorithm of low complexity. It exploits two fundamental characteristics of an image transform -- the well defined hierarchical structure, and energy clustering in frequency and in space. The image coding algorithm developed here, apart from being embedded and of low complexity, is very efficient and is comparable to the best known low-complexity image coding schemes available today.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
244 citations
07 Dec 1998
TL;DR: The experiment shows that this coder yields nearly transparent quality at bit rates 55-66 kbits/sec, and degrades only gradually at lower rates, which shows its potential for interactive applications with levels of quality from good to perceptually transparent.
Abstract: This paper proposes an efficient, low complexity audio coder based on the SPIHT (set partitioning in hierarchical trees) coding algorithm , which has achieved notable success in still image coding. A wavelet packet transform is used to decompose the audio signal into 29 frequency subbands corresponding roughly to the critical subbands of the human auditory system. A psychoacoustic model, which, for simplicity, is based on MPEG model I, is used to calculate the signal to mask ratio, and then calculate the bit rate allocation among subbands. We distinguish the subbands into two groups: the low frequency group which contains the first 17 subbands corresponding to 0-3.4 kHz, and the high frequency group which contains the remaining high frequency subbands. The SPIHT algorithm is used to encode and decode the low frequency group and a reverse sorting process plus arithmetic coding algorithm is used to encode and decode the high frequency group. The experiment shows that this coder yields nearly transparent quality at bit rates 55-66 kbits/sec, and degrades only gradually at lower rates. The low complexity of this coding system shows its potential for interactive applications with levels of quality from good to perceptually transparent.
53 citations
28 Dec 1998
TL;DR: A 3D integer wavelet packet transform is described that allows implicit bit shifting of wavelet coefficients to approximate a 3D unitary transformation to achieve good lossy coding performance.
Abstract: We examine progressive lossy to lossless compression of medical volumetric data using three-dimensional (3D) integer wavelet packet transforms and set partitioning in hierarchical trees (SPIHT). To achieve good lossy coding performance, we describe a 3D integer wavelet packet transform that allows implicit bit shifting of wavelet coefficients to approximate a 3D unitary transformation. We also address context modeling for efficient entropy coding within the SPIHT framework. Both lossy and lossless coding performances are better than those reported recently in reference one.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
44 citations
01 Oct 1998
TL;DR: A 3D extension of the set partitioning in hierarchical trees (SPIHT) algorithm is utilizing to cascade the resulting 3D SPIHT video coder with a rate-compatible punctured convolutional channel coder for transmission of video over a binary symmetric channel.
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.
29 citations
04 Oct 1998
TL;DR: A three dimensional extension of the set partitioning in hierarchical trees (SPIHT) algorithm is utilizing to cascade the resulting 3D SPIHT video coder with the rate-compatible punctured convolutional (RCPC) channel coder for transmission of video over a binary symmetric channel (BSC).
Abstract: We extend the work of Sherwood and Zeger (IEEE Signal Processing Letters, vol.4, p.189-91, 1997) to progressive video coding for noisy channels. By utilizing a three dimensional (3D) extension of the set partitioning in hierarchical trees (SPIHT) algorithm, we cascade the resulting 3D SPIHT video coder with the rate-compatible punctured convolutional (RCPC) channel coder for transmission of video over a binary symmetric channel (BSC). 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 a low transmission rate and bad channel conditions. Its low complexity makes it suitable for emerging applications such as video over wireless channels.
28 citations
09 Jan 1998
TL;DR: Simulation shows that 3D SPIHT with reduced coding latency still achieves coding result comparable to MPEG-2, and exhibits more uniform PSNR fluctuations.
Abstract: In this paper, a modification of the 3D SPIHT, which is the 3D extension to image sequence of 2D SPIHT still image coding, is presented in order to allow more flexibility in choosing the number of frames to be processed at one time by introducing unbalanced tree structure. Simulation shows that 3D SPIHT with reduced coding latency still achieves coding result comparable to MPEG-2, and exhibits more uniform PSNR fluctuations. In additional extension to color video coding is accomplished without explicit rate-allocation, and can be used to any color-plane representation.© (1998) COPYRIGHT SPIE--The International Society for Optical Engineering. Downloading of the abstract is permitted for personal use only.
20 citations
07 Dec 1998
TL;DR: A 3D integer wavelet packet transform is described that allows implicit bit shifting of wavelet coefficients to approximate a 3D unitary transformation to achieve good lossy coding performance.
Abstract: We examine progressive lossy to lossless compression of medical volumetric data using three-dimensional (3D) integer wavelet packet transforms and set partitioning in hierarchical trees (SPIHT). To achieve good lossy coding performance, we describe a 3D integer wavelet packet transform that allows implicit bit shifting of wavelet coefficients to approximate a 3D unitary transformation. We also address context modeling for efficient entropy coding within the SPIHT framework. Both lossy and lossless coding performance are better than those previously reported.
17 citations
12 May 1998
TL;DR: Add spatial/temporal scalability is significant for emerging multimedia applications such as fast decoding, image/video database browsing, telemedicine, multipoint video conferencing, and distance learning.
Abstract: We address multiresolutional encoding and decoding within the embedded zerotree wavelet (EZW) framework for both images and video By varying a resolution parameter, one can obtain decoded images at different resolutions from one single encoded bitstream, which is already rate scalable for EZW coders Similarly one can decode video sequences at different rates and different spatial and temporal resolutions from one bitstream Furthermore, a layered bitstream can be generated with multiresolutional encoding, from which the higher resolution layers can be used to increase the spatial/temporal resolution of the images/video obtained from the low resolution layer In other words, we have achieved full scalability in rate and partial scalability in space and time This added spatial/temporal scalability is significant for emerging multimedia applications such as fast decoding, image/video database browsing, telemedicine, multipoint video conferencing, and distance learning
10 citations
17 Aug 1998
TL;DR: A 3D integer wavelet packet transform is described that allows implicit bit shifting of wavelet coefficients to approximate a 3D unitary transformation and context modeling for efficient entropy coding within the SPIHT framework is addressed.
Abstract: Examines progressive lossy-to-lossless compression of medical volumetric data using 3D integer wavelet packet transforms and set partitioning in hierarchical trees (SPIHT). To achieve good lossy coding performance, we describe a 3D integer wavelet packet transform that allows implicit bit shifting of wavelet coefficients to approximate a 3D unitary transformation. We also address context modeling for efficient entropy coding within the SPIHT framework. Both lossy and lossless coding performances are better than those reported by A. Bilgin et al. (1998).
9 citations
TL;DR: The condition for perfect reconstruction for the periodic signals is derived, the generalizations are made for the nonperiodic sequences, and several ways to apply the developed technique to the non periodic sequences are considered.
Abstract: We present a new approach to filtering and reconstruction of periodic signals. The tool that proves to handle these tasks very efficiently is the discrete Zak transform. The discrete Zak transform can be viewed as the discrete Fourier transform performed on the signal blocks. It also can be considered the polyphase representation of periodic signals. Fast filtering-decimation-interpolation-reconstruction algorithms are developed in the Zak transform domain both for the undersampling and critical sampling cases. The technique of finding the optimal biorthogonal filter banks, i.e., those that would provide the best reconstruction even in the undersampling case, is presented. An algorithm for orthogonalization of nonorthogonal filters is developed. The condition for perfect reconstruction for the periodic signals is derived. The generalizations are made for the nonperiodic sequences, and several ways to apply the developed technique to the nonperiodic sequences are considered. Finally, the developed technique is applied to recursive filter banks and the discrete wavelet decomposition.
9 citations
31 May 1998
TL;DR: This work explores the development of tree-based, embedded image coding, their use with different image transformations, the reasons for their effectiveness and low complexity, their flexibility and incorporation into state-of-the-art compression systems.
Abstract: We review first the development of tree-based, embedded image coding. We then explore their use with different image transformations, the reasons for their effectiveness and low complexity, their flexibility and incorporation into state-of-the-art compression systems.
TL;DR: Add spatial/temporal scalability is significant for emerging multimedia applications such as fast decoding, image/video database browsing, telemedicine, multipoint video conferencing, and distance learning.
Abstract: We address multiresolutional encoding and decoding within the embedded zerotree wavelet (EZW) framework for both images and video By varying a resolution parameter, one can obtain decoded images at different resolutions from one single encoded bitstream, which is already rate scalable for EZW coders Similarly one can decode video sequences at different rates and different spatial and temporal resolutions from one bitstream Furthermore, a layered bitstream can be generated with multiresolutional encoding, from which the higher resolution layers can be used to increase the spatial/temporal resolution of the images/video obtained from the low resolution layer In other words, we have achieved full scalability in rate and partial scalability in space and time This added spatial/temporal scalability is significant for emerging multimedia applications such as fast decoding, image/video database browsing, telemedicine, multipoint video conferencing, and distance learning
TL;DR: The rate constrained block matching algorithm (RCBMA) jointly minimizes displaced frame difference (DFD) variance and entropy, or conditional entropy of motion vectors for determining the motion vectors in order to result in smoother and more organized motion vector fields.
Abstract: The rate constrained block matching algorithm (RCBMA) jointly minimizes displaced frame difference (DFD) variance and entropy, or conditional entropy of motion vectors for determining the motion vectors. It is intended for use in low rate video coding applications, where the contribution of the motion vector rate to the overall coding rate might be significant. The DFD variance versus motion vector rate performance of RCBMA employing size K x K blocks is shown to be superior to that of the conventional minimum distortion block matching algorithm (MDBMA) employing size 2 K x 2 K blocks. Constraining of the entropy or conditional entropy of motion vectors in RCBMA results in smoother and more organized motion vector fields than those output by MDBMA. The motion vector rate of RCBMA can also be precisely controlled for each frame by adjusting a single parameter.
16 Aug 1998
TL;DR: Analysis and numerical results are presented to show that AGP and SPIHT are indeed efficient block entropy coders.
Abstract: Efficient low-complexity block entropy coding requires careful exploitation of specific data characteristics to circumvent the practical difficulties associated with large alphabets. Two recent image coding methods, alphabet and group partitioning (AGP) and set partitioning in hierarchical trees (SPIHT) can be viewed as block entropy coding methods, which are successful because of the manner in which they partition the alphabet into sets and encode these sets very efficiently. Here we present analysis and numerical results to show that AGP and SPIHT are indeed efficient block entropy coders.
01 Jan 1998
TL;DR: This work explores the development of tree-based, embedded image coding, their use with different image transformations, the reasons for their effectiveness and low complexity, their flexibility and incorporation into state-of-the-art compression systems.
Abstract: We review first the development of tree-based, embedded image coding. We then explore their use with different image transformations, the reasons for their effectiveness and low complexity, their flexibility and incorporation into state-of-the-art compression systems.