Similarity-based retrieval method for fractal coded images in the compressed data domain

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We propose a novel retrieval method for fractal coded images in the compressed data domain. A fractal code is a contractive affine mapping that represents a similarity relation between two regions in an image. A fractal coded image consists of a set of these contractive mappings. Each mapping can be approximately represented by a vector spanning two regions. Therefore, a fractal coded image can be approximated as a set of vectors. By introducing a new similarity measure that reflects the difference of distribution and cardinality between two vector sets, a novel retrieval method for fractal coded images is realized. We also propose a new efficient retrieval method using upper bounds of the similarity measure. The effectiveness of the proposed method is also illustrated by various experiments. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Yokoyama, T., Watanabe, T., & Koga, H. (2005). Similarity-based retrieval method for fractal coded images in the compressed data domain. In Lecture Notes in Computer Science (Vol. 3568, pp. 385–394). Springer Verlag. https://doi.org/10.1007/11526346_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free