Concept of linear run and its application to image compression

Sukhamay Kundu

doi:10.1117/12.326721

13 October 1998 Concept of linear run and its application to image compression

Sukhamay Kundu

Proceedings Volume 3455, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation; (1998) https://doi.org/10.1117/12.326721
Event: SPIE's International Symposium on Optical Science, Engineering, and Instrumentation, 1998, San Diego, CA, United States

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available