Image Search by Features of Sorted Gray level Histogram Polynomial Curve

Image Searching was always a problem specially when these images are not properly managed or these are distributed over different locations. Currently different techniques are used for image search. On one end, more features of the image are captured and stored to get better results. Storing and management of such features is itself a time consuming job. While on the other extreme if fewer features are stored the accuracy rate is not satisfactory. Same image stored with different visual properties can further reduce the rate of accuracy. In this paper we present a new concept of using polynomials of sorted histogram of the image. This approach need less overhead and can cope with the difference in visual features of image.





References:
[1] M. Swain and D. Ballard, "Color Indexing", International journal of
Computer Vision Vol., 7 no 1, 1991.
[2] R. W. G. Hunt, "Measuring Color", Ellis Harwood Limited, England, 1987.
[3] K. M. Wong, C. H. Cheung and L. M Po "merged-color histogram for
color image retrieval", Proceedings In International Conference, Image
Processing , Vol III pp.949-952, Sep 2002.
[4] J. Hafner, H. S. Sawhney, W. Equilz, M. Flicker and W. Niblack,
"Efficient color histogram indexing for quadratic form distance
functions", IEEE Trans. Pattern Anal. Machine Intell, vol. 17, pp.
729-736, July, 1995.
[5] A. P. Berman and L. G. Shapiro, "Efficient image retrieval with
multiple distance measures", Proc. SPIE Storage and Retrieval for
Image and Video Database, vol. 3022, pp.12-21. Feb. 1997.
[6] B. C. Song, M. J. Kim and J. B. Ra, "A fast multi resolution feature
matching algorithm for exhaustive search in large image databases",
IEEE Trans. Circuits Syst Video Technol, vol. 11, pp.673-678, May 2001.