Share Email Print
cover

Proceedings Paper

Data structures in image database and their storage efficiency
Author(s): Qinghuai Gao; Jun He; Guisheng Qiu; Qing-Yun Shi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper 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.

Paper Details

Date Published: 17 August 1994
PDF: 4 pages
Proc. SPIE 2357, ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision, (17 August 1994); doi: 10.1117/12.182819
Show Author Affiliations
Qinghuai Gao, Peking Univ. (China)
Jun He, Peking Univ. (China)
Guisheng Qiu, Peking Univ. (China)
Qing-Yun Shi, Peking Univ. (China)


Published in SPIE Proceedings Vol. 2357:
ISPRS Commission III Symposium: Spatial Information from Digital Photogrammetry and Computer Vision
Heinrich Ebner; Christian Heipke; Konrad Eder, Editor(s)

© SPIE. Terms of Use
Back to Top