Deformable Object Matching Algorithm Using Fast Agglomerative Binary Search Tree 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.
منابع مشابه
Efficient Clustering and Matching for Object Class Recognition
In this paper we address the problem of building object class representations based on local features and fast matching in a large database. We propose an efficient algorithm for hierarchical agglomerative clustering. We examine different agglomerative and partitional clustering strategies and compare the quality of obtained clusters. Our combination of partitional-agglomerative clustering give...
متن کاملTwo tree - formation methods and fast pattern search using nearestneighbor and nearest
4 This paper describes tree-based classiication of character images, comparing two methods of tree formation and two methods of matching: nearest neighbor and nearest centroid. The rst method, Preprocess Using Relative Distances (PURD) is a tree-based reorganization of a at list of patterns, designed to speed up nearest-neighbor matching. The second method is a variant of agglomerative hierarch...
متن کاملAn Efficient Agglomerative Clustering Algorithm for Region Growing
This paper proposes an eficient agglomerative clustering algorithm for region growing. To speed up the search of the best pair of segments which is merged into one segment, dissimilarity values of all possible pairs of segments are stored in a heap. Then the best pair can be found as the element of the root node of the binary tree corresponding to the heap. Since the only adjacent pairs of segm...
متن کاملCategorization via Agglomerative Correspondence Clustering
This paper presents computationally efficient object detection, matching and categorization via Agglomerative Correspondence Clustering (ACC). We implement ACC for feature correspondence and object-based image matching exploiting both photometric similarity and geometric consistency from local invariant features. Objectbased image matching is formulated here as an unsupervised multi-class clust...
متن کاملCreating Concept Hierarchies in an Information Retrieval System
Most information retrieval systems are comprised of a focused set of domain-specific documents located within a single logical repository. A mechanism is developed by which user queries against such a system are used to generate a concept hierarchy pertinent to the domain. First, an algorithm is described which extracts terms from documents matching user queries, and then reduces this set of te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Symmetry
دوره 9 شماره
صفحات -
تاریخ انتشار 2017