A Technique for Image Search Using Fractal Quadtree Partitioned Iterated Function System-A Survey

During the last few years, with high compression ratio performance, fractal image compression becomes the hot topic of research. In this paper we proposed a search engine which may allows user to retrieve the similar images from the database by applying fractal image compression al gorithm employing quadtree iterated function system. In this proposed search engine, When a user input an image query this proposed system may generate image eigen value data ,compare the eigen values with the stored image eigen values in the database and output the result based on quadtree partitioned iterated function system. This proposed search engine may find the exact input image but also may find the right image when the source image is rotated. The traditional fractal technique is too long to compre ss the image. Therefore quadtree partitioned iterated function system is introduced which may reduces compression time.