Proposed heuristic procedures to preprocess character patterns using line adjacency graphs

doi:10.1016/0031-3203(95)00141-7

Pattern Recognition

Volume 29, Issue 6, June 1996, Pages 951-975

https://doi.org/10.1016/0031-3203(95)00141-7 Get rights and content

Abstract

Heuristic procedures are proposed to remove noise from character patterns. The procedures use line adjacency graphs (LAGs) of two types: white and black. Our proposed white LAGs are an extension of the well-known black LAGs. Furthermore, we refine the procedure to condense black LAGs into different types of nodes, the types of node depending on the local configuration of the pattern at that node. Finally, specialized procedures are developed to skeletonize the different types of nodes, which in turn skeletonize the full pattern. Experiments demonstrate that our noise removal and skeletonization procedures are robust and fast. Our results compare favorably with those of established algorithms.

References (18)

J. Mukherjee et al.
Thinning of 3-D images using the safe point thinning algorithm (SPTA)
Pattern Recognition Lett.
(September 1989)
N.J. Naccache et al.
An investigation into the skeletonization algorithm of Hilditch
Pattern Recognition
(1984)
P.K. Saha et al.
A single scan boundary removal thinning algorithm for 2-D binary object
Pattern Recognition Lett.
(March 1993)
R.M. Brown et al.
Handprinted symbol recognition system
Pattern Recognition
(1988)
C. Arcelli et al.
A width-independent fast thinning algorithm
IEEE Trans. Pattern Anal. Mach. Intell.
(July 1985)
H. Beffert et al.
Skeletonizing binary patterns on the homogeneous multiprocessor
Int. J. Pattern Recognition Mach. Intell.
(July 1989)
B.K. Jang et al.
One-pass parallel thinning: analysis, properties, and quantitative evaluation
IEEE Trans. Pattern Anal. Mach. Intell.
(November 1992)
S. Kahan et al.
On the recognition of printed characters of any font and size
IEEE Trans. Pattern Anal. Mach. Intell.
(March 1987)
N.J. Naccache et al.
SPTA: A proposed algorithm for thinning binary patterns
IEEE Trans. Syst. Man Cybernet.
(Ma//J/ne 1)

There are more references available in the full text version of this article.

Cited by (5)

Shape skeletonization by identifying discrete local symmetries
2001, Pattern Recognition
This paper presents a new skeletonization method based on a novel concept — discrete local symmetry. A skeleton obtained from discrete local symmetries approaches the skeleton of the underlying continuous shape if the sampling is dense enough. Discrete local symmetries can be obtained by computing the constrained Delaunay triangulation of the underlying image. Internal triangles of a triangulation are divided into isolated triangles, end triangles, normal triangles and junction triangles. A discrete local symmetry corresponds to an isolated triangle, or an end triangle, or a normal triangle. Several measures are taken to remove skeletonization artifacts and suppress image noise. The proposed method can produce correct centre lines and junctions. It is efficient and robust against noise. The method is suitable for skeletonizing high-resolution images.
Extraction of strokes in handwritten characters
2000, Pattern Recognition
Among the many handwritten character recognition algorithms that have been proposed in the past few years, few of them use models which are able to simulate handwriting. This can be explained by the fact that simulation models require the estimation of strokes starting from statistic images of letters, while crossing and overlapping strokes make this estimation difficult. The approach we suggest is to efficiently deal with crossing areas and overlaps using parametric representations of lines and thickness of stroke: a probabilistic model of strokes is described to extract non-overlapping strokes of the image. A bayesian approach using a statistical study and a model of stroke crossing is described that optimizes the reconstruction of crossings and permits to characterize image of letters by robust graphs of curves.
OPTICAL MUSIC RECOGNITION: STATE OF THE ART AND MAJOR CHALLENGES
2020, arXiv
Boon and bane of curvelet transform
2010, Communications in Computer and Information Science
Surface modeling
2009, Advanced Imaging in Biology and Medicine: Technology, Software Environments, Applications

View full text

Proposed heuristic procedures to preprocess character patterns using line adjacency graphs

Abstract

Pattern Recognition Lett.

Pattern Recognition

Pattern Recognition Lett.

Pattern Recognition

A width-independent fast thinning algorithm

IEEE Trans. Pattern Anal. Mach. Intell.

Skeletonizing binary patterns on the homogeneous multiprocessor

Int. J. Pattern Recognition Mach. Intell.

One-pass parallel thinning: analysis, properties, and quantitative evaluation

IEEE Trans. Pattern Anal. Mach. Intell.

On the recognition of printed characters of any font and size

IEEE Trans. Pattern Anal. Mach. Intell.

SPTA: A proposed algorithm for thinning binary patterns

IEEE Trans. Syst. Man Cybernet.