COMPUTATION OF IMAGE SIMILARITY WITH TIME SERIES

Abstract
Searching for similar sequence in large database is an important task in temporal data mining. Similarity search is concerned with efficiently locating subsequences or whole sequences in large archives of sequences. It is useful in typical data mining applications and it can be easily extended to image retrieval. In this work, time series similarity analysis that involves dimensionality reduction and clustering is adapted on digital images to find similarity between them. The dimensionality reduced time series is represented as clusters by the use of K-Means clustering and the similarity distance between two images is found by finding the distance between the signatures of their clusters. To quantify the extent of similarity between two sequences, Earth Mover’s Distance (EMD) is used. From the experiments on different sets of images, it is found that this technique is well suited for measuring the subjective similarity between two images.

Authors
V. Balamurugan1 , K. Senthamarai Kannan2 and S. Selvakumar3
1Sri Vidya College of Engineering and Technology,2,3Manonmaniam Sundaranar University

Keywords
Similarity Search, Vector Quantization, Similarity Measures, Clustering, EMD
Published By :
ICTACT
Published In :
ICTACT Journal on Image and Video Processing
( Volume: 2 , Issue: 2 )
Date of Publication :
November 2011

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.