Bayes coding algorithm using context tree

Toshiyasu Matsushima, Shigeichi Hirasawa

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

    1 Citation (Scopus)

    Abstract

    The context tree weighting (CTW) algorithm has high compressibility for the universal coding with respect to FSMX sources. In this paper, we propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. Our 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 previously studied. 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
    Place of PublicationPiscataway, NJ, United States
    PublisherIEEE
    Publication statusPublished - 1994
    EventProceedings of the 1994 IEEE International Symposium on Information Theory - Trodheim, Norw
    Duration: 1994 Jun 271994 Jul 1

    Other

    OtherProceedings of the 1994 IEEE International Symposium on Information Theory
    CityTrodheim, Norw
    Period94/6/2794/7/1

    Fingerprint

    Trees (mathematics)
    Compressibility

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    Matsushima, T., & Hirasawa, S. (1994). Bayes coding algorithm using context tree. In IEEE International Symposium on Information Theory - Proceedings Piscataway, NJ, United States: IEEE.

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

    IEEE International Symposium on Information Theory - Proceedings. Piscataway, NJ, United States : IEEE, 1994.

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

    Matsushima, T & Hirasawa, S 1994, Bayes coding algorithm using context tree. in IEEE International Symposium on Information Theory - Proceedings. IEEE, Piscataway, NJ, United States, Proceedings of the 1994 IEEE International Symposium on Information Theory, Trodheim, Norw, 94/6/27.
    Matsushima T, Hirasawa S. Bayes coding algorithm using context tree. In IEEE International Symposium on Information Theory - Proceedings. Piscataway, NJ, United States: IEEE. 1994
    Matsushima, Toshiyasu ; Hirasawa, Shigeichi. / Bayes coding algorithm using context tree. IEEE International Symposium on Information Theory - Proceedings. Piscataway, NJ, United States : IEEE, 1994.
    @inproceedings{30c17394c90a41acb8f833d1261f2c69,
    title = "Bayes coding algorithm using context tree",
    abstract = "The context tree weighting (CTW) algorithm has high compressibility for the universal coding with respect to FSMX sources. In this paper, we propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. Our 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 previously studied. Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.",
    author = "Toshiyasu Matsushima and Shigeichi Hirasawa",
    year = "1994",
    language = "English",
    booktitle = "IEEE International Symposium on Information Theory - Proceedings",
    publisher = "IEEE",

    }

    TY - GEN

    T1 - Bayes coding algorithm using context tree

    AU - Matsushima, Toshiyasu

    AU - Hirasawa, Shigeichi

    PY - 1994

    Y1 - 1994

    N2 - The context tree weighting (CTW) algorithm has high compressibility for the universal coding with respect to FSMX sources. In this paper, we propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. Our 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 previously studied. Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

    AB - The context tree weighting (CTW) algorithm has high compressibility for the universal coding with respect to FSMX sources. In this paper, we propose an algorithm by reinterpreting the CTW algorithm from the viewpoint of Bayes coding. Our 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 previously studied. Moreover, the proposed algorithm is free from underflow which frequently occurs in the CTW procedure.

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

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

    M3 - Conference contribution

    AN - SCOPUS:0028723110

    BT - IEEE International Symposium on Information Theory - Proceedings

    PB - IEEE

    CY - Piscataway, NJ, United States

    ER -