Skeleton-Based Shape Classification Using Path Similarity
نویسندگان
چکیده
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, especially when the variability is structural or due to articulation. It is well-known that shape representation based on skeletons is superior to contour based representation in such situations. However, approaches to shape similarity based on skeletons suffer from the instability of skeletons, and matching of skeleton graphs is still an open problem. Using a new skeleton pruning method, we are able to obtain stable pruned skeletons even in the presence of significant contour distortions. We also propose a new method for matching of skeleton graphs. In contrast to most existing methods, it does not require converting of skeleton graphs to trees and it does not require any graph editing. Shape classification is done with Bayesian classifier. We present excellent classification results for complete shapes.
منابع مشابه
Shape Classification Based on Skeleton Path Similarity
Most of the traditional methods for shape classification are based on contour. They often encounter difficulties when dealing with classes that have large nonlinear variability, especially when the variability is structural or due to articulation. It is well-known that shape representation based on skeletons is superior to contour based representation in such situations. However, approaches to ...
متن کاملExtended Investigations on Skeleton Graph Matching for Object Recognition
Shape similarity estimation of objects is a key component in many computer vision systems. In order to compare two shapes, salient features of a query and target shape are selected and compared with each other, based on a predefined similarity measure. The challenge is to find a meaningful similarity measure that captures most of the original shape properties. One well performing approach calle...
متن کاملSkeleton Graph Matching Based on Critical Points Using Path Similarity
This paper proposes a novel graph matching algorithm based on skeletons and applies it to shape recognition based on object silhouettes. The main idea is to match the critical points (junction points and end points) on skeleton graphs by comparing the geodesic paths between end points and junction points of the skeleton. Our method is motivated by the fact that junction points can carry informa...
متن کامل3D Shape Matching Using Skeleton Graphs
We describe a method to match 3D polygonal geometry models using their internal skeleton graphs. These graphs carry information about the overall shape of the model. In order to make assumptions about the similarity of the 3D models, we search for the biggest common subgraph. As internal skeleton graphs normally do not consist of many edges, the problem of exponential time complexity due to NP ...
متن کاملA similarity-based approach for shape classification using Aslan skeletons
Shape skeletons are commonly used in generic shape recognition as they capture part hierarchy, providing a structural representation of shapes. However, their potential for shape classification has not been investigated much. In this study, we present a similarity based approach for classifying 2D shapes based on their Aslan skeletons [1, 2]. The coarse structure of this skeleton representation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJPRAI
دوره 22 شماره
صفحات -
تاریخ انتشار 2008