Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleMetrics
Research Article · Free to read · Published 3 December 2013

SHAPE RETRIEVAL THROUGH MAHALANOBIS DISTANCE WITH SHORTEST AUGMENTING PATH ALGORITHM

S. Muruganathan1, N. Devarajan1, D. Chitra1 & T. Manigandan1

Journal of Computer Science, Volume 10, Issue 4, pp. 552–562 · doi.org/10.3844/jcssp.2014.552.562

6,856 accesses5,787 downloads1 citations (Crossref)Metrics
Cite Check for updates

Abstract

Shape matching and object recognition plays an vital role in the computer vision. The shape matching is difficult in case of the real world images like mpeg database images since the real world images has the internal and external contours. The Mahalanobis distance based shape context approach is proposed to measure similarity between shapes and exploit it for shape retrieval. The process of shape retrieval identifies the relevant shapes from the data base for the query images. The query image matched with the reference images and it gives the dissimilarity between the shapes. This dissimilarity measures used to identify the relevant images from the databases. The dissimilarity is distance between the two images. The shape matching has the three major steps that are finding correspondence, measusring distance and the applying allinging transformation. The finding correspondence is find the best matching point between the query image and the reference image, The correspondence is solved by the shape context with Shortest augmenting path algorithm. The measuring distance is used to find the distance between the corresponding point. In this study, Mehalanobis distance is used to find the distance between the images. The alligning transformation is used to allign the shapes in order to achieve the best matching point. Object recognition is achieved by the k-nearest neighbor algorithm. The proposed method is simple, invariant to noise and gives better error rate compared to the existing methods.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2014 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Muruganathan, S., Devarajan, N., Chitra, D. & Manigandan, T. (2014). SHAPE RETRIEVAL THROUGH MAHALANOBIS DISTANCE WITH SHORTEST AUGMENTING PATH ALGORITHM. Journal of Computer Science, 10(4), 552–562. https://doi.org/10.3844/jcssp.2014.552.562

Licence
© Science Publications
Issue
Volume 10, Issue 4
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
SHAPE RETRIEVAL THROUGH MAHALANOBIS DISTANCE WITH SHORTEST AUGMENTING PATH ALGORITHMJournal of Computer Science · Volume 10, Issue 4 · pp. 552–562 · © Science PublicationsDownload