Fractals everywhere
Fractal image compression: theory and application
Fractal image compression: theory and application
Digital image indexing and retrieval by content using the fractal transform for multimedia databases
IEEE ADL '97 Proceedings of the IEEE international forum on Research and technology advances in digital libraries
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Retrieving Faces by the PIFS Fractal Code
WACV '02 Proceedings of the Sixth IEEE Workshop on Applications of Computer Vision
Content-Based Retrieval in Fractal Coded Image Databases
ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 1
Scale and rotational invariant object recognition using fractal transformations
ICASSP '96 Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06
A review of the fractal image coding literature
IEEE Transactions on Image Processing
Image segmentation using fractal coding
IEEE Transactions on Circuits and Systems for Video Technology
Hi-index | 0.00 |
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.