Chaos equations pack more images into computers

Davidson, Clive
May 1991
New Scientist;5/25/91, Vol. 130 Issue 1770, p26
Reports on a mathematical technique that uses fractal equations to reduce the amount of data needed to store an image on a computer. Possible uses by TV newsrooms and police's `missing children' files; Why images are a problem for computers; Conventional compression techniques; Development of the new technique by Michael Barnsley, professor of mathematics at the Georgia Institute of Technology; Description of Barnsley's technique; More.


Related Articles

  • The poetry of data compression. Davis, Arnold // Educom Review;May/Jun99, Vol. 34 Issue 3, p12 

    Focuses on Atlanta, Georgia-based entrepreneur Michael Barnsley and his thoughts concerning data compression. Nature of data compression; Profile on Barnsley; Mathematical explanations for the phenomenon; Products developed by his company Iterated Systems.

  • Lossless Text Compression Technique Using Syllable Based Morphology.  // International Arab Journal of Information Technology (IAJIT);Jan2011, Vol. 8 Issue 1, p66 

    No abstract available.

  • A Quadtree-based Progressive Lossless Compression Technique for Volumetric Data Sets. KLAJNSEK, GREGOR; ZALIK, BORUT; NOVAK, FRANC; PAPA, GREGOR // Journal of Information Science & Engineering;Jul2008, Vol. 24 Issue 4, p1187 

    An efficient technique for progressive lossless compression of volumetric data is described. It is based on the quadtree data structure and exploits the expected similarities between the neighboring slices. The proposed approach has better compression ratio than the octree method. A small amount...

  • Compression Preserves Pre-Digital Data. Skiffington, Jon // GEOWorld;Sep2006, Vol. 19 Issue 9, p42 

    The article discusses the application of data compression in the storage, management and distribution of pre-digital geospatial mapping data possessed by organizations. The problem with most of pre-digital geospatial data is that they are not backward compatible. The conversion of the...

  • The Key as Dictionary Compression Method of Inverted Index Table under the Hbase Database. Pengsen Cheng; Junxiu An // Journal of Software (1796217X);May2013, Vol. 8 Issue 5, p1086 

    Starting with Hbase's own characteristics, this paper designs an inverted index table which includes key word, document ID and position list, and the table can saves a lot of storage space. After then, on the basis of the table, the paper provides key as dictionary compression with high...

  • Variable-resolution Compression of Vector Data. Bisheng Yang; Purves, Ross S.; Weibel, Robert // GeoInformatica;Sep2008, Vol. 12 Issue 3, p357 

    The compression of spatial data is a promising solution to reduce the space of data storage and to decrease the transmission time of spatial data over the Internet. This paper proposes a new method for variable-resolution compression of vector data. Three key steps are encompassed in the...

  • A top-down approach for compressing data cubes under the simultaneous evaluation of multiple hierarchical range queries. Cuzzocrea, Alfredo // Journal of Intelligent Information Systems;Jun2010, Vol. 34 Issue 3, p305 

    A novel top-down compression technique for data cubes is introduced and experimentally assessed in this paper. This technique considers the previously unrecognized case in which multiple Hierarchical Range Queries (HRQ), a very useful class of OLAP queries, must be evaluated against the target...

  • Compression of Semistructured Documents. Galambos, Leo; Lansky, Jan; Chernik, Katsiaryna // Enformatika;2006, Vol. 14, p222 

    EGOTHOR is a search engine that indexes the Web and allows us to search the Web documents. Its hit list contains URL and title of the hits, and also some snippet which tries to shortly show a match. The snippet can be almost always assembled by an algorithm that has a full knowledge of the...

  • On the Data Expansion of the Huffman Compression Algorithm. De Prisco, R.; De Santis, A. // Computer Journal;1998, Vol. 41 Issue 3, p137 

    While compressing a file with a Huffman code, it is possible that the size of the file grows temporarily. This happens when the source letters with low frequencies (to which long codewords are assigned) are encoded first. The maximum data expansion is the average growth in bits per source letter...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics