27 March 1989 Image Compression In Orthogonal Spline Space
Author Affiliations +
Proceedings Volume 1002, Intelligent Robots and Computer Vision VII; (1989) https://doi.org/10.1117/12.960269
Event: 1988 Cambridge Symposium on Advances in Intelligent Robotics Systems, 1988, Boston, MA, United States
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.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
H. S. Hou, "Image Compression In Orthogonal Spline Space", Proc. SPIE 1002, Intelligent Robots and Computer Vision VII, (27 March 1989); doi: 10.1117/12.960269; https://doi.org/10.1117/12.960269
PROCEEDINGS
14 PAGES


SHARE
RELATED CONTENT

Data Compression Using Image Contours
Proceedings of SPIE (December 11 1985)
Image coding and image activity measurement
Proceedings of SPIE (August 20 1993)
Rule-Based String Code Processor
Proceedings of SPIE (February 19 1988)

Back to Top