The concept of a simple point is well known in digital topology: a black point in a binary picture is called a simple point if its deletion preserves topology. This paper introduces the notion of a simplifier point: a...
详细信息
ISBN:
(纸本)9783319591087;9783319591070
The concept of a simple point is well known in digital topology: a black point in a binary picture is called a simple point if its deletion preserves topology. This paper introduces the notion of a simplifier point: a black point in a binary picture is simplifier if it is simple, and its deletion turns a non-simple border point into simple. We show that simplifier points are line end points for both (8, 4) and (4, 8) pictures on the square grid. Our result makes efficient implementation of endpoint-based topology-preserving 2D thinning algorithms possible.
Among the many handwritten character recognition algorithms that have been proposed, few of them use models which are able to simulate handwriting. This can be explained by the fact that simulations require the estima...
详细信息
ISBN:
(纸本)0819433020
Among the many handwritten character recognition algorithms that have been proposed, few of them use models which are able to simulate handwriting. This can be explained by the fact that simulations require the estimation of strokes starting from statistic images of letters, while crossing and overlapping strokes make this estimation difficult. In this paper an algorithm to extract overlapping strokes that optimizes the reconstruction of crossings of the image is describes, and a stochastic model of off-line handwritten letter deformation for handwritten letter recognition is presented.
This paper proposes a new structural technique for Arabic text recognition. The technique can be divided into five major steps: (1) preprocessing and binarization;(2) thinning;(3) binary tree construction;(4) segmenta...
详细信息
This paper proposes a new structural technique for Arabic text recognition. The technique can be divided into five major steps: (1) preprocessing and binarization;(2) thinning;(3) binary tree construction;(4) segmentation;and (5) recognition. The advantage of this technique is that its execution does not depend on either the font or size of character. Thus, this same technique might be utilized for the recognition of machine or hand printed text. The relevant algorithm is implemented on a microcomputer. Experiments were conducted to verify the accuracy and the speed of this algorithm using about 20,000 subwords each with an average length of 3 characters. The subwords used were written using different fonts. The recognition rate obtained in the experiments indicated an accuracy of 93.38% with a speed of 2.7 characters per second.
Topology preservation is a crucial issue in parallel reductions that transform binary pictures by changing only a set of black points to white at a time. In this paper, we present sufficient conditions for topology-pr...
详细信息
Topology preservation is a crucial issue in parallel reductions that transform binary pictures by changing only a set of black points to white at a time. In this paper, we present sufficient conditions for topology-preserving parallel reductions on the three types of pictures of the unconventional 3D face-centered cubic (FCC) grid. Some conditions provide methods of verifying that a given parallel reduction always preserves the topology, and the remaining ones directly provide deletion rules of topology-preserving parallel reductions, and make us possible to generate topologically correct thinning algorithms. We give local characterizations of P-simple points, whose simultaneous deletion preserves the topology, and the relationships among the existing universal sufficient conditions for arbitrary types of binary pictures and our new FCC-specific results are also established.
This paper presents the method of understanding objects that can be considered as thin objects. The proposed method of understanding thin objects is part of the shape understanding method developed by the author. The ...
详细信息
This paper presents the method of understanding objects that can be considered as thin objects. The proposed method of understanding thin objects is part of the shape understanding method developed by the author. The main novelty of the presented method is that the process of understanding thin objects is related to the visual concept represented as a symbolic name of the possible class of shapes. The possible classes of shape, viewed as hierarchical structures, are incorporated into the shape model. At each stage of the reasoning process that led to assigning of an examined object to one of the possible classes, novel processing methods are used. These methods are very efficient because they deal with a very specific class of shapes. In this paper, the 2-D objects that are classified as thin objects are regarded as geometrical objects without any reference to the real world objects. However, the shape under standing method is designed to understand an object at many levels of interpretation, such as the topological level, the linguistic level and the real world reference level. This approach influences the way in which the system of shape understanding is designed. The system consists of different types of experts that perform different processing and reasoning tasks.
To improve the spatial resolution of solid-state nanopores, thinning the membrane is a very important issue. The most commonly used membrane material for solid-state nanopores is silicon nitride (Si3N4). However, unti...
详细信息
To improve the spatial resolution of solid-state nanopores, thinning the membrane is a very important issue. The most commonly used membrane material for solid-state nanopores is silicon nitride (Si3N4). However, until now, stable wafer-scale fabrication of Si3N4 membranes with a thickness of less than 5 nm has not been reported, although a further reduction in thickness is desired to improve spatial resolution. In the present study, to fabricate thinner Si3N4 membranes with a thickness of less than 5 nm in a wafer, a new fabrication process that employs a polycrystalline-Si (poly-Si) sacrificial layer was developed. This process enables the stable fabrication of Si3N4 membranes with thicknesses of 3 nm. Nanopores were fabricated in the membrane using a transmission electron microscope (TEM) beam. Based on the relationship between the ionic current through the nanopores and their diameter, the effective thickness of the nanopores was estimated to range from 0.6 to 2.2 nm. Moreover, DNA translocation through the nanopores was observed.
One of the severe problems in a fingerprint-based system is retaining the fingerprint images. In this paper, we propose a method to minimize the fingerprint images size and retain the reference points. The method is d...
详细信息
One of the severe problems in a fingerprint-based system is retaining the fingerprint images. In this paper, we propose a method to minimize the fingerprint images size and retain the reference points. The method is divided into three parts, the first part is about digital image preprocessing that allows us to eliminate the noise, improve the image, convert it into a binary image, detect the skeleton and locate the reference point. The second part concerns the detection of critical points by the Douglas-Peucker method. The final part presents the methodology for the fingerprint curves reconstruction using the fractal interpolation curves. The experimental result shows the accuracy of this reconstruction method. The relative error (ER) is between 2.007% and 5.627% and the mean squared error (MSE) is between 0.126 and 0.009 at a small iterations number. On the other hand, for a greater number of iterations, the ER is between 0.415% and 1.64% and MSE is between 0.000124 and 0.0167. This clearly indicates that the interpolated curves and the original curves are virtually identical and exceedingly close.
A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for...
详细信息
A reduction transforms a binary picture only by changing some black points to white ones, which is referred to as deletion. Sequential reductions traverse the black points of a picture, and consider a single point for possible deletion, while parallel reductions can delete a set of black points simultaneously. Two reductions are called equivalent if they produce the same result for each input picture. A deletion rule is said to be equivalent if it yields a pair of equivalent parallel and sequential reductions. This paper introduces a class of equivalent deletion rules that allows us to establish a new sufficient condition for topology-preserving parallel reductions in arbitrary binary pictures. In addition we present a method of verifying that a deletion rule given by matching templates is equivalent, a necessary and sufficient condition for order-independent deletion rules, and a sufficient criterion for order-independent and translation-invariant parallel subfield-based algorithms.
暂无评论