Share Email Print

Proceedings Paper

On-Line Visual Data Compression Along A One-Dimensional Scan
Author(s): Noam Sorek; Yehoshua Y. Zeevi
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A new method for on-line visual data compression is presented, implementing nonuniform data selection according to gray-level neighborhood relations computed along a one-dimensional Hilbert scanning trajectory. Selection of a newly-scanned point (sample) is based on comparison of its gray level with a threshold determined by neighboring points previously scanned along the trajectory. Inherent in this algorithm is a mechanism for image pre-emphasis over areas (such as edges) exhibiting rapid changes in gray levels, whereas the reconstructed gray-level distribution over such areas is less accurate. Image reconstruction from the resultant (partial) subset of data is effected with the aid of a Zero-Order-Hold algorithm. At a rate of 0.38 bit/pixel obtained over a monochrome image of 512 by 512 pixels, the quality of the reconstructed image appears to be satisfactory, although it is not as good as that obtained with some of the best compression techniques, there is a clear advantage in using the proposed technique in cases where on-line processing and/or compression is important.

Paper Details

Date Published: 25 October 1988
PDF: 8 pages
Proc. SPIE 1001, Visual Communications and Image Processing '88: Third in a Series, (25 October 1988); doi: 10.1117/12.969025
Show Author Affiliations
Noam Sorek, Technion - Israel Institute of Technology (Israel)
Yehoshua Y. Zeevi, Technion - Israel Institute of Technology (Israel)

Published in SPIE Proceedings Vol. 1001:
Visual Communications and Image Processing '88: Third in a Series
T. Russell Hsing, Editor(s)

© SPIE. Terms of Use
Back to Top