A Survey on Different Hashing Techniques used for Image Searching
Sapana Prakash Mali and Nitin N Patil. Article: A Survey on Different Hashing Techniques used for Image Searching. IJCA Proceedings on National Conference on Advances in Communication and Computing NCACC 2015(1):32-36, September 2015. Full text available. BibTeX
@article{key:article,
author = {Sapana Prakash Mali and Nitin N. Patil},
title = {Article: A Survey on Different Hashing Techniques used for Image Searching},
journal = {IJCA Proceedings on National Conference on Advances in Communication and Computing},
year = {2015},
volume = {NCACC 2015},
number = {1},
pages = {32-36},
month = {September},
note = {Full text available}
}
Abstract
Image searching, is an active approach to recover the effective results for image searched by the users with the help of queries. Which is used by the current required search engines likes Bing, Google, and Internet Explorer and so on. To improve image searching method there is use of hash code technique. In this paper, various image search techniques using different hashing methods are reviewed. More than a few hashing methods such as state of the art which is used to generate hash codes, then embed and extract features of images in the high-dimensional practice. This scale image search can be executed in real time; this is depends on Hamming distance. This technique contains a weighted Hamming distance and finer-grained ranking. Query adaptive weights consist of semantic concept classes which improves the result of an image search. With the Query adaptive bit weights, images are ranked and calculated by weighted Hamming distance.
References
- Yu-Gang Jiang, Jun Wang, Xiang yang Xue, and Shih-Fu Chang, "Query-Adaptive Image Search With Hash Codes," in IEEE Transactions on Multimedia, Vol. 15, No. 2, February 2013.
- J. Wang, S. Kumar, and S. -F. Chang, "Sequential projection learning for hashing with compact codes," in Proc. Int. Conf. Machine Learning, 2010.
- H. Xu, J. Wang, Z. Li, G. Zeng, S. Li, and N. Yu, "Complementary hashing for approximate nearest neighbor search," in Proc. IEEE Int. Conf. Computer Vision, 2011.
- Y. Weiss, A. Torralba, and R. Fergus, "Spectral hashing," in Adv. Neural Inf. Process. Syst. , 2008.
- J. Wang, S. Kumar, and S. -F. Chang, "Semi-supervised hashing for scalable image retrieval," in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2010.
- H. Jegou, M. Douze, and C. Schmid, "Packing bag-of-features," in Proc. IEEE Conf. Computer Vision and Pattern Recognition, 2009.
- M. Muja and D. G. Lowe, "Fast approximate nearest neighbors with automatic algorithm configuration," in Proc. Int. Conf. Computer Vision Theory and Applications, pp. 331–340, 2009.
- T. -S. Chua, J. Tang, R. Hong, H. Li, Z. Luo, and Y. -T. Zheng, "NUSWIDE: A real-world web image database from National University of Singapore," in Proc. ACM Int. Conf. Image and Video Retrieval, 2009.
- P. Indyk, , J. E. Goodman and J. O'Rourke, Eds. , "Nearest neighbor using high-dimensional spaces," in Handbook of Discrete and ComputationalGeometry. Boca Raton, FL: CRC,ch. 39, 2004
- B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing for scalable image search," in Proc. IEEE Int. Conf. Computer Vision, 2009.
- Y. Mu, J. Shen, and S. Yan, "Weakly-supervised hashing in kernelspace," in Proc. IEEE Conf. Computer Vision and Pattern Recognition,2010
- E. Horster and R. Lienhart, "Deep networks for image retrieval on large-scale databases," in Proc. ACM Int. Conf. Multimedia, 2008.
- M. M. Bronstein, A. M. Bronstein, F. Michel, and N. Paragios, "Datafusion through cross-modality metric learning using similarity-sensitivehashing," in Proc. IEEE Conf. Computer Vision and PatternRecognition, 2010.
- Y. Jia, J. Wang, G. Zeng, H. Zha, and X. -S. Hua, "Optimizing KD-treesfor scalable visual descriptor indexing," in Proc. IEEE Conf. ComputerVision and Pattern Recognition, 2010, pp. 3392–3399.