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.
Matching pursuit: contents featuring for image indexing
Multimedia Storage and Archiving Systems III ; 1998 ; Boston,MA,USA
Proc. SPIE ; 3527
1998-10-05
Conference paper
Electronic Resource
English
Tree structure search for matching pursuit
IEEE | 2005
|Tree Structure Search for Matching Pursuit
British Library Conference Proceedings | 2005
|MPSteg: hiding a message in the matching pursuit domain
SPIE | 2006
|Template Matching Approach to Content Based Image Indexing by Low Dimensional Euclidean Embedding
British Library Conference Proceedings | 2001
|