COVID-19 Update: We are currently shipping orders daily. However, due to transit disruptions in some geographies, deliveries may be delayed. To provide all customers with timely access to content, we are offering 50% off Science and Technology Print & eBook bundle options. Terms & conditions.
Compression Algorithms for Real Programmers - 1st Edition - ISBN: 9780127887746, 9780080502434

Compression Algorithms for Real Programmers

1st Edition

0.0 star rating Write a review
Author: Peter Wayner
Paperback ISBN: 9780127887746
eBook ISBN: 9780080502434
Imprint: Morgan Kaufmann
Published Date: 11th October 1999
Page Count: 240
Sales tax will be calculated at check-out Price includes VAT/GST
44.95
35.99
58.95
41.26
Unavailable
Price includes VAT/GST

Institutional Subscription

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents

Preface. Book Notes.

  1. Introduction
  2. 1 Grading Compression Algorithms
  3. 2 Philosophical Hurdles
  4. 3 How to Use this Book 2. Statistical Basics
  5. 1 Huffman Encoding
  6. 2 Shannon-Fano Encoding
  7. 3 Entropy and Information Theory
  8. 4 Character Grouping Schemes
  9. 5 Conclusion 3. Dictionary Techniques
  10. 1 Basic Lempel-Ziv-Welch
  11. 2 Simple Windows with LZSS
  12. 3 Coding Notes
  13. 4 Variations
  14. 5 Commercially Available Standards
  15. 6 Conclusions 4. Arithmetic Compression
  16. 1 Three Examples
  17. 2 Programming Arithmetic Coding
  18. 3 Products Using Arithmetic Coding
  19. 4 Conclusion 5. Adaptive Compression
  20. 1 Escape Codes
  21. 2 Adaptive Huffman Coding
  22. 3 Windows of Data
  23. 4 Conclusion 6. Grammar Compression
  24. 1 SEQUITUR
  25. 2 Code Compression
  26. 3 Conclusion 7. Programmatic Solutions
  27. 1 PostScript
  28. 2 Conclusion 8. Quantization
  29. 1 Basic Quantization
  30. 2 Adaptive Quantization
  31. 3 Vector Quantization
  32. 4 Dimension Reduction
  33. 5 Conclusion 9. Wavelet Transforms
  34. 1 Basic Fourier Mathematics
  35. 2 Discrete Cosine Transform
  36. 3 Two-Dimensional Approaches
  37. 4 Other Wavelet Functions
  38. 5 Conclusion 10. JPEG
  39. 1 JPEG Overview
  40. 2 Basic JPEG
  41. 3 JPEG Enhancements
  42. 4 Lossless JPEG
  43. 5 Progressive Transmission
  44. 6 Hierarchical Transmission
  45. 7 Conclusions 11. Video Compression
  46. 1 Pixel Details
  47. 2 Motion Estimation
  48. 3 Quantization and Bit Packaging
  49. 4 MPEG-2
  50. 5 Conclusions 12. Audio Compression
  51. 1 Digitization
  52. 2 Subband Coding
  53. 3 Speech Compression
  54. 4 MPEG and MP3
  55. 5 Conclusion 13. Fractal Compression
  56. 1 Conclusion 14. Steganography
  57. 1 Statistical Coding
  58. 2 JPEG and Jsteg
  59. 3 Quantization
  60. 4 Grammars
  61. 5 Conclusions Appendix A: Patents A.1 Statistical Patents A.2 Dictionary Algorithm Patents A.3 Arithmetic Algorithm Patents A.4 Adaptive Algorithm Patents A.5 Grammar Algorithm Patents A.6 Quantization Algorithm Patents A.7 Image Algorithm Patents A.8 Fractal Algorithm Patents A.9 Other Patents Appendix B: Bibliography Index

Description

In life, time is money, and on the Internet, the size of data is money. Small programs and small files take less disk space and cost less to send over the Internet. Compression Algorithms for Real Programmers describes the basic algorithms and approaches for compressing information so you can create the smallest files possible. These new algorithms are making it possible for people to take impossibly large audio and video files and compress them enough that they can flow over the Internet.

Key Features

  • Examines the classic algorithms like Huffman coding, arithmetic compression, and dictionary-based schemes in depth
  • Describes the basic approaches used to squeeze audio and video signals by factors of as much as 100:1
  • Discusses the philosophy of compression to illustrate the underlying trade-offs in the algorithms
  • Explores the use of wavelets and other modeling techniques that use repetitive functions to squeeze audio and video
  • Shows how programming solutions like Adobe PostScript can save space and make networks more efficient
  • Describes new approaches using fractals and grammars just being explored by the compression community
  • Shows how to extend the algorithms and use them for copyright protection

Readership

programmers, software engineers


Details

No. of pages:
240
Language:
English
Copyright:
© Morgan Kaufmann 2000
Published:
11th October 1999
Imprint:
Morgan Kaufmann
Paperback ISBN:
9780127887746
eBook ISBN:
9780080502434

Ratings and Reviews


About the Author

Peter Wayner

Peter Wayner is a writer living in Baltimore and is the author of Digital Cash and Agents at Large (both Academic Press). His writings appear in numerous academic journals as well as the pages of more popular forums such as MacWorld and the New York Times. He has taught various computer science courses at Cornell University and Georgetown University.

Affiliations and Expertise

Writer, Baltimore, MD, USA