Deformable Object Matching Algorithm Using Fast Agglomerative Binary Search Tree Clustering

作者：Jeong Jaehyup; Won Insu; Yang Hunjun; Lee Bowon^*; Jeong Dongseok^*

来源：Symmetry-Basel, 2017, 9(2): 25.

DOI：10.3390/sym9020025

• content-based image retrieval
• image matching
• deformable object
• clustering

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.

• 出版日期2017-2