Share Email Print

Proceedings Paper

Image Compression In Orthogonal Spline Space
Author(s): H. S. Hou
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

This paper presents a theoretical analysis and computing technique for performing image data compression in orthogonal spline space. First, we define the orthogonal spline basis functions which are derived from the subdivision of the discrete cosine transform. The number of subdivided blocks is the integer power of 2. In this paper, we present the detailed analysis of the bi-orthogonal and the quad-orthogonal spline spaces. Fast image compression and decompression algorithms in these spaces are given and simulated with examples. Based on the simulation results, one can conclude that this new image compression method is superior to the ordinary discrete cosine transform; i.e., it can retain more high-frequency details with less artifact and noise. Compared to the subband coding technique, this new method is still favorable both in terms of image detail and buffer size. In short, this new compression method reproduces better image quality for a prescribed data compression ratio in the reconstructed image.

Paper Details

Date Published: 27 March 1989
PDF: 14 pages
Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); doi: 10.1117/12.960269
Show Author Affiliations
H. S. Hou, The Aerospace Corporation (United States)

Published in SPIE Proceedings Vol. 1002:
Intelligent Robots and Computer Vision VII
David P. Casasent, Editor(s)

© SPIE. Terms of Use
Back to Top