We proposed an image featuring technique for image indexing. To achieve image indexing, the matching pursuit algorithm is employed. Image domain is classified into several groups, which are determined by atoms in the dictionary of matching pursuit algorithm. Since the image is decomposed into groups of atoms the atoms can describe the contents of image. In this paper, a fast matching-pursuit of image in Radon space (RMP) is proposed. Further a content featuring algorithm by RMP with the dictionary consisting of Gabor functions is proposed. Texture and color featuring are shown as examples of content featuring. The computer simulations and their corresponding experimental results show that the proposed method can achieve contents featuring as well as image compression.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Matching pursuit: contents featuring for image indexing


    Contributors:
    Ro, Yong M. (author)

    Conference:

    Multimedia Storage and Archiving Systems III ; 1998 ; Boston,MA,USA


    Published in:

    Publication date :

    1998-10-05





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Optical implementation of image representation using matching pursuit

    Chao, Tien-Hsin / Lau, Brian / Miceli, William J. | SPIE | 1994


    Tree structure search for matching pursuit

    Shoa, A. / Shirani, S. | IEEE | 2005


    Tree Structure Search for Matching Pursuit

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


    MPSteg: hiding a message in the matching pursuit domain

    Cancelli, G. / Barni, M. / Menegaz, G. | SPIE | 2006


    Template Matching Approach to Content Based Image Indexing by Low Dimensional Euclidean Embedding

    Schweitzer, H. / IEEE | British Library Conference Proceedings | 2001