EZW algorithm using depth-first representation of the wavelet zerotree

Li Minn Ang, Hon Nin Cheung, Kamran Eshraghian

    Research output: Book chapter/Published conference paperConference paperpeer-review

    4 Citations (Scopus)

    Abstract

    In this paper, we present a scheme for the implementation of the embedded zerotree wavelet (EZW) algorithm. The approach is based on using a depth-first search (DFS) to traverse the ancestor-descendant tree hierarchies of the wavelet coefficients. The EZW algorithm uses a raster scan to encode the coefficients. Two other tree-searching strategies to encode the coefficients would be by using a breath-first or depth-first traversal of the wavelet coefficients in the tree hierarchies. The DFS simplifies and diversifies the implementation of the EZW algorithm at the expense of a slight decrease in coding efficiency. The different tree-searching strategies are compared and simulation results using standard images are presented.

    Original languageEnglish
    Title of host publicationISSPA 1999 - Proceedings of the 5th International Symposium on Signal Processing and Its Applications
    PublisherIEEE Computer Society
    Pages75-78
    Number of pages4
    Volume1
    ISBN (Print)1864354518, 9781864354515
    DOIs
    Publication statusPublished - 01 Jan 1999
    Event5th International Symposium on Signal Processing and Its Applications, ISSPA 1999 - Brisbane, QLD, Australia
    Duration: 22 Aug 199925 Aug 1999

    Conference

    Conference5th International Symposium on Signal Processing and Its Applications, ISSPA 1999
    Country/TerritoryAustralia
    CityBrisbane, QLD
    Period22/08/9925/08/99

    Fingerprint

    Dive into the research topics of 'EZW algorithm using depth-first representation of the wavelet zerotree'. Together they form a unique fingerprint.

    Cite this