Reduction of Waiting Time in Retrieving Images Utilizing Image Directories with Sketched Image as Key
International Conference on Parallel Computing in Electrical Engineering (PARELEC'00) (2000)
Aug. 27, 2000 to Aug. 30, 2000
Kayo Suzuki , Hamamatsu Research Center
Mitsuru Nagao , Hamamatsu Research Center
Hiroaki Ikeda , Hamamatsu Research Center
The image retrieval from the distributed image servers using a sketched image as a key was confirmed to be superior to those using keywords. In accordance with experimental and analytical studies, the total processing time of the image retrieval using a sketched image was much shorter than that of the image retrieval using keywords, and the total volume of data required for the image retrieval using a sketched image was much smaller than that for the image retrieval using keywords. On the image retrieval using a sketched image, the processing time was found to be reduced to one half of that in the conventional system when the image directories were installed in the new system. A mathematical model to derive the waiting time W from the processing time p was obtained as \math, where \math is the rate of occurrence of the requests for the image retrieval. The calculated values were confirmed to agree with experimental data. Based on the studies, a high-speed image retrieval system was constructed using an image directory. Based on the experimental studies, the increases in success rate, reduction of processing time, total volume of data transmitted through the communication lines, and waiting time are theoretically derived to define the characteristics of the image database systems constructed using image directories.
M. Nagao, K. Suzuki and H. Ikeda, "Reduction of Waiting Time in Retrieving Images Utilizing Image Directories with Sketched Image as Key," International Conference on Parallel Computing in Electrical Engineering (PARELEC'00)(PARELEC), Quebec, Canada, 2000, pp. 121.