Image Retrieval using Hypergraph of Visual Concepts

Full Text (PDF, 426KB), PP.38-44

Views: 0 Downloads: 0

Author(s)

Sandhya V. Kawale 1,* S. M. Kamalapur 1

1. Department of Computer Engineering K. K. Wagh Institute of Engineering, Education and Research, Nashik Savitribai Phule Pune University, Maharashtra, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2017.12.05

Received: 27 Jul. 2017 / Revised: 30 Aug. 2017 / Accepted: 12 Sep. 2017 / Published: 8 Dec. 2017

Index Terms

Clustering, Hypergraph, Image Retrieval, Ranking, Visual Concepts

Abstract

Retrieving images similar to query image from a large image collection is a challenging task. Image retrieval is most useful in the image search engine to find images similar to the query image. Most of the existing graph based image retrieval methods capture only pair-wise similarity between images. The proposed work uses the hypergraph approach of the visual concepts. Each image can be represented by combination of the several visual concepts. Visual concept is the specific object or part of an image. There are several images in the database which can share multiple visual concepts. To capture such a relationship between group of images hypergraph is used. In proposed work, each image is considered as a vertex and each visual concept as a hyperedge in a hypergraph. All the images sharing same visual concept, form a hyperedge. Images in the dataset are represented using hypergraph. For each query image visual concept is identified. Similarity between query image and database image is identified. According to these similarities association scores are assigned to images, which will handle the image retrieval.

Cite This Paper

Sandhya V. Kawale, S. M. Kamalapur, "Image Retrieval using Hypergraph of Visual Concepts", International Journal of Information Technology and Computer Science(IJITCS), Vol.9, No.12, pp.38-44, 2017. DOI:10.5815/ijitcs.2017.12.05

Reference

[1]R. Datta, D. Joshi, J. Li, and J. Z. Wang, “Image retrieval: Ideas, influences, and trends of the new age”, ACM Comput. Surv. vol. 40, no. 2, 2008, Art. ID 5.

[2]W. Bian and D. Tao, “Biased discriminant Euclidean embedding for content-based image retrieval,” IEEE Trans. Image Process., vol. 19, no. 2, pp. 545–554, Feb. 2010.

[3]Kaiman Zeng, Nansong Wu, Arman Sargolzaei, and Kang Yen, "Learn to Rank Images: A Unified Probabilistic Hypergraph Model for Visual Search," Department of Electrical and Computer Engineering, Florida International University, 10555 West Flagler Street, Miami, FL 33174,USA

[4]Y. Jing and S. Baluja, “Visualrank: Applying PageRank to large-scale image search”, IEEE Trans. Pattern Anal. Mach. Intell., vol. 30, no. 11, pp. 1877-1890, Nov. 2008.

[5]M. Ambai and Y. Yoshida, “Multiclass VisualRank: Image ranking method in clustered subsets based on visual features”, in Proc. 32nd Int. ACM SIGIR Conf. Res. Develop. Inf. Retr., 2009, pp. 732-733.

[6]J. He, M. Li, H.-J. Zhang, H. Tong, and C. Zhang, “Manifold-ranking based image retrieval”, in Proc. 12th Annu. ACM Int. Conf. Multimedia, 2004, pp. 9-16.

[7]J. He, M. Li, H.-J. Zhang, H. Tong, and C. Zhang, “Generalized manifold ranking- based image retrieval”, IEEE Trans. Image Process., vol. 15, no. 10, pp. 3170-3177, Oct. 2006.

[8]M. K.-P. Ng, X. Li, and Y. Ye, “MultiRank: Co-ranking for objects and relations in multi-relational data”, in Proc. 17th ACM SIGKDD Int. Conf. Knowl. Discovery Data Mining, 2011, pp. 1217-1225.

[9]X. Li, M. K. Ng, and Y. Ye, “HAR: Hub, authority and relevance scores in multi-relational data for query search”, in Proc. SIAM Int. Conf. Data Mining, 2012, pp. 141-152. 

[10]Xiaojun Qi, Ran Chang (2013), “A Scalable Graph based semi-superwised Ranking System for Content-Based Image Retrieval".

[11]Y. Huang, Q. Liu, S. Zhang, and D. N. Metaxas, “Image retrieval via probabilistic hypergraph ranking”, in Proc. IEEE Conf. Comput. Vis. Pattern Recognit., Jun. 2010, pp. 3376-3383.

[12]Xutau Li, Yunming Ye, and Michael K. Ng "MultiVCRank With Applications to Image Retrieval", IEEE Transaction on Image Processing, Vol.25, No. 3, March 2016. 

[13]Bikramjot Singh Hanzra, “Texture Matching using Local Binary Pattern”, May 30, 2015 blog.

[14]R. Achanta, A. Shaji, K. Smith, A. Lucchi, P. Fua, S. Susstrunk, “SLIC Superpixels”, EPFL Technical Report, 149300, June 2010.

[15]M. M. Cheng, N. J. Mitra, X. Huang, P. H. S. Torr, and S. M. Hu, “Global contrast based salient region detection”, Proc. IEEE Conf. Comput. Vis. Pattern Recognit., 2011, pp. 409-416.

[16]A. C. Fabregas, B. D. Gerardo and B. T. Tanguilig III,” Enhanced Initial Centroids for K-means Algorithm” I.J. Information Technology and Computer Science, 2017, 1, 26-33

[17]Jinshan Xiea and Liqun Qi, ”Spectral directed hypergraph theory via tensors” Linear and Multilinear Algebra, 2015.

[18]S.P. Algur and P. Bhat, “Web Video Mining : Metadata Predictive Analysis Using Classification Techniques” I.J. Information Technology and Computer Science, 2016, 2, 69-77.