Bibliography

  • David Salomon

Keywords

IEEE Computer Society Image Compression Data Compression Block Truncation Code Data Compression Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

B.1 General Works

  1. Abut, Huseyin (ed.), Vector Quantization, IEEE Press, NY, 1990.Google Scholar
  2. Barnsley, M. F., and Lyman P. Hurd, Fractal Image Compression, Wellesley, MA, AK Peters, 1993.MATHGoogle Scholar
  3. Bell, T. C., I. H. Witten, and J. G. Cleary, Text Compression, Englewood Cliffs, NJ, Prentice-Hall, 1990.Google Scholar
  4. Bryan, Marvin, Diskdoubler and Autodoubler: An Illustrated Tutorial, New York, Windcrest/McGraw-Hill, 1994.Google Scholar
  5. Cappellini, V. (ed.), Data Compression and Error Control Techniques with Applications, New York, Academic Press, 1985.Google Scholar
  6. Clarke, R. J., Digital Compression of Still Images and Video, New York, Aca¬demic Press, 1995.Google Scholar
  7. Cushing, John Aikin and Yukio Rikiso, Data Compression Algorithms for En¬glish Text Based on Word Frequency, Kobe, Japan, Institute of Economic Research, Kobe University of Commerce, 1990.Google Scholar
  8. Dasarathy, Belur V. (ed.), Image Data Compression: Block Truncation Coding (BTC) Techniques, Los Alamitos, CA, IEEE Computer Society Press, 1995.Google Scholar
  9. Farrelle, Paul Michael, Recursive Block Coding for Image Data Compression, New York, Springer-Verlag, 1990.MATHCrossRefGoogle Scholar
  10. Fisher, Yuval (ed.), Fractal Image Compression: Theory and Application, New York, Springer Verlag, 1995.Google Scholar
  11. Gersho, Allen and Robert M. Gray, Vector Quantization and Signal Compres¬sion, Boston, Kluwer Academic Publishers, 1992.CrossRefGoogle Scholar
  12. Harris, Matthew, The Disk Compression Book, Que, Indianapolis, IN, 1993.Google Scholar
  13. Held, Gilbert and Thomas R. Marshall, Data and Image Compression: Tools and Techniques, 4th Ed., New York, John Wiley, 1996.Google Scholar
  14. Held, Gilbert, Personal Computer File Compression: A Guide to Shareware, DOS, and Commercial Compression Programs, New York, Van Nostrand, 1994.Google Scholar
  15. Hubbard, Barbara Burke, The World According to Wavelets, Wellesley, MA, AK Peters, 1996.MATHGoogle Scholar
  16. Krichevskii, R. E., Universal Compression and Retrieval, Boston, Kluwer Academic Publishers, 1994.Google Scholar
  17. Kou, Weidong, Digital Image Compression: Algorithms and Standards, Boston, Kluwer Academic Publishers, 1995.CrossRefGoogle Scholar
  18. Lynch, Thomas J., Data Compression Techniques and Applications, Belmont, CA, Lifetime Learning Publications, 1985.Google Scholar
  19. Nelson, Mark, and Jean-Loup Gailly, The Data Compression Book, 2nd Ed., New York, M&T Books, 1996.Google Scholar
  20. Pennebaker, William ?., and Joan L. Mitchell, JPEG Still Image Data Com¬pression Standard, New York, Van Nostrand Reinhold, 1992.Google Scholar
  21. Rabbani, Majid, and Paul W. Jones, Digital Image Compression Techniques, Bellingham, WA, Spie Optical Engineering Press, 1991.CrossRefGoogle Scholar
  22. Ramapriyan, H. K. (ed.), Scientific Data Compression Workshop (1988: Snowbird, Utah) Proceedings of the Scientific Data Compression Workshop, NASA con¬ference publication 3025.Google Scholar
  23. Ramstad, T. A. et al., Subband Compression of Images: Principles and Exam¬ples, New York, Elsevier, 1995.Google Scholar
  24. Rao, K.R. and P. Yip, Discrete Cosine TransformAlgorithms, Advantages, Applications, London, Academic Press, 1990.Google Scholar
  25. Sayood, Khalid.Introduction to Data Compression, San Francisco, Morgan Kaufmann, 1996.Google Scholar
  26. Storer, James A., John H. Reif (eds.), DCC ’91: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press, 1991.Google Scholar
  27. Storer, James A., and Martin Cohn (eds.), DCC ’92: Data Compression Con-ference, Los Alamitos, CA, IEEE Computer Society Press, 1992.Google Scholar
  28. Storer, James A., and Martin Cohn (eds.), DCC ’93: Data Compression Con-ference, Los Alamitos, CA, IEEE Computer Society Press, 1993.Google Scholar
  29. Storer, James A., and Martin Cohn (eds.), DCC ’94: Data Compression Con-ference, Los Alamitos, CA, IEEE Computer Society Press, 1994.Google Scholar
  30. Storer, James A., and Martin Cohn (eds.), DCC ’95: Data Compression Con-ference, Los Alamitos, CA, IEEE Computer Society Press, 1995.Google Scholar
  31. Storer, James A. (ed.), DCC ′96: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press, 1996.Google Scholar
  32. Storer, James A., (ed.), Image and Text Compression, Boston, Kluwer Academic Publishers, 1992.Google Scholar
  33. Storer, James A., Data Compression: Methods and Theory, Rockville, MD, Computer Science Press, 1988.Google Scholar
  34. Tseng, Nai-yu, and W.D. Burnside, A Very Efficient RCS Data Compression and Reconstruction Technique, NASA contractor report; NASA CR-191378. 1992.Google Scholar
  35. Vasudev, Bhaskaran, and Konstantinos Konstantinides, Image and Video Com¬pression Standards: Algorithms and Architectures, Boston, Kluwer Academic Pub¬lishers.Google Scholar
  36. Williams, Ross N., Adaptive Data Compression, Boston, Kluwer Academic Publishers, 1991.MATHCrossRefGoogle Scholar
  37. Witten, Ian H., Alistair Moffat, and Timothy C. Bell, Managing Gigabytes: Compressing and Indexing Documents and Images, New York, Van Nostrand Rein-hold, 1994.MATHGoogle Scholar

