Block-constrained fractal coding scheme for image retrieval

Zhiyong Wang, Zheru Chi, Da Deng, Yinlin Yu

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review

1 Citation (Scopus)

Abstract

Fractal coding has been proved useful for image compression. In this paper, we present a block-constrained fractal coding scheme and a matching strategy for content-based image retrieval. In our coding scheme, an image is partitioned into non-overlap blocks of a size close to that of an iconic image. Fractal codes are generated for each block independently. In the similarity measure of fractal codes, an improved nona-tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity. Our experimental results show that our approach is effective for image retrieval.
Original languageEnglish
Title of host publicationVisual Information and Information Systems - 3rd International Conference, VISUAL 1999, Proceedings
PublisherSpringer Verlag
Pages673-680
Number of pages8
ISBN (Print)3540660798, 9783540660798
Publication statusPublished - 1 Jan 1999
Event3rd International Conference on Visual Information Systems, VISUAL 1999 - Amsterdam, Netherlands
Duration: 2 Jun 19994 Jun 1999

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1614
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd International Conference on Visual Information Systems, VISUAL 1999
Country/TerritoryNetherlands
CityAmsterdam
Period2/06/994/06/99

Keywords

  • Content-based image retrieval
  • Fractal coding
  • Image coding
  • Iterated function systems

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Block-constrained fractal coding scheme for image retrieval'. Together they form a unique fingerprint.

Cite this