rent-now

Rent More, Save More! Use code: ECRENTAL

5% off 1 book, 7% off 2 books, 10% off 3+ books

9780521899826

Digital Signal Compression: Principles and Practice

by
  • ISBN13:

    9780521899826

  • ISBN10:

    0521899826

  • Format: Hardcover
  • Copyright: 2011-12-30
  • Publisher: Cambridge University Press

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

Purchase Benefits

  • Free Shipping Icon Free Shipping On Orders Over $35!
    Your order must be $35 or more to qualify for free economy shipping. Bulk sales, PO's, Marketplace items, eBooks and apparel do not qualify for this offer.
  • eCampus.com Logo Get Rewarded for Ordering Your Textbooks! Enroll Now
List Price: $108.00 Save up to $31.05
  • Rent Book $76.95
    Add to Cart Free Shipping Icon Free Shipping

    TERM
    PRICE
    DUE
    SPECIAL ORDER: 1-2 WEEKS
    *This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.

How To: Textbook Rental

Looking to rent a book? Rent Digital Signal Compression: Principles and Practice [ISBN: 9780521899826] for the semester, quarter, and short term or search our site for other textbooks by William A. Pearlman , Amir Said. Renting a textbook can save you up to 90% from the cost of buying.

Summary

With clear and easy-to-understand explanations, this book covers the fundamental concepts and coding methods of signal compression, whilst still retaining technical depth and rigor. It contains a wealth of illustrations, step-by-step descriptions of algorithms, examples and practice problems, which make it an ideal textbook for senior undergraduate and graduate students, as well as a useful self-study tool for researchers and professionals. Principles of lossless compression are covered, as are various entropy coding techniques, including Huffman coding, arithmetic coding and Lempel-Ziv coding. Scalar and vector quantization and trellis coding are thoroughly explained, and a full chapter is devoted to mathematical transformations including the KLT, DCT and wavelet transforms. The workings of transform and subband/wavelet coding systems, including JPEG2000 and SBHP image compression and H.264/AVC video compression, are explained and a unique chapter is provided on set partition coding, shedding new light on SPIHT, SPECK, EZW and related methods.

Author Biography

William A. Pearlman is a Professor Emeritus in the Electrical, Computer, and Systems Engineering Department at the Rensselear Polytechnic Institute (RPI), where he has been a faculty member since 1979. He has more than 35 years of experience in teaching and researching in the fields of information theory, data compression, digital signal processing, and digital communications theory, and he has written about 250 published works on these fields. He is a Fellow of the IEEE and the SPIE, and he is the co-inventor of two celebrated image compression algorithms: SPIHT and SPECK. Amir Said is currently a Master Researcher at Hewlett-Packard Laboratories, where he has worked since 1998. His research interests include multimedia communications, coding and information theory, image and video compression, signal processing, and optimization, and he has more than 100 publications and 20 patents in these fields. He is co-inventor, also with Dr. Pearlman of the SPIHT image compression algorithm, and co-recipient, also with Dr. Pearlman, of two Best Paper Awards, one from the IEEE Circuits and Systems Society and the other from the IEEE Signal Processing Society.

Table of Contents

