Similarity Retrieval by 2D C-Trees Matching in Image Databases

Fang Jung Hsu*, Sun Yin Lee, Bao-Shuh Lin 

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

The image retrieval based on spatial content is an attracting task in many image database applications. The 2D strings provide a natural way of constructing spatial indexing for images and support effective picture query. Nevertheless, the 2D string is deficient in describing the spatial knowledge of nonzero sized objects with overlapping. In this paper, we use an ordered labeled tree, a 2D C-tree, to be the spatial representation for images and propose the tree-matching algorithm for similarity retrieval. The distance between 2D C-trees is used to measure the similarity of images. The proposed tree comparison algorithm is also modified to compute the partial tree distance for subpicture query. Experimental results for verifying the effectiveness of similarity retrieval by 2D C-trees matching are presented.

Original languageEnglish
Pages (from-to)87-100
Number of pages14
JournalJournal of Visual Communication and Image Representation
Volume9
Issue number1
DOIs
StatePublished - 1 Jan 1998

Fingerprint Dive into the research topics of 'Similarity Retrieval by 2D C-Trees Matching in Image Databases'. Together they form a unique fingerprint.

Cite this