Taxonomy for lossless image compression

Nasir D. Memon, Khalid Sayood

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Abstract

    We give a classification scheme for both decorrelation and coding. The two classifications put together give us a framework for discussing, comparing and evaluating lossless image compression schemes. The classifications also enable us to clearly identify areas where not enough work has been done, thus identifying avenues for future research. We identify three component functions in an image decorrelation scheme, which are induced by a given image. These are: 1) An Ordering function, 2) A Neighborhood function and 3) A Replacement function. These functions can be static, backward adaptive or forward adaptive Static functions are fixed for all images. The above definitions provide us with a classification scheme for image decorrelation techniques. We also give a simple classification of residual image encoding techniques, similar to the one for decorrelation schemes. While this is not exhaustive survey, it does point out a few interesting things. One is the relatively small amount of work in error modeling. Another is the paucity of adaptive ordering functions. Finally, the classification reinforces the view that the development of decorrelation techniques is far from being a mature area.

    Original languageEnglish (US)
    Title of host publicationProceedings of the Data Compression Conference
    EditorsJames A. Storer, Martin Cohn
    PublisherPubl by IEEE
    Pages526
    Number of pages1
    ISBN (Print)0818656379
    StatePublished - 1994
    EventProceedings of the Data Compression Conference - Snowbird, UT, USA
    Duration: Mar 29 1994Mar 31 1994

    Other

    OtherProceedings of the Data Compression Conference
    CitySnowbird, UT, USA
    Period3/29/943/31/94

    Fingerprint

    Taxonomies
    Image compression

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Cite this

    Memon, N. D., & Sayood, K. (1994). Taxonomy for lossless image compression. In J. A. Storer, & M. Cohn (Eds.), Proceedings of the Data Compression Conference (pp. 526). Publ by IEEE.

    Taxonomy for lossless image compression. / Memon, Nasir D.; Sayood, Khalid.

    Proceedings of the Data Compression Conference. ed. / James A. Storer; Martin Cohn. Publ by IEEE, 1994. p. 526.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Memon, ND & Sayood, K 1994, Taxonomy for lossless image compression. in JA Storer & M Cohn (eds), Proceedings of the Data Compression Conference. Publ by IEEE, pp. 526, Proceedings of the Data Compression Conference, Snowbird, UT, USA, 3/29/94.
    Memon ND, Sayood K. Taxonomy for lossless image compression. In Storer JA, Cohn M, editors, Proceedings of the Data Compression Conference. Publ by IEEE. 1994. p. 526
    Memon, Nasir D. ; Sayood, Khalid. / Taxonomy for lossless image compression. Proceedings of the Data Compression Conference. editor / James A. Storer ; Martin Cohn. Publ by IEEE, 1994. pp. 526
    @inproceedings{a1e5db5f258c4b66a7c53283d08961b5,
    title = "Taxonomy for lossless image compression",
    abstract = "We give a classification scheme for both decorrelation and coding. The two classifications put together give us a framework for discussing, comparing and evaluating lossless image compression schemes. The classifications also enable us to clearly identify areas where not enough work has been done, thus identifying avenues for future research. We identify three component functions in an image decorrelation scheme, which are induced by a given image. These are: 1) An Ordering function, 2) A Neighborhood function and 3) A Replacement function. These functions can be static, backward adaptive or forward adaptive Static functions are fixed for all images. The above definitions provide us with a classification scheme for image decorrelation techniques. We also give a simple classification of residual image encoding techniques, similar to the one for decorrelation schemes. While this is not exhaustive survey, it does point out a few interesting things. One is the relatively small amount of work in error modeling. Another is the paucity of adaptive ordering functions. Finally, the classification reinforces the view that the development of decorrelation techniques is far from being a mature area.",
    author = "Memon, {Nasir D.} and Khalid Sayood",
    year = "1994",
    language = "English (US)",
    isbn = "0818656379",
    pages = "526",
    editor = "Storer, {James A.} and Martin Cohn",
    booktitle = "Proceedings of the Data Compression Conference",
    publisher = "Publ by IEEE",

    }

    TY - GEN

    T1 - Taxonomy for lossless image compression

    AU - Memon, Nasir D.

    AU - Sayood, Khalid

    PY - 1994

    Y1 - 1994

    N2 - We give a classification scheme for both decorrelation and coding. The two classifications put together give us a framework for discussing, comparing and evaluating lossless image compression schemes. The classifications also enable us to clearly identify areas where not enough work has been done, thus identifying avenues for future research. We identify three component functions in an image decorrelation scheme, which are induced by a given image. These are: 1) An Ordering function, 2) A Neighborhood function and 3) A Replacement function. These functions can be static, backward adaptive or forward adaptive Static functions are fixed for all images. The above definitions provide us with a classification scheme for image decorrelation techniques. We also give a simple classification of residual image encoding techniques, similar to the one for decorrelation schemes. While this is not exhaustive survey, it does point out a few interesting things. One is the relatively small amount of work in error modeling. Another is the paucity of adaptive ordering functions. Finally, the classification reinforces the view that the development of decorrelation techniques is far from being a mature area.

    AB - We give a classification scheme for both decorrelation and coding. The two classifications put together give us a framework for discussing, comparing and evaluating lossless image compression schemes. The classifications also enable us to clearly identify areas where not enough work has been done, thus identifying avenues for future research. We identify three component functions in an image decorrelation scheme, which are induced by a given image. These are: 1) An Ordering function, 2) A Neighborhood function and 3) A Replacement function. These functions can be static, backward adaptive or forward adaptive Static functions are fixed for all images. The above definitions provide us with a classification scheme for image decorrelation techniques. We also give a simple classification of residual image encoding techniques, similar to the one for decorrelation schemes. While this is not exhaustive survey, it does point out a few interesting things. One is the relatively small amount of work in error modeling. Another is the paucity of adaptive ordering functions. Finally, the classification reinforces the view that the development of decorrelation techniques is far from being a mature area.

    UR - http://www.scopus.com/inward/record.url?scp=0028060918&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0028060918&partnerID=8YFLogxK

    M3 - Conference contribution

    SN - 0818656379

    SP - 526

    BT - Proceedings of the Data Compression Conference

    A2 - Storer, James A.

    A2 - Cohn, Martin

    PB - Publ by IEEE

    ER -