|
|
|
|
| LEADER |
05838nmm a2200385 u 4500 |
| 001 |
EB000677694 |
| 003 |
EBX01000000000000000530776 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783642860928
|
| 100 |
1 |
|
|a Salomon, David
|
| 245 |
0 |
0 |
|a Data Compression
|h Elektronische Ressource
|b The Complete Reference
|c by David Salomon
|
| 250 |
|
|
|a 2nd ed. 2000
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 2000, 2000
|
| 300 |
|
|
|a XXXII, 823 p
|b online resource
|
| 505 |
0 |
|
|a 1. Basic Techniques -- 1.1 Intuitive Compression -- 1.2 Run Length Encoding -- 1.3 RLE Text Compression -- 1.4 RLE Image Compression -- 1.5 Move-to-Front Coding -- 1.6 Scalar Quantization -- 2. Statistical Methods -- 2.1 Information Theory Concepts -- 2.2 Variable-Size Codes -- 2.3 Prefix Codes -- 2.4 The Golomb Code -- 2.5 The Kraft-MacMillan Inequality -- 2.6 Shannon-Fano Coding -- 2.7 The Counting Argument -- 2.8 Huffman Coding -- 2.9 Adaptive Huffman Coding -- 2.10 MNP5 -- 2.11 MNP7 -- 2.12 Reliability -- 2.13 Facsimile Compression -- 2.14 Arithmetic Coding -- 2.15 Adaptive Arithmetic Coding -- 2.16 The QM Coder -- 2.17 Text Compression -- 2.18 PPM -- 2.19 Context-Tree Weighting -- 3. Dictionary Methods -- 3.1 String Compression -- 3.2 LZ77 (Sliding Window) -- 3.3 LZSS -- 3.4 Repetition Times -- 3.5 QIC-122 -- 3.6 LZ78 -- 3.7 LZFG -- 3.8 LZRW1 -- 3.9 LZRW4 -- 3.10 LZW -- 3.11 LZMW -- 3.12 LZAP -- 3.13 LZY -- 3.14 LZP -- 3.15 Repetition Finder -- 3.16 UNIX Compression --
|
| 505 |
0 |
|
|a 3.17 GIF Images -- 3.18 The V.42bis Protocol -- 3.19 Zip and Gzip -- 3.20 ARC and PKZip -- 3.21 ARJ and LHArc -- 3.22 EXE Compressors -- 3.23 CRC -- 3.24 Summary -- 3.25 Data Compression Patents -- 3.26 A Unification -- 4. Image Compression -- 4.1 Introduction -- 4.2 Approaches to Image Compression -- 4.3 Intuitive Methods -- 4.4 Image Transforms -- 4.5 Test Images -- 4.6 JPEG -- 4.7 JPEG-LS -- 4.8 Progressive Image Compression -- 4.9 JBIG -- 4.10 JBIG2 -- 4.11 Simple Images: EIDAC -- 4.12 Vector Quantization -- 4.13 Adaptive Vector Quantization -- 4.14 Block Matching -- 4.15 Block Truncation Coding -- 4.16 Context-Based Methods -- 4.17 FELICS -- 4.18 Progressive FELICS -- 4.19 MLP -- 4.20 PPPM -- 4.21 CALIC -- 4.22 Differential Lossless Compression -- 4.23 DPCM -- 4.24 Context-Tree Weighting -- 4.25 Block Decomposition -- 4.26 Binary Tree Predictive Coding -- 4.27 Quadtrees -- 4.28 Quadrisection -- 4.29 Space-Filling Curves -- 4.30 Hubert Scan and VQ --
|
| 505 |
0 |
|
|a 4.31 Finite Automata Methods -- 4.32 Iterated Function Systems -- 4.33 Cell Encoding -- 5. Wavelet Methods -- 5.1 Fourier Transform -- 5.2 The Frequency Domain -- 5.3 The Uncertainty Principle -- 5.4 Fourier Image Compression -- 5.5 The CWT and Its Inverse -- 5.6 The Haar Transform -- 5.7 Filter Banks -- 5.8 The DWT -- 5.9 Multiresolution Decomposition -- 5.10 Various Image Decompositions -- 5.11 The Lifting Scheme -- 5.12 The IWT -- 5.13 The Laplacian Pyramid -- 5.14 SPIHT -- 5.15 CREW -- 5.16 EZW -- 5.17 DjVu -- 5.18 WSQ, Fingerprint Compression -- 5.19 JPEG 2000 -- 6. Video Compression -- 6.1 Analog Video -- 6.2 Composite and Components Video -- 6.3 Digital Video -- 6.4 Video Compression -- 6.5 MPEG -- 6.6 H.261 -- 7. Audio Compression -- 7.1 Sound -- 7.2 Digital Audio -- 7.3 The Human Auditory System -- 7.4 ?-Law and A-Law Companding -- 7.5 ADPCM Audio Compression -- 7.6 MPEG-1 Audio Layers -- 8. Other Methods -- 8.1 The Burrows-Wheeler Method -- 8.2 Symbol Ranking -- 8.3 ACB --
|
| 505 |
0 |
|
|a 8.4 Sort-Based Context Similarity -- 8.5 Sparse Strings -- 8.6 Word-Based Text Compression -- 8.7 Textual Image Compression -- 8.8 Dynamic Markov Coding -- 8.9 FHM Curve Compression -- 8.10 Sequitur -- 8.11 Triangle Mesh Compression: Edgebreaker -- Joining the Data Compression Community -- Colophon
|
| 653 |
|
|
|a Coding and Information Theory
|
| 653 |
|
|
|a Coding theory
|
| 653 |
|
|
|a Cryptography
|
| 653 |
|
|
|a Information theory
|
| 653 |
|
|
|a Data encryption (Computer science)
|
| 653 |
|
|
|a Information retrieval
|
| 653 |
|
|
|a Cryptology
|
| 653 |
|
|
|a Data Storage Representation
|
| 653 |
|
|
|a Computer architecture
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 028 |
5 |
0 |
|a 10.1007/978-3-642-86092-8
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/978-3-642-86092-8?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 005.72
|
| 520 |
|
|
|a viii • The second new chapter, Chapter 6, discusses video compression. The chapter opens with a general description of CRT operation and basic analog and digital video concepts. It continues with a general discussion of video compression, and it concludes with a description of MPEG-1 and H.261. • Audio compression is the topic of the third new chapter, Chapter 7. The first topic in this chapter is the properties of the human audible system and how they can be exploited to achieve lossy audio compression. A discussion of a few simple audio compression methods follows, and the chapter concludes with a description of the three audio layers of MPEG-1, including the very popular mp3 format. Other new material consists of the following: • Conditional image RLE (Section 1.4.2). • Scalar quantization (Section 1.6). • The QM coder used in JPEG, JPEG 2000, and JBIG is now included in Sec tion 2.16. • Context-tree weighting is discussed in Section 2.19. Its extension to lossless image compression is the topic of Section 4.24. • Section 3.4 discusses a sliding buffer method called repetition times. • The troublesome issue of patents is now also included (Section 3.25). • The relatively unknown Gray codes are discussed in Section 4.2.1, in connection with image compression. • Section 4.3 discusses intuitive methods for image compression, such as subs- pling and vector quantization
|