Next Article in Journal
A Symmetry Particle Method towards Implicit Non‐Newtonian Fluids
Next Article in Special Issue
Generalized Degree-Based Graph Entropies
Previous Article in Journal
Single Image Super-Resolution by Non-Linear Sparse Representation and Support Vector Regression
Previous Article in Special Issue
A Study on Immersion of Hand Interaction for Mobile Platform Virtual Reality Contents
Article Menu
Issue 2 (February) cover image

Export Article

Open AccessArticle
Symmetry 2017, 9(2), 25;

Deformable Object Matching Algorithm Using Fast Agglomerative Binary Search Tree Clustering

Department of Electronic Engineering, Inha University, Incheon 22212, Korea
Authors to whom correspondence should be addressed.
Received: 7 November 2016 / Revised: 5 January 2017 / Accepted: 4 February 2017 / Published: 10 February 2017
(This article belongs to the Special Issue Symmetry in Complex Networks II)
View Full-Text   |   Download PDF [3385 KB, uploaded 21 February 2017]   |  


Deformable objects have changeable shapes and they require a different method of matching algorithm compared to rigid objects. This paper proposes a fast and robust deformable object matching algorithm. First, robust feature points are selected using a statistical characteristic to obtain the feature points with the extraction method. Next, matching pairs are composed by the feature point matching of two images using the matching method. Rapid clustering is performed using the BST (Binary Search Tree) method by obtaining the geometric similarity between the matching pairs. Finally, the matching of the two images is determined after verifying the suitability of the composed cluster. An experiment with five different image sets with deformable objects confirmed the superior robustness and independence of the proposed algorithm while demonstrating up to 60 times faster matching speed compared to the conventional deformable object matching algorithms. View Full-Text
Keywords: content‐based image retrieval; image matching; deformable object; clustering content‐based image retrieval; image matching; deformable object; clustering

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Jeong, J.; Won, I.; Yang, H.; Lee, B.; Jeong, D. Deformable Object Matching Algorithm Using Fast Agglomerative Binary Search Tree Clustering. Symmetry 2017, 9, 25.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Symmetry EISSN 2073-8994 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top