Prefacep. xv
Acknowledgmentsp. xix
Motivationp. 1
The importance of compressionp. 1
Data typesp. 2
Symbolic informationp. 2
Numerical informationp. 3
Basic compression processp. 4
Compression applicationsp. 5
Design of compression methodsp. 6
Multi-disciplinary aspectp. 8
Notep. 8
Referencesp. 9
Book overviewp. 10
Entropy and lossless codingp. 10
Quantizationp. 11
Source transformationsp. 12
Predictionp. 12
Transformsp. 13
Set partition codingp. 16
Coding systemsp. 17
Performance criteriap. 17
Transform coding systemsp. 18
Subband coding systemsp. 19
Distributed source codingp. 20
Notesp. 21
Referencesp. 22
Principles of lossless compressionp. 23
Introductionp. 23
Lossless source coding and entropyp. 23
Variable length codesp. 28
Unique decidability and prefix-free codesp. 28
Construction of prefix-free codesp. 28
Kraft inequalityp. 30
Optimality of prefix-free codesp. 32
Sources with memoryp. 36
Concluding remarksp. 37
Problemsp. 37
Referencesp. 40
Entropy coding techniquesp. 41
Introductionp. 41
Huffman codesp. 41
Shannon-Fano-Elias codesp. 47
SFE code examplesp. 48
Decoding the SFE codep. 49
Arithmetic codep. 50
Preliminariesp. 50
Arithmetic encodingp. 51
Arithmetic decodingp. 53
Run-length codesp. 55
Alphabet partitioning: modified Huffman codesp. 57
Modified Huffman codesp. 57
Alphabet partitioningp. 58
Golomb codep. 60
Dictionary codingp. 53
The LZ78 codep. 64
The LZW algorithmp. 65
The LZ77 coding methodp. 67
Summary remarksp. 72
Problemsp. 72
Notesp. 75
Referencesp. 76
Lossy compression of scalar sourcesp. 77
Introductionp. 77
Quantizationp. 77
Scalar quantizationp. 77
Uniform quantizationp. 81
Non-uniform quantizationp. 87
High rate approximationsp. 89
Compandingp. 91
Distortion at high ratesp. 93
Entropy coding of quantizer outputsp. 95
Entropy coded quantizer characteristicsp. 98
Null-zone quantizationp. 99
Bounds on optimal performancep. 101
Rate-distortion theoryp. 102
The Gish-Pierce boundp. 104
Concluding remarksp. 107
Appendix: quantization tablesp. 107
Problemsp. 109
Notep. 113
Referencesp. 114
Coding of sources with memoryp. 116
Introductionp. 116
Predictive codingp. 116
Optimal linear predictionp. 117
DPCM system descriptionp. 120
DPCM coding error and gainp. 121
Vector codingp. 122
Optimal performance boundsp. 122
Vector (block) quantization (VQ)p. 129
Entropy constrained vector quantizationp. 135
Tree-structured vector quantizationp. 141
Variable length TSVQ codingp. 144
Pruned TSVQp. 145
Tree and trellis codesp. 146
Trellis codesp. 148
Encoding and decoding of trellis codesp. 150
Codevector alphabetsp. 152
Trellis coded quantization (TCQ)p. 152
Entropy-coded TCQp. 154
Improving low-rate performance in TCQp. 155
Search algorithmsp. 155
M-algorithmp. 155
The Viterbi algorithmp. 158
Concluding remarksp. 160
Problemsp. 160
Notesp. 163
Referencesp. 164
Mathematical transformationsp. 166
Introductionp. 166
Transform coding gainp. 169
The optimal Karhunen-Loeve transformp. 171
Optimal transform coding gainp. 172
Suboptimal transformsp. 172
The discrete Fourier transformp. 172
The discrete cosine transformp. 173
The Hadamard-Walsh transformp. 174
Lapped orthogonal transformp. 175
Example of calculation of transform coding gainp. 178
Transforms via filter banksp. 179
Two-dimensional transforms for imagesp. 181
Subband transformsp. 184
Introductionp. 184
Coding gain of subband transformationp. 187
Realizable perfect reconstruction filtersp. 192
Orthogonal wavelet transformp. 194
Biorthogonal wavelet transformp. 199
Useful biorthogonal filtersp. 204
The lifting schemep. 205
Transforms with integer outputp. 208
Concluding remarksp. 211
Problemsp. 212
Notesp. 214
Referencesp. 216
Rate control in transform coding systemsp. 218
Rate allocationp. 218
Optimal rate allocation for known quantizer characteristicsp. 220
Realizing the optimal rate allocationp. 223
Fixed level quantizationp. 225
Optimal bit allocation for arbitrary set of quantizersp. 226
Building up to optimal rates for arbitrary quantizersp. 228
Transform coding gainp. 230
Subband rate allocationp. 233
Practical issuesp. 237
Subband coding gainp. 239
Algorithms for rate allocation to subbandsp. 241
Conclusionsp. 242
Problemsp. 242
Notesp. 243
Referencesp. 244
Transform coding systemsp. 245
Introductionp. 245
Application of source transformationsp. 245
Model-based image transform codingp. 246
Encoding transform coefficientsp. 249
The JPEG standardp. 251
The JPEG baseline systemp. 252
Detailed example of JPEG standard methodp. 256
Advanced image transform coding: H.264/AVC intra codingp. 259
Concluding remarksp. 262
Problemsp. 262
Notesp. 263
Referencesp. 264
Set partition codingp. 265
Principlesp. 265
Partitioning data according to valuep. 267
Forming partitions recursively: square blocksp. 270
Binary splittingp. 274
One-dimensional signalsp. 276
Tree-structured setsp. 276
A different wavelet transform partitionp. 279
Data-dependent thresholdsp. 282
Adaptive partitionsp. 283
Progressive transmission and bitplane codingp. 285
Applications to image transform codingp. 286
Block partition coding and amplitude and group partitioning (AGP)p. 287
Enhancements via entropy codingp. 289
Traversing the blocksp. 289
Embedded block coding of image wavelet transformsp. 291
A SPECK coding examplep. 291
Embedded tree-based image wavelet transform codingp. 297
A SPIHT coding examplep. 299
Embedded zerotree wavelet (EZW) codingp. 302
Group testing for image wavelet codingp. 306
Conclusionp. 306
Problemsp. 307
Notesp. 310
Referencesp. 311
Subband/wavelet coding systemsp. 313
Wavelet transform coding systems.p. 313
Generic wavelet-based coding systemsp. 317
Compression methods in wavelet-based systemsp. 318
Block-based wavelet transform set partition codingp. 320
Progressive resolution codingp. 321
Quality-progressive codingp. 323
Octave band partitioningp. 326
Direct bit-embedded coding methodsp. 328
Lossless coding of quantizer levels with adaptive thresholdsp. 329
Tree-block codingp. 331
Coding of subband subblocksp. 332
Coding the initial thresholdsp. 333
The SBHP methodp. 335
JPEG2000 codingp. 336
The embedded zero-block coder (EZBC)p. 343
Tree-based wavelet transform coding systemsp. 347
Fully scalable SPIHTp. 347
Resolution scalable SPIHTp. 349
Block-oriented SPIHT codingp. 352
Rate control for embedded block codersp. 354
Conclusionp. 356
Notesp. 357
Referencesp. 359
Methods for lossless compression of imagesp. 361
Introductionp. 361
Lossless predictive codingp. 362
Old JPEG standard for lossless image compressionp. 362
State-of-the-art lossless image coding and JPEG-LSp. 364
The predictorp. 364
The contextp. 365
Golomb-Rice codingp. 366
Bias cancellationp. 366
Run modep. 367
Near-lossless modep. 368
Remarksp. 368
Multi-resolution methodsp. 368
Concluding remarksp. 369
Problemsp. 370
Notesp. 371
Referencesp. 372
Color and multi-component image and video codingp. 373
Introductionp. 373
Color image representationp. 374
Chrominance subsamplingp. 376
Principal component spacep. 377
Color image codingp. 378
Transform coding and JPEGp. 378
Wavelet transform systemsp. 380
Multi-component image codingp. 383
JPEG2000p. 383
Three-dimensional wavelet transform codingp. 384
Video codingp. 389
Concluding remarksp. 395
Notesp. 395
Referencesp. 396
Distributed source codingp. 398
Slepian-Wolf coding for lossless compressionp. 398
Practical Slepian-Wolf codingp. 400
Wyner-Ziv coding for lossy compressionp. 404
Scalar Wyner-Ziv codingp. 406
Probability of successful reconstructionp. 407
Concluding remarksp. 411
Problemsp. 411
Notesp. 412
Referencesp. 413
Indexp. 414
Table of Contents provided by Ingram. All Rights Reserved.

Supplemental Materials

What is included with this book?

The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.

The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.

Rewards Program