The talk deals with grouping of edges to contours of shapes using only local symmetry and continuity. Shape skeletons are used to generate the search space for a version of the Markov Chain Monte Carlo approach utilizing particle filters to find the most likely skeleton. Intuitively this means that grouping of edge segments is performed by walking along the skeleton. The particle search, which ...

We propose an algorithm to find piecewise linear skeletons of hand-written characters by using principal curves. The development of the method was inspired by the apparent similarity between the definition of principal curves (smooth curves which pass through the “middle” of a cloud of points) and the medial axis (smooth curves that go equidistantly from the contours of a character image). The ...

This paper presents a method for computing the skeleton of planar shapes and objects which exhibit sparseness (lack of connectivity), within their image regions. Such sparseness in images may occur due to poor lighting conditions, incorrect thresholding or image subsampling. Furthermore, in document image analysis, sparse shapes are characteristic of texts faded due to aging and/or poor ink qua...

a detailed description of the osteological structure of kiabi loach ( oxynoemacheilus kiabii ), a recently described endemic species caught from gamasiab river, iran, is provided. seven specimens were collected by electrofishing in june 2013 and cleared and stained and its osteological structures were described. the results showed that o. kiabii can be distinguished from other members of the ge...

Thinning is a very important preprocessing step for many image analysis operations, such as optical character recognition and fingerprint recognition. The main drawbacks of traditional thinning algorithms are low speed and serious deformation. To remedy these problems, a novel approach which generates the skeletons of binary patterns via block decomposition and contour vector matching is propos...

This paper presents a new method for computing the shape skeleton of planar objects in presence of noise occurring inside the image regions. Such noise may be due to poor control of lighting conditions, incorrect thresholding or image subsampling. Binary images of objects with such noise exhibit sparseness (lack of connectivity), within their image regions. Such non-contiguity may also be obser...

This paper describes a binary image representation scheme, which is called Image Block Representation and presents a new skeletonization algorithm, which is fast implemented on block represented binary images. The main purpose of the Image Block Representation is to provide an efficient binary image representation that permits the execution of operations on image areas instead of image points. ...

In binary tomography, the goal is to reconstruct binary images from a small set of their projections. However, especially when only two projections are used, the task can be extremely underdetermined. In this paper, we show how to reduce ambiguity by using the morphological skeleton of the image as a priori. Three different variants of our method based on Simulated Annealing are tested using ar...

Large structuring elements are used in many morphological transformations. They are needed when computing size distributions, in filtering operators (and especially in alternate sequential filters), for regularised gradients and large top-hat transforms, for residual operators (skeletons by openings, critical balls, ultimate openings and so on). Moreover, in some applications, images are large ...