skip to main content
Skip header Section
Data compression: the complete referenceDecember 1997
Publisher:
  • Springer-Verlag
  • Berlin, Heidelberg
ISBN:978-0-387-98280-9
Published:15 December 1997
Pages:
447
Skip Bibliometrics Section
Bibliometrics
Abstract

No abstract available.

Cited By

  1. Rajankar S and Talbar S (2019). An electrocardiogram signal compression techniques, Analog Integrated Circuits and Signal Processing, 98:1, (59-74), Online publication date: 1-Jan-2019.
  2. Obrul D, Liu Y and Žalik B (2012). Progressive Visualization of Losslessly Compressed DICOM Files Over the Internet, Journal of Medical Systems, 36:3, (1927-1933), Online publication date: 1-Jun-2012.
  3. Bruni V, De Canditiis D and Vitulano D (2019). Phase information and space filling curves in noisy motion estimation, IEEE Transactions on Image Processing, 18:7, (1660-1664), Online publication date: 1-Jul-2009.
  4. Krivograd S, Trlep M and alik B (2008). A hexahedral mesh connectivity compression with vertex degrees, Computer-Aided Design, 40:12, (1105-1112), Online publication date: 1-Dec-2008.
  5. Zhengcai L, Zhu J, Ben-Lin X, Zhong-Hai Y and Huaiyu W (2008). Index transforms of a symmetrical matrix, Computers & Geosciences, 34:4, (301-309), Online publication date: 1-Apr-2008.
  6. Saha A and Ghosh S A speed-area optimization of full search block matching hardware with applications in high-definition TVs (HDTV) Proceedings of the 14th international conference on High performance computing, (83-94)
  7. ACM
    Chattopadhyay S, Bhandarkar S and Li K Ligne-claire video encoding for power constrained mobile environments Proceedings of the 15th ACM international conference on Multimedia, (1036-1045)
  8. Franco A, Lumini A and Maio D (2007). MKL-tree: an index structure for high-dimensional vector spaces, Multimedia Systems, 12:6, (533-550), Online publication date: 1-May-2007.
  9. Maruyama S, Miyagawa H and Sakamoto H Improving time and space complexity for compressed pattern matching Proceedings of the 17th international conference on Algorithms and Computation, (484-493)
  10. Krivograd S, Trlep M and Žalik B A compression method for FEM quadrilateral data Proceedings of the 6th WSEAS international conference on Applied computer science, (402-407)
  11. ACM
    Koloros M and Žára J Coding of vectorized cartoon video data Proceedings of the 22nd Spring Conference on Computer Graphics, (175-182 PAGE@7)
  12. ACM
    Mathur G, Desnoyers P, Ganesan D and Shenoy P Ultra-low power data storage for sensor networks Proceedings of the 5th international conference on Information processing in sensor networks, (374-381)
  13. Sýkora D, Buriánek J and Žára J Video codec for classical cartoon animations with hardware accelerated playback Proceedings of the First international conference on Advances in Visual Computing, (43-50)
  14. Krivograd S, Trlep M and Žalik B An efficient compression method for triangular meshes used in engineering Proceedings of the 7th WSEAS International Conference on Mathematical Methods and Computational Techniques In Electrical Engineering, (223-228)
  15. Won J, Ahn H, Kim W and Jang E Bit-Precision method for low complex lossless image coding Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part I, (155-164)
  16. ACM
    Krivograd S, Trlep M and Žalik B Compression of triangular meshes by simultaneously processing pairs of triangles Proceedings of the 21st Spring Conference on Computer Graphics, (105-110)
  17. Malek S, Mikic-Rakic M and Medvidovic N (2005). A Style-Aware Architectural Middleware for Resource-Constrained, Distributed Systems, IEEE Transactions on Software Engineering, 31:3, (256-272), Online publication date: 1-Mar-2005.
  18. Trincǎ D Meta-EAH Proceedings of the 2004 international symposium on Information and communication technologies, (220-225)
  19. Hwang S and Abraham J (2003). Test data compression and test time reduction using an embedded microprocessor, IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 11:5, (853-862), Online publication date: 1-Oct-2003.
  20. Sampath G A Block Coding Method that Leads to Significantly Lower Entropy Values for the Proteins and Coding Sections of Haemophilus influenzae Proceedings of the IEEE Computer Society Conference on Bioinformatics
  21. Mikic-Rakic M and Medvidovic N Adaptable architectural middleware for programming-in-the-small-and-many Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware, (162-181)
  22. ACM
    Min J, Park M and Chung C XPRESS Proceedings of the 2003 ACM SIGMOD international conference on Management of data, (122-133)
  23. Motta G, Rizzo F and Storer J Image compression Encyclopedia of Computer Science, (836-840)
  24. Taubin G BLIC Proceedings of the conference on Visualization '02, (451-458)
  25. Botsch M, Wiratanaya A and Kobbelt L Efficient high quality rendering of point sampled geometry Proceedings of the 13th Eurographics workshop on Rendering, (53-64)
  26. Tiplea F, Mäkinen E, Trincă D and Enea C (2019). Characterization results for time-varying codes, Fundamenta Informaticae, 53:2, (185-198), Online publication date: 15-May-2002.
  27. Ţiplea F, Mäkinen E, Trincă D and Enea C (2019). Characterization Results for Time-Varying Codes, Fundamenta Informaticae, 53:2, (185-198), Online publication date: 1-Apr-2002.
  28. Hirota K and Pedrycz W (2019). Data compression with fuzzy relational equations, Fuzzy Sets and Systems, 126:3, (325-335), Online publication date: 6-Mar-2002.
  29. ACM
    Khuri S and Hsu H (2000). Interactive packages for learning image compression algorithms, ACM SIGCSE Bulletin, 32:3, (73-76), Online publication date: 1-Sep-2000.
  30. ACM
    Khuri S and Hsu H Interactive packages for learning image compression algorithms Proceedings of the 5th annual SIGCSE/SIGCUE ITiCSEconference on Innovation and technology in computer science education, (73-76)
  31. Karni Z and Gotsman C Spectral compression of mesh geometry Proceedings of the 27th annual conference on Computer graphics and interactive techniques, (279-286)
  32. ACM
    Liefke H and Suciu D (2019). XMill, ACM SIGMOD Record, 29:2, (153-164), Online publication date: 1-Jun-2000.
  33. ACM
    Liefke H and Suciu D XMill Proceedings of the 2000 ACM SIGMOD international conference on Management of data, (153-164)
  34. ACM
    Khuri S and Hsu H Tools for visualizing text compression algorithms Proceedings of the 2000 ACM symposium on Applied computing - Volume 1, (119-123)
  35. Chi C, Deng J and Lim Y Compression proxy server Proceedings of the 2nd conference on USENIX Symposium on Internet Technologies and Systems - Volume 2, (10-10)
  36. Rosenfeld A (2018). Image Analysis and Computer Vision, Computer Vision and Image Understanding, 74:1, (36-95), Online publication date: 1-Apr-1999.
