⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 ewtoc.html

📁 The primary purpose of this book is to explain various data-compression techniques using the C progr
💻 HTML
📖 第 1 页 / 共 2 页
字号:
<DL><DD><A HREF="ch06/169-171.html#Heading17">Enhancement</A></DL><DD><A HREF="ch06/172-200.html#Heading18">ARITH-N Listing</A></DL></B></FONT><BR><DD><A HREF="ch07/201-203.html#Heading1"><FONT SIZE="4"><B>Chapter 7&#151;Dictionary-Based Compression</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch07/201-203.html#Heading2">An Example</A><DD><A HREF="ch07/201-203.html#Heading3">Static vs. Adaptive</A><DL><DD><A HREF="ch07/203-205.html#Heading4">Adaptive Methods</A><DD><A HREF="ch07/203-205.html#Heading5">A Representative Example</A></DL><DD><A HREF="ch07/205-208.html#Heading6">Israeli Roots</A><DL><DD><A HREF="ch07/208-209.html#Heading7">History</A></DL><DD><A HREF="ch07/208-209.html#Heading8">ARC: The Father of MS-DOS Dictionary Compression</A><DL><DD><A HREF="ch07/210-212.html#Heading9">Dictionary Compression: Where It Shows Up</A></DL><DD><A HREF="ch07/212-214.html#Heading10">Danger Ahead&#151;Patents</A><DD><A HREF="ch07/212-214.html#Heading11">Conclusion</A></DL></B></FONT><BR><DD><A HREF="ch08/215-218.html#Heading1"><FONT SIZE="4"><B>Chapter 8&#151;Sliding Window Compression</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch08/215-218.html#Heading2">The Algorithm</A><DL><DD><A HREF="ch08/218-221.html#Heading3">Problems with LZ77</A><DD><A HREF="ch08/218-221.html#Heading4">An Encoding Problem</A></DL><DD><A HREF="ch08/221-223.html#Heading5">LZSS Compression</A><DL><DD><A HREF="ch08/221-223.html#Heading6">Data Structures</A><DD><A HREF="ch08/223-226.html#Heading7">A Balancing Act</A><DD><A HREF="ch08/226-228.html#Heading8">Greedy vs. Best Possible</A></DL><DD><A HREF="ch08/226-228.html#Heading9">The Code</A><DL><DD><A HREF="ch08/226-228.html#Heading10">Constants and Macros</A><DD><A HREF="ch08/228-232.html#Heading11">Global Variables</A></DL><DD><A HREF="ch08/228-232.html#Heading12">The Compression Code</A><DL><DD><A HREF="ch08/232-235.html#Heading13">Initialization</A><DD><A HREF="ch08/232-235.html#Heading14">The Main Loop</A><DD><A HREF="ch08/232-235.html#Heading15">The Exit Code</A><DD><A HREF="ch08/235-238.html#Heading16">AddString()</A><DD><A HREF="ch08/238-242.html#Heading17">DeleteString()</A><DD><A HREF="ch08/238-242.html#Heading18">Binary Tree Support Routines</A></DL><DD><A HREF="ch08/242-244.html#Heading19">The Expansion Routine</A><DL><DD><A HREF="ch08/242-244.html#Heading20">Improvements</A></DL><DD><A HREF="ch08/244-254.html#Heading21">The Code</A></DL></B></FONT><BR><DD><A HREF="ch09/255-257.html#Heading1"><FONT SIZE="4"><B>Chapter 9&#151;LZ78 Compression</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch09/255-257.html#Heading2">Can LZ77 Improve?</A><DD><A HREF="ch09/255-257.html#Heading3">Enter LZ78</A><DL><DD><A HREF="ch09/257-261.html#Heading4">LZ78 Details</A><DD><A HREF="ch09/257-261.html#Heading5">LZ78 Implementation</A></DL><DD><A HREF="ch09/261-264.html#Heading6">An Effective Variant</A><DD><A HREF="ch09/264-267.html#Heading7">Decompression</A><DL><DD><A HREF="ch09/264-267.html#Heading8">The Catch</A><DD><A HREF="ch09/267-271.html#Heading9">LZW Implementation</A><DD><A HREF="ch09/267-271.html#Heading10">Tree Maintenance and Navigation</A></DL><DD><A HREF="ch09/267-271.html#Heading11">Compression</A><DD><A HREF="ch09/271-273.html#Heading12">Decompression</A><DD><A HREF="ch09/273-278.html#Heading13">The Code</A><DD><A HREF="ch09/279-287.html#Heading14">Improvements</A><DD><A HREF="ch09/287-288.html#Heading15">Patents</A></DL></B></FONT><BR><DD><A HREF="ch10/289-292.html#Heading1"><FONT SIZE="4"><B>Chapter 10&#151;Speech Compression</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch10/289-292.html#Heading2">Digital Audio Concepts</A><DL><DD><A HREF="ch10/289-292.html#Heading3">Fundamentals</A><DD><A HREF="ch10/293-297.html#Heading4">Sampling Variables</A><DD><A HREF="ch10/297-299.html#Heading5">PC-Based Sound</A></DL><DD><A HREF="ch10/297-299.html#Heading6">Lossless Compression of Sound</A><DL><DD><A HREF="ch10/299-303.html#Heading7">Problems and Results</A><DD><A HREF="ch10/299-303.html#Heading8">Lossy Compression</A><DD><A HREF="ch10/303-309.html#Heading9">Silence Compression</A></DL><DD><A HREF="ch10/310-313.html#Heading10">Companding</A><DD><A HREF="ch10/318-320.html#Heading11">Other Techniques</A></DL></B></FONT><BR><DD><A HREF="ch11/321-323.html#Heading1"><FONT SIZE="4"><B>Chapter 11&#151;Lossy Graphics Compression</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch11/321-323.html#Heading2">Enter Compression</A><DL><DD><A HREF="ch11/321-323.html#Heading3">Statistical and Dictionary Compression Methods</A><DD><A HREF="ch11/323-326.html#Heading4">Lossy Compression</A><DD><A HREF="ch11/323-326.html#Heading5">Differential Modulation</A><DD><A HREF="ch11/323-326.html#Heading6">Adaptive Coding</A></DL><DD><A HREF="ch11/326-330.html#Heading7">A Standard That Works: JPEG</A><DL><DD><A HREF="ch11/326-330.html#Heading8">JPEG Compression</A><DD><A HREF="ch11/326-330.html#Heading9">The Discrete Cosine Transform</A><DD><A HREF="ch11/330-333.html#Heading10">DCT Specifics</A></DL><DD><A HREF="ch11/330-333.html#Heading11">Why Bother?</A><DD><A HREF="ch11/330-333.html#Heading12">Implementing the DCT</A><DL><DD><A HREF="ch11/333-336.html#Heading13">Matrix Multiplication</A></DL><DD><A HREF="ch11/333-336.html#Heading14">Continued Improvements</A><DL><DD><A HREF="ch11/333-336.html#Heading15">Output of the DCT</A><DD><A HREF="ch11/337-340.html#Heading16">Quantization</A><DD><A HREF="ch11/337-340.html#Heading17">Selecting a Quantization Matrix</A></DL><DD><A HREF="ch11/340-344.html#Heading18">Coding</A><DL><DD><A HREF="ch11/340-344.html#Heading19">The Zig-Zag Sequence</A><DD><A HREF="ch11/340-344.html#Heading20">Entropy Encoding</A><DD><A HREF="ch11/344-348.html#Heading21">What About Color?</A></DL><DD><A HREF="ch11/344-348.html#Heading22">The Sample Program</A><DL><DD><A HREF="ch11/344-348.html#Heading23">Input Format</A><DD><A HREF="ch11/344-348.html#Heading24">The Code</A><DD><A HREF="ch11/348-351.html#Heading25">Initialization</A><DD><A HREF="ch11/348-351.html#Heading26">The Forward DCT Routine</A><DD><A HREF="ch11/348-351.html#Heading27">WriteDCTData()</A><DD><A HREF="ch11/351-355.html#Heading28">OutputCode()</A><DD><A HREF="ch11/351-355.html#Heading29">File Expansion</A><DD><A HREF="ch11/351-355.html#Heading30">ReadDCTData()</A><DD><A HREF="ch11/355-370.html#Heading31">Input DCT Codes</A><DD><A HREF="ch11/355-370.html#Heading32">The Inverse DCT</A></DL><DD><A HREF="ch11/355-370.html#Heading33">The Complete Code Listing</A><DD><A HREF="ch11/370-375.html#Heading34">Support Programs</A><DD><A HREF="ch11/753-380.html#Heading35">Some Compression Results</A></DL></B></FONT><BR><DD><A HREF="ch12/381-385.html#Heading1"><FONT SIZE="4"><B>Chapter 12&#151;An Archiving Package</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch12/381-385.html#Heading2">CAR and CARMAN</A><DL><DD><A HREF="ch12/381-385.html#Heading3">The CARMAN Command Set</A><DD><A HREF="ch12/381-385.html#Heading4">The CAR File</A><DD><A HREF="ch12/381-385.html#Heading5">The Header</A><DD><A HREF="ch12/385-388.html#Heading6">Storing the Header</A><DD><A HREF="ch12/388-392.html#Heading7">The Header CRC</A><DD><A HREF="ch12/388-392.html#Heading8">Command-Line Processing</A></DL><DD><A HREF="ch12/392-394.html#Heading9">Generating the File List</A><DL><DD><A HREF="ch12/395-398.html#Heading10">Opening the Archive Files</A></DL><DD><A HREF="ch12/399-403.html#Heading11">The Main Processing Loop</A><DL><DD><A HREF="ch12/403-406.html#Heading12">Skipping/Copying Input File</A><DD><A HREF="ch12/403-406.html#Heading13">File Insertion</A><DD><A HREF="ch12/406-456.html#Heading14">File Extraction</A><DD><A HREF="ch12/406-456.html#Heading15">Cleanup</A></DL><DD><A HREF="ch12/406-456.html#Heading16">The Code</A></DL></B></FONT><BR><DD><A HREF="ch13/457-459.html#Heading1"><FONT SIZE="4"><B>Chapter 13&#151;Fractal Image Compression</B></FONT></A><FONT SIZE="3"><B><DL><DD><A HREF="ch13/457-459.html#Heading2">A brief history of fractal image compression</A><DD><A HREF="ch13/459-461.html#Heading3">What is an Iterated Function System?</A><DL><DD><A HREF="ch13/459-461.html#Heading4">Basic IFS mathematics</A></DL><DD><A HREF="ch13/461-464.html#Heading5">Image compression with Iterated Function Systems</A><DD><A HREF="ch13/461-464.html#Heading6">Image compression with Partitioned Iterated Function Systems</A><DD><A HREF="ch13/467-471.html#Heading7">Fractal image decoding</A><DD><A HREF="ch13/467-471.html#Heading8">Resolution independence</A><DD><A HREF="ch13/471-474.html#Heading9">The sample program</A><DL><DD><A HREF="ch13/471-474.html#Heading10">The main compression module</A><DD><A HREF="ch13/471-474.html#Heading11">Initialization</A><DD><A HREF="ch13/474-477.html#Heading12">Domain classification</A><DD><A HREF="ch13/474-477.html#Heading13">Image partitioning</A><DD><A HREF="ch13/474-477.html#Heading14">Finding optimal affine maps</A><DD><A HREF="ch13/477-505.html#Heading15">The decompression module</A></DL><DD><A HREF="ch13/477-505.html#Heading16">The complete code listing</A><DD><A HREF="ch13/506-509.html#Heading17">Some Compression Results</A><DD><A HREF="ch13/509-510.html#Heading18">Patents</A></DL></DL></DL><B></FONT><FONT SIZE="4"><B><DD><A HREF="bib.html">Bibliography</A><DD><A HREF="appendix-a.html">Appendix A</A><DD><A HREF="appendix-b.html">Appendix B</A><DD><A HREF="glossary.html">Glossary</A><DD><A HREF="book-index.html">Index</A></B></FONT></DL></TD></TR></TABLE></BODY></HTML>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -