Optimization of Quantizer s Segment Treshold Using Spline Approximations for Optimal Compressor Function
|
|
- Agnes Whitehead
- 6 years ago
- Views:
Transcription
1 Applied Mathematics, 1, 3, doi:1436/am1331 Published Online October 1 ( Optimization of Quantizer s Segment Treshold Using Spline Approimations for Optimal Compressor Function azar Velimirović 1*, Zoran Perić, Miomir Stanković 3, Jelena ikolić 1 Mathematical Institute of the Serbian Academy of Sciences and Arts, Belgrade, Serbia epartment of Telecommunications, Faculty of Electronic Engineering, University of iš, iš, Serbia 3 Mathematical epartment, Faculty of Occupational Safety, University of iš, iš, Serbia * velimiroviclazar@gmailcom, zoranperic@elfakniacrs Received July 9, 1; revised August 9, 1; accepted August 16, 1 ABSTRACT In this paper, the optimization of quantizer s segment threshold is done The quantizer is designed on the basis of approimative spline functions Coefficients on which we form approimative spline functions are calculated by minimization mean square error (MSE) For coefficients determined in this way, spline functions by which optimal compressor function is approimated are obtained For the quantizer designed on the basis of approimative spline functions, segment threshold is numerically determined depending on imal value of the signal to quantization noise ratio (SQR) Thus, quantizer with optimized segment threshold is achieved It is shown that by quantizer model designed in this way and proposed in this paper, the SQR that is very close to SQR of nonlinear optimal companding quantizer is achieved Keywords: Optimization of Quantizer s Segment Threshold; Mean Square Error; Second-egree Spline Functions; Compressor Function 1 Introduction Quantization, in mathematics and digital signal processing, is the process of mapping a large set of input values to a smaller set such as rounding values to some unit of precision The most common type of quantization is known as scalar quantization A device or algorithmic function that performs quantization is called a quantizer [1-3] Quantizers can be uniform and nonuniform Uniform quantizers are suitable for signals that have approimately uniform distribution How most of the signals do not have a uniform distribution there is a need for using nonuniform quantizer [1-3] One of the most used methods for the realization of the nonuniform quantizer is companding technique, in which a specific compressor function is applied on an input signal The most often used compressor functions are optimal compressor function [1-3] The optimal compressor function gives the imum signal to quantization noise ratio (SQR) for the reference variance of the input signal By knowing compressor function, model quantizer is completely defined However, although easy for analysis, it is shown that this model is very difficult to realize [1-3] Therefore, in order to achieve easier practical realization, approi- * Corresponding author mation of the optimal compressor function and linearization of the optimal compressor function is performed A comprehensive analysis of SQR behavior in a wide range of variances for the piecewise uniform scalar quantizer PUSQ designed for a aplacian source according to the piecewise linear approimation to the optimal compressor law is reported in [4] The linearization of the optimal compressor function is done in [5] The demerit of method described by [5] is a high compleity of quantizer and high compleity of coding and decoding The analysis of compressor function for aplacian source is shown in [6] Quantizer designed on the basis of approimative spline functions, whose support region is divided on segments of equal size is described in [7] In this paper, in order to reduce compleity and maintenance of a reasonably good performance of quantizer, we develop a new method of construction quantizer which introduces optimization of the segment threshold and different number of cells per segments The number of cells per segments is determined depending on value of optimized segment threshold Also, depending on value of optimized segment threshold, approimate spline functions, by which the optimal compressor function is approimated, are determined Unlike with the quantizer described in [7], the support region of proposed quantizer model is not divided on segments of equal size Segments Copyright 1 SciRes
2 VEIMIROVIĆ ET A 1431 size at the proposed model depends on segment threshold that is being optimized The value of segment threshold depends on the size of the support region In papers [8-1] detailed analyses are performed on which the importance of support region choice could be well seen In the papers mentioned above, the influence of support region choice on scalar quantizer performances that are designed for aplacian source is analysed By designing the proposed quantizer based on approimate spline functions and optimized threshold segment, SQR that is close to that of the nonlinear optimal companding quantizer is obtained The rest of the paper is organized as follows: In Section the detailed description of spline functions of the second-degree and optimal compressor function is given esign of quantizer based on spline functions of the second-degree is described in Section 3 The procedure for optimization of the segment threshold is described in Section 4 Finally, Section 5 presents numerical results and discusses their implications Approimate Second-egree Spline Functions and Optimal Compressor Function The theory of approimation is the area of numerical mathematics that deals with problems of replacing one function with other It is shown that the spline of degree better approimates the optimal compressor function than the spline of degree 1 [7] Therefore, in this paper, the approimation of the optimal compressor function using spline function of the second-degree is done A function Q is called a spline of degree if [11]: 1) The domain of Q is an interval [a, b] ) Q and Q are continuous on [a, b] 3) There are points i (called knots) such that a = < 1 < < = b and Q is a polynomial of degree at most on each subinterval [ i, i+1 ] In brief, a quadratic spline is a continuously differenttiable piecewise quadratic function, where quadratic includes all linear combinations of the basic functions 1,, The second-degree spline, also called a quadratic spline, is consisted of parabola parts between two consecutive knotes, but elected to have the same tangent at knote [11] The approimate quadratic spline function g(), which approimates a nonlinear compressed function c(), has the following form [11]: r1 p1q1,, 1 r p q, 1, g (1) r p q, 1, In this paper, the coefficients of the second-degree spline, r i, p i and q i, i = 1,,, are determined by minimizing the mean-square error (MSE) as follows: 1 F c g i i i d, () i1 i i1 i1 F F F,,, i 1,, (3) r p q i i i The optimal compressor function c() by which the imum SQR is achieved for the reference variance of an input signal is defined as [1-3]: p d, p d c (4) p d, p d Without diminishing the generality, the quantizer design will be done for the reference input variance of ref 1 and 3 esign of Quantizer Based on Approimate Second-egree Spline Functions The performances of a quantizer are usually specified in terms of SQR [1-3]: SQR 1log 1log, g o measured in decibels [db], with denoting the variance of an input signal and with denoting the total distortion The total distortion is equal to the sum of the granular distortion g and the overload distortion o The overload distortion o is determined as follows [1-3]:, (5) y p d (6) o where p() is aplacian probability density function (PF) which is defined as follows [1]: p 1 ep In the rest of the paper we assume symmetry about zero in the proposed quantizer model design The aplacian PF is symmetrical about zero amely, without loss of generality, we assume that information source is aplacian source with memoryless property, the unit (7) Copyright 1 SciRes
3 143 VEIMIROVIĆ ET A variance and zero mean value The reproduction level y is determined from the condition: y g 1 (8) The g presents the approimate spline function of the last segment (see Figure 1) The step size is equal to: (9) The optimal support region value of the proposed quantizer is as follows [5]: 3 ln 1 (1) The total number of the reproduction levels per segments in the first quadrant is: i, (11) i1 where the optimal number of reproduction levels per segments, i, is determined from the following condition: ci i ci 1( i 1) i, i 1,,, (1) c Reproduction levels are determined as the solution of the approimate spline function as follows: c ( ) c 1 ( 1 ) 1 1 y gi, i 1, 1,, i (13) y g i1 1 i k k 1 g 1 () 1, (14) 1 g () second-degree spline function nonlinear optimal compressor function = Figure 1 Second-degree spline function and nonlinear optimal compressor function for the number of segments = 4 where i,,, 1,, i For the y is taken the solution that belongs to the spline function domain Observe that indees i and indicate on the -th reproduction levels within the i-th segment Cells lengths per segments of the considered quantizer is equal to:, i 1,,, 1,, i (15) g y i enoted by the -th cells lengths within the i-th segment The granular distortion is determined by Bennett s integral [1-3]: g p d 3 (16) c The granular distortion for the proposed model, based on formula (16), is equal to: g p y, 3 g y where i 1,,, 1,, i (17) ' i 4 Optimization of Quantizer s Segment Threshold In this Section, the segment threshold optimization is described Solving the system of equations defined by Equation (3), where is the optimal value of the support region, =, defined by Equation (1), the epressions for determining coefficents r i, p i, q i, i = 1,, are obtained The values of coefficents r i, p i, q i, i = 1,, depend on the value of the segment threshold i The segment threshold i is determined in the following: Step 1 Based on the coefficents r i, p i, q i, i = 1,, epressed depending on the segment threshold i, the second-degree spline functions, g i (), defined by Equation (1) is desgined Step On the basis of the second-degree spline functions obtained in this way, g i (), the proposed quantizer as described in Section 3 is designed This way, an epression for SQR of proposed quantizer depending on the segment threshold i is achieved Step 3 The segment threshold i is numerically determined so that imal SQR value of proposed quantizer is achieved (see Figures and 3) 5 umerical Results and Conclusions umerical results presented in this section are obtained for the case when the number of segments is equal to = 4 and for number of levels = 16 and = 3 For the number of segments = 4, the approimate quadratic spline function g() defined by Equation (1) is equal to: Copyright 1 SciRes
4 VEIMIROVIĆ ET A , , , , ,11 SQR [db] , , , , , ,5 43 4, , , , , , , , ,7 1 Figure umerical determination of the segment threshold 1 for the number of levels = 16 4, , ,9 3,85 SQR385 [db] 38 3, , , , ,6 55 5,5 56 5,6 57 5,7 58 5,8 59 5,9 6 6, 61 6,1 6 6, 63 6,3 64 6,4 65 6,5 1 Figure 3 umerical determination of the segment threshold 1 for the number of levels = 3 r p q,, g r p q , 1, (18) The number of conditions set is equal to the number of coefficients that should be determined In fact, as we have three knotes and two subintervals (see Figure 1), and each second-degree polynomial has three coefficients, means to determinate the si coefficients in total [11] Solving the system of equations defined by Equation (3), the coefficents r 1, p 1, q 1, r, p, q are determined The values of coefficents r 1, p 1, q 1, r, p, q depend on the value of the segment threshold 1 which is numerically determined as described in Section 4 In Figures and 3 the dependence of SQR of the proposed quantizer model on the segment threshold 1 for the number of levels = 16 and = 3 is shown Based on Figure it can be concluded that the imal value of SQR of the proposed quantizer is achieved for the value of the segment threshold 1 = 451 Also, based on Figure 3 it can be concluded that the imal value of SQR of the proposed quantizer is achieved for the value of the segment threshold 1 = 594 Table 1 shows the values of SQR of the proposed quantizer which segment threshold 1 numerically determined, (SQR ), the values of SQR of the proposed quantizer having equidistant segment thresholds (the segment threshold 1 is at the middle of support region) [7], (SQR S ), and the values of SQR of nonlinear optimal companding quantizer, c():,,, (SQR O ), for the number of levels = 16 and = 3 The granular distortion g and the overload distortion o of nonlinear optimal companding quantizer defined as in [1-3]: O o O g 9 1e 3, (19) e () In Figure 4 dependency of SQR, SQR S and SQR O on the number bits per sample (R = 4 bit/sample and R = 5 bit/sample) is shown Analyzing the results shown in Table 1 and Figure 4, one can notice that design of quantizer based on approimate spline of degree, with the optimized segment threshold 1, achieved higher SQR than design of quantizer based on approimate spline of degree with the segment threshold 1 that is it the middle of the support region Also, analyzing the results shown in Table 1 and Figure 4, one can conclude that design of quantizer based on approimate spline of degree, with the optimized segment threshold 1, achieved SQR very close to that of nonlinear optimal companding quantizer Comparing the performance of the proposed quantizer model with the optimized segment threshold 1, with the quantizer model having equidistant segment thresholds [7], and with the nonlinear optimal companding quantizer [1-3], it can be concluded that the proposed model is a very effective solution because a simple quantizer model achieves a high quality signal For the case when the number of levels is lower than 16, the compleity of the Table 1 The values of SQR, SQR S and SQR O for the number of levels = 16 and = 3 SQR [db] SQR S [db] SQR O [db] Copyright 1 SciRes
5 1434 VEIMIROVIĆ ET A SQR [db] SQR SQR S SQR O , 41 4,1 4 4, 43 4,3 4,4 44 4,5 45 4,6 46 4,7 47 4,8 48 4,9 49 5, 5 R [bit/sample] Figure 4 ependency of SQR, SQR S and SQR O on the number bits per sample proposed quantizer model may be larger than the optimal loyd-ma s scalar quantizer model [1-3] For the case when the number of levels is more than 3, the compleity of the proposed quantizer model becomes high ue to these limitations, this paper analyzes the quantizer model for the number of levels = 16 and = 3, ie for the number bits per sample R = 4 and R = 5 The proposed quantizer model besides aplacian PF, is convenient for other probability density functions 6 Acknowledgements This work is partially supported by Serbian Ministry of Education and Science through Mathematical Institute of Serbian Academy of Sciences and Arts (Proect III446) and by Serbian Ministry of Education and Science (Proect TR335) REFERECES [1] S Jayant and P oll, igital Coding of Waveforms, Principles and Applications to Speech and Video, Prentice Hall Secondary Education ivision, ew Jersey, 1984 [] A Gersho and R M Gray, Vector Quantization and Signal Compression, Kluwer Academic Publishers, Boston, ordrecht, ondon, 199 doi:117/ [3] R Rabiner and R W Schafer, Introduction to igital Speech Processing, Foundations and Trends in Signal Processing, Hanover, 7 [4] J ikolić, Z Perić, Antić, A Jovanović and enić, ow Comple Forward Adaptive oss Compression Algorithm and ITS Aplication in Speech Coding, Journal of Electrical Engineering, Vol 6, o 1, 11, pp 19-4 doi:1478/v [5] Z Perić, M Petković and M inčić, Simple Compression Algorithm for Memoryless aplacian Source Based on the Optimal Companding Technique, Informatica, Vol, o1, 9, pp [6] Z Perić and J ikolić, Analysis of Compressor Function for aplacian Source s Scalar Compandor Construction, ata Recording, Storage and Processing, Vol 8, o, 6, pp 15-4 [7] Velimirović, Z Perić, J ikolić and M Stanković, esign of Compandor Quantizer for aplacian Source for Medium Bit Rate Using Spline Approimations, Facta Universitatis, Vol 5, o 1, 1, pp 9-1 [8] S a, On the Support of Fied-Rate Minimum Mean- Squared Error Scalar Quantizers for a aplacian Source, IEEE Transactions on Information Theory, Vol 5, o 5, 4, pp doi:1119/tit [9] Z Perić, J ikolić and Pokraac, Estimation of the Support Region for aplacian Source Scalar Quantizers, Journal of Electrical Engineering, Vol 58, o 1, 7, pp [1] Z Perić, J ikolić and Pokraac, Analysis of Support Region for aplacian Source s Scalar Quantizers, Proceedings of 7th IEEE Conference on Telecommunications in Modern Satelite, Cable and Broadcasting Services TESIKS 5, iš, 8-3 September 5, Vol, pp [11] W Cheney and Kincaid, umerical Mathematics and Computing, 6th Edition, Thomson Higher Education, Belmont, 8 Copyright 1 SciRes
LOW COMPLEX FORWARD ADAPTIVE LOSS COMPRESSION ALGORITHM AND ITS APPLICATION IN SPEECH CODING
Journal of ELECTRICAL ENGINEERING, VOL. 62, NO. 1, 2011, 19 24 LOW COMPLEX FORWARD ADAPTIVE LOSS COMPRESSION ALGORITHM AND ITS APPLICATION IN SPEECH CODING Jelena Nikolić Zoran Perić Dragan Antić Aleksandra
More informationDual-mode quasi-logarithmic quantizer with embedded G.711 codec
Journal of ELECTRICAL ENGINEERING, VOL 69 (018), NO1, 46 51 Dual-mode quasi-logarithmic quantizer with embedded G.711 codec Bojan Denić, Zoran Perić, Vladimir Despotović, Nikola Vučić, Predrag Petrović
More informationAn Effective Method for Initialization of Lloyd Max s Algorithm of Optimal Scalar Quantization for Laplacian Source
INFORMATICA, 007, Vol. 18, No., 79 88 79 007 Institute of Mathematics and Informatics, Vilnius An Effective Method for Initialization of Lloyd Max s Algorithm of Optimal Scalar Quantization for Laplacian
More informationOptimization of Variable-length Code for Data. Compression of memoryless Laplacian source
Optimization of Variable-length Code for Data Compression of memoryless Laplacian source Marko D. Petković, Zoran H. Perić, Aleksandar V. Mosić Abstract In this paper we present the efficient technique
More informationAnalysis of methods for speech signals quantization
INFOTEH-JAHORINA Vol. 14, March 2015. Analysis of methods for speech signals quantization Stefan Stojkov Mihajlo Pupin Institute, University of Belgrade Belgrade, Serbia e-mail: stefan.stojkov@pupin.rs
More informationMultimedia Communications. Scalar Quantization
Multimedia Communications Scalar Quantization Scalar Quantization In many lossy compression applications we want to represent source outputs using a small number of code words. Process of representing
More informationPulse-Code Modulation (PCM) :
PCM & DPCM & DM 1 Pulse-Code Modulation (PCM) : In PCM each sample of the signal is quantized to one of the amplitude levels, where B is the number of bits used to represent each sample. The rate from
More informationScalar and Vector Quantization. National Chiao Tung University Chun-Jen Tsai 11/06/2014
Scalar and Vector Quantization National Chiao Tung University Chun-Jen Tsai 11/06/014 Basic Concept of Quantization Quantization is the process of representing a large, possibly infinite, set of values
More informationReview of Quantization. Quantization. Bring in Probability Distribution. L-level Quantization. Uniform partition
Review of Quantization UMCP ENEE631 Slides (created by M.Wu 004) Quantization UMCP ENEE631 Slides (created by M.Wu 001/004) L-level Quantization Minimize errors for this lossy process What L values to
More informationEE-597 Notes Quantization
EE-597 Notes Quantization Phil Schniter June, 4 Quantization Given a continuous-time and continuous-amplitude signal (t, processing and storage by modern digital hardware requires discretization in both
More informationCOMPARISON OF CLASSICAL CIC AND A NEW CLASS OF STOPBAND-IMPROVED CIC FILTERS FORMED BY CASCADING NON-IDENTICAL COMB SECTIONS
FACTA UIVERSITATIS Series: Electronics and Energetics Vol. 29, o 1, March 216, pp. 61-76 DOI: 1.2298/FUEE16161M COMPARISO OF CLASSICAL CIC AD A EW CLASS OF STOPBAD-IMPROVED CIC FILTERS FORMED BY CASCADIG
More informationDigital Signal Processing
COMP ENG 4TL4: Digital Signal Processing Notes for Lecture #3 Wednesday, September 10, 2003 1.4 Quantization Digital systems can only represent sample amplitudes with a finite set of prescribed values,
More informationMultimedia Systems Giorgio Leonardi A.A Lecture 4 -> 6 : Quantization
Multimedia Systems Giorgio Leonardi A.A.2014-2015 Lecture 4 -> 6 : Quantization Overview Course page (D.I.R.): https://disit.dir.unipmn.it/course/view.php?id=639 Consulting: Office hours by appointment:
More informationModule 3. Quantization and Coding. Version 2, ECE IIT, Kharagpur
Module Quantization and Coding ersion, ECE IIT, Kharagpur Lesson Logarithmic Pulse Code Modulation (Log PCM) and Companding ersion, ECE IIT, Kharagpur After reading this lesson, you will learn about: Reason
More informationQuantization 2.1 QUANTIZATION AND THE SOURCE ENCODER
2 Quantization After the introduction to image and video compression presented in Chapter 1, we now address several fundamental aspects of image and video compression in the remaining chapters of Section
More informationMultimedia Communications. Differential Coding
Multimedia Communications Differential Coding Differential Coding In many sources, the source output does not change a great deal from one sample to the next. This means that both the dynamic range and
More informationOn Optimal Coding of Hidden Markov Sources
2014 Data Compression Conference On Optimal Coding of Hidden Markov Sources Mehdi Salehifar, Emrah Akyol, Kumar Viswanatha, and Kenneth Rose Department of Electrical and Computer Engineering University
More informationON SCALABLE CODING OF HIDDEN MARKOV SOURCES. Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose
ON SCALABLE CODING OF HIDDEN MARKOV SOURCES Mehdi Salehifar, Tejaswi Nanjundaswamy, and Kenneth Rose Department of Electrical and Computer Engineering University of California, Santa Barbara, CA, 93106
More informationIMAGE COMPRESSION OF DIGITIZED NDE X-RAY RADIOGRAPHS. Brian K. LoveweIl and John P. Basart
IMAGE COMPRESSIO OF DIGITIZED DE X-RAY RADIOGRAPHS BY ADAPTIVE DIFFERETIAL PULSE CODE MODULATIO Brian K. LoveweIl and John P. Basart Center for ondestructive Evaluation and the Department of Electrical
More informationThe information loss in quantization
The information loss in quantization The rough meaning of quantization in the frame of coding is representing numerical quantities with a finite set of symbols. The mapping between numbers, which are normally
More informationSUBOPTIMALITY OF THE KARHUNEN-LOÈVE TRANSFORM FOR FIXED-RATE TRANSFORM CODING. Kenneth Zeger
SUBOPTIMALITY OF THE KARHUNEN-LOÈVE TRANSFORM FOR FIXED-RATE TRANSFORM CODING Kenneth Zeger University of California, San Diego, Department of ECE La Jolla, CA 92093-0407 USA ABSTRACT An open problem in
More informationChapter 10 Applications in Communications
Chapter 10 Applications in Communications School of Information Science and Engineering, SDU. 1/ 47 Introduction Some methods for digitizing analog waveforms: Pulse-code modulation (PCM) Differential PCM
More informationEE368B Image and Video Compression
EE368B Image and Video Compression Homework Set #2 due Friday, October 20, 2000, 9 a.m. Introduction The Lloyd-Max quantizer is a scalar quantizer which can be seen as a special case of a vector quantizer
More informationC.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University
Quantization C.M. Liu Perceptual Signal Processing Lab College of Computer Science National Chiao-Tung University http://www.csie.nctu.edu.tw/~cmliu/courses/compression/ Office: EC538 (03)5731877 cmliu@cs.nctu.edu.tw
More informationCoding Algorithm for Grayscale Images Design of Piecewise Uniform Quantizer with Golomb Rice Code and Novel Analytical Model for Performance Analysis
INFORMATICA, 2017, Vol. 28, No. 4, 703 724 703 2017 Vilnius University DOI: http://dx.doi.org/10.15388/informatica.2017.152 Coding Algorithm for Grayscale Images Design of Piecewise Uniform Quantizer with
More informationA Systematic Description of Source Significance Information
A Systematic Description of Source Significance Information Norbert Goertz Institute for Digital Communications School of Engineering and Electronics The University of Edinburgh Mayfield Rd., Edinburgh
More informationVector Quantization and Subband Coding
Vector Quantization and Subband Coding 18-796 ultimedia Communications: Coding, Systems, and Networking Prof. Tsuhan Chen tsuhan@ece.cmu.edu Vector Quantization 1 Vector Quantization (VQ) Each image block
More informationGaussian source Assumptions d = (x-y) 2, given D, find lower bound of I(X;Y)
Gaussian source Assumptions d = (x-y) 2, given D, find lower bound of I(X;Y) E{(X-Y) 2 } D
More informationFuzzy quantization of Bandlet coefficients for image compression
Available online at www.pelagiaresearchlibrary.com Advances in Applied Science Research, 2013, 4(2):140-146 Fuzzy quantization of Bandlet coefficients for image compression R. Rajeswari and R. Rajesh ISSN:
More informationExample: for source
Nonuniform scalar quantizer References: Sayood Chap. 9, Gersho and Gray, Chap.'s 5 and 6. The basic idea: For a nonuniform source density, put smaller cells and levels where the density is larger, thereby
More informationTHE dictionary (Random House) definition of quantization
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 2325 Quantization Robert M. Gray, Fellow, IEEE, and David L. Neuhoff, Fellow, IEEE (Invited Paper) Abstract The history of the theory
More informationApplicatin of the α-approximation for Discretization of Analogue Systems
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 8, no. 3, December 5, 57-586 Applicatin of the α-approximation for Discretization of Analogue Systems Tomislav B. Šekara and Milić R. Stojić Abstract:
More informationPerformance Bounds for Joint Source-Channel Coding of Uniform. Departements *Communications et **Signal
Performance Bounds for Joint Source-Channel Coding of Uniform Memoryless Sources Using a Binary ecomposition Seyed Bahram ZAHIR AZAMI*, Olivier RIOUL* and Pierre UHAMEL** epartements *Communications et
More informationCompression methods: the 1 st generation
Compression methods: the 1 st generation 1998-2017 Josef Pelikán CGG MFF UK Praha pepca@cgg.mff.cuni.cz http://cgg.mff.cuni.cz/~pepca/ Still1g 2017 Josef Pelikán, http://cgg.mff.cuni.cz/~pepca 1 / 32 Basic
More information7. Piecewise Polynomial (Spline) Interpolation
- 64-7 Piecewise Polynomial (Spline Interpolation Single polynomial interpolation has two major disadvantages First, it is not computationally efficient when the number of data points is large When the
More informationSoft-Output Trellis Waveform Coding
Soft-Output Trellis Waveform Coding Tariq Haddad and Abbas Yongaçoḡlu School of Information Technology and Engineering, University of Ottawa Ottawa, Ontario, K1N 6N5, Canada Fax: +1 (613) 562 5175 thaddad@site.uottawa.ca
More informationCS578- Speech Signal Processing
CS578- Speech Signal Processing Lecture 7: Speech Coding Yannis Stylianou University of Crete, Computer Science Dept., Multimedia Informatics Lab yannis@csd.uoc.gr Univ. of Crete Outline 1 Introduction
More informationRandom Signal Transformations and Quantization
York University Department of Electrical Engineering and Computer Science EECS 4214 Lab #3 Random Signal Transformations and Quantization 1 Purpose In this lab, you will be introduced to transformations
More information7.1 Sampling and Reconstruction
Haberlesme Sistemlerine Giris (ELE 361) 6 Agustos 2017 TOBB Ekonomi ve Teknoloji Universitesi, Guz 2017-18 Dr. A. Melda Yuksel Turgut & Tolga Girici Lecture Notes Chapter 7 Analog to Digital Conversion
More informationMATH College Algebra 3:3:1
MATH 1314 College Algebra 3:3:1 South Plains College Arts & Sciences Mathematics Jay Driver Summer I 2010 Instructor: Jay Driver Office: M102 (mathematics building) Telephone: (806) 716-2780 Email: jdriver@southplainscollege.edu
More informationAfundamental component in the design and analysis of
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 2, MARCH 1999 533 High-Resolution Source Coding for Non-Difference Distortion Measures: The Rate-Distortion Function Tamás Linder, Member, IEEE, Ram
More informationAudio /Video Signal Processing. Lecture 2, Quantization, SNR Gerald Schuller, TU Ilmenau
Audio /Video Signal Processing Lecture 2, Quantization, SNR Gerald Schuller, TU Ilmenau Quantization Signal to Noise Ratio (SNR). Assume we have a A/D converter with a quantizer with a certain number of
More informationLecture 9 Video Coding Transforms 2
Lecture 9 Video Coding Transforms 2 Integer Transform of H.264/AVC In previous standards, the DCT was defined as the ideal transform, with unlimited accuracy. This has the problem, that we have encoders
More informationOptimal Multiple Description and Multiresolution Scalar Quantizer Design
Optimal ultiple Description and ultiresolution Scalar Quantizer Design ichelle Effros California Institute of Technology Abstract I present new algorithms for fixed-rate multiple description and multiresolution
More informationAsymptotic Distortion Performance of Source-Channel Diversity Schemes over Relay Channels
Asymptotic istortion Performance of Source-Channel iversity Schemes over Relay Channels Karim G. Seddik 1, Andres Kwasinski 2, and K. J. Ray Liu 1 1 epartment of Electrical and Computer Engineering, 2
More informationPrinciples of Communications
Principles of Communications Weiyao Lin, PhD Shanghai Jiao Tong University Chapter 4: Analog-to-Digital Conversion Textbook: 7.1 7.4 2010/2011 Meixia Tao @ SJTU 1 Outline Analog signal Sampling Quantization
More informationDithering for Floating-Point Number Representation
1st International On-Line Workshop on Dithering in Measurement, http://measure.feld.cvut.cz/dithering98, March 1-31, 1998. 9-1 Dithering for Floating-Point Number Representation Rezső Dunay, István Kollár,
More informationarxiv: v1 [math.ca] 2 Nov 2018
arxiv.org arxiv:1811.00748v1 [math.ca] 2 Nov 2018 One method for proving some classes of eponential analytical inequalities Branko Malešević a, Tatjana Lutovac a, Bojan Banjac b a School of Electrical
More informationEXAMPLE OF SCALAR AND VECTOR QUANTIZATION
EXAMPLE OF SCALAR AD VECTOR QUATIZATIO Source sequence : This could be the output of a highly correlated source. A scalar quantizer: =1, M=4 C 1 = {w 1,w 2,w 3,w 4 } = {-4, -1, 1, 4} = codeboo of quantization
More informationGaussian-Shaped Circularly-Symmetric 2D Filter Banks
Gaussian-Shaped Circularly-Symmetric D Filter Bans ADU MATEI Faculty of Electronics and Telecommunications Technical University of Iasi Bldv. Carol I no.11, Iasi 756 OMAIA Abstract: - In this paper we
More informationPCM Reference Chapter 12.1, Communication Systems, Carlson. PCM.1
PCM Reference Chapter 1.1, Communication Systems, Carlson. PCM.1 Pulse-code modulation (PCM) Pulse modulations use discrete time samples of analog signals the transmission is composed of analog information
More informationImage Coding Algorithm Based on All Phase Walsh Biorthogonal Transform
Image Coding Algorithm Based on All Phase Walsh Biorthogonal ransform Chengyou Wang, Zhengxin Hou, Aiping Yang (chool of Electronic Information Engineering, ianin University, ianin 72 China) wangchengyou@tu.edu.cn,
More informationCalculating the Required Number of Bits in the Function of Confidence Level and Error Probability Estimation
SERBIA JOURAL OF ELECTRICAL EGIEERIG Vol. 9, o. 3, October 2012, 361-375 UDK: 621.391:004.7]:519.213 DOI: 10.2298/SJEE1203361M Calculating the Required umber of Bits in the Function of Confidence Level
More informationLloyd-Max Quantization of Correlated Processes: How to Obtain Gains by Receiver-Sided Time-Variant Codebooks
Lloyd-Max Quantization of Correlated Processes: How to Obtain Gains by Receiver-Sided Time-Variant Codebooks Sai Han and Tim Fingscheidt Institute for Communications Technology, Technische Universität
More informationEstimation Error Bounds for Frame Denoising
Estimation Error Bounds for Frame Denoising Alyson K. Fletcher and Kannan Ramchandran {alyson,kannanr}@eecs.berkeley.edu Berkeley Audio-Visual Signal Processing and Communication Systems group Department
More informationSummary of Lecture 3
Summary of Lecture 3 Simple histogram based image segmentation and its limitations. the his- Continuous and discrete amplitude random variables properties togram equalizing point function. Images as matrices
More informationFinite Word Length Effects and Quantisation Noise. Professors A G Constantinides & L R Arnaut
Finite Word Length Effects and Quantisation Noise 1 Finite Word Length Effects Finite register lengths and A/D converters cause errors at different levels: (i) input: Input quantisation (ii) system: Coefficient
More informationTime-domain representations
Time-domain representations Speech Processing Tom Bäckström Aalto University Fall 2016 Basics of Signal Processing in the Time-domain Time-domain signals Before we can describe speech signals or modelling
More information9 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.3 è1998è this paper we have considered shaping gain for two interesting quantization procedu
FACTA UNIVERSITATIS èniçsè Series: Electronics and Energetics vol. 11, No.3 è1998è, 91-99 NONLINEAR TRANSFORMATION OF ONEíDIMENSIONAL CONSTELLATION POINTS IN ORDER TO ERROR PROBABILITY DECREASING Zoran
More informationQuantisation. Uniform Quantisation. Tcom 370: Principles of Data Communications University of Pennsylvania. Handout 5 c Santosh S.
Tcom 370: Principles of Data Communications Quantisation Handout 5 Quantisation involves a map of the real line into a discrete set of quantisation levels. Given a set of M quantisation levels {S 0, S
More informationSHAPE OF IMPULSE RESPONSE CHARACTERISTICS OF LINEAR-PHASE NONRECURSIVE 2D FIR FILTER FUNCTION *
FACTA UNIVERSITATIS Series: Electronics and Energetics Vol. 6, N o, August 013, pp. 133-143 DOI: 10.98/FUEE130133P SHAPE OF IMPULSE RESPONSE CHARACTERISTICS OF LINEAR-PHASE NONRECURSIVE D FIR FILTER FUNCTION
More informationFractal Dimension and Vector Quantization
Fractal Dimension and Vector Quantization [Extended Abstract] Krishna Kumaraswamy Center for Automated Learning and Discovery, Carnegie Mellon University skkumar@cs.cmu.edu Vasileios Megalooikonomou Department
More informationLloyd Max s Algorithm Implementation in Speech Coding Algorithm Based on Forward Adaptive Technique
INFORMATICA, 2008, Vol. 19, No. 2, 255 270 255 2008 Institute of Mathematics and Informatics, Vilnius Lloyd Max s Algorithm Implementation in Speech Coding Algorithm Based on Forward Adaptive Technique
More informationSpherical Logarithmic Quantization and its Application for DPCM
FACTA UNIVERSITATIS (NIŠ) SER.: ELEC. ENERG. vol. 17, August 2004, 165-184 Spherical Logarithmic Quantization and its Application for PCM edicated to Prof. r. Karlheinz Tröndle on the occasion of his retirement
More informationat Some sort of quantization is necessary to represent continuous signals in digital form
Quantization at Some sort of quantization is necessary to represent continuous signals in digital form x(n 1,n ) x(t 1,tt ) D Sampler Quantizer x q (n 1,nn ) Digitizer (A/D) Quantization is also used for
More informationNUMERICAL COMPUTATION OF THE CAPACITY OF CONTINUOUS MEMORYLESS CHANNELS
NUMERICAL COMPUTATION OF THE CAPACITY OF CONTINUOUS MEMORYLESS CHANNELS Justin Dauwels Dept. of Information Technology and Electrical Engineering ETH, CH-8092 Zürich, Switzerland dauwels@isi.ee.ethz.ch
More informationTail Approximation of the Skew-Normal by the Skew-Normal Laplace: Application to Owen s T Function and the Bivariate Normal Distribution
Journal of Statistical and Econometric ethods vol. no. 3 - ISS: 5-557 print version 5-565online Scienpress Ltd 3 Tail Approimation of the Skew-ormal by the Skew-ormal Laplace: Application to Owen s T Function
More informationFractal Dimension and Vector Quantization
Fractal Dimension and Vector Quantization Krishna Kumaraswamy a, Vasileios Megalooikonomou b,, Christos Faloutsos a a School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 523 b Department
More informationCODING SAMPLE DIFFERENCES ATTEMPT 1: NAIVE DIFFERENTIAL CODING
5 0 DPCM (Differential Pulse Code Modulation) Making scalar quantization work for a correlated source -- a sequential approach. Consider quantizing a slowly varying source (AR, Gauss, ρ =.95, σ 2 = 3.2).
More informationE303: Communication Systems
E303: Communication Systems Professor A. Manikas Chair of Communications and Array Processing Imperial College London Principles of PCM Prof. A. Manikas (Imperial College) E303: Principles of PCM v.17
More informationVector Quantization Encoder Decoder Original Form image Minimize distortion Table Channel Image Vectors Look-up (X, X i ) X may be a block of l
Vector Quantization Encoder Decoder Original Image Form image Vectors X Minimize distortion k k Table X^ k Channel d(x, X^ Look-up i ) X may be a block of l m image or X=( r, g, b ), or a block of DCT
More informationGaussian Source Coding With Spherical Codes
2980 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 48, NO 11, NOVEMBER 2002 Gaussian Source Coding With Spherical Codes Jon Hamkins, Member, IEEE, and Kenneth Zeger, Fellow, IEEE Abstract A fixed-rate shape
More informationExperimental verification of different models of the ADC transfer function. Petr Suchanek, David Slepicka, Vladimir Haasz
Experimental verification of different models of the ADC transfer function Petr Suchanek, David Slepicka, Vladimir Haasz Czech Technical University in Prague, Faculty of Electrical Engineering Technická,
More informationBeing edited by Prof. Sumana Gupta 1. only symmetric quantizers ie the input and output levels in the 3rd quadrant are negative
Being edited by Prof. Sumana Gupta 1 Quantization This involves representation the sampled data by a finite number of levels based on some criteria such as minimizing of the quantifier distortion. Quantizer
More informationBECAS de PROYECTOS CONTROL DE SISTEMAS A TRAVÉS DE REDES DE COMUNICACIÓN.
BECAS de PROYECTOS CONTROL DE SISTEMAS A TRAVÉS DE REDES DE COMUNICACIÓN. Perfil: Ingeniero Industrial, Telecomunicación, Automática y Electrónica Industrial, con proyecto Fin de Carrera terminado. Entregar
More informationWest Essex Regional School District. AP Calculus AB. Summer Packet
West Esse Regional School District AP Calculus AB Summer Packet 05-06 Calculus AB Calculus AB covers the equivalent of a one semester college calculus course. Our focus will be on differential and integral
More informationThe Secrets of Quantization. Nimrod Peleg Update: Sept. 2009
The Secrets of Quantization Nimrod Peleg Update: Sept. 2009 What is Quantization Representation of a large set of elements with a much smaller set is called quantization. The number of elements in the
More informationComputing running DCTs and DSTs based on their second-order shift properties
University of Wollongong Research Online Faculty of Informatics - Papers (Archive) Faculty of Engineering Information Sciences 000 Computing running DCTs DSTs based on their second-order shift properties
More informationSCALABLE AUDIO CODING USING WATERMARKING
SCALABLE AUDIO CODING USING WATERMARKING Mahmood Movassagh Peter Kabal Department of Electrical and Computer Engineering McGill University, Montreal, Canada Email: {mahmood.movassagh@mail.mcgill.ca, peter.kabal@mcgill.ca}
More informationConverting DCT Coefficients to H.264/AVC
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Converting DCT Coefficients to H.264/AVC Jun Xin, Anthony Vetro, Huifang Sun TR2004-058 June 2004 Abstract Many video coding schemes, including
More informationLogarithmic quantisation of wavelet coefficients for improved texture classification performance
Logarithmic quantisation of wavelet coefficients for improved texture classification performance Author Busch, Andrew, W. Boles, Wageeh, Sridharan, Sridha Published 2004 Conference Title 2004 IEEE International
More informationLeast-Squares Performance of Analog Product Codes
Copyright 004 IEEE Published in the Proceedings of the Asilomar Conference on Signals, Systems and Computers, 7-0 ovember 004, Pacific Grove, California, USA Least-Squares Performance of Analog Product
More informationLecture 7 Predictive Coding & Quantization
Shujun LI (李树钧): INF-10845-20091 Multimedia Coding Lecture 7 Predictive Coding & Quantization June 3, 2009 Outline Predictive Coding Motion Estimation and Compensation Context-Based Coding Quantization
More informationAcomplex-valued harmonic with a time-varying phase is a
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 46, NO. 9, SEPTEMBER 1998 2315 Instantaneous Frequency Estimation Using the Wigner Distribution with Varying and Data-Driven Window Length Vladimir Katkovnik,
More information1-Bit Compressive Sensing
1-Bit Compressive Sensing Petros T. Boufounos, Richard G. Baraniuk Rice University, Electrical and Computer Engineering 61 Main St. MS 38, Houston, TX 775 Abstract Compressive sensing is a new signal acquisition
More informationMARKOV CHAINS A finite state Markov chain is a sequence of discrete cv s from a finite alphabet where is a pmf on and for
MARKOV CHAINS A finite state Markov chain is a sequence S 0,S 1,... of discrete cv s from a finite alphabet S where q 0 (s) is a pmf on S 0 and for n 1, Q(s s ) = Pr(S n =s S n 1 =s ) = Pr(S n =s S n 1
More informationOn Eigenvalues of Row-Inverted Sylvester Hadamard Matrices
Result.Math. 54 (009), 117 16 c 009 Birkhäuser Verlag Basel/Switzerland 14-68/010117-10, published online January 1, 009 DOI 10.1007/s0005-008-0-4 Results in Mathematics On Eigenvalues of Row-Inverted
More informationon a per-coecient basis in large images is computationally expensive. Further, the algorithm in [CR95] needs to be rerun, every time a new rate of com
Extending RD-OPT with Global Thresholding for JPEG Optimization Viresh Ratnakar University of Wisconsin-Madison Computer Sciences Department Madison, WI 53706 Phone: (608) 262-6627 Email: ratnakar@cs.wisc.edu
More informationGAUSSIANIZATION METHOD FOR IDENTIFICATION OF MEMORYLESS NONLINEAR AUDIO SYSTEMS
GAUSSIANIATION METHOD FOR IDENTIFICATION OF MEMORYLESS NONLINEAR AUDIO SYSTEMS I. Marrakchi-Mezghani (1),G. Mahé (2), M. Jaïdane-Saïdane (1), S. Djaziri-Larbi (1), M. Turki-Hadj Alouane (1) (1) Unité Signaux
More informationDynamical Behavior for Optimal Cubic-Order Multiple Solver
Applied Mathematical Sciences, Vol., 7, no., 5 - HIKARI Ltd, www.m-hikari.com https://doi.org/.988/ams.7.6946 Dynamical Behavior for Optimal Cubic-Order Multiple Solver Young Hee Geum Department of Applied
More informationError Spectrum Shaping and Vector Quantization. Jon Dattorro Christine Law
Error Spectrum Shaping and Vector Quantization Jon Dattorro Christine Law in partial fulfillment of the requirements for EE392c Stanford University Autumn 1997 0. Introduction We view truncation noise
More informationDesign of Optimal Quantizers for Distributed Source Coding
Design of Optimal Quantizers for Distributed Source Coding David Rebollo-Monedero, Rui Zhang and Bernd Girod Information Systems Laboratory, Electrical Eng. Dept. Stanford University, Stanford, CA 94305
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Lesson 7 Delta Modulation and DPCM Instructional Objectives At the end of this lesson, the students should be able to: 1. Describe a lossy predictive coding scheme.
More informationVarious signal sampling and reconstruction methods
Various signal sampling and reconstruction methods Rolands Shavelis, Modris Greitans 14 Dzerbenes str., Riga LV-1006, Latvia Contents Classical uniform sampling and reconstruction Advanced sampling and
More informationSimple and convenient analytical formulas for studying the projectile motion in midair
Revista Brasileira de Ensino de Física, vol 40, nº 1, e1308 (018) wwwscielobr/rbef DOI: http://dxdoiorg/101590/1806-916-rbef-017-0145 Articles cb Licença Creative Commons Simple and convenient analytical
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationCompressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes
Compressed Sensing Using Reed- Solomon and Q-Ary LDPC Codes Item Type text; Proceedings Authors Jagiello, Kristin M. Publisher International Foundation for Telemetering Journal International Telemetering
More informationwindow operator 2N N orthogonal transform N N scalar quantizers
Lapped Orthogonal Vector Quantization Henrique S. Malvar PictureTel Corporation 222 Rosewood Drive, M/S 635 Danvers, MA 1923 Tel: (58) 623-4394 Email: malvar@pictel.com Gary J. Sullivan PictureTel Corporation
More informationNumber Representation and Waveform Quantization
1 Number Representation and Waveform Quantization 1 Introduction This lab presents two important concepts for working with digital signals. The first section discusses how numbers are stored in memory.
More informationOn Common Information and the Encoding of Sources that are Not Successively Refinable
On Common Information and the Encoding of Sources that are Not Successively Refinable Kumar Viswanatha, Emrah Akyol, Tejaswi Nanjundaswamy and Kenneth Rose ECE Department, University of California - Santa
More information