Skip Navigation

The Computer Journal 1988 31(4):353-357; doi:10.1093/comjnl/31.4.353
© 1988 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Anedda, C.
Right arrow Articles by Felician, L.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

P-compressed Quadtrees for Image Storing

C. Anedda and L. Felician

Dipartimento di Matematica e Informatica, Università degli Studi di Udine, Udine, Italy

Received 1 May 1987; revised 1 October 1987

The expanding role of database systems is now faced with a new application field, i.e. large image-file management. Composite documents in the Office Automation environment often include images (e.g. graphs, drawings, illustrated or handwritten documents, and so on), as well as alphanumeric and other coded data. Images are stored on mass storage after conversion into a long sequence of bits, performed by scanner devices. Bit-map images are then compressed either using run-length encoding techniques or quadtree-based techniques.

The goal of this paper is to show how quadtree-encoded images, which usually require more storage than run-length encodings, can be compressed using a new technique, named P-compression, which is effective for typical Office Automation documents.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.