• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 29
Next 10 →

Digital Non-Subtractive Dither: Necessary and Sufficient Condition for Unbiasedness, with Implementation Issues

by I. Kollár
"... Abstract – Dither theory gives the condition of unbiasedness for non-subtractive dither, which can only be fulfilled with continuousamplitude dithers. However, within a computer or a DSP, only digital dither can be used. A condition was given also for digital dither, however, the condition and the p ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract – Dither theory gives the condition of unbiasedness for non-subtractive dither, which can only be fulfilled with continuousamplitude dithers. However, within a computer or a DSP, only digital dither can be used. A condition was given also for digital dither, however, the condition

Dithering in Lattice Quantization

by A. Kirac, P. P. Vaidyanathan , 1995
"... We study error statistics of lattice quantization with and without vector dithering. As in the scalar case, we distinguish between subtractive and nonsubtractive dithering. We derive general expressions for appropriate error statistics in both cases. In subtractive dithering, we can achieve statisti ..."
Abstract - Add to MetaCart
We study error statistics of lattice quantization with and without vector dithering. As in the scalar case, we distinguish between subtractive and nonsubtractive dithering. We derive general expressions for appropriate error statistics in both cases. In subtractive dithering, we can achieve

The mathematical theory of dithered quantization

by Robert Alexander Wannamaker, Robert Alexander Wannamaker - Ph.D., Dept. Applied Mathematics, Univ. of , 1997
"... I hereby declare that I am the sole author of this thesis. I authorize the University of Waterloo to lend this thesis to other institutions or individuals for the purpose of scholarly research. I further authorize the University of Waterloo to reproduce this thesis by pho-tocopying or by other means ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
is presented for the analysis of multibit quantizing systems. Dithering is examined as a means for eliminating signal-dependent quanti-zation errors, and subtractive and non-subtractive dithered systems are thoroughly explored within the established theoretical framework. Of primary interest are the

Dithered GMD Transform Coding

by Ching-chih Weng, Student Member, P. P. Vaidyanathan, Han-i Su, Student Member
"... Abstract—The geometric mean decomposition (GMD) transform coder (TC) was recently introduced and was shown to achieve the optimal coding gain without bit loading under the high bit rate assumption. However, the performance of the GMD transform coder is degraded in the low rate case. There are mainly ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
, and then redesign the precoders and predictors in the GMD transform coders to tackle the second. We propose two dithered GMD transform coders: the GMD subtractive dithered transform coder (GMD-SD) where the decoder has access to the dither information and the GMD nonsubtractive dithered transform coder (GMD

PYRAMID VECTOR QUANTIZATION OF VIDEO SUBBAND WITH DITHERING

by Mohsen Ashourian, Zulkalnain Mohd Yusof, Sheikh Hussain, S. Salleh, Syed Abd, Rahman S. A. Bakar , 2001
"... Abstract. This paper describes the development of a low complexity and fixed-rate video compression scheme based on three-dimensional subband coding of video signals. The video codec first performs three-dimensional subband decomposition on a group of video frames, and then encode high frequency sub ..."
Abstract - Add to MetaCart
subbands with pyramid vector quantization and lowest tempo-spatial band with a DPCM coding in time and space. To improve the visual quality of reconstructed video, different types of subtractive and non-subtractive dithering of pyramid vector quantizers were experimented and its effectiveness was proved

Rate Distortion Performance in Coding Band-Limited Sources by Sampling and Dithered Quantization

by Ram Zamir, Meir Feder - IEEE Trans. Inform. Theory , 1995
"... The rate-distortion characteristics of a scheme for encoding continuous-time band-limited stationary sources, with a prescribed band, is considered. In this coding procedure the input is sampled at Nyquist's rate or faster, the samples undergo dithered uniform or lattice quantization, using sub ..."
Abstract - Cited by 22 (5 self) - Add to MetaCart
subtractive dither, and the quantizer output is entropy coded. The rate-distortion performance, and the trade-off between the sampling rate and the quantization accuracy is investigated, utilizing the observation that the coding scheme is equivalent to an additive noise channel. It is shown that the mean

PAPERS Quantization and Dither: A Theoretical Survey*

by Stanley P. Lipshitz, Aes Fellow, Robert A. Wannamaker, John Vanderkooy, Aes Fellow
"... A theoretical survey of multibit quantization is presented, beginning with the classical model of undithered quantization and proceeding to modern statistical models of un-dithered, subtractively dithered, and nonsubtractively dithered quantizing systems. Properties of the error and output signals f ..."
Abstract - Add to MetaCart
A theoretical survey of multibit quantization is presented, beginning with the classical model of undithered quantization and proceeding to modern statistical models of un-dithered, subtractively dithered, and nonsubtractively dithered quantizing systems. Properties of the error and output signals

1A Bound on the MSE of Oversampled Dithered Quantization with Feedback

by Milan S. Derpich
"... Abstract—We analyze the behaviour of the mean squared error (MSE) achievable by oversampled, uniform scalar quantization using feedback, pre- and post-filters of un-restricted order, when encoding wide-sense stationary discrete-time random sources having (possibly) unbounded support. Our results are ..."
Abstract - Add to MetaCart
are based upon the use of subtractively dithered uniform scalar quantizers. We consider the number of quantization levels, N, to be given and fixed, which lends itself to fixed-rate encoding, and focus on the cases in which N is insufficient to avoid overload. In order to guarantee the stability

Amplitude scale estimation for quantization-based watermarking

by Ivo D. Shterev, Reginald L. Lagendijk, Senior Member - IEEE Transactions on Signal Processing , 2004
"... Abstract—In this paper we propose a maximum likelihood technique to combat amplitude scaling attacks within a quantizationbased watermarking context. We concentrate on operations that are common in many applications and at the same time devastating to this class of watermarking schemes, namely, ampl ..."
Abstract - Cited by 15 (3 self) - Add to MetaCart
, amplitude scaling in combination with additive noise. First we derive the probability density function of the watermarked and attacked data in the absence of subtractive dither. Next we extend these models to incorporate subtractive dither in the encoder. The dither sequence is primarily used for security

Recursive Consistent Estimation with Bounded Noise

by Sundeep Rangan , Vivek K Goyal - IEEE TRANS. INFORM. TH , 2001
"... Estimation problems with bounded, uniformly distributed noise arise naturally in reconstruction problems from over complete linear expansions with subtractive dithered quantization. We present a simple recursive algorithm for such bounded-noise estimation problems. The mean-square error (MSE) of the ..."
Abstract - Cited by 24 (16 self) - Add to MetaCart
Estimation problems with bounded, uniformly distributed noise arise naturally in reconstruction problems from over complete linear expansions with subtractive dithered quantization. We present a simple recursive algorithm for such bounded-noise estimation problems. The mean-square error (MSE
Next 10 →
Results 1 - 10 of 29
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University