Abstract
This paper presents a novel distance measure, the Minimum Landscape Distance (MLD). MLD is a warping distance measure that provides a non-linear mapping between the elements in one sequence to those of another. Each element in one sequence is mapped to that with the highest neighborhood structural similarity (landscape) in the other sequence within a window. Different window sizes are tested on a number of datasets and a linear relationship between the window size and the sequence size is discovered. Experimental results obtained on the Kimia-99 and Kimia-216 datasets show that MLD is superior to the Euclidean, correlation, and Dynamic Time Warping (DTW) distance measures.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Duda, R.O., Hart, P.E.: Pattern Classification and Scene Analysis. Wiley, New York (1973)
Gonzalez, R.C., Woods, R.E.: Digital Image Processing. Addison-Wesley, Reading (1992)
Sakoe, H., Chiba, S.: Dynamic programming algorithm optimization for spoken word recognition. IEEE Trans. Acoust. Speech and Signal Process 26, 43–49 (1978)
Sebastian, T.B., Kimia, B.B.: Curves vs. skeletons in object recognition. In: International Conference on Image Processing, pp. 22–25 (2001)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ebrahim, Y., Ahmed, M., Chau, SC., Abdelsalam, W. (2008). Shape Matching Using a Novel Warping Distance Measure. In: Campilho, A., Kamel, M. (eds) Image Analysis and Recognition. ICIAR 2008. Lecture Notes in Computer Science, vol 5112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69812-8_46
Download citation
DOI: https://doi.org/10.1007/978-3-540-69812-8_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69811-1
Online ISBN: 978-3-540-69812-8
eBook Packages: Computer ScienceComputer Science (R0)