Paper
13 October 1998 Concept of linear run and its application to image compression
Sukhamay Kundu
Author Affiliations +
Abstract
We introduce here the motion of a linear-run in the sequence of gray values of an image. We present an optimal linear-time algorithm for decomposing an image into the smallest number of linear-runs that approximate the gray values within a given error limit (epsilon) > 0. For (epsilon) <EQ 6, which give good visual quality approximations, the linear-runs give significantly fewer runs that the traditional runs based on constant gray values in each run, and requires only about 1/3 of the memory needed for the traditional run-length method.We demonstrate the usefulness of this method on example images.
© (1998) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Sukhamay Kundu "Concept of linear run and its application to image compression", Proc. SPIE 3455, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation, (13 October 1998); https://doi.org/10.1117/12.326721
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Berkelium

Lawrencium

Image compression

Osmium

Information operations

Visualization

Error analysis

Back to Top