A robust parallel thinning algorithm for pattern recognition

Tarábek, Peter

doi:10.1109/saci.2012.6249979

Cited by 13 publications

(3 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Как установлено в [4], основными недостатки алгоритма ZS являются размытие диагональных линий толщиной 2 пикселя и удаление областей размером 2х2 пикселей. Для устранения данных недостатков и развития алгоритма ZS предложены следующие его модификации: изменение порогового значения в первом логическом условии [4]; изменение логических условий на втором шаге [5]; расширение набора логических условий на первом и втором шагах [6][7][8][9][10] в сочетании с масками [10]; обработка скелетов после применения алгоритма ZS с использованием дополнительных логических условий [11][12][13][14], расширенных прямоугольной [11] и квадратных [13] масок, измененного порогового значения в первом логическом условии [14]; предварительная обработка скелета перед алгоритмом ZS с использованием дополнительных логических условий [15]. Повышение качества скелетов в этих модификациях достигается за счет роста вычислительной сложности.…”

Section: Introductionunclassified

“…Повышение качества скелетов в этих модификациях достигается за счет роста вычислительной сложности. Некоторые из рассмотренных алгоритмов ориентированы на обработку специфических изображений: сканированных символов [2,4,8,[11][12][13][14][15], топологических схем [10], отпечатков пальцев [5]. Целью работы является предельное утоньшение и повышение устойчивости к контурному шуму скелетов бинарных объектов произвольной формы при сохранении высокой скорости скелетизации.…”

Section: Introductionunclassified

See 1 more Smart Citation

Two-step skeletization of binary images based on the Zhang-Suen model and the producing mask

Ма

Цветков

Конопелько

2021

Sist. anal.i prikl. inform.

View full text Add to dashboard Cite

The aim of the work is to limit excessive thinning and increase the resistance to contour noise of skeletons resulted from arbitrary binary image shape while maintaining a high skeletonization rate. The skeleton is a set of thin lines, the relative position, the size and shape, which conveys information of size, shape and orientation in space of the corresponding homogeneous region of the image. To ensure resistance to contour noise, skeletonization algorithms are built on the basis of several steps. Zhang-Suen algorithm is widely known by high-quality skeletons and average performance, which disadvantages are the blurring of diagonal lines with a thickness of 2 pixels and the totally disappear patterns of 2x2 pixels. To overcome them, a mathematical model that compensates the Zhang-Suen algorithm has proposed in this paper, along with a producing mask and two logical conditions for evaluating its elements.

show abstract

Section: Introductionunclassified

Two-step skeletization of binary images based on the Zhang-Suen model and the producing mask

Ма

Цветков

Конопелько

2021

Sist. anal.i prikl. inform.

View full text Add to dashboard Cite

show abstract

“…Rule-based thinning applies the thinning templates iteratively to remove the contour points until the unit-width skeleton is obtained. In accordance with the operating manner, rule-based thinning algorithms can be further divided into sequential [6] and parallel [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25][26] thinning. For the sequential thinning, the thinning operation of a contour point depends on its neighboring points' thinning results.…”

Section: Introductionmentioning

confidence: 99%

Pattern Reconstructability in Fully Parallel Thinning

Chen

Chao

2017

J. Imaging

View full text Add to dashboard Cite

It is a challenging topic to perform pattern reconstruction from a unit-width skeleton, which is obtained by a parallel thinning algorithm. The bias skeleton yielded by a fully-parallel thinning algorithm, which usually results from the so-called hidden deletable points, will result in the difficulty of pattern reconstruction. In order to make a fully-parallel thinning algorithm pattern reconstructable, a newly-defined reconstructable skeletal pixel (RSP) including a thinning flag, iteration count, as well as reconstructable structure is proposed and applied for thinning iteration to obtain a skeleton table representing the resultant thin line. Based on the iteration count and reconstructable structure associated with each skeletal pixel in the skeleton table, the pattern can be reconstructed by means of the dilating and uniting operations. Embedding a conventional fully-parallel thinning algorithm into the proposed approach, the pattern may be over-reconstructed due to the influence of a biased skeleton. A simple process of removing hidden deletable points (RHDP) in the thinning iteration is thus presented to reduce the effect of the biased skeleton. Three well-known fully-parallel thinning algorithms are used for experiments. The performances investigated by the measurement of reconstructability (MR), the number of iterations (NI), as well as the measurement of skeleton deviation (MSD) confirm the feasibility of the proposed pattern reconstruction approach with the assistance of the RHDP process.

show abstract