Notification: Our email services are now fully restored after a brief, temporary outage caused by a denial-of-service (DoS) attack. If you sent an email on Dec 6 and haven't received a response, please resend your email.
CFP last date
20 December 2024
Reseach Article

Image Similarity Measurement using Shape Feature

Published on September 2015 by Shweta R. Patil, V.s. Patil
National Conference on Advances in Communication and Computing
Foundation of Computer Science USA
NCACC2015 - Number 1
September 2015
Authors: Shweta R. Patil, V.s. Patil
af543ba9-8679-4229-a863-021598a52a82

Shweta R. Patil, V.s. Patil . Image Similarity Measurement using Shape Feature. National Conference on Advances in Communication and Computing. NCACC2015, 1 (September 2015), 6-9.

@article{
author = { Shweta R. Patil, V.s. Patil },
title = { Image Similarity Measurement using Shape Feature },
journal = { National Conference on Advances in Communication and Computing },
issue_date = { September 2015 },
volume = { NCACC2015 },
number = { 1 },
month = { September },
year = { 2015 },
issn = 0975-8887,
pages = { 6-9 },
numpages = 4,
url = { /proceedings/ncacc2015/number1/22321-3010/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Advances in Communication and Computing
%A Shweta R. Patil
%A V.s. Patil
%T Image Similarity Measurement using Shape Feature
%J National Conference on Advances in Communication and Computing
%@ 0975-8887
%V NCACC2015
%N 1
%P 6-9
%D 2015
%I International Journal of Computer Applications
Abstract

In this paper, we describe an incipient method for image retrieval predicated on the local invariant shape feature, designated scalable shape context. The feature utilizes the Harris-Laplace corner to locat the fix points and coinside scale in the animal and flower image. Then, we utilize shape context to explain the local shape. Correspondence of feature points is achieved by a weighted bipartite graph matching algorithm and the homogeneous attribute between the query and the indexing image is presented by the match cost. The practical results show that our method is efficient than shape context and SIFT for the animal and flower image retrieval.

References
  1. C. T. Zahn and R. Z. Roskies. Fourier descriptors for plane closed curves. IEEE Transactions on Computers, 1972.
  2. C Teh, R Chin. On image analysis by the methods of moments. IEEE Transaction pattern analysis 1988, 10(4):254-266.
  3. C. Harris and M. Stephens. A combined corner and edge detector of the 4th alvey vusion conference, 1988, pp: 147-151.
  4. Jacobs C E. Fast multi-resolution image querying, proceeding of SIGGAPH, 1995,227-286 .
  5. F Mokhtarian, S Abbasi, L Kittler. Efficient and robust retrieval byshape content through curvature scale space. Processing international workshop on image databased and multi-media search 1996,pp:35-42.
  6. S Liao, M Pawlak. On image analysis by moments. IEEETransactions Pattern Analysis and Machine Intelligence,1996,18(3):254-266.
  7. S. Belongie, J. Malik, and J. Puzicha, Shape Matching and Object Recognition Using Shape Contexts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002,24 (24): 509-521.
  8. K Mikolajczyk, C Schmid. Scale& affine invariant interesting pointdetectors. International Journal of Computer Vision. 2004,60(1).
  9. Dong Liu, Xiaoyan Sun, Feng Wu, Shipeng Li, Ya Qin Zhang, Image compression with edge-based inpainting. IEEE Transactions on Circuits and Systems for Video Technology, 2007,17 (10), pp: 1273–1287.
  10. SongHai Zhang, Tao Chen, YiFei Zhang, ShiMin Hu and Ralph R . Martin. Vectorizing Cartoon Animations. IEEE Transactions on Visualization and Computer Graphics, 2009,15 (4).
  11. Yang Ping, Wang GuoZhao. Unbiased curvilinear structure extraction for cartoon images. Eighth International Symposium on Voronoi Diagrams in Science and Engineering, 2011, pp:220–227.
Index Terms

Computer Science
Information Sciences

Keywords

Local Invariant Shape Feature Key Points Graph Matching.