Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Deformable Object Matching Algorithm Using Fast Agglomerative Binary Search Tree Clustering
View through CrossRef
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.
Title: Deformable Object Matching Algorithm Using Fast Agglomerative Binary Search Tree Clustering
Description:
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.
Related Results
Clustering Analysis of Data with High Dimensionality
Clustering Analysis of Data with High Dimensionality
Clustering analysis has been widely applied in diverse fields such as data mining, access structures, knowledge discovery, software engineering, organization of information systems...
Adaptive Image Matching Using Discrimination of Deformable Objects
Adaptive Image Matching Using Discrimination of Deformable Objects
We propose an efficient image-matching method for deformable-object image matching using discrimination of deformable objects and geometric similarity clustering between feature-ma...
How suitable are clustering methods for functional annotation of proteins?
How suitable are clustering methods for functional annotation of proteins?
Abstract
The advent of affordable high-throughput genome sequencing has drastically expanded protein sequence databases, necessitating the development of computatio...
The Kernel Rough K-Means Algorithm
The Kernel Rough K-Means Algorithm
Background:
Clustering is one of the most important data mining methods. The k-means
(c-means ) and its derivative methods are the hotspot in the field of clustering research in re...
Hybrid Clustering Using N-Soft Set and Artificial Bee Colony for Digital Literacy
Hybrid Clustering Using N-Soft Set and Artificial Bee Colony for Digital Literacy
Introduction: Open and distance education requires a good level of digital literacy. Students in open and distance educatiom come from various ages and backgrounds, resulting in di...
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
Parallel density clustering algorithm based on MapReduce and optimized cuckoo algorithm
In the process of parallel density clustering, the boundary points of clusters with different densities are blurred and there is data noise, which affects the clustering performanc...
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
MR-DBIFOA: a parallel Density-based Clustering Algorithm by Using Improve Fruit Fly Optimization
<p>Clustering is an important technique for data analysis and knowledge discovery. In the context of big data, the density-based clustering algorithm faces three challenging ...
A Fast Pattern Matching Algorithm Based on Middle Characters of Pattern String
A Fast Pattern Matching Algorithm Based on Middle Characters of Pattern String
String pattern matching is one of the important string operation. At present, the pattern matching algorithm of strings mainly includes BF algorithm, KMP algorithm, and improved KM...