Matching pursuit has found many applications recently especially in very low bit rate video coding. In this paper we show how the complexity of matching pursuit can be reduced from O(N) to O(log(2N)) using tree structured dictionaries. Moreover, we show how tree structured dictionaries provide an efficient coding strategy that is more resilient to error than random coding. Our simulation results showed an improvement of about 3 dB in PSNR can be achieved using the code provided by the tree structured dictionary.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Tree structure search for matching pursuit


    Contributors:
    Shoa, A. (author) / Shirani, S. (author)


    Publication date :

    2005-01-01


    Size :

    355289 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Tree Structure Search for Matching Pursuit

    Shoa, A. / Shirani, S. | British Library Conference Proceedings | 2005


    Multiple blocks update algorithm for matching pursuit video coding

    Jian-Liang Lin, / Wen-Liang Hwang, / Soo-Chang Pei, | IEEE | 2005


    Matching Pursuit via Genetic Algorithm Based on Hybrid Coding

    Hong, F. / Qingfeng, M. / Youyun, Z. | British Library Online Contents | 2005


    Collaborative Search and Pursuit for Autonomous Helicopters

    Johnson, E. / Mooney, J. / American Helicopter Society | British Library Conference Proceedings | 2014