B.2 References

  1. Abelson, H. and A. A. diSessa (1982) Turtle Geometry, Cambridge, MA, MIT Press.Google Scholar
  2. Anderson, K. L., et al., (1987) “Binary-Image-Manipulation Algorithm in the Image View Facility,” IBM J. of Research and Development 31(1): 16–31, January.Google Scholar
  3. Backus, J. W. (1959) “The Syntax and Semantics of the Proposed International Algebraic Language,” in Proceedings of the International Conference on Information processing, pp. 125–132, UNESCO.Google Scholar
  4. Barnsley, F., and Sloan, A. D. (1988) “A Better Way to Compress Images,” Byte Magazine pp. 215–222 January.Google Scholar
  5. Barnsley, M. (1988) Fractals Everywhere, New York, Academic Press.MATHGoogle Scholar
  6. Bell, T. C., I. H. Witten, and J. G. Cleary (1990) Text Compression, Prentice-Hall.Google Scholar
  7. Bell, J. J (1986) “Better OPM/L Text Compression,” IEEE Transactions on Communications COM-34(12):1176–1182, December.CrossRefGoogle Scholar
  8. Bentley, J. L. et al. (1986) “A Locally Adaptive Data Compression Algorithm,” Communications of the ACM 29(4):320–330, April.MathSciNetMATHCrossRefGoogle Scholar
  9. Blackstock, Steve (1987) “LZW and GIF Explained,” available from URL “http://www.ece.uiuc.edu/~ece291/class-resources/gpe/gif.txt.html”.Google Scholar
  10. Blinn, J. F. (1993) “What’s the Deal with the DCT,” IEEE Computer Graphics and Applications pp. 78–83, July.Google Scholar
  11. Bloom, J R., (1996) “LZP: A New Data Compression Algorithm,” in Proceedings of Data Compression Conference, J. Storer, editor, Los Alamitos, CA, IEEE Computer Society Press, p. 425.Google Scholar
  12. Burrows, Michael, et al. (1992) On-line Data Compression in a Log-Structured File System, Digital, Systems Research Center, Palo Alto, CA.Google Scholar
  13. Burrows, Michael and D. J. Wheeler (1994) A Block-Sorting Lossless Data Compression Algorithm, Digital, Systems Research Center report 124, Palo Alto, Calif, May 10.Google Scholar
  14. Cappellini, V. (ed.) (1985) Data Compression and Error Control Techniques with Applications, New York, Academic Press.Google Scholar
  15. Chomsky, N. (1956) “Three Models for the Description of Language,” IRE Transactions on Information Theory 2(3): 113–124.MATHCrossRefGoogle Scholar
  16. Cleary, J. G. and I. H. Witten (1984) “Data Compression Using Adaptive Cod¬ing and Partial String Matching,” IEEE Transactions on Communications COM-32(4):396–402, April.CrossRefGoogle Scholar
  17. Cole, A. J. (1985) “A Note on Peano Polygons and Gray Codes,” International Journal of Computer Mathemathics 18:3–13.MATHCrossRefGoogle Scholar
  18. Cole, A. J. (1986) “Direct Transformations Between Sets of Integers and Hilbert Polygons,” International Journal of Computer Mathemathics 20:115–122.MATHCrossRefGoogle Scholar
  19. Cormack G. V. and R. N. S. Horspool (1987) “Data Compression Using Dy¬namic Markov Modelling,” The Computer Journal 30(6):541–550.MathSciNetCrossRefGoogle Scholar
  20. Culik, Karel II, and V. Valenta (1996), “Finite Automata Based Compres¬sion of Bi-Level Images,” in Storer, James A. (ed.), DCC ′96, Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press, pp. 280–289.CrossRefGoogle Scholar
  21. Cushing, John Aikin and Yukio Rikiso (1990) Data Compression Algorithms for English Text Based on Word Frequency, Institute of Economic Research, Kobe University of Commerce, Kobe, Japan.Google Scholar
  22. Czech, Z. J., et al (1992) “An Optimal Algorithm for Generating Minimal Perfect Hash Functions,” Information Processing Letters 43:257–264.MathSciNetMATHCrossRefGoogle Scholar
  23. Dasarathy, Belur V. (ed.) (1995) Image Data Compression: Block Truncation Coding (BTC) Techniques, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  24. Demko, S., L. Hodges, and B. Naylor (1985) “Construction of Fractal Objects with Iterated Function Systems,” Computer Graphics 19(3):271–278, July.CrossRefGoogle Scholar
  25. DeVore R. et al. (1992) “Image Compression Through Wavelet Transform Coding,” IEEE Transactions on Information Theory 38(2):719–746, March.MathSciNetMATHCrossRefGoogle Scholar
  26. Elias, P. (1975) “Universal Codeword Sets and Representations of the Integers,” IEEE Transactions on Information Theory IT-21(2):194–203, March.MathSciNetCrossRefGoogle Scholar
  27. Fang I. (1966) “It Isn’t ETAOIN SHRDLU; It’s ETAONI RSHDLC.,” Journal¬ism Quarterly 43:761–762.CrossRefGoogle Scholar
  28. Feder, Jens (1988) Fractals, New York, Plenum Press.MATHGoogle Scholar
  29. Fenwick, P. (1996) Symbol Ranking Text Compression, Tech. Rep. 132, Dept. of Computer Science, University of Auckland, New Zealand, June.Google Scholar
  30. Fiala, E. R., and D. H. Greene (1989), “Data Compression with Finite Win-dows,” Communications of the ACM 32(4):490–505.CrossRefGoogle Scholar
  31. Fisher, Yuval (ed.), (1995) Fractal Image Compression: Theory and Applica¬tion, New York, Springer-Verlag.Google Scholar
  32. Floyd, Sally, and Manfred Warmuth (1993) Sample Compression, Learnability and the Vapnik-Chervonenskis Dimension, Tec. report UCSC-CRL-93–13. Univ. of California, Santa Cruz.Google Scholar
  33. Fox, E. A. et al. (1991) “Order Preserving Minimal Perfect Hash Functions and Information Retrieval,” ACM Transactions on Information Systems 9(2):281–308.CrossRefGoogle Scholar
  34. Fraenkel, A. S., and S. T. Klein (1985) “Novel Compression of Sparse Bit-Strings—Preliminary Report,” in A. Apostolico and Z. Galil, eds. Combinatorial Algorithms on Words, Vol. 12, NATO ASI Series F: 169–183, New York, Springer-Verlag.CrossRefGoogle Scholar
  35. Gabor, G., and Z. Gyorfi (1986) Recursive Source Coding: A Theory for the Practice of Waveform Coding, New York, Springer-Verlag.MATHCrossRefGoogle Scholar
  36. Gersho, Allen, and Robert M. Gray (1992) Vector Quantization and Signal Compression, Boston, MA, Kluwer Academic Publishers.MATHCrossRefGoogle Scholar
  37. Gilliam, Laurence Bradley (1988) Raster Cartographic Data Compression (Dissertation).Google Scholar
  38. Glover, Daniel, and S. C. Kwatra, Compressing Subbanded Image Data with Lempel-Ziv-based Coders, NASA technical memo 105998.Google Scholar
  39. Glover, Daniel (19930 Transform Coding for Space Applications, NASA tech¬nical memorandum; 106362.Google Scholar
  40. Golomb, S. W. (1966) “Run-Length Encodings,” IEEE Transactions on Information Theory IT-12(3):399–401.MathSciNetCrossRefGoogle Scholar
  41. Gottlieb, D., et al (1975) A Classißcation of Compression Methods and their Usefulness for a Large Data Processing Center, Procedings of National Computer Conference 44:453–458.Google Scholar
  42. Gray, Robert T. (1983) Multispectral Data Compression using Staggered Detector Arrays, (Dissertation)Google Scholar
  43. Gray, F. (1953) U. S. Patent 2632058, March.Google Scholar
  44. Gulati, Amit (1993) Tessellated Image Compression (Dissertation).Google Scholar
  45. Hamming, Richard (1950) “Error Detecting and Error Correcting Codes,” Bell Systems Technical Journal 29:147–160, April.MathSciNetGoogle Scholar
  46. Hamming, Richard (1986) Coding and Information Theory, 2nd Ed., Engle-wood Cliffs, NJ, Prentice-Hall.MATHGoogle Scholar
  47. Harris, Matthew (1993) The Disk Compression Book, Indianapolis, IN, Que.Google Scholar
  48. Hartz, William G. (1989) Data Compression Techniques Applied to High-Resolution High Frame Rate Video Technology, NASA contractor report; NASA CR-4263.Google Scholar
  49. Hassner, Martin (1981) A Nonprobabilistic Source and Channel Coding Theory (Dissertation).Google Scholar
  50. Havas, G. et al. (1993) Graphs, Hypergraphs and Hashing in Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG’93), Berlin, Springer-Verlag.Google Scholar
  51. Held, Gilbert, and Thomas R. Marshall (1991) Data Compression: Techniques and Applications: Hardware and Software Considerations, 3rd Ed., New York, John Wiley.Google Scholar
  52. Held, Gilbert, and Thomas R. Marshall (1996) Data and Image Compression: Tools and Techniques, 4th Ed., New York, John Wiley.Google Scholar
  53. Held, Gilbert (1994) Personal Computer File Compression: A Guide to Shareware, DOS, and Commercial Compression Programs, New York, Van Nostrand.Google Scholar
  54. Hilbert, D. (1891) “Ueber Stetige Abbildung Einer Linie auf ein Flachenstuck,” Math. Annalen 38:459–460.MathSciNetMATHCrossRefGoogle Scholar
  55. Hirschberg, D., and D. Lelewer (1990) “Efficient Decoding of Prefix Codes,” Communications of the ACM 33(4):449–459.CrossRefGoogle Scholar
  56. Horspool, N. R. (1991) “Improving LZW,” in Proceedings of the 1991 Data Compression Conference, J. Storer Ed., Los Alamitos, CA, IEEE Computer Society Press, pp.332–341.Google Scholar
  57. Horspool, N. R. and G. V. Cormack (1992) “Constructing Word-Based Text Compression Algorithms,” in Proceedings of the 1992 Data Compression Confer-ence, J. Storer Ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 62–71, April.CrossRefGoogle Scholar
  58. Howard, Paul G., and J. S. Vitter (1992a), “New Methods for Lossless Image Compression Using Arithmetic Coding,” Information Processing and Management, 28(6):765–779.CrossRefGoogle Scholar
  59. Howard, Paul G., and J. S. Vitter (1992b), “Error Modeling for Hierarchical Lossless Image Compression,” in Proceedings of the 1992 Data Compression Confer-ence, J. Storer ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 269–278.CrossRefGoogle Scholar
  60. Howard, P. G. and J. S. Vitter, (1993) “Fast and Efficient Lossless Image Compression,” In Proceedings of the 1993 Data Compression Conference, J. Storer Ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 351–360.Google Scholar
  61. Huffman, David (1952) “A Method for the Construction of Minimum Redundancy Codes,” Proceedings of the IRE 40(9): 1098–1101.CrossRefGoogle Scholar
  62. Hunter, R., and A. H. Robinson (1980) “International Digital Facsimile Coding Standards,” Proceedings of the IEEE 68(7):854–867, July.CrossRefGoogle Scholar
  63. Huntley, H. E. (1970) The Divine Proportion: A Study in Mathematical Beauty, New York, Dover Publications.MATHGoogle Scholar
  64. Kespret, Irene (1993) PKZIP, LHarc and Co.: The Ultimate Data Compression Book, Grand Rapids, MI, Abacus.Google Scholar
  65. Kespret, Istok (1996) ZIP Bible, Grand Rapids, MI, Abacus.Google Scholar
  66. Kespret, Istok (1994) PKZIP, LHARC and Co.: The Ultimate Data Compres¬sion Book, Grand Rapids, MI, Abacus.Google Scholar
  67. Knuth, D. E. (1973) The Art of Computer Programming, Vol. 1, 2nd Ed., Reading, MA, Addison-Wesley.Google Scholar
  68. Knuth, D. E. (1985) “Dynamic Huffman Coding,” Journal of Algorithms 6:163–180.MathSciNetMATHCrossRefGoogle Scholar
  69. Kossentini, Faouzi et al., Necessary Conditions for the Optimality of Variable Rate Residual Vector Quantizers, NASA contractor report; NASA CR-193730.Google Scholar
  70. Krichevskii, R. E. (1994) Universal Compression and Retrieval, Kluwer Academic.Google Scholar
  71. Langdon, G., and J. Rissanen (1981) “Compression of Black White Images with Arithmetic Coding,” IEEE Transactions on Communications COM-29(6):858–867, June.CrossRefGoogle Scholar
  72. Langdon, Glen G. (1983) “A Note on the Ziv-Lempel Model for Compressing Individual Sequences,” IEEE Transactions on Information Theory IT-29(2):284–287, March.CrossRefGoogle Scholar
  73. Langdon, Glen G. (1984) On Parsing vs. Mixed-Order Model Structures for Data Compression, IBM research report RJ-4163 (46091), Jan 18, 1984, San Jose.Google Scholar
  74. Lin, Shu (1970) An Introduction to Error Correcting Codes, Englewood Cliffs, NJ, Prentice-Hall.Google Scholar
  75. Lindenmayer, A. (1968) “Mathematical Models for Cellular Interaction in De-velopment,” Journal of Theoretical Biology 18:280–315.CrossRefGoogle Scholar
  76. Lowe, Doug (1994) Microsoft Press Guide to DOUBLESPACE: Understanding Data Compression with MS-DOS 6.0 and 6.2, Redmond, WA, Microsoft Press.Google Scholar
  77. Lynch, Thomas J. (1985) Data Compression Techniques and Applications, Bel¬mont, CA, Lifetime Learning Publications.Google Scholar
  78. Manber, U., and E. W. Myers (1993) “Suffix Arrays: A New Method for On-Line String Searches,” SIAM Journal on Computing 22(5):935–948, October.MathSciNetMATHCrossRefGoogle Scholar
  79. Mandelbrot, Benoit (1982) The Fractal Geometry of Nature, San Francisco, CA, W. H. Freeman.MATHGoogle Scholar
  80. Marking, Michael P. (1990) “Decoding Group 3 Images,” The ? Users Journal pp. 45–54, June.Google Scholar
  81. McConnell, Kenneth R. (1992) FAX: Digital Facsimile Technology and Applications, Norwood, MA, Artech House.Google Scholar
  82. McCreight, E. M (1976) “A Space Economical Suffix Tree Construction Algo-rithm,” Journal of the ACM 32(2):262–272, April.MathSciNetCrossRefGoogle Scholar
  83. Miller, V. S., and M. N. Wegman (1985) “Variations On a Theme by Ziv and Lempel,” in A. Apostolico and Z. Galil, eds., NATO ASI series Vol. F12, Combinatorial Algorithms on Words, Springer, Berlin, pp. 131–140.CrossRefGoogle Scholar
  84. Moffat, A. (1990) “Implementing the PPM Data Compression Scheme,” IEEE Transactions on Communications COM-38(11):1917–1921, November.CrossRefGoogle Scholar
  85. Moffat, A. (1991) “Two-Level Context Based Compression of Binary Images,” in Proceedings of the 1991 Data Compression Conference, J. Storer Ed., Los Alami-tos, CA, IEEE Computer Society Press, pp. 382–391.Google Scholar
  86. Murray, James D. (1994) and William vanRyper, Encyclopedia of Graphics File Formats, Sebastopol, CA, O’Reilly and Assoc.Google Scholar
  87. Naur, P. et al. (1960) “Report on the Algorithmic Language ALGOL 60,” Communications of the ACM 3(5):299–314, revised in Communications of the ACM 6(1):1–17.Google Scholar
  88. Nelson, Mark and Jean-Loup Gailly (1996) The Data Compression Book, 2nd Ed., New York, M&T Books.Google Scholar
  89. Nesenbergs, M., Image Data Compression Overview: Issues and Partial Solutions, NTIA report; 89–252.Google Scholar
  90. Nix, R. (1981) “Experience With a Space Efficient Way to Store a Dictionary,” Communications of the ACM 24(5):297–298.CrossRefGoogle Scholar
  91. Nussbaum, Howard Steven (1977) Source Coding and Adaptive Data Compression for Communication Networks (Dissertation).Google Scholar
  92. Paola, Justin D., and Robert A. Schowengerdt (1995) The Effect of Lossy Image Compression on Image Classification, NASA contractor report; NASA CR-199550.Google Scholar
  93. Paola, Justin D., and Robert A. Schowengerdt (1995) Searching for Patterns in Remote Sensing Image Databases Using Neural Networks, NASA contractor report; NASA CR-199549.Google Scholar
  94. Peano, G. (1890) “Sur Une Courbe Qui Remplit Toute Une Aire Plaine,” Math. Annalen 36:157–160.MathSciNetMATHCrossRefGoogle Scholar
  95. Peitgen, H. O., et al. (eds.) (1982) The Beauty of Fractals, Berlin, Springer-Verlag.Google Scholar
  96. Peitgen, H. J., and Dietmar Saupe (1985) The Science of Fractal Images, Berlin, Springer-Verlag.Google Scholar
  97. Pennebaker, W. J., and J. L. Mitchell (1988) “Probability Estimation for the Q-coder,” IBM Journal of Research and Development 32(6):717–726.CrossRefGoogle Scholar
  98. Pennebaker, W. J., J. L. Mitchell, et al. (1988) “An Overview of the Basic Principles of the Q-coder Adaptive Binary Arithmetic Coder,” IBM Journal of Research and Development 32(6):737–752.CrossRefGoogle Scholar
  99. Pennebaker, William., and Joan L. Mitchell (1992) JPEG Still Image Data Compression Standard, Van Nostrand Reinhold.Google Scholar
  100. Phillips, Dwayne (1992) “LZW Data Compression,” The Computer Application Journal Circuit Cellar Inc., 27:36–48, June/July.Google Scholar
  101. Press, W. H., B. P. Flannery, et al. (1988) Numerical Recipes in C: The Art of Scientific Computing, Cambridge University Press. (Also available on-line from http: //nr. harvard. edu/nr/bookc. html.)MATHGoogle Scholar
  102. Prusinkiewicz, Przemyslav (1986) Graphical Applications of L-systems, inProc. of Graphics Interface ‘86 — Vision Interface ‘86, pp.247–253.Google Scholar
  103. Prusinkiewicz, P., and A. Lindenmayer (1990) The Algorithmic Beauty of Plants, New York, Springer Verlag.MATHCrossRefGoogle Scholar
  104. Prusinkiewicz, P., A. Lindenmayer, and F. D. Pracchia (1991) “Synthesis of Space-Filling Curves on the Square Grid,” in Fractals in the Fundamental and Applied Sciences, edited by Peitgen, H.-O. et al., Amsterdam, Elsevier Science Publishers, pp. 341–366.Google Scholar
  105. Rabbani, Majid, and Paul W. Jones (1991) Digital Image Compression Tech¬niques, Bellingham, WA, Spie Optical Engineering Press.CrossRefGoogle Scholar
  106. Ramabadran, Tenkasi V., and Sunil S. Gaitonde (1988) “A Tutorial on CRC Computations,” IEEE Micro pp. 62–75, August.Google Scholar
  107. Ramapriyan, H. K. (ed.) (1988) Scientific Data Compression Workshop (1988: Snowbird, Utah) Proceedings of the Scientific Data Compression Workshop, NASA conference publication 3025.Google Scholar
  108. Ramstad, T. A. et al (1995) Subband Compression of Images: Principles and Examples, Amsterdam, Elsevier Science Publishers.Google Scholar
  109. Rao, K. R., and P. Yip (1990) Discrete Cosine TransformAlgorithms, Ad-vantages, Applications, London, Academic Press.Google Scholar
  110. Reghbati, H. K. (1981) “An Overview of Data Compression Techniques,” IEEE Computer 14(4):71–76.CrossRefGoogle Scholar
  111. Rice, Robert F. et al., Algorithms for a Very High Speed Universal Noiseless Coding Module, NASA contractor report; NASA CR-187974.Google Scholar
  112. Robinson, P., and D. Singer (1981) “Another Spelling Correction Program,” Communications of the ACM 24(5):296–297.CrossRefGoogle Scholar
  113. Rost, Martin .(1988) Data Compression Using Adaptive Transform Coding, NASA contractor report; NASA CR-189956.Google Scholar
  114. Sacco, William et al. (1988) Information Theory, Saving Bits, Janson Publications, Providence, R.I.Google Scholar
  115. Sagan, Hans (1994) Space-Filling Curves, New York, Springer Verlag.MATHCrossRefGoogle Scholar
  116. Sauer, Ken et al. (1992) Subhband/Transform Compression of Video Sequences: Final Report, NASA contractor report; NASA CR-189786.Google Scholar
  117. Sayood, K., and K. Robinson (1992) “A Differential Lossless Image Compression Scheme,” IEEE Transactions on Signal Processing 40(1):236–241, January.CrossRefGoogle Scholar
  118. Sayood, Khalid (1996) Introduction to Data Compression, San Francisco, CA, Morgan Kaufmann.MATHGoogle Scholar
  119. Shannon, C. (1951) “Prediction and Entropy of Printed English,” Bell System Technical Journal 30(l):50–64, January.MATHGoogle Scholar
  120. Sieminski, A. (1988) “Fast Decoding of the Huffman Codes,” Information Pro¬cessing Letters 26(5):237–241.CrossRefGoogle Scholar
  121. Sierpinski, W. (1912) “Sur Une Nouvelle Courbe Qui Remplit Toute Une Aire Plaine,” Bull Acad. Sei. Cracovie Serie A:462–478.Google Scholar
  122. Smith, Alvy Ray (1984) “Plants, Fractals and Formal Languages,” Computer Graphics 18(3):1–10.CrossRefGoogle Scholar
  123. Stollnitz, E. J., T. D. DeRose, and D. H. Salesin (1996) Waveiets for Computer Graphics, San Francisco, CA, Morgan Kaufmann.Google Scholar
  124. Storer, J. A. and T. G. Szymanski (1982) “Data Compression via Textual Substitution,” Journal of the ACM 29:928–951.MathSciNetMATHCrossRefGoogle Scholar
  125. Storer, James A. (1988) Data Compression: Methods and Theory, Rockville, MD, Computer Science Press.Google Scholar
  126. Storer, James A., (ed.) (1992) Image and Text Compression, Boston, MA, Kluwer Academic Publishers.Google Scholar
  127. Storer, James A., and John H. Reif (eds.) (1991) DCC ′91: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  128. Storer, James A., and Martin Cohn (eds.) (1992) DCC ’92: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  129. Storer, James A., and Martin Cohn (eds.) (1993) DCC ’93: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  130. Storer, James A., and Martin Cohn (eds.) (1994) DCC ’94: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  131. Storer, James A., and Martin Cohn (eds.) (1995) DCC ′95: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  132. Storer, James A., (ed.) (1996) DCC ’96: Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  133. Sutardja, Budi (1991) LZWBSWRT—A Technique for High Performance Universal Delta Data Compression (Dissertation).Google Scholar
  134. Szilard, A. L. and R. E. Quinton (1979) “An Interpretation for DOL Systems by Computer Graphics,” The Science Terrapin 4:8–13.Google Scholar
  135. Tabatabai, Y. M. A., (1981) Edge Location and Data Compression for Digital Imagery (Dissertation).Google Scholar
  136. Thomborson, Clark, (1992) “The V.42bis Standard for Data-Compressing Mod-ems,” IEEE Micro pp. 41–53, October.Google Scholar
  137. Tilton, James C., (ed.) (1991) Space and Earth Science Data Compression Workshop (1991: Snowbird, Utah), NASA conference publication 3130.Google Scholar
  138. Tilton, James C., (ed.) (1992) Space and Earth Science Data Compression Workshop (1992: Snowbird, Utah), NASA conference publication 3183.Google Scholar
  139. Tilton, James C., (ed.) (1994) Space and Earth Science Data Compression Workshop (4th: 1994: Salt Lake City, Utah), NASA conference publication 3255.Google Scholar
  140. Tseng, Nai-yu and W. D. Burnside (1992) A Very Efficient RCS Data Compression and Reconstruction Technique, NASA contractor report; NASA CR-191378.Google Scholar
  141. Vasudev, Bhaskaran, and Konstantinos Konstantinides, Image and Video Com¬pression Standards: Algorithms and Architectures, Boston, MA, Kluwer Academic Publishers.Google Scholar
  142. Vitter, Jeffrey S. (1987) “Design and Analysis of Dynamic Huffman Codes,” Journal of the ACM 34(4):825–845, October.MathSciNetMATHCrossRefGoogle Scholar
  143. Wallace, Gregory K. (1991) “The JPEG Still Image Compression Standard,” Communications of the ACM 34(4):30–44, April.CrossRefGoogle Scholar
  144. Welch, T. A. (1984) “A Technique for High-Performance Data Compression,” IEEE Computer 17(6):8–19, June.CrossRefGoogle Scholar
  145. Williams, Ross N. (1991) Adaptive Data Compression, Boston, MA, Kluwer Academic Publishers.MATHCrossRefGoogle Scholar
  146. Williams, Ross (1991),“An Extremely Fast Ziv-Lempel Data Compression Al-gorithm,” in Proceedings of the 1991 Data Compression Conference, J. Storer ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 362–371.Google Scholar
  147. Wirth, N. (1976) Algorithms + Data Structures = Programs, Englewood Cliffs, NJ, Prentice-Hall, 2nd Ed.MATHGoogle Scholar
  148. Witten, I. H., T. C. Bell, M. E. Harrison, M. L. James, and A. Moffat (1992) “Textual Image Compression,” in Proceedings of the 1992 Data Compression Con-ference, J. Storer ed., Los Alamitos, CA, IEEE Computer Society Press, pp. 42–51.CrossRefGoogle Scholar
  149. Witten, I. H., et al. (1994) Managing Gigabytes: Compressing and Indexing Documents and Images, New York, Van Nostrand Reinhold.MATHGoogle Scholar
  150. Wright, E. V. (1939) Gadsby, Los Angeles, Wetzel. Reprinted by University Microfilms, Ann Arbor, 1991.Google Scholar
  151. Wu, Xiaolin (1995), “Context Selection and Quantization for Lossless Image Coding,” in Storer, James A., and Martin Cohn (eds.), DCC ’95, Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press, p. 453.Google Scholar
  152. Wu, Xiaolin (1996), “An Algorithmic Study on Lossless Image Compression,” in Storer, James A. (ed.), DCC ’96, Data Compression Conference, Los Alamitos, CA, IEEE Computer Society Press.Google Scholar
  153. Yokko, Hidetoshi (1991) “An Improvement of Dynamic Huffman Coding with a Simple Repetition Finder,” IEEE Transactions on Communications 39(1):8–10, January.CrossRefGoogle Scholar
  154. Young, D. M. (1985) “MacWrite File Format,” Wheels for the Mind 1:34, Fall.Google Scholar
  155. Yu, Tong Lai. (1996) “Dynamic Markov Compression,” Dr Dobb’s Journal pp. 30–31, January.Google Scholar
  156. Zandi, Ahmad (1992) Adaptation to Nonstationary Binary Sources for Data Compression (Dissertation).Google Scholar
  157. Zhang, Manyun (1990) The JPEG and Image Data Compression Algorithms (Dissertation).Google Scholar
  158. Ziv, Jacob and A. Lempel (1977) “A Universal Algorithm for Sequential Data Compression,” IEEE Transactions on Information Theory IT-23(3):337–343.MathSciNetCrossRefGoogle Scholar
  159. Ziv, Jacob and A. Lempel (1978) “Compression of Individual Sequences via Variable-Rate Coding,” IEEE Transactions on Information Theory IT-24(5):530–536.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • David Salomon
    • 1
  1. 1.Department of Computer ScienceCalifornia State UniversityNorthridgeUSA

Personalised recommendations