Contributors
  • California State University, Northridge

Recommendations

Reviews

Timothy C. Bell

Give me fruitful error any time, full of seeds, bursting with its own corrections. You can keep your sterile truth for yourself. (Vilfredo Pareto, 1848–1923) Salomon uses Pareto's words to conclude an appendix on error correction, but they could well have been used as a motto for this book. This “complete reference” on data compression provides a wonderful treasure chest of information, spanning a wide range of data compression methods, from simple text compression methods to the use of wavelets for image compression. Although it contains some vague generalizations and unfounded claims, it also provides tremendous detail, such as the full details of several file formats. It is unusual for a text on compression to cover the field so completely, with detailed descriptions of lossy and lossless compression methods for text, images, and sound. It includes methods that have only become widely known in recent years. However, the book does not quite live up to its title, as a few important methods get little or no mention, most notably vector quantization, the PNG format, the MPEG standard, and some audio compression methods. There are also some unusual definitions of terms that are not used elsewhere in the compression literature. The book's most frustrating deficiency is the lack of performance comparisons among the many methods described, although the preface includes references to Web pages that provide performance comparisons. The presentation is quirky, full of quotations (some of them relevant) and curious asides. The chatty style will make the text more accessible for some readers, while others may find the diversions distracting. For example, on page 86, the author suddenly interrupts a description of a compression method to give details of six examples of lipograms, such as books that entirely exclude the letter “e.” Nevertheless, the explanations are clear, and numerous examples illustrate the methods described. The book is suitable for an audience with a general computing background. Several appendices provide details about related topics that the reader may need, such as Fourier transforms and matrix operations. The text is interspersed with exercises, and a full set of answers is supplied. The book has been printed directly from the author's \TeX files, and while it is of a noticeably higher standard than many camera-ready books, it lacks the polish that conventional publishing can bring to a project. The text does not appear to have been copyedited, and the structure is a little unusual. For example, the bulk of the preface consists of introductory material that one might expect to find in the first chapter. Also, there are sudden changes of topic within each of the five chapters. For example, the chapter on dictionary compression methods has a section on cyclic redundancy codes, which really belongs in the appendix on error correcting codes. The index is comprehensive, though finding some topics may take several attempts. The glossary and bibliography are useful. Despite the unusual presentation, I highly recommend this book as a reference on data compression. It would also serve as a good starting point for information on a particular data compression method, and it is a very readable introduction to a number of topics relating to compression.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.