Abstract
A Bayesian architecture for annotating, categorizing and retrieving 3D models of homogenous images given their 2D view is presented. Although the superiority of bayesian retrieval in a generic database has been studied, its ability to discriminate visually similar images, similarity being in colour, texture or shape has not been much reported. In the current work, we have established that continuous probabilistic image modeling based on mixture of Gaussians together with KL similarity measure, shows remarkable performance. For training, the characteristic view of the images is used. The features extracted are the polynomials transform coefficients. The algorithms used are simple, computationally efficient and do not require any prior segmentation. The dependence of the performance of the proposed architecture on the number of transform subspaces and the number of Gaussian mixtures has been studied. A comparative study with Daubechies wavelet shows that this architecture performs well with a small number of dimensions of transform subspaces and also with a small number of mixture of Gaussians, in addition to being fast.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Khapli, V.R., Bhalchandra, A.S.: Compressed domain content based image retrieval: state of the Art, challenges and open issues. In: Proceedings of World Congress for Science, Engineering and Technology, Bangkok, vol. 36 (2008) ISSN 2070-3740
Bae, H.J., Jung, S.H.: Image retrieval using texture based on DCT. In: Proceedings of the International Conference on Info., Comm. and Signal Proc., Singapore, pp.1065–1068 (1997)
Qiu, K.J., Jiang, J., Xiao, G., Irianto, S.Y.: DCT-Domain Image Retrieval Via Block-Edge-Patterns. In: Campilho, A., Kamel, M.S. (eds.) ICIAR 2006. LNCS, vol. 4141, pp. 673–684. Springer, Heidelberg (2006)
Bajaj, M., Lay, J.: A Comparative Study of Performance Measures for Information Retrieval Systems. In: Proceedings of the IEEE Symposium on Computational Intelligence in Image and Signal Processing, pp. 271–274 (2007)
Krishnamoorthy, R., Bhattacharayya, P.: A new data compression Scheme using Orthogonal Polynomials. In: IEEE Proceedings of the International Conference on Info., Com. and Signal Proc., vol. I, pp. 490–494. Nanyang Technology Univ., Singapore (1997)
Krishnamoorthy, R.: Transform coding of monochrome images with a statistical design of experiments to separate noise. Pattern Recognition Letters 28, 771–777 (2007)
Krishnamoorthy, R.: A unified framework based on orthogonal polynomials for edge detection, and compression in colour images, Ph.D.thesis, IIT Kharaghpur (1997)
Kullback, S.: Information theory and statistics. Dover Publications, New York (1968)
Aksoy, S., Haralick, M.: Probabilistic vs. Geometric Similarity Measures for Image Retrieval. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 357–362 (2000)
Greenspan, H., Goldberger, J., Riddel, L.: A probabilistic framework for image matching. Journal of Computer Vision and Image Understanding 84, 384–406 (2001)
Vasconcelos, N.: On the complexity of probabilistic image retrieval. In: Proceedings of the International Conference. on Computer Vision, pp. 400–407 (2001)
Meng, X.: A Comparative Study of Performance Measures for Information Retrieval Systems. In: Proceedings of the 3rd International Conference on InfoTech., pp. 578–579 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishnamoorthy, R., Kalpana, J. (2012). Indexing and Retrieval of Visually Similar Images in the Orthogonal Polynomials Transform Domain. In: Kannan, R., Andres, F. (eds) Data Engineering and Management. ICDEM 2010. Lecture Notes in Computer Science, vol 6411. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27872-3_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-27872-3_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27871-6
Online ISBN: 978-3-642-27872-3
eBook Packages: Computer ScienceComputer Science (R0)