Results 11  20
of
48
Fast compression of seismic data with local trigonometric bases
 in Wavelet Applications in Signal and Image Processing VII
, 1999
"... Our goal in this paper is to provide a fast numerical implementation of the local trigonometric bases algorithm1 in order to demonstrate that an advantage can be gained by constructing a biorthogonal basis adapted to a target image. Different choices for the bells are proposed, and an extensive eval ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Our goal in this paper is to provide a fast numerical implementation of the local trigonometric bases algorithm1 in order to demonstrate that an advantage can be gained by constructing a biorthogonal basis adapted to a target image. Different choices for the bells are proposed, and an extensive evaluation of the algorithm was performed on synthetic and seismic data. Because of its ability to reproduce textures so well, the coder performs very well, even at high bitrate.
Modulus Quantization for Matching Pursuit Video Coding
, 2000
"... Overcomplete signal decomposition using matching pursuits has been shown to be an efficient technique for coding motion residual images in a hybrid video coder. Unlike orthogonal decomposition, matching pursuit uses an intheloop modulus quantizer which must be specified before coding begins. This ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
Overcomplete signal decomposition using matching pursuits has been shown to be an efficient technique for coding motion residual images in a hybrid video coder. Unlike orthogonal decomposition, matching pursuit uses an intheloop modulus quantizer which must be specified before coding begins. This complicates the quantizer design, since the optimal quantizer depends on the statistics of the matching pursuit coefficients which in turn depend on the inloop quantizer actually used. In this paper, we address the modulus quantizer design issue, specifically developing frameadaptive quantization schemes for the matching pursuit video coder. Adaptive deadzone subtraction is shown to reduce the information content of the modulus source, and a uniform threshhold quantizer is shown to be optimal for the resulting source. Practical 2pass and 1pass algorithms are developed to jointly determine the quantizer parameters and the number of coded basis functions in order to minimize coding distor...
Efficient bitrate scalability for weighted squared error optimization in audio coding
 IEEE Trans. Audio, Speech, Lang. Process
, 2006
"... ..."
(Show Context)
Image Subband Coding Using Progressive Classification and Adaptive Quantization
, 1997
"... Adaptive compression methods have been a key component of many of the recently proposed subband (or wavelet) image coding techniques. This paper deals with a particular type of adaptive subband image coding where we focus on the image coder's ability to adjust itself on the fly to the spatially ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
Adaptive compression methods have been a key component of many of the recently proposed subband (or wavelet) image coding techniques. This paper deals with a particular type of adaptive subband image coding where we focus on the image coder's ability to adjust itself on the fly to the spatially varying statistical nature of image contents. This backward adaptation is distinguished from more frequently used forward adaptation in that forward adaptation selects the best operating parameters from a predesigned set and thus uses considerable amount of side information in order for the encoder and the decoder to operate with the same parameters. Specifically, we present a backward adaptive quantizer by introducing a new progressive classification technique which classifies subband coefficients based on the surrounding quantized coefficients. We couple this classification with online adaptation of the quantizer used within each class. The quantizers themselves are simple scalar uniform thr...
InLoop Atom Modulus Quantization for Matching Pursuit and Its Application to Video Coding
, 2003
"... This paper provides a precise analytical study of the selection and modulus quantization of matching pursuit (MP) coefficients. We demonstrate that an optimal ratedistortion tradeoff is achieved by selecting the atoms up to a qualitydependent threshold, and by defining the modulus quantizer in te ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
(Show Context)
This paper provides a precise analytical study of the selection and modulus quantization of matching pursuit (MP) coefficients. We demonstrate that an optimal ratedistortion tradeoff is achieved by selecting the atoms up to a qualitydependent threshold, and by defining the modulus quantizer in terms of that threshold. In doing so, we take into account quantization error reinjection resulting from inserting the modulus quantizer inside the MP atom computation loop. Inloop quantization not only improves coding performance, but also affects the optimal quantizer design for both uniform and nonuniform quantization. We measure the impact of our work in the context of video coding. For both uniform and nonuniform quantization, the precise understanding of the relation between atom selection and quantization results in significant improvements in terms of coding efficiency. At high bitrates, the proposed nonuniform quantization scheme results in 0.5 to 2 dBs improvement over [8]. I.
Estimationtheoretic approach to delayed prediction in scalable video coding
 Proc. IEEE ICIP
