Hyperspace storage compression for Multimedia systems

Using Autosophy data compression for Multimedia storage systems

Authors: Klaus Holtz, Alfred Lettieri, Eric Holtz.

Published / Presented at: SPIE 1994, High-Speed Networking and Multimedia Computing, 8 – 10 February 1994, San Jose, California. Volume 2188.

Level: Expert

Abstract: Storing multimedia text, speech or images in personal computers now requires very large storage facilities. Data compression eases the problem, but all algorithms based on Shannon's information theory will distort the data with increased compression. Autosophy, an emerging science of `self-assembling structures', provides a new mathematical theory of `learning' and a new `information theory'. `Lossless' data compression is achieved by storing data in mathematically omni dimensional hyperspace. Such algorithms are already used in disc file compression and V.42 bis modems. Speech can be compressed using similar methods. `Lossless' autosophy image compression has been implemented and tested in an IBM PC (486), confirming the algorithms and theoretical predictions of the new `information theory'. Computer graphics frames or television images are disassembled into `known' fragments for storage in an omni dimensional hyperspace library. Each unique fragment is used only once. Each image frame is converted into a single output code which is later used for image retrieval. The hyperspace image library is stored on a disc. Experimental data confirms that hyperspace storage is independent of image size, resolution or frame rate; depending solely on `novelty' or `movement' within the images. The new algorithms promise dramatic improvements in all multimedia data storage.

Available downloadable documents:

Publication Top Page -- Adobe pdf

Published document -- Adobe pdf