Rounding Transform. and Its Application for Lossless Pyramid Structured Coding ABSTRACT
|
|
- Marcus Perkins
- 5 years ago
- Views:
Transcription
1 Rounding Transform and Its Application for Lossless Pyramid Structured Coding ABSTRACT A new transform, called the rounding transform (RT), is introduced in this paper. This transform maps an integer vector onto another integer vector by using weighted average and difference filters followed by a rounding operation. The RT can be applied to lossless pyramid structured coding with various elementary block sizes and filters. In addition, it generalizes other mean based lossless pyramid structured coding schemes. I. INTRODUCTION Although linear predictive coding [1,2] is usually used for lossless image compression, pyramid structured coding is still an attractive solution due to the progressive transmission [3,4]. Two pyramid structured coding methods have been studied in depth : the sub-sample based methods [5-7] and the mean based methods [8-11]. The sub-sample based methods mainly transmit difference images between two successive levels of the sub-sample pyramid. The mean based methods such as the S-Transform [8-10] and the hierarchy embedded differential image (HEDI) [11] construct a mean based pyramid by rounding the mean of the non-overlapping block and then generating the differences between neighboring nodes of the mean pyramid to achieve good lossless compression. In recent works [12,13], more efficient compression was found using the S-Transform based predictive coding which is referred to as S+P (Sequential+ Prediction) Transform or RTS (Reversible Two Six) -Transform. However, the computations for the mean based methods have not yet been generalized, mainly due to a lack of precise analysis of the rounding operations. For example, the usable block size is restricted to two sizes, 2 2or 3 3, and the computations of the reconstruction must be done successively. In this paper, we propose a new transform, called the rounding transform (RT), that maps an integer vector to another integer vector by using weighted average and difference filters followed by a rounding operation. The RT is a reversible transform if floor (ceiling) and ceiling 1
2 (floor) operations are used in the forward and inverse transformation respectively. A proof of reversibility is given in Appendix-A. The RT can be applied to lossless pyramid structured coding with various elementary block sizes and various filters. We show that the RT generalizes the previous mean based lossless pyramid structured coding schemes [8-11], including the reduced difference pyramid (RDP) [14]. All of these schemes can be implemented in parallel at both the transmitting and receiving ends, if the proposed method is used. II. Rounding Transform defined as The RT of an one-dimensional (1-D) integer vector X N 1 and its inverse transform are YN 1 = RN X N 1 (1) X = R Y N 1 N N 1 (2) where and denote the floor and ceiling. R N matrix), and R N is the rounding transform matrix (RT is its inverse matrix. Note that the floor operator can be used in the inverse RT if the ceiling operator is used in the forward, i.e., the order of the rounding operations is interchangeable. A sufficient condition for the reversibility of the transform pair is that the non-singular matrix R N has the following properties. All the elements are integers except for the first row. The sum of the first row is equal to 1. All the other rows sum to 0. To avoid roundoff error due to the finite precision arithmetic [15], the RT matrix should be machine representable. For its inverse to be also machine representable, the determinant should be of the form 2 k where k Z. A proof of reversibility is given in Appendix A. The transformed vector Y N 1 is formed by computing the weighted average and the N 1 difference values, followed by a floor operation. In fact, the floor operation is not used for the differences since they are calculated from integers. The original integer data can be exactly recovered from the floored weighted average and differences by using the inverse RT with the ceiling operation. In a similar manner, a 2-D RT is defined as 2
3 t Y = Rr X Rc (3) M M M M N X = Rr Y Rc t M M M M N (4) where the superscript -t indicates the transposed inverse, and Rr M M and Rc N satisfy the RT matrix conditions. Note that the order of the inverse transform must be the reverse of that of the forward transform. The floored weighted average has the same dynamic range as the input data and its probability distribution may be very similar to that of the input data. The difference values are significantly decorrelated since they tend to be close to zero when the input data are highly correlated. Taking into account this decorrelation, the RT can be applied to a lossless pyramid structured coding. Fig. 1 depicts the basic algorithm for constructing the pyramids on an elementary block of size M. This structure is similar to the other mean based pyramids [9-11,14], but various elementary block sizes can be used. In addition, the RT allows the use of various weighted averaging filters. We refer to it as a lossless weighted average based pyramid. Using the 2-D RT, the weighted average and the difference pyramids can easily be constructed. The structure can also be obtained by using the 1-D RT, if the block of size M rearranged into a 1-D vector such as is ( L L L ) X x x x x x x ( M ) 1 = N 21 2N MN t, (5) and the RT matrix is of size MN MN. y 11 y y 1N Level K N y 21 O y M1 y MN Level K+1 N x 11 O... x 1 N x M1 x MN Weighted Average Pyramid Difference Pyramid 3
4 Fig. 1. The basic structure of weighted average based pyramid for a block of size M. The weighted average and the difference images at level k are obtained from the k +1 level weighted average image. III. Relation with other mean based methods The other mean based pyramid coding methods can be represented by the RT matrix and its inverse as shown in Table 1. The S-Transform is represented by a 2-D RT, where the same matrix is used for both Rr 2 2 and Rc 2 2. The HEDI and the RDP can be represented by the 1-D RT. HEDI-CM2 and triplet-a RDP are considered as representatives of the HEDI and the RDP as these were empirically found to yield to the lowest entropy in [11] and [14], respectively. Note that triplet-a RDP is the same as HEDI-CM2 except for the change in sign. It should be noted that the RDP which is a lossy scheme in [11], can losslessly reconstruct the original image if the proposed rounding operations are used. In addition, the RT enables all of these schemes to be implemented in parallel at both the transmitting and receiving ends. Methods RT Dimension Basic block size RT matrix S-Tr. 2-D HEDI-CM2 1-D 2 2 Triplet-A RDP 1-D Selected RT 2-D 4 4 a 1 2 a 1 2 a a Inverse matrix a 1 2 a 1 a 1 2 a 1 a 2 a 1 a 2 1+ a Table 1. Previous mean based pyramid methods and a selected 2-D RT. The S-Transform is represented by a 2-D RT. HEDI-CM2 and triplet-a RDP are represented by the 1-D RT. Note that the reconstruction processes of the mean based pyramid methods, based on their 4
5 formulations [9-14], have to be calculated successively. These can now be calculated in parallel due to the representation of RT matrix form. IV. Performance and Simulation Results For our computer simulation, we use the 2-D RT with the 4 4 RT matrix (see the bottom of table 1). The same matrix is employed for both Rr 4 4 and Rc 4 4, where a is machine representable. The matrix is designed with a symmetric weighted average filter, taking into account the phase linearity for the reduced resolution images. The differentiators take the difference between two adjacent pixels since their correlation is generally the highest. In order to find the optimal a, we consider the output variance (sum of the diagonal elements of the transformed auto-covariance matrix), since the entropy often increases with the output variance [16]. We assume that an input vector is a 1-D first order Markov process with a correlation coefficient ρ. Differentiating the output variance with respect to a and setting the result to zero yields an optimal coefficient a opt = 1 2( 2 ρ ). Note that if ρ 1, then Similarly, the output variance of the S-Transform (in this case, S-Transform a opt matrix is expanded to size 4 4) can be obtained. Fig. 2 shows the difference between two output variances : subtraction of the output variance of the S-Transform from that of the proposed optimal RT matrix. From this figure, one can see that the proposed RT matrix produce a smaller variance than the S-Transform when ρ is larger than Variances ρ 5
6 Fig. 2. Difference between two output variances : subtraction of the output variance (sum of the diagonal elements of the transformed auto-covariance matrix) of the S-Transform from that of the proposed optimal RT matrix. The proposed RT matrix produces a smaller output variance than the S-Transform when ρ Two sets of images are used (see table 2). The first seven images are well-known, of which two are Lena images : Lena-g (green component) and Lena-y (luminance). The others are medical images : "MAMMOGRAM", cardiac "ANGIOGRAM", chest "X-RAY", and head "M.R.I." All the test images are 8-bit except for first two images which are of size The proposed RT is compared in terms of the total lossless first order entropy with the three mean based pyramid structured coding schemes, the six-level S+P Transform predictor A [12] (or RTS-Transform [13]), and the lossless JPEG third-order predictors #4 and #7 [1,2]. These entropies are shown in Table. 2. Three values are selected for parameter a of the RT matrix. However, it has been observed, by varying a, that the entropy curve is quite flat near the minimum when 1 6 a 1 2. Hence, parameter tuning is not very important in this region. The simulation results indicate that our proposed scheme is generally more effective than HEDI, RDP, and S-Transform. Its performance is very close to that of lossless JPEG, but is inferior to S+P Transform for the majority of the test images. Pyramid Non-Pyramid Non - Overlapping Overlapping - Successive Parallel Successive - RDP S-Tr. R T S+P Tr. (A) JPEG Test Images Original Entropy HEDI- CM2 a=1/4 a=5/16 a=3/8 RTS-Tr. # 4 # 7 Camera Couple Peppers Lena-g Lena-y Baboon Airplane MAMM ANGIO X-RAY MRI
7 mean Table 2. Comparative evaluation of the total lossless first order entropy (bpp) obtained with the proposed RT matrix (a=1/4, 5/16 and 3/8), the other mean based pyramid methods, the six level S+P Transform predictor A (RTS Tr.), and the lossless JPEG with three-order predictors #4 and #7. V. CONCLUSION An integer to integer transform, called the rounding transform was proposed in this paper. We have showed that the RT is reversible. We have applied the RT to the weighted average based lossless pyramid structured coding with various elementary block sizes and various filters. The RT generalizes the previous mean based lossless pyramid structured coding schemes, including the RDP. We also showed that the proposed RT is effective for lossless pyramid structured coding. Acknowledgment. The authors would like to thank the reviewers for their helpful comments and suggestions. REFERENCES [1] G. K. Wallace, "The JPEG Still Picture Compression Standard," Communications of the ACM, vol. 34(4), pp.30-44, April [2] W. B. Pennebaker and J. L. Mitchell, JPEG Still Image Data Compression Standard, Van Nostrand Reinhold, N.Y, USA, [3] K.H. Tzou,"Progressive Image Transmission: A Review and Comparison of Technique," Optical engineering, vol. 26, no. 7, pp , July [4] K.R. Sloan Jr. and S.L. Tanimoto, "Progressive Refinement of Raster Images," IEEE Trans. Computers, vol. C-28, no.11, pp , November
8 [5] P. Roos, M.A. Viergevier, M.C.A. Vandijke, and J.H. Peters, "Reversible Intraframe Compression of Medical Images," IEEE Trans. Medical Imaging, vol. 7, no. 4, pp , December [6] D. Houlding and J. Valsey, "Low Entropy Image Pyramids for Efficient Lossless Coding," IEEE Trans. Image Processing, vol.4, no.8, pp , August [7] B. Aiazzi, L. Alparone, and S. Baronti, "A Reduced Laplacian Pyramid for Lossless and Progressive Image Communication," IEEE Trans. Communications, vol. 44, no. 1, pp.18-22, January [8] Lux, A. " A Novel Set of Closed Orthogonal Functions for Picture Coding," Arch. Elek. Ubertragung " vol. 31, pp , [9] I.A. Shah, O. A.-Assani, and B. Johnson, "A Chip Set for Lossless Image Compression," IEEE Journal of Solid-State Circuits, vol. 26, no. 3, pp , March [10] H. Blume and A. Fand, "Reversible and Irreversible Image Data Compression Using the S- Transform and Lempel-Ziv coding," in Proc. SPIE Medical Imaging III: Image Capture and Display, vol. 1091, 1989, pp [11] W.Y. Kim, P.T. Balsara, D.T. Harper III, and J.W. Park, "Hierarchy Embedded Differential Images for Progressive Transmission Using Lossless Compression," IEEE Trans. Circuits and Systems for Video Technology, vol. 5, no. 1, pp. 1-13, February [12] A. Said and W.A. Pearlman, "An Image Multiresolution Representation for Lossless and Lossy Compression," IEEE Trans. Image Processing, vol. 5, no. 9, pp , September [13] A. Zandi, J. Allen, E. Schwartz, and M. Boliek, "CREW : Compression with Reversible Embedded Wavelets," IEEE Data Compression Conference, Snowbird, Utah USA, pp , March [14] L. Wang and M. Goldberg, "Reduced-Difference Pyramid: A Data Structure for Progressive Image Transmission," Optical Engineering, vol. 28, no. 7, pp , July [15] G. H. Golub and C. F. Van Loan, Matrix Computations, The Johns Hopkins University Press, Maryland USA, [16] A. Papoulis, Probability, Random Variables, and Stochastic Processes (second edition), McGraw- Hill Book Company, NY USA,
9 APPENDIX A Given an N matrix RN = ( rij) satisfying the following RT matrix conditions : N R N is an non-singular matrix where r j= 1 1 j for i N = 1, r ij = j= 1 0 for i = 2,..., N, and r ij Z = 2,..., N and j = 1,..., N, it immediately follows that the first column of the inverse matrix is the unit column vector. Rewrite R N and R N as : R N H = 1 H ( N 1) ( 1 ) R = V V N N N N ( ) (A-1) Since R R N N H = ( VN VN ) I N 1 1 ( 1) = H (A-2) ( N 1) where I N is the identity matrix, V N 1 must be the unit column vector since there is a unique solution to R N and the first row of R N sums to 1 while all other rows sum to 0. We prove the reversibility of the RT using the definition of the RT X = R R X N 1 N N N 1 = ( ) H1 X N 1 V V N 1 N ( N ) ( ) H = V H X + V H X = V H X + I V H X = V H X + X V X ( N 1) N 1 N 1 1 N 1 N ( N ) ( N 1) N 1 N 1 1 N 1 N N 1 1 N 1 N 1 1 N 1 N 1 H X = X N 1 1 N 1 N 1 (A-3) 9
10 Due to the finite precision arithmetic [15], the first row of the RT matrix should be machine k representable (i.e., c k 2 where c k { 0 1}, and k Z ) so that the summation to 1 condition is not violated. In addition, as R = adj( R ) det( R ), the determinant should be of the form 2 k where k Z. N N N 10
Fast Progressive Wavelet Coding
PRESENTED AT THE IEEE DCC 99 CONFERENCE SNOWBIRD, UTAH, MARCH/APRIL 1999 Fast Progressive Wavelet Coding Henrique S. Malvar Microsoft Research One Microsoft Way, Redmond, WA 98052 E-mail: malvar@microsoft.com
More informationProgressive Wavelet Coding of Images
Progressive Wavelet Coding of Images Henrique Malvar May 1999 Technical Report MSR-TR-99-26 Microsoft Research Microsoft Corporation One Microsoft Way Redmond, WA 98052 1999 IEEE. Published in the IEEE
More information+ (50% contribution by each member)
Image Coding using EZW and QM coder ECE 533 Project Report Ahuja, Alok + Singh, Aarti + + (50% contribution by each member) Abstract This project involves Matlab implementation of the Embedded Zerotree
More information- An Image Coding Algorithm
- An Image Coding Algorithm Shufang Wu http://www.sfu.ca/~vswu vswu@cs.sfu.ca Friday, June 14, 2002 22-1 Agenda Overview Discrete Wavelet Transform Zerotree Coding of Wavelet Coefficients Successive-Approximation
More informationImage Compression - JPEG
Overview of JPEG CpSc 86: Multimedia Systems and Applications Image Compression - JPEG What is JPEG? "Joint Photographic Expert Group". Voted as international standard in 99. Works with colour and greyscale
More informationECE533 Digital Image Processing. Embedded Zerotree Wavelet Image Codec
University of Wisconsin Madison Electrical Computer Engineering ECE533 Digital Image Processing Embedded Zerotree Wavelet Image Codec Team members Hongyu Sun Yi Zhang December 12, 2003 Table of Contents
More informationMultimedia Networking ECE 599
Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on lectures from B. Lee, B. Girod, and A. Mukherjee 1 Outline Digital Signal Representation
More informationSIGNAL COMPRESSION. 8. Lossy image compression: Principle of embedding
SIGNAL COMPRESSION 8. Lossy image compression: Principle of embedding 8.1 Lossy compression 8.2 Embedded Zerotree Coder 161 8.1 Lossy compression - many degrees of freedom and many viewpoints The fundamental
More informationEmbedded Lossless Wavelet-Based Image Coder Based on Successive Partition and Hybrid Bit Scanning
IEICE TRANS. FUNDAMENTALS, VOL.E84 A, NO.8 AUGUST 2001 1863 PAPER Special Section on Digital Signal Processing Embedded Lossless Wavelet-Based Image Coder Based on Successive Partition and Hybrid Bit Scanning
More informationModule 4. Multi-Resolution Analysis. Version 2 ECE IIT, Kharagpur
Module 4 Multi-Resolution Analysis Lesson Multi-resolution Analysis: Discrete avelet Transforms Instructional Objectives At the end of this lesson, the students should be able to:. Define Discrete avelet
More informationCan the sample being transmitted be used to refine its own PDF estimate?
Can the sample being transmitted be used to refine its own PDF estimate? Dinei A. Florêncio and Patrice Simard Microsoft Research One Microsoft Way, Redmond, WA 98052 {dinei, patrice}@microsoft.com Abstract
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 informationBasic Principles of Video Coding
Basic Principles of Video Coding Introduction Categories of Video Coding Schemes Information Theory Overview of Video Coding Techniques Predictive coding Transform coding Quantization Entropy coding Motion
More informationIMAGE COMPRESSION-II. Week IX. 03/6/2003 Image Compression-II 1
IMAGE COMPRESSION-II Week IX 3/6/23 Image Compression-II 1 IMAGE COMPRESSION Data redundancy Self-information and Entropy Error-free and lossy compression Huffman coding Predictive coding Transform coding
More informationL. Yaroslavsky. Fundamentals of Digital Image Processing. Course
L. Yaroslavsky. Fundamentals of Digital Image Processing. Course 0555.330 Lec. 6. Principles of image coding The term image coding or image compression refers to processing image digital data aimed at
More informationGeneralized S Transform
Generalized S Transform Michael D Adams, Member, IEEE, Faouzi ossentini, Senior Member, IEEE, and Rabab Ward, Fellow, IEEE Dept of Elec and Comp Engineering, University of British Columbia, Vancouver,
More informationA COMPARATIVE STUDY OF -DISTORTION LIMITED IMAGE COMPRESSION ALGORITHMS. Hannes Hartenstein, Ralf Herz and Dietmar Saupe
c c A COMPARATIVE STUDY OF -DISTORTION LIMITED IMAGE COMPRESSION ALGORITHMS Hannes Hartenstein, Ralf Herz and Dietmar Saupe Institut für Informatik, Universität Freiburg, Am Flughafen 17, 79110 Freiburg,
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 5 Other Coding Techniques Instructional Objectives At the end of this lesson, the students should be able to:. Convert a gray-scale image into bit-plane
More informationEfficient Alphabet Partitioning Algorithms for Low-complexity Entropy Coding
Efficient Alphabet Partitioning Algorithms for Low-complexity Entropy Coding Amir Said (said@ieee.org) Hewlett Packard Labs, Palo Alto, CA, USA Abstract We analyze the technique for reducing the complexity
More informationLifting Parameterisation of the 9/7 Wavelet Filter Bank and its Application in Lossless Image Compression
Lifting Parameterisation of the 9/7 Wavelet Filter Bank and its Application in Lossless Image Compression TILO STRUTZ Deutsche Telekom AG, Hochschule für Telekommunikation Institute of Communications Engineering
More informationInformation and Entropy
Information and Entropy Shannon s Separation Principle Source Coding Principles Entropy Variable Length Codes Huffman Codes Joint Sources Arithmetic Codes Adaptive Codes Thomas Wiegand: Digital Image Communication
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 informationA WAVELET BASED CODING SCHEME VIA ATOMIC APPROXIMATION AND ADAPTIVE SAMPLING OF THE LOWEST FREQUENCY BAND
A WAVELET BASED CODING SCHEME VIA ATOMIC APPROXIMATION AND ADAPTIVE SAMPLING OF THE LOWEST FREQUENCY BAND V. Bruni, D. Vitulano Istituto per le Applicazioni del Calcolo M. Picone, C. N. R. Viale del Policlinico
More informationHalf-Pel Accurate Motion-Compensated Orthogonal Video Transforms
Flierl and Girod: Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms, IEEE DCC, Mar. 007. Half-Pel Accurate Motion-Compensated Orthogonal Video Transforms Markus Flierl and Bernd Girod Max
More informationRun-length & Entropy Coding. Redundancy Removal. Sampling. Quantization. Perform inverse operations at the receiver EEE
General e Image Coder Structure Motion Video x(s 1,s 2,t) or x(s 1,s 2 ) Natural Image Sampling A form of data compression; usually lossless, but can be lossy Redundancy Removal Lossless compression: predictive
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 informationIntroduction p. 1 Compression Techniques p. 3 Lossless Compression p. 4 Lossy Compression p. 5 Measures of Performance p. 5 Modeling and Coding p.
Preface p. xvii Introduction p. 1 Compression Techniques p. 3 Lossless Compression p. 4 Lossy Compression p. 5 Measures of Performance p. 5 Modeling and Coding p. 6 Summary p. 10 Projects and Problems
More informationState of the art Image Compression Techniques
Chapter 4 State of the art Image Compression Techniques In this thesis we focus mainly on the adaption of state of the art wavelet based image compression techniques to programmable hardware. Thus, an
More informationJPEG Standard Uniform Quantization Error Modeling with Applications to Sequential and Progressive Operation Modes
JPEG Standard Uniform Quantization Error Modeling with Applications to Sequential and Progressive Operation Modes Julià Minguillón Jaume Pujol Combinatorics and Digital Communications Group Computer Science
More informationEntropy Encoding Using Karhunen-Loève Transform
Entropy Encoding Using Karhunen-Loève Transform Myung-Sin Song Southern Illinois University Edwardsville Sept 17, 2007 Joint work with Palle Jorgensen. Introduction In most images their neighboring pixels
More informationScalable color image coding with Matching Pursuit
SCHOOL OF ENGINEERING - STI SIGNAL PROCESSING INSTITUTE Rosa M. Figueras i Ventura CH-115 LAUSANNE Telephone: +4121 6935646 Telefax: +4121 69376 e-mail: rosa.figueras@epfl.ch ÉCOLE POLYTECHNIQUE FÉDÉRALE
More informationStatistical Models for Images: Compression, Restoration and Synthesis
Presented at: st Asilomar Conference on Signals Systems, and Computers Pacific Grove, CA. November -5, 997. Pages 67-678. c IEEE Computer Society, Los Alamitos, CA. Statistical Models for Images: Compression,
More information4x4 Transform and Quantization in H.264/AVC
Video compression design, analysis, consulting and research White Paper: 4x4 Transform and Quantization in H.264/AVC Iain Richardson / VCodex Limited Version 1.2 Revised November 2010 H.264 Transform and
More informationImage Compression. 1. Introduction. Greg Ames Dec 07, 2002
Image Compression Greg Ames Dec 07, 2002 Abstract Digital images require large amounts of memory to store and, when retrieved from the internet, can take a considerable amount of time to download. The
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 informationData Mining and Analysis: Fundamental Concepts and Algorithms
: Fundamental Concepts and Algorithms dataminingbook.info Mohammed J. Zaki 1 Wagner Meira Jr. 2 1 Department of Computer Science Rensselaer Polytechnic Institute, Troy, NY, USA 2 Department of Computer
More informationImage Compression. Qiaoyong Zhong. November 19, CAS-MPG Partner Institute for Computational Biology (PICB)
Image Compression Qiaoyong Zhong CAS-MPG Partner Institute for Computational Biology (PICB) November 19, 2012 1 / 53 Image Compression The art and science of reducing the amount of data required to represent
More informationencoding without prediction) (Server) Quantization: Initial Data 0, 1, 2, Quantized Data 0, 1, 2, 3, 4, 8, 16, 32, 64, 128, 256
General Models for Compression / Decompression -they apply to symbols data, text, and to image but not video 1. Simplest model (Lossless ( encoding without prediction) (server) Signal Encode Transmit (client)
More informationSource Coding for Compression
Source Coding for Compression Types of data compression: 1. Lossless -. Lossy removes redundancies (reversible) removes less important information (irreversible) Lec 16b.6-1 M1 Lossless Entropy Coding,
More informationLecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments
Lecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP9519 Multimedia Systems S2 2006 jzhang@cse.unsw.edu.au
More informationRate-Distortion Based Temporal Filtering for. Video Compression. Beckman Institute, 405 N. Mathews Ave., Urbana, IL 61801
Rate-Distortion Based Temporal Filtering for Video Compression Onur G. Guleryuz?, Michael T. Orchard y? University of Illinois at Urbana-Champaign Beckman Institute, 45 N. Mathews Ave., Urbana, IL 68 y
More informationMultiscale Image Transforms
Multiscale Image Transforms Goal: Develop filter-based representations to decompose images into component parts, to extract features/structures of interest, and to attenuate noise. Motivation: extract
More informationEFFICIENT IMAGE COMPRESSION ALGORITHMS USING EVOLVED WAVELETS
International Journal of ISSN 0974-2107 Systems and Technologies IJST Vol.4, No.2, pp 127-146 KLEF 2011 EFFICIENT IMAGE COMPRESSION ALGORITHMS USING EVOLVED WAVELETS 1.G.CHENCHU KRISHNAIAH* 2.T.JAYACHANDRAPRASAD
More informationWavelets and Image Compression. Bradley J. Lucier
Wavelets and Image Compression Bradley J. Lucier Abstract. In this paper we present certain results about the compression of images using wavelets. We concentrate on the simplest case of the Haar decomposition
More informationFault Tolerance Technique in Huffman Coding applies to Baseline JPEG
Fault Tolerance Technique in Huffman Coding applies to Baseline JPEG Cung Nguyen and Robert G. Redinbo Department of Electrical and Computer Engineering University of California, Davis, CA email: cunguyen,
More informationA Piggybacking Design Framework for Read-and Download-efficient Distributed Storage Codes
A Piggybacing Design Framewor for Read-and Download-efficient Distributed Storage Codes K V Rashmi, Nihar B Shah, Kannan Ramchandran, Fellow, IEEE Department of Electrical Engineering and Computer Sciences
More informationLecture 2: Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments. Tutorial 1. Acknowledgement and References for lectures 1 to 5
Lecture : Introduction to Audio, Video & Image Coding Techniques (I) -- Fundaments Dr. Jian Zhang Conjoint Associate Professor NICTA & CSE UNSW COMP959 Multimedia Systems S 006 jzhang@cse.unsw.edu.au Acknowledgement
More informationA Video Codec Incorporating Block-Based Multi-Hypothesis Motion-Compensated Prediction
SPIE Conference on Visual Communications and Image Processing, Perth, Australia, June 2000 1 A Video Codec Incorporating Block-Based Multi-Hypothesis Motion-Compensated Prediction Markus Flierl, Thomas
More informationA Note on Projecting the Cubic Lattice
A Note on Projecting the Cubic Lattice N J A Sloane (a), Vinay A Vaishampayan, AT&T Shannon Labs, 180 Park Avenue, Florham Park, NJ 07932-0971, USA and Sueli I R Costa, University of Campinas, Campinas,
More informationChapter 2: Source coding
Chapter 2: meghdadi@ensil.unilim.fr University of Limoges Chapter 2: Entropy of Markov Source Chapter 2: Entropy of Markov Source Markov model for information sources Given the present, the future is independent
More informationEnhanced Stochastic Bit Reshuffling for Fine Granular Scalable Video Coding
Enhanced Stochastic Bit Reshuffling for Fine Granular Scalable Video Coding Wen-Hsiao Peng, Tihao Chiang, Hsueh-Ming Hang, and Chen-Yi Lee National Chiao-Tung University 1001 Ta-Hsueh Rd., HsinChu 30010,
More informationIMAGE COMPRESSION IMAGE COMPRESSION-II. Coding Redundancy (contd.) Data Redundancy. Predictive coding. General Model
IMAGE COMRESSIO IMAGE COMRESSIO-II Data redundancy Self-information and Entropy Error-free and lossy compression Huffman coding redictive coding Transform coding Week IX 3/6/23 Image Compression-II 3/6/23
More informationWaveform-Based Coding: Outline
Waveform-Based Coding: Transform and Predictive Coding Yao Wang Polytechnic University, Brooklyn, NY11201 http://eeweb.poly.edu/~yao Based on: Y. Wang, J. Ostermann, and Y.-Q. Zhang, Video Processing and
More informationReprinted from Proceedings of the Pattern Recognition and Information Processing Conference (pp ), Dallas, TX (1981).
Reprinted from Proceedings of the Pattern Recognition and Information Processing Conference (pp. 18-3), Dallas, TX (1981). IMAGE DATA COMPRESSION WITH THE LAPLACIAN PYRAMID* Edward H. Adelson Psychology
More informationDepartment of Electrical Engineering, Polytechnic University, Brooklyn Fall 05 EL DIGITAL IMAGE PROCESSING (I) Final Exam 1/5/06, 1PM-4PM
Department of Electrical Engineering, Polytechnic University, Brooklyn Fall 05 EL512 --- DIGITAL IMAGE PROCESSING (I) Y. Wang Final Exam 1/5/06, 1PM-4PM Your Name: ID Number: Closed book. One sheet of
More informationCHAPTER 3. Transformed Vector Quantization with Orthogonal Polynomials Introduction Vector quantization
3.1. Introduction CHAPTER 3 Transformed Vector Quantization with Orthogonal Polynomials In the previous chapter, a new integer image coding technique based on orthogonal polynomials for monochrome images
More informationRate-Constrained Multihypothesis Prediction for Motion-Compensated Video Compression
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 12, NO 11, NOVEMBER 2002 957 Rate-Constrained Multihypothesis Prediction for Motion-Compensated Video Compression Markus Flierl, Student
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 informationLaboratory 1 Discrete Cosine Transform and Karhunen-Loeve Transform
Laboratory Discrete Cosine Transform and Karhunen-Loeve Transform Miaohui Wang, ID 55006952 Electronic Engineering, CUHK, Shatin, HK Oct. 26, 202 Objective, To investigate the usage of transform in visual
More informationImage Data Compression
Image Data Compression Image data compression is important for - image archiving e.g. satellite data - image transmission e.g. web data - multimedia applications e.g. desk-top editing Image data compression
More informationAn Investigation of 3D Dual-Tree Wavelet Transform for Video Coding
MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com An Investigation of 3D Dual-Tree Wavelet Transform for Video Coding Beibei Wang, Yao Wang, Ivan Selesnick and Anthony Vetro TR2004-132 December
More informationMRI Reconstruction via Fourier Frames on Interleaving Spirals
MRI Reconstruction via Fourier Frames on Interleaving Spirals Christiana Sabett Applied Mathematics & Statistics, and Scientific Computing (AMSC) University of Maryland, College Park Advisors: John Benedetto,
More informationCHAPTER 4 PRINCIPAL COMPONENT ANALYSIS-BASED FUSION
59 CHAPTER 4 PRINCIPAL COMPONENT ANALYSIS-BASED FUSION 4. INTRODUCTION Weighted average-based fusion algorithms are one of the widely used fusion methods for multi-sensor data integration. These methods
More informationLossless Image and Intra-frame Compression with Integer-to-Integer DST
1 Lossless Image and Intra-frame Compression with Integer-to-Integer DST Fatih Kamisli, Member, IEEE arxiv:1708.07154v1 [cs.mm] 3 Aug 017 Abstract Video coding standards are primarily designed for efficient
More informationEdge Adaptive Prediction for Lossless Image Coding
Edge Adaptive Prediction for Lossless Image Coding Wee Sun Lee Department of Computer Science School of Computing National University of Singapore Singapore 119260 Republic of Singapore Abstract We design
More informationSignal Recovery from Permuted Observations
EE381V Course Project Signal Recovery from Permuted Observations 1 Problem Shanshan Wu (sw33323) May 8th, 2015 We start with the following problem: let s R n be an unknown n-dimensional real-valued signal,
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 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 informationGAUSSIAN PROCESS TRANSFORMS
GAUSSIAN PROCESS TRANSFORMS Philip A. Chou Ricardo L. de Queiroz Microsoft Research, Redmond, WA, USA pachou@microsoft.com) Computer Science Department, Universidade de Brasilia, Brasilia, Brazil queiroz@ieee.org)
More informationDirect Conversions Between DV Format DCT and Ordinary DCT
Direct Conversions Between DV Format DCT Ordinary DCT Neri Merhav HP Laboratories Israel* HPL-9-4 August, 99 digital recording, DVC format, - DCT, 2-4- DCT A fast algorithm is developed for direct conversions
More informationOverview. Analog capturing device (camera, microphone) PCM encoded or raw signal ( wav, bmp, ) A/D CONVERTER. Compressed bit stream (mp3, jpg, )
Overview Analog capturing device (camera, microphone) Sampling Fine Quantization A/D CONVERTER PCM encoded or raw signal ( wav, bmp, ) Transform Quantizer VLC encoding Compressed bit stream (mp3, jpg,
More informationR[p ], Rip]. Axiomatic Quantification of Image Resolution. Xiao-ming Ma Center of Environment Science Peking University Beijing , China.
Axiomatic Quantification of Image Resolution Ming Jiang* School of Mathematics Peking University Beijing 0087, China. Ge Wang Department of Radiology University of Iowa Iowa City, IA 52242, USA ovember,
More informationComparison of Selected Fast Orthogonal Parametric Transforms in Data Encryption
JOURNAL OF APPLIED COMPUTER SCIENCE Vol. 23 No. 2 (2015), pp. 55-68 Comparison of Selected Fast Orthogonal Parametric Transforms in Data Encryption Dariusz Puchala Lodz University of Technology Institute
More informationMaximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary. Spatial Correlation
Maximum Achievable Diversity for MIMO-OFDM Systems with Arbitrary Spatial Correlation Ahmed K Sadek, Weifeng Su, and K J Ray Liu Department of Electrical and Computer Engineering, and Institute for Systems
More informationSYDE 575: Introduction to Image Processing. Image Compression Part 2: Variable-rate compression
SYDE 575: Introduction to Image Processing Image Compression Part 2: Variable-rate compression Variable-rate Compression: Transform-based compression As mentioned earlier, we wish to transform image data
More informationWavelets and Multiresolution Processing
Wavelets and Multiresolution Processing Wavelets Fourier transform has it basis functions in sinusoids Wavelets based on small waves of varying frequency and limited duration In addition to frequency,
More informationThe Karhunen-Loeve, Discrete Cosine, and Related Transforms Obtained via the Hadamard Transform
The Karhunen-Loeve, Discrete Cosine, and Related Transforms Obtained via the Hadamard Transform Item Type text; Proceedings Authors Jones, H. W.; Hein, D. N.; Knauer, S. C. Publisher International Foundation
More informationECE472/572 - Lecture 11. Roadmap. Roadmap. Image Compression Fundamentals and Lossless Compression Techniques 11/03/11.
ECE47/57 - Lecture Image Compression Fundamentals and Lossless Compression Techniques /03/ Roadmap Preprocessing low level Image Enhancement Image Restoration Image Segmentation Image Acquisition Image
More informationANALYSIS OF A PARTIAL DECORRELATOR IN A MULTI-CELL DS/CDMA SYSTEM
ANAYSIS OF A PARTIA DECORREATOR IN A MUTI-CE DS/CDMA SYSTEM Mohammad Saquib ECE Department, SU Baton Rouge, A 70803-590 e-mail: saquib@winlab.rutgers.edu Roy Yates WINAB, Rutgers University Piscataway
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationImage Filtering. Slides, adapted from. Steve Seitz and Rick Szeliski, U.Washington
Image Filtering Slides, adapted from Steve Seitz and Rick Szeliski, U.Washington The power of blur All is Vanity by Charles Allen Gillbert (1873-1929) Harmon LD & JuleszB (1973) The recognition of faces.
More informationProyecto final de carrera
UPC-ETSETB Proyecto final de carrera A comparison of scalar and vector quantization of wavelet decomposed images Author : Albane Delos Adviser: Luis Torres 2 P a g e Table of contents Table of figures...
More informationPre-sessional Mathematics for Big Data MSc Class 2: Linear Algebra
Pre-sessional Mathematics for Big Data MSc Class 2: Linear Algebra Yuri Kalnishkan September 22, 2018 Linear algebra is vitally important for applied mathematics We will approach linear algebra from a
More informationComputation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems
Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Department of Electrical Engineering, College of Engineering, Basrah University Basrah Iraq,
More informationImage and Multidimensional Signal Processing
Image and Multidimensional Signal Processing Professor William Hoff Dept of Electrical Engineering &Computer Science http://inside.mines.edu/~whoff/ Image Compression 2 Image Compression Goal: Reduce amount
More information<Outline> JPEG 2000 Standard - Overview. Modes of current JPEG. JPEG Part I. JPEG 2000 Standard
JPEG 000 tandard - Overview Ping-ing Tsai, Ph.D. JPEG000 Background & Overview Part I JPEG000 oding ulti-omponent Transform Bit Plane oding (BP) Binary Arithmetic oding (BA) Bit-Rate ontrol odes
More informationLATTICE VECTOR QUANTIZATION FOR IMAGE CODING USING EXPANSION OF CODEBOOK
LATTICE VECTOR QUANTIZATION FOR IMAGE CODING USING EXPANSION OF CODEBOOK R. R. Khandelwal 1, P. K. Purohit 2 and S. K. Shriwastava 3 1 Shri Ramdeobaba College Of Engineering and Management, Nagpur richareema@rediffmail.com
More informationarxiv: v1 [cs.mm] 2 Feb 2017 Abstract
DCT-like Transform for Image Compression Requires 14 Additions Only F. M. Bayer R. J. Cintra arxiv:1702.00817v1 [cs.mm] 2 Feb 2017 Abstract A low-complexity 8-point orthogonal approximate DCT is introduced.
More informationA Lossless Image Coder With Context Classification, Adaptive Prediction and Adaptive Entropy Coding
A Lossless Image Coder With Context Classification, Adaptive Prediction and Adaptive Entropy Coding Author Golchin, Farshid, Paliwal, Kuldip Published 1998 Conference Title Proc. IEEE Conf. Acoustics,
More informationPredictive Coding. Lossy or lossless. Feedforward or feedback. Intraframe or interframe. Fixed or Adaptive
Predictie Coding Predictie coding is a compression tecnique based on te difference between te original and predicted alues. It is also called DPCM Differential Pulse Code Modulation Lossy or lossless Feedforward
More informationWavelet Packet Based Digital Image Watermarking
Wavelet Packet Based Digital Image ing A.Adhipathi Reddy, B.N.Chatterji Department of Electronics and Electrical Communication Engg. Indian Institute of Technology, Kharagpur 72 32 {aar, bnc}@ece.iitkgp.ernet.in
More informationDigital Image Processing
Digital Image Processing, 2nd ed. Digital Image Processing Chapter 7 Wavelets and Multiresolution Processing Dr. Kai Shuang Department of Electronic Engineering China University of Petroleum shuangkai@cup.edu.cn
More informationJPEG and JPEG2000 Image Coding Standards
JPEG and JPEG2000 Image Coding Standards Yu Hen Hu Outline Transform-based Image and Video Coding Linear Transformation DCT Quantization Scalar Quantization Vector Quantization Entropy Coding Discrete
More informationA Variation on SVD Based Image Compression
A Variation on SVD Based Image Compression Abhiram Ranade Srikanth S. M. Satyen Kale Department of Computer Science and Engineering Indian Institute of Technology Powai, Mumbai 400076 ranade@cse.iitb.ac.in,
More informationECE 634: Digital Video Systems Wavelets: 2/21/17
ECE 634: Digital Video Systems Wavelets: 2/21/17 Professor Amy Reibman MSEE 356 reibman@purdue.edu hjp://engineering.purdue.edu/~reibman/ece634/index.html A short break to discuss wavelets Wavelet compression
More informationRLE = [ ; ], with compression ratio (CR) = 4/8. RLE actually increases the size of the compressed image.
MP/BME 574 Application Solutions. (2 pts) a) From first principles in class, we expect the entropy of the checkerboard image to be since this is the bit depth of the image and the frequency of each value
More informationAutumn Coping with NP-completeness (Conclusion) Introduction to Data Compression
Autumn Coping with NP-completeness (Conclusion) Introduction to Data Compression Kirkpatrick (984) Analogy from thermodynamics. The best crystals are found by annealing. First heat up the material to let
More informationELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications
ELE539A: Optimization of Communication Systems Lecture 15: Semidefinite Programming, Detection and Estimation Applications Professor M. Chiang Electrical Engineering Department, Princeton University March
More informationINTEGER WAVELET TRANSFORM BASED LOSSLESS AUDIO COMPRESSION
INTEGER WAVELET TRANSFORM BASED LOSSLESS AUDIO COMPRESSION Ciprian Doru Giurcăneanu, Ioan Tăbuş and Jaakko Astola Signal Processing Laboratory, Tampere University of Technology P.O. Box 553, FIN-33101
More informationTitle. Author(s)Lee, Kenneth K. C.; Chan, Y. K. Issue Date Doc URL. Type. Note. File Information
Title Efficient Color Image Compression with Category-Base Author(s)Lee, Kenneth K. C.; Chan, Y. K. Proceedings : APSIPA ASC 2009 : Asia-Pacific Signal Citationand Conference: 747-754 Issue Date 2009-10-04
More information