Work place: Department of Computer Engineering, K. K. Wagh Institute of Engineering Education & Research, Nashik Savitribai Phule Pune University, Maharashtra, India
E-mail: smkamalapur@kkwagh.edu.in
Website:
Research Interests: Computational Science and Engineering, Computational Engineering, Computer systems and computational processes
Biography
Dr. Snehal M. Kamalapur is currently working as associate professor in department of Computer Engineering at K. K. Wagh Institute of Engineering Education and Research, Nashik, MS, India. She pursued her Computer Engineering from Walchand institute of Technology, Shivaji University in 1992. She has earned a Master of Computer Engineering from Pune Institute of Computer Technology, Pune. She holds a doctorate in Computer Engineering from Saitribai Phule pune University. She has 20 years of teaching experience at undergraduate and postgraduate level. She has also developed study material for distance course at WAWASAN Open University, Malaysia. She has copyright and 55 papers to her credit, which are published at various national and international Journals and conferences. She is contributing as reviewer, Session Chair & committee member to various International conferences and Journals.
By Sandhya V. Kawale S. M. Kamalapur
DOI: https://doi.org/10.5815/ijitcs.2017.12.05, Pub. Date: 8 Dec. 2017
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.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals