Abstract
Content-based image retrieval methods based on the Euclidean metric expect the feature space to be isotropic. They suffer from unequal differential relevance of features in computing the similarity between images in the input feature space. We propose a learning method that attempts to overcome this limitation by capturing local differential relevance of features based on user feedback. This feedback, in the form of accept or reject examples generated in response to a query image, is used to locally estimate the strength of features along each dimension while taking into consideration the correlation between features. This results in local neighborhoods that are constricted along feature dimensions that are most relevant, while enlongated along less relevant ones. In addition to exploring and exploiting local principal information, the system seeks a global space for efficient independent feature analysis by combining such local information. We provide experimental results that demonstrate the efficacy of our technique using real-world data.
Current address: Computer Science Department, Oklahoma State University, Still- water, OK 74078. Email:jpeng@cs.okstate.edu
Acknowledgements
This work was supported by DARPA/AFOSR grant F49620-97-1-0184. The contents of the information do not necessarily reflect the position or the policy of the U.S. Government.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
R.H. Creecy, B.M. Masand, S.J. Smith, and D.L. Waltz, “Trading Mips and Memory for Knowledge Engineering”, CACM, 35:48–64, 1992.
M. Flickner et al.,“Query by Image and Video Content: The QBIC system” IEEE Computer, pp.23–31, September 1995.
J.H. Friedman “Flexible Metric Nearest Neighbor Classication”, Tech. Report, Dept. of Statistics, Stanford University, 1994.
T. Hastie and R. Tibshirani, “Discriminant adaptive nearest neighbor classification”, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 18 No. 6, pp. 607–616, June 1996.
W.Y. Ma and B.S. Manjunath, “Texture features and learning similarity”, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Francisco, pp. 425–430, June, 1996.
T.P. Minka and R.W. Picard, “Interactive Learning with a “Society of Models””, Pattern Recognition, vol.30, (no.4):565-81, April 1997.
P.M. Murphy and D.W. Aha, UCI repository of machine learning databases. 1995. http://www.cs.uci.edu/~mlearn/MLRepository.html.
J. Peng, B. Bhanu and S. Qing, “Probabilistic Feature Relevance Learning for Content-Based Image Retrieval”, Computer Vision and Image Understanding, 1999.
Y. Rui, T.S. Huang and S. Mehrotra, “Content-based image retrieval with relevance feedback in MARS” Proceedings of IEEE International Conference on Image Processing, pp. 815–818, Santa Barbara, California, October, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Peng, J., Bhanu, B. (1999). Independent Feature Analysis for Image Retrieval. In: Perner, P., Petrou, M. (eds) Machine Learning and Data Mining in Pattern Recognition. MLDM 1999. Lecture Notes in Computer Science(), vol 1715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48097-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-48097-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66599-1
Online ISBN: 978-3-540-48097-6
eBook Packages: Springer Book Archive