A Bayes coding algorithm using context tree

Toshiyasu Matsushima, Shigeichi Hirasawa

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

    Abstract

    The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

    Original languageEnglish
    Title of host publicationIEEE International Symposium on Information Theory - Proceedings
    Pages386
    Number of pages1
    DOIs
    Publication statusPublished - 1994
    Event1994 IEEE International Symposium on Information Theory, ISIT 1994 - Trondheim
    Duration: 1994 Jun 271994 Jul 1

    Other

    Other1994 IEEE International Symposium on Information Theory, ISIT 1994
    CityTrondheim
    Period94/6/2794/7/1

    Fingerprint

    Trees (mathematics)
    Bayes
    Coding
    Weighting
    Compressibility
    Prior distribution
    Context

    ASJC Scopus subject areas

    • Applied Mathematics
    • Modelling and Simulation
    • Theoretical Computer Science
    • Information Systems

    Cite this

    Matsushima, T., & Hirasawa, S. (1994). A Bayes coding algorithm using context tree. In IEEE International Symposium on Information Theory - Proceedings (pp. 386). [394633] https://doi.org/10.1109/ISIT.1994.394633

    A Bayes coding algorithm using context tree. / Matsushima, Toshiyasu; Hirasawa, Shigeichi.

    IEEE International Symposium on Information Theory - Proceedings. 1994. p. 386 394633.

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

    Matsushima, T & Hirasawa, S 1994, A Bayes coding algorithm using context tree. in IEEE International Symposium on Information Theory - Proceedings., 394633, pp. 386, 1994 IEEE International Symposium on Information Theory, ISIT 1994, Trondheim, 94/6/27. https://doi.org/10.1109/ISIT.1994.394633
    Matsushima T, Hirasawa S. A Bayes coding algorithm using context tree. In IEEE International Symposium on Information Theory - Proceedings. 1994. p. 386. 394633 https://doi.org/10.1109/ISIT.1994.394633
    Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / A Bayes coding algorithm using context tree. IEEE International Symposium on Information Theory - Proceedings. 1994. pp. 386
    @inproceedings{304b4eef71b94d75a36f245f4ac26d0f,
    title = "A Bayes coding algorithm using context tree",
    abstract = "The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.",
    author = "Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "1994",
    doi = "10.1109/ISIT.1994.394633",
    language = "English",
    isbn = "0780320158",
    pages = "386",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",

    }

    TY - GEN

    T1 - A Bayes coding algorithm using context tree

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 1994

    Y1 - 1994

    N2 - The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

    AB - The context tree weighting (CTW) algorithm [Willems et al., 1993] has high compressibility for universal coding with respect to FSMX sources. The present authors propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. This algorithm can be applied to a wide class of prior distribution for finite alphabet FSMX sources. The algorithm is regarded as both a generalized version of the CTW procedure and a practical algorithm using a context tree of the adaptive Bayes coding which has been studied in Mataushima et al. (1991). Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

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

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

    U2 - 10.1109/ISIT.1994.394633

    DO - 10.1109/ISIT.1994.394633

    M3 - Conference contribution

    SN - 0780320158

    SN - 9780780320154

    SP - 386

    BT - IEEE International Symposium on Information Theory - Proceedings

    ER -