Digital Character Research Articles

Feature-preserving thinning algorithm for optical character recognition

We propose an improved thinning algorithm. Basically, the algorithm uses a 3×3 window to accommodate an eight-neighbor skeleton in each thinning iteration. This algorithm overcomes many thinning problems, such as Y-shaped distortions, spiky skeletons, and skeleton shortening, and thus preserves precise features of digital character patterns. By using this thinning algorithm, better structural features of a character pattern can be provided to an optical character recognition system, such that accurate recognition results can be achieved.

Data compression on multifont Chinese character patterns

The problems arising in the modeling and coding of digital Chinese character patterns for noiseless compression purposes are discussed. The modeling is intended to capture the maximum redundancies of the source under the consideration of relevant parameters. In this study, a redundancy-gathering algorithm is proposed in which a 2-D parsing tree is used, and the nodes to extend the tree are ranked according to the maximum redundancy gathered. Hence, the modeling represented by the tree can achieve great performance in the small number of nodes. The algorithm is then applied to evaluate the performance of arithmetic coding for digital Chinese character patterns. The results are compared to those of the traditional compression methods. In the same complexity, the authors find that their algorithm can improve the coding efficiency as high as 25.54%, 30.23%, 32.17%, 15.90%, and 27.58%, for five Chinese fonts, respectively.

Design and Evolution of the A72 Digital Character Generator

Design and Evolution of the A72 Digital Character Generator

Global study on data compression techniques for digital Chinese character patterns

Dot matrix representation of Chinese characters is the most popular method used, however, it requires a relatively large memory for the storage of Chinese character patterns. For the purpose of a global study, various data compression techniques are investigated to determine the method that requires the least amount of memory for data storage. The entropy of Chinese character patterns preprocessed using the two-dimensional prediction algorithm shows the best results and appears almost independent of the subblock resolutions of m*n. Therefore, a possible bound of data compression for Chinese character patterns can be predicted. The data compression technique involving two-dimensional prediction preprocessing as well as arithmetic coding for subblock symbols is found to be capable of achieving the best compression results for the 13051 Chinese character patterns with various fonts in different resolutions. >

Data compression techniques for Chinese character patterns

Abstract In this study, a general compression model of digital Chinese character patterns is proposed. Based on this model, several coding techniques are investigated to achieve the best compression ratio among the comparative results. Then, the expanding and shrinking operations by coordinate transform are investigated and improved, in which the mathematical morphology and discrete cosine transform (DCT) are proposed to improve the zig‐zag phenomena in expanding operation and achieve gray‐level patterns in a very low resolution, respectively.

Zooming techniques on digital Chinese character patterns: a further study and improvement

Two techniques for both zooming and smoothing digital Chinese character patterns are presented. In this paper, zooming by Discrete Cosine Transform (DCT) technique is proposed for achieving binary and grey-level digital character patterns in different resolutions. Where the grey-level character patterns are shrunk in a lower resolution of 12∗12 pixels this can be achieved in a monitor display more clearly than those shrunk by traditional zooming techniques; while zig-zag phenomena appeared equally in the character patterns, expanded by both zooming techniques. Then, a smoothing technique using morphological operations is proposed to smooth the zig-zag patterns expanded by traditional zooming techniques. Therefore, zig-zag phenomena can be substantially alleviated, and high quality character patterns can be produced.

Character scaling by contour method

Advancement in digital-image processing hardware has given the printing industry novel facilities for capturing fonts and has provided new grounds for character scaling, which is an important issue in typesetting and graphical text. An algorithm for digital character scaling by a contour method is developed and implemented. The algorithm is based on scaling the contour of the character through a transformation. Cubic splines are used to interpolate the discrete samples of the contour character. Final results show no jaggies. The algorithm is applied to Arabic fonts and compared to two other algorithms: replication and telescoping template. The superior performance of the contour method is attributed to the cubic spline fitting, which gives better smoothness to the edge of the character.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

A method of processing digital character noise

Based on the recognition requirement to suppress types of noise created in the conversion process of handwritten characters into binary patterns in our optical character recognition, an algorithm of processing digital character noise is presented. The software and hardware of the algorithm is described.

An imaging problem: Restoration of blurred digital character

An imaging problem: Restoration of blurred digital character

Digital dynamics and the simulation of magnetic systems

This paper investigates the problems associated with simulating many-body systems with finite-state machines such as computers. It is shown that the digital (discrete) character of time brings in features which are not encountered in the usual analytical studies using continuous time. This is illustrated with a thorough study of the dynamics of simple magnetic systems with competing interactions. Whereas continuous dynamics, as derived from the usual master-equation approach, yields asymptotic behavior which is time independent, dynamics in digital time can lead to complex behavior characterized by the existence of multiple basins of attraction, broken symmetries, oscillations, and chaos. These results might provide a dynamical explanation for the breakdown of ergodicity which has been reported in Monte Carlo studies of spin-glasses.

Character generator systems for broadcast television

The different kinds of written message which appear as part of television programmes are distinguished, and their requirements in terms of numbers of typefaces and character sizes listed. The history of electronic character generation on broadcast television is briefly summarised, and the types of system in current use in the UK reviewed. The ways in which digital character shape descriptions for television are made at the present time are described and discussed. A case is argued for the direct design of character shapes, rather than the use of processes which translate into television formats character shapes originally intended for other media.

Low-cost integrator with digital character

Low-cost integrator with digital character