, 2010
"... Scalable video coding (SVC) employs interframe prediction at the base and/or the enhancement layers. Since the base layer can be encoded/decoded independent of the enhancement layers, we consider here the potential gains when prediction at the enhancement layers is delayed to accumulate and incorpo ..."
Abstract

Cited by 5 (5 self)
 Add to MetaCart
(Show Context)
Scalable video coding (SVC) employs interframe prediction at the base and/or the enhancement layers. Since the base layer can be encoded/decoded independent of the enhancement layers, we consider here the potential gains when prediction at the enhancement layers is delayed to accumulate and incorporate additional future information from the base layer. We build on two basic estimationtheoretic (ET) approaches developed by our group: an ET approach for enhancement layer prediction that optimally combines current base layer with prior enhancement layer information, and our recent ET approach for delayed decoding. The proposed technique fully exploits all the available information from the base layer, including any future frame information, and past enhancement layer information. It achieves considerable gains over zerodelay techniques including both standard SVC, and SVC with optimal ET prediction (but with zero encoding delay). Index Terms — estimationtheoretic, prediction, scalable video coding, quality scalability, delayed encoding, delayed decoding 1.
Fréjus Collaboration), in
 Proc. of the XXVIIth Recontre de Moriond, Les Arcs
, 1992
"... dugan1 ..."
Data Compression and Its Statistical Implications, with an Application to the Analysis of Microarray Images
, 2001
"... This thesis consists of three parts. Even though each part is selfcontained, a common theme runs through all of them: data compression and its implications for statistical inference. In particular, we consider the following three questions. How can we quantify the effect of compression on statist ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This thesis consists of three parts. Even though each part is selfcontained, a common theme runs through all of them: data compression and its implications for statistical inference. In particular, we consider the following three questions. How can we quantify the effect of compression on statistical inference? How should a compression scheme be designed such that the effect of compression on inference is minimal? How can the Minimum Description Length (MDL) principle be used for model selection with an extraordinary number of dependent predictors? In this thesis, we attempt to answer these three questions in a general setting, and with a specific application in the compression and analysis of microarray images. In the first
Optimal Nearly Uniform Scalar Quantizer Design for Wavelet Coding
 in Proceedings of SPIE Visual Communications and Image Processing Conference
, 2002
"... Uniform scalar quantizers are widely used in image coding. They are known to be optimum entropy constrained scalar quantizers within the high resolution assumption. In this paper, we focus on the design of nearly uniform scalar quantizers for high performance coding of wavelet coefiqcients whatever ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
Uniform scalar quantizers are widely used in image coding. They are known to be optimum entropy constrained scalar quantizers within the high resolution assumption. In this paper, we focus on the design of nearly uniform scalar quantizers for high performance coding of wavelet coefiqcients whatever the bitrate is. Some codecs use uniform scalar quantizers with a zero quantization bin size (deadzone) equal to two times the other quantization bin sizes (for example JPEG2000). We address the problem of deadzone size optimization using distortion rate considerations. The advantages of the proposed method are that the quantizer design is adapted to both the source statistics and the compression ratio. Our method is based on statistical information of the wavelet coefiqcients distribution. It provides experimental gains up to 0.19 dB.
MP3D: Highly Scalable Video Coding Scheme Based on Matching Pursuit
 IN ICASSP
, 2003
"... This paper describes a novel video coding scheme based on a threedimensional Matching Pursuit algorithm. In addition to good compression performance at low bit rate, the proposed coder allows for flexible spatial, temporal and rate scalability thanks to its progressive coding structure. The Match ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
This paper describes a novel video coding scheme based on a threedimensional Matching Pursuit algorithm. In addition to good compression performance at low bit rate, the proposed coder allows for flexible spatial, temporal and rate scalability thanks to its progressive coding structure. The Matching Pursuit algorithm generates a sparse decomposition of a video sequence in a series of spatiotemporal atoms, taken from an overcomplete dictionary of threedimensional basis functions. The dictionary is generated by shifting, scaling and rotating two different mother atoms in order to cover the whole frequency cube. An embedded stream is then produced from the series of atoms. They are first distributed into sets through the setpartitioned position map algorithm (SPPM) to form the indexmap, inspired from bit plane encoding. Scalar quantization is then applied to the coefficients which are finally arithmetic coded. A complete MP3D codec has been implemented, and performances are shown to favorably compare to other scalable coders like MPEG4 FGS and SPIHT3D. In addition, the MP3D streams offer an incomparable flexibility for multiresolution streaming or adaptive decoding.