Similarity-Based Retrieval Method for Fractal Coded Images in the Compressed Data Domain
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.
Unable to display preview. Download preview PDF.
- 1.Barnsley, M.F.: Fractals Everywhere. Academic Press, San Diego (1993, 1988)Google Scholar
- 4.Haseyama, M., Kondo, I.: Image authentication based on fractal image coding without contamination of original image. Journal of IEICE J85-D-II, 1513–1521 (2002)Google Scholar
- 5.Neil, G., Curtis, K.M.: Scale and rotationaly invariant recognition using fractal transformations. In: IEEE ICASSP 1996, vol. 6, pp. 3458–3461 (1996)Google Scholar
- 6.Lasfar, A., Mouline, S., Aboutajdine, D., Cherifi, H.: Content-based retrieval in fractal coded image databases. 1, 5031–5034 (2000)Google Scholar
- 8.Marie-Julie, J.M., Essafi, H.: Digital image indexing and retrieval by content using the fractal transform for multimedia databases. In: 4th International Forum on Research and Technology Advances in Digital Libraries (ADL 1997), pp. 2–12 (1997)Google Scholar
- 10.Chandran, S., Kar, S.: Retrieving faces by the PIFS fractal code. In: Sixth IEEE workshop on applications of computer vision (WACV 2002), pp. 8–12 (2002)Google Scholar
- 13.Fisher, Y. (ed.): Fractal Image Compression: Theory and Application. Springer, New York (1995)Google Scholar
- 15.Robinson, J.T.: The k-d-b-tree: A search structure for large multidimensional dynamic indexes. In: SIGMOD 1981, pp. 10–18 (1981)Google Scholar