MARC record from Internet Archive

LEADER: 10997cam 22002898a 4500
001 9920579570001661
005 20150423130656.0
008 021125s2003 ne a b 001 0 eng
015 $aGBA2-T8046
020 $a0126208611
035 $a(CSdNU)u109452-01national_inst
035 $a(OCoLC)51109286
035 $a(Sirsi) 01-AAP-2539
040 $aUKM$cUKM$dORU$dCNU$dOrPss
049 $aCNUM
090 $aTK5102.5$b.L67 2003
245 00 $aLossless compression handbook /$cKhalid Sayood, editor.
260 $aAmsterdam ;$aBoston :$bAcademic Press,$cc2003.
300 $axx, 455 p. :$bill. (some col.) ;$c26 cm.
440 0 $aAcademic Press series in communications, networking and multimedia
504 $aIncludes bibliographical references and index.
505 0 $aTheory -- Information Theory behind Source Coding / Frans M. J. Willems, Tjalling J. Tjalkens -- Definition of Entropy -- Properties of Entropy -- Entropy as an Information Measure -- Joint Entropy and Conditional Entropy -- Properties of Joint Entropy and Conditional Entropy -- Interpretation of Conditional Entropy -- Sequences and Information Sources -- Sequences -- Information Sources -- Memoryless Sources -- Binary Sources -- Discrete Stationary Sources -- The Entropy Rate -- Variable-Length Codes for Memoryless Sources -- A Source Coding System, Variable-Length Codes for Source Symbols -- Unique Decodability, Prefix Codes -- Kraft's Inequality for Prefix Codes and Its Counterpart -- Redundancy, Entropy, and Bounds -- Variable-Length Codes for Blocks of Symbols -- Variable-Length Codes for Sources with Memory -- Block Codes Again -- The Elias Algorithm -- Representation of Sequences by Intervals -- Competitive Optimality -- Fixed-Length Codes for Memoryless Sources, the AEP -- The Fixed-Length Source Coding Problem -- Some Probabilities -- An Example Demonstrating the Asymptotic Equipartition Property -- The Idea behind Fixed-Length Source Coding -- Rate and Error Probability -- A Hamming Ball -- An Optimal Balance between R and P[subscript epsilon] -- The Fixed-Length Coding Theorem -- Converse and Conclusion -- Complexity Measures / Stephen R. Tate -- An Aside on Computability -- Concerns with Shannon Information Theory -- Strings versus Sources -- Complex Non-random Sequences -- Structured Random Strings -- Kolmogorov Complexity -- Incompressibility -- Prefix-free Encoding -- Computational Issues of Kolmogorov Complexity -- Resource-Bounded Kolmogorov Complexity -- Lower-Bounding Kolmogorov Complexity -- Relation to Shannon Information Theory -- Approach 1: An InfiniteSequence of Sources -- Approach 2: Conditional Complexities -- Historical Notes -- Compression Techniques -- Universal Codes / Peter Fenwick -- Compact Integer Representations -- Characteristics of Universal Codes -- Polynomial Representations -- Unary Codes -- Levenstein and Elias Gamma Codes -- Elias Omega and Even-Rodeh Codes -- Rice Codes -- Golomb Codes -- Start-Step-Stop Codes -- Fibonacci Codes -- Zeckendorf Representation -- Fraenkel and Klein Codes -- Higher-Order Fibonacci Representations -- Apostolico and Fraenkel Codes -- A New Order-3 Fibonacci Code -- Ternary Comma Codes -- Summation Codes -- Goldbach G[subscript 1] Codes -- Additive Codes -- Wheeler 1/2 Code and Run-Lengths -- The Wheeler 1/2 Code -- Using the Wheeler 1/2 Code -- Comparison of Representations -- Huffman Coding / Steven Pigeon -- Huffman Codes -- Shannon-Fano Coding -- Building Huffman Codes -- N-ary Huffman Codes -- Canonical Huffman Coding -- Performance of Huffman Codes -- Variations on a Theme -- Modified Huffman Codes -- Huffman Prefixed Codes -- Extended Huffman Codes -- Length-Constrained Huffman Codes -- Adaptive Huffman Coding -- Brute Force Adaptive Huffman -- The Faller, Gallager, and Knuth (FGK) Algorithm -- Vitter's Algorithm: Algorithm [Lambda] -- Other Adaptive Huffman Coding Algorithms -- An Observation on Adaptive Algorithms -- Efficient Implementations -- Memory-Efficient Algorithms -- Speed-Efficient Algorithms -- Arithmetic Coding / Amir Said -- Code Values -- Arithmetic Coding -- Optimality of Arithmetic Coding -- Arithmetic Coding Properties -- Implementation -- Coding with Fixed-Precision Arithmetic -- Adaptive Coding -- Complexity Analysis -- Dictionary-Based Data Compression: An Algorithmic Perspective / S. Cenk Sahinalp, Nasir M. Rajpoot -- Dictionary Construction: Static versus Dynamic -- Static Dictionary Methods -- Parsing Issues -- Semidynamic and Dynamic Dictionary Methods -- Extensions of Dictionary Methods for Compressing Biomolecular Sequences -- The Biocompress Program -- The GenCompress Program -- Data Structures in Dictionary Compression -- Tries and Compact Tries -- Suffix Trees -- Trie-Reverse Trie Pairs -- Karp-Rabin Fingerprints -- Benchmark Programs and Standards -- The gzip Program -- The compress Program -- The GIF Image Compression Standard -- Modem Compression Standards: v. 42bis and v.44 -- Burrows-Wheeler Compression / Peter Fenwick -- The Burrows-Wheeler Algorithm -- The Burrows-Wheeler Transform -- The Burrows-Wheeler Forward Transformation -- The Burrows-Wheeler Reverse Transformation -- Illustration of the Transformations -- Algorithms for the Reverse Transformation -- Basic Implementations -- The Burrows-Wheeler Transform or Permutation -- Move-To-Front Recoding -- Statistical Coding -- Relation to Other Compression Algorithms -- Improvements to Burrows-Wheeler Compression -- Preprocessing -- The Permutation -- Suffix Trees -- Move-To-Front -- Move-To-Front Variants -- Statistical Compressor -- Eliminating Move-To-Front -- Using the Burrows-Wheeler Transform in File Synchronization -- Recent Developments -- Symbol-Ranking and ACB Compression / Peter Fenwick -- Symbol-Ranking Compression -- Shannon Coder -- History of Symbol-Ranking Compressors -- An Example of a Symbol-Ranking Compressor -- A Fast Symbol-Ranking Compressor -- Buynovsky's ACB Compressor -- Applications -- Lossless Image Compression / K. P. Subbalakshmi -- Spatial Prediction -- Hierarchical Prediction -- Error Modeling -- Scanning Techniques -- Prediction for Lossless Image Compression -- Switched Predictors -- Combined Predictors -- Hierarchical Lossless Image Coding -- Text Compression / Amar Mukherjee, Fauzia Awan -- Information Theory Background -- Classification of Lossless Compression Algorithms -- Statistical Methods -- Dictionary Methods -- Transform-Based Methods: The Burrows-Wheeler Transform (BWT) -- Comparison of Performance of Compression Algorithms -- Transform-Based Methods: Star (*) Transform and Length-Index Preserving Transform -- Star (*) Transformation -- Length-Index Preserving Transform (LIPT) -- Experimental Results -- Timing Performance Measurements -- Three New Transforms--ILPT, NIT, and LIT -- Compression of Telemetry / Sheila Horan -- What is Telemetry? -- Issues Involved in Compression of Telemetry -- Why Use Compression on Telemetry -- Structure of the Data -- Size Requirements -- Existing Telemetry Compression -- Future of Telemetry Compression -- Lossless Compression of Audio Data / Robert C. Maher -- Expectations -- Principles of Lossless Data Compression -- Basic Redundancy Removal -- Amplitude Range and Segmentation -- Multiple-Channel Redundancy -- Prediction -- Entropy Coding -- Practical System Design Issues -- Numerical Implementation and Portability -- Segmentation and Resynchronization -- Variable Bit Rate: Peak versus Average Rate -- Speed and Complexity -- Examples of Lossless Audio Data Compression Software Systems -- Shorten -- Meridian Lossless Packing (MLP) -- Sonic Foundry Perfect Clarity Audio (PCA) -- Algorithms for Delta Compression and Remote File Synchronization / Torsten Suel, Nasir Memon -- Problem Definition -- Delta Compression -- Applications -- LZ77-Based Delta Compressors -- Some Experimental Results -- Space-Constrained Delta Compression -- Choosing Reference Files -- Remote File Synchronization -- Applications -- The rsync Algorithm -- Some Experimental Results for rsync -- Theoretical Results -- Results for Particular Distance Measures -- Estimating File Distances -- Reconciling Database Records and File Systems -- Conclusions and Open Problems -- Compression of Unicode Files / Peter Fenwick -- Unicode Character Codings -- Big-endian versus Little-endian -- UTF-8 Coding -- Compression of Unicode -- Finite-Context Statistical Compressors -- Unbounded-Context Statistical Compressors -- LZ-77 Compressors -- Test Compressors -- The Unicode File Test Suite -- Comparisons -- UTF-8 Compression -- Standards -- JPEG-LS Lossless and Near Lossless Image Compression / Michael W. Hoffman -- Lossless Image Compression and JPEG-LS -- JPEG-LS -- Overview of JPEG-LS -- JPEG-LS Encoding -- JPEG-LS Decoding -- The CCSDS Lossless Data Compression Recommendation for Space Applications / Pen-Shu Yeh -- The e_Rice Algorithm -- The Adaptive Entropy Coder -- Fundamental Sequence Encoding -- The Split-Sample Option -- Low-Entropy Options -- No Compression -- Code Selection -- Preprocessor -- Predictor -- Reference Sample -- Prediction Error Mapper -- Coded Data Format -- Decoding -- Testing -- Implementation Issues and Applications -- Lossless Bilevel Image Compression / Michael W. Hoffman -- Bilevel Image Compression -- JBIG -- Overview of JBIG Encoding/Decoding -- JBIG Encoding -- Data Structure and Formatting -- JBIG Decoding -- JBIG2 -- Overview of JBIG2 -- JBIG2 Decoding Procedures -- Decoding Control and Data Structures -- JPEG2000: Highly Scalable Image Compression / Ali Bilgin, Michael W. Marcellin -- JPEG2000 Features -- Compressed Domain Image Processing/Editing -- Progression -- The JPEG2000 Algorithm -- Tiles and Component Transforms -- The Wavelet Transform -- Quantization -- Bit-Plane Coding -- Packets and Layers -- JPEG2000 Codestream -- Performance -- PNG Lossless Image Compression / Greg Roelofs -- Historical Background -- Design Decisions -- Compression Engine -- zlib Format -- zlib Library -- Filters -- Practical Compression Tips -- Compression Tests and Comparisons -- MNG -- Facsimile Compression / Khalid Sayood -- A Brief History -- The Compression Algorithms -- Modified Huffman -- Modified READ -- Context-Based Arithmetic Coding -- Run-Length Color Encoding -- The Standards -- ITU-T Group 3 (T.4) -- Group 4 (T.6) -- JBIG and JBIG2 (T.82 and T.88) -- MRC--T.44 -- Other Standards -- Hardware -- Hardware Implementation of Data Compression / Sanjukta Bhanja, N. Ranganathan -- Text Compression Hardware -- Tree-Based Encoder Example -- Lempel-Ziv Encoder Example -- Image Compression Hardware -- DCT Hardware -- Wavelet Architectures -- JPEG Hardware -- Video Compression Hardware -- Some Detailed Examples -- Commercial Video and Audio Products.
650 0 $aData compression (Telecommunication)
700 1 $aSayood, Khalid.
948 $a02/05/2003$b02/05/2003
994 $aX0$bCNU
999 $aTK 5102.5 L67 2003$wLC$c1$i31786101551650$d1/29/2007$e1/11/2007 $f4/19/2004$g1$lCIRCSTACKS$mNULS$n1$rY$sY$tBOOK$u2/7/2003