z-logo
open-access-imgOpen Access
P-compressed Quadtrees for Image Storing
Author(s) -
Cinzia Anedda,
Leonardo Felician
Publication year - 1988
Publication title -
the computer journal
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.319
H-Index - 64
eISSN - 1460-2067
pISSN - 0010-4620
DOI - 10.1093/comjnl/31.4.353
Subject(s) - alphanumeric , quadtree , computer science , encoding (memory) , automation , computer graphics (images) , scanner , image file formats , field (mathematics) , computer vision , database , artificial intelligence , image (mathematics) , computer hardware , operating system , mathematics , pure mathematics , mechanical engineering , engineering
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom