Data structures in image database and their storage efficiency

Qinghuai Gao; Jun He; Guisheng Qiu; Qing-Yun Shi

doi:10.1117/12.182819

17 August 1994 Data structures in image database and their storage efficiency

Qinghuai Gao, Jun He, Guisheng Qiu, Qing-Yun Shi

Proceedings Volume 2357, ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision; (1994) https://doi.org/10.1117/12.182819
Event: Spatial Information from Digital Photogrammetry and Computer Vision: ISPRS Commission III Symposium, 1994, Munich, Germany

Abstract

In this paper, an image compression scheme called H-coding is presented. H-coding, which is based on Hilbert curve and Hilbert order and compresses images with no information loss, is a good choice for an image database system. The theoretic analysis and experiments all show that H-coding has a much higher compression rate comparing with quadtree representation and line run code of images. Also, a theoretic comparison between the run code and vector representation is given.

Citation Download Citation

Qinghuai Gao, Jun He, Guisheng Qiu, and Qing-Yun Shi "Data structures in image database and their storage efficiency", Proc. SPIE 2357, ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision, (17 August 1994); https://doi.org/10.1117/12.182819

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available