Linear Algorithm for Digital Euclidean Connected Skeleton
The skeleton is an essential shape characteristic providing a compact representation of the studied shape. Its computation on the image grid raises many issues. Due to the effects of discretization, the required properties of the skeleton - thinness, homotopy to the shape, reversibility, connectivity - may become incompatible. However, as regards practical use, the choice of a specific skeletonization algorithm depends on the application. This allows to classify the desired properties by order of importance, and tend towards the most critical ones. Our goal is to make a skeleton dedicated to shape matching for recognition. So, the discrete skeleton has to be thin - so that it can be represented by a graph -, robust to noise, reversible - so that the initial shape can be fully reconstructed - and homotopic to the shape. We propose a linear-time skeletonization algorithm based on the squared Euclidean distance map from which we extract the maximal balls and ridges. After a thinning and pruning process, we obtain the skeleton. The proposed method is finally compared to fairly recent methods.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
A programme to determine the exact interior of any connected digital picture
Region filling is one of the most important and fundamental operations in computer graphics and image processing. Many filling algorithms and their implementations are based on the Euclidean geometry, which are then tran…
KShapeNet: Riemannian network on Kendall shape space for Skeleton based Action Recognition
Deep Learning architectures, albeit successful in most computer vision tasks, were designed for data with an underlying Euclidean structure, which is not usually fulfilled since pre-processed data may lie on a non-linear…
Action RecognitionDeep LearningSkeleton Based Action RecognitionE2E-GNet: An End-to-End Skeleton-based Geometric Deep Neural Network for Human Motion Recognition
Geometric deep learning has recently gained significant attention in the computer vision community for its ability to capture meaningful representations of data lying in a non-Euclidean space. To this end, we propose E2E…
Offline signature authenticity verification through unambiguously connected skeleton segments
A method for offline signature verification is presented in this paper. It is based on the segmentation of the signature skeleton (through standard image skeletonization) into unambiguous sequences of points, or unambigu…
Dynamic Time WarpingSkelite: Compact Neural Networks for Efficient Iterative Skeletonization
Skeletonization extracts thin representations from images that compactly encode their geometry and topology. These representations have become an important topological prior for preserving connectivity in curvilinear str…
BenchmarkingComputational Efficiency