KEYWORDS: Wavelets, Image compression, Computer programming, 3D image processing, Medical imaging, Liver, Skull, Wavelet transforms, Data compression, 3D video compression
We propose an integrated, wavelet based, two-stage coding scheme for lossy, near-lossless and lossless compression of medical volumetric data. The method presented determines the bit-rate while encoding for the lossy layer and without any iteration. It is in the spirit of "lossy plus residual coding" and consists of a wavelet-based lossy layer followed by an arithmetic coding of the quantized residual to guarantee a given pixel-wise maximum error bound. We focus on the selection of the optimum bit rate for the lossy coder to achieve the minimum total (lossy plus residual) bit rate in the near-lossless and the lossless cases. We propose a simple and practical method to estimate online the optimal bit rate and provide a theoretical justification for it. Experimental results show that the proposed scheme provides improved, embedded lossy, and lossless performance competitive with the best results published so far in the literature, with an added feature of near-lossless coding.
For faster random access of a target image block, a bi-section idea is
applied to link image blocks. Conventional methods configure the blocks in linearly linked way, for which the block seek time entirely depends on the location of the block on the compressed bitstream. The block linkage information is configured such that binary search is
possible, giving the worst case block seek time of log2(n),
for n blocks. Experimental results with 3D-SPIHT on video sequences show that the presented idea gives substantial speed improvement with minimal bit overhead.
In this paper we consider the problem of robust image coding and packetization for the purpose of communications over slow fading frequency selective channels and channels with a shaped spectrum like those of digital subscribe lines (DSL). Towards this end, a novel and analytically based joint source channel coding (JSCC) algorithm to assign unequal error protection is presented. Under a block budget constraint, the image bitstream is de-multiplexed into two classes with different error responses. The algorithm assigns unequal error protection (UEP) in a way to minimize the expected mean square error (MSE) at the receiver while minimizing the probability of catastrophic failure. In order to minimize the expected mean square error at the receiver, the algorithm assigns unequal protection to the value bit class (VBC) stream. In order to minimizes the probability of catastrophic error which is a characteristic of progressive image coders, the algorithm assigns more protection to the location bit class (LBC) stream than the VBC stream. Besides having the advantage of being analytical and also numerically solvable, the algorithm is based on a new formula developed to estimate the distortion rate (D-R) curve for the VBC portion of SPIHT. The major advantage of our technique is that the worst case instantaneous minimum peak signal to noise ratio (PSNR) does not differ greatly from the averge MSE while this is not the case for the
optimal single stream (UEP) system. Although both average PSNR of our method and the optimal single stream UEP are about the same, our scheme does not suffer erratic behavior because we have made the probability of catastrophic error arbitarily small. The coded image is sent via orthogonal frequency division multiplexing (OFDM) which is a known and increasing popular modulation scheme to combat ISI (Inter Symbol Interference) and impulsive noise. Using dual adaptive
energy OFDM, we use the minimum energy necessary to send each bit stream at a particular probability of bit error. An added benefit of OFDM over serial transmission schemes is that some degree of progressiveness of SPIHT is preserved by transmitting both the VBC and LBC streams in parallel.
KEYWORDS: Error analysis, Wavelets, Video, Computer programming, Video coding, Wavelet packet decomposition, 3D image processing, 3D video compression, Video compression, Automatic repeat request
This paper first introduces an asymmetric tree structure for utilization with an error resilient form 3-D SPIHT, called ERC-SPIHT. Then, we present a fast error concealment scheme, borrowed from Rane et al.'s work with images, for embedded video bitstream using ERC-SPIHT. In addition to using simple averaging method in the root subband, we detect the presence or absence of edges in the lost block of every image. Then we use an interpolation scheme to recover the lost edge information.
KEYWORDS: Video, Video compression, Forward error correction, 3D image processing, 3D video compression, Error analysis, Satellite communications, Satellites, 3D video streaming, Computer programming
Error Resilient and Error Concealment 3-D SPIHT (ERC-SPIHT) is a joint source channel coder developed to improve the overall performance against channel bit errors without requiring automatic-repeat-request (ARQ). The objective of this research is to test and validate the properties of two competing video compression algorithms in a wireless environment. The property focused on is error resiliency to the noise inherent in wireless data communication. ERC-SPIHT and MPEG-2 with forward error correction (FEC) are currently undergoing tests over a satellite communication link. The initial test indicates that ERC-SPIHT gives excellent results in noisy channel conditions is shown to have superior performance over MPEG-2 with FEC when communicated over a military satellite channel.
KEYWORDS: Error analysis, Video compression, Wavelets, 3D video compression, Video, 3D image processing, Error control coding, Computer programming, Wavelet transforms, Automatic repeat request
This paper presents an embedded video compression with error resilience and error concealment using three dimensional SPIHT (3-D SPIHT) algorithm. We use a new method for partitioning the wavelet coefficients into spatio-temporal (s-t) blocks to get higher error resilience and to support error concealment. Instead of grouping adjacent coefficients, we group coefficients in some fixed intervals in the lowest subband to get interleaved trees. All of the sub-blocks correspond to a group of full frames within the image sequence, because each group of interleaved trees has coefficients dispersed over the entire frame group. Then we separate the stream into fixed length packets and encode every one with a channel code. Experiments show that our proposed method brings higher error resilience in noisy channels since the decoded coefficients associated with early decoding error would be spread out to the whole area along with the sequence, and we can conceal the lost coefficients with the surrounding coefficients even if some of substreams are totally missing. In addition to that, our proposed method gives higher coding performance in noseless channels than the conventional grouping method of grouping contiguous trees.
KEYWORDS: Video, Error control coding, 3D image processing, Computer programming, Forward error correction, 3D video compression, Wavelets, Video compression, Image compression, Wavelet transforms
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.
KEYWORDS: 3D video compression, Video, Video compression, Automatic repeat request, Error control coding, Forward error correction, Wavelets, Computer programming, Wavelet transforms, 3D video streaming
Compressed video bitstreams require protection from channel errors in a wireless channel and protection from packet loss in a wired ATM 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 (RCPC) code combined with a single ARQ (automatic- repeat-request) proved to be an effective means for protecting the bitstream. There were two problems with this scheme: the noiseless reverse channel ARQ may not be feasible in practice; and, in the absence of channel coding and ARQ, the decoded sequence was hopelessly corrupted even for relatively clean channels. In this paper, we first show how to make the 3-D SPIHT bitstream more robust to channel errors by breaking the wavelet transform into a number of spatio-temporal tree blocks which can be encoded and decoded independently. This procedure brings the added benefit of parallelization of the compression and decompression algorithms. Then we demonstrate the packetization of the bit stream and the reorganization of these packets to achieve scalability in bit rate and/or resolution in addition to robustness. Then we encode each packet with a channel code. Not only does this protect the integrity of the packets in most cases, but it also allows detection of packet decoding failures, so that only the cleanly recovered packets are reconstructed. This procedure obviates ARQ, because the performance is only about 1 dB worse than normal 3-D SPIHT with FEC and ARQ. Furthermore, the parallelization makes possible real-time implementation in hardware and software.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
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.