R- TREE IMPLEMENTATION OF IMAGE DATABASES

Abstract

With the onslaught of multimedia in the near past, there has been a tremendous increase in the uses of images. Previously what used to be only text documents are now being converted to those containing images as well. A very good example of which is the web on which most of the documents contain images. Other than this the images are being used in other applications like weather forecasting, medical diagnosis, police department. All of these applications involve processing with images that are stored in electronic form in computer. For example in police department, various similar images are extracted out related to a given image that could contain the face of a suspected criminal. All these applications involve the use of huge number of images to be stored in database. This image database must such that efficient and easy retrieval of large number of images is possible. R-tree implementation of image databases is one such example which is being presented here in this thesis. The images are made available to the program which then stores them in their database. The. image database is represented using R-tree and the database is stored in a separate file. This R-tree implementation results in both update as well . as efficient retrieval of the images from hard disk. The program uses the similarity based retrieval feature for the images to retrieve the required number of similar images being inquired by the user. The program is implemented using c++ language on a PC with window95 as the operating system. The developing environment was turbo c.