The Pattern Recognition System Using the Fractal Dimension of Chaos Theory
- Author: Shon Young-Woo
- Publish: International Journal of Fuzzy Logic and Intelligent Systems Volume 15, Issue2, p121~125, 25 June 2015
In this paper, we propose a method that extracts features from character patterns using the fractal dimension of chaos theory. The input character pattern image is converted into time-series data. Then, using the modified Henon system suggested in this paper, it determines the last features of the character pattern image after calculating the box-counting dimension, natural measure, information bit, and information (fractal) dimension. Finally, character pattern recognition is performed by statistically finding each information bit that shows the minimum difference compared with a normalized character pattern database.
Fractal dimension , Modified Henon attractor , Chaos theory , Pattern recognition system , Image processing system
Chaos theory is the study of the irregular, unpredictable behavior of deterministic and nonlinear dynamical systems. Using a chaos interpretation allows us to evaluate the characteristics existing in a system’s status space, using a time-series, to extract the chaos characteristic understanding, these characteristics enable us to conduct a high-precision interpretation [1-4].
Therefore, this paper proposes a new method that extracts character features and recognizes characters using the fractal dimension of chaos theory; it precisely recognizes minute differences with a strange attractor created from the Henon system. This paper presents a high-precision character recognition system.
The same kind of difficulties are found in recognizing Hangul (Korean) characters, as are found in English word recognition because Hangul characters have a similar hierarchy graphemes are combined to form characters [5-7]. In order to solve the variability and ambiguity problems, statistical and structural methods have been mainly used in previous studies.
The proposed system first obtains the mesh, projection and cross-distance features from the character images. The features are converted into time-series data. Then, using the modified Henon system suggested in this paper, each character’s attractor for a standard Korean character set, KSC 5601, is reconstructed (Figure 1).
Henon’s Attractor is a discrete dynamical system in two dimensions. It was suggested by the French astronomer Michel Henon in 1976 as a simplified model for the dynamics of the Lorenz system . Because of its simplicity, it lends itself to computer studies and numerous other investigations. Moreover, the gently swirling, boomerang-like shape of the attractor that arises through the dynamics is aesthetically very appealing. This object is now known as the Henon attractor (Figure 2).
In a manner which we will specify, the Henon system leads from the one-dimensional dynamics of the quadratic transformation to multi-dimensional strange attractors.
The stretch-and-fold action of the Henon system occurs in two dimensions, with coordinates denoted by
xand y. The transformation, thus, is a plane transformation which operates just like one of the affine transformations from our paradigm . Explicitly, Henon suggested that a transformation is
aand bare adjustable parameters. An orbit of the system consists of a starting point ( x0, y0) and its iterated image; i.e.,
Similar to the logistic equation, these dynamics depend dramat ically on the choice of the constants
aand b, in addition to that of the starting point. For some parameters, almost all orbits tend to have a unique periodic cycle, while chaos seems to reign for other choices, Henon used the values a= 1.4 and b= 0.3.
The system extracts the first feature from the input character images, and the feature is converted into time-series data. Then, using the modified Henon system suggested in this paper, the character attractors are reconstructed; i.e.,
cf iis the first feature of the input character image. In addition, in the experiment, the following Modified Henon system parameters are adopted
a = 0.55 and b = 0.3
The best character attracters are reconstructed in this case (Figure 3).
The concept of a fractal dimension has inspired scientists to produce a host of interesting new work and fascinating speculations. Indeed, for a while, it seemed as if the fractal dimension would allow us to discover a new order in the world of complex phenomena and structures.
In this paper, in order to analyze the chaotic degree of each character’s attractor, the system obtains the last features of the character image after calculating the box-counting dimension, the natural measure, the information bit, information (fractal) dimension [8-10].
The box-counting dimension is related to the self-similarity dimension and is the most used measurement in all the sciences. The reason for its dominance lies in its easy and automatic computability by machine. It is straightforward to count boxes and to maintain statistics allowing dimensional calculation.
We place the structure on a regular mesh, with mesh, size
s(scaling factor), and simply count the number of grid boxes which contain some of the structure. This produces a number, say N. Since this number depends on our choice of s. we write N( s). Next, we make a log/log-diagram. We then try to fit a straight line to the plotted points of the diagram and measure its slope, D f. This number is the box-counting dimension (Eq. (4)).
where, scaling factor
To compute the box-counting dimension, we first find a rectangular region that contains the complete attractor. To overcome this shortcoming of the fractal dimension, boxes should be weighted according to how many times an orbit visits them. Consider an open subset
Bof a space Xin which an attractor lies; for example, a subset Bof a plane or the Euclidean three-dimensional space. Orbits that are typically observed in computer studies seem to densely fill up the attractor, eventually.
We can count the number of times an orbit
x0, x1, x2, ... ∈ Xenters subset B, and it is natural to assume that the percentage of all points in Bstabilizes as we perform more and more iterations. This percentage is called the natural measure, µ( B), for the system.
B( x, y) is a function which returns 1 or 0 to indicate whether xis in Bor not. In other words,
and is the number of points from the orbit
x0, x1, x2, ..., x nwhich fall in the set B.
The natural measure can be understood as a means of quantifying the mass of a portion of the attractor. The calculated result of the natural measure is shown in Figure 4.
The theoretical foundation was given by Claude Shannon in 1948. The logical approach would be to replace the simple box-count by a counting procedure in which each box is weighted according to its natural measure. Thus, places which the orbit passes through very frequently have a stronger impact on the calculation than boxes which the orbit rarely visits. In terms of a formula, we replace
log N( s) by
Here, the sum ranges over all
N( s) boxes B kof linear size sthat cover the attractor. The quantity I( s) specifies the amount of information necessary to specify a point of the attractor to within an accuracy of s; or, in other words, it is the information obtained in making a measurement that is uncertain by amount s. The calculated result of the information bit, I( s), is shown in Figure 5. The information dimension D Iis obtained in Eq. (8).
First, using modified the Henon system suggested in this paper, each character’s attractor for the standard Korean character set, KSC 5601, is reconstructed. Next, in order to analyze the chaotic degree of each character’s attractor, the system finds the last features of the character image after calculating the box-counting dimension, natural measure, information bit, information (fractal) dimension.
Even though calculating of the box-counting dimension for a character attractor in character recognition is very simple, it only determines whether the attractor exists in a fixed box size.
Thus, is very sensitive to noise and does not well reflect the characteristic information of the character. Therefore, after using the information dimension and information bit computed based on the natural measure, which shows the characteristic information of character, we do global and detailed classifications by means of a statistical method using the minimum distance value of the characteristic vector.
In the experiment, we adopted Henon system parameters (
a= 0.55, b= 0.3) to reconstruct the best character attractor and adopt the proper box-count size for seeking the best fractal dimension characteristic value, in behalf of high-precision character recognition from a character attractor. Further, we developed a strange attractor simulator in order to quantitatively discriminate the chaos status. With time-series data as analysis input, this simulator automatically reconstructed the attractor in state space and automatically calculated its dimension at high speed.
This paper proposed a new method which extracts character features and recognizes characters using the fractal dimension of chaos theory which accurately recognizes minute differences with a strange attractor created with the Modified Henon system. This paper implements a high-precision character recognition system.
Conflict of Interest
No potential conflict of interest relevant to this article was reported.
[Figure 1.] Proposed character recognition system.
[Figure 2.] Henon attractor.
[Figure 3.] Time series and attractors of a character image using the proposed system.
[Figure 4.] Natural measure.
[Figure 5.] Information bit.
[Figure 6.] Fractal dimension at s = 1/8.
[Figure 7.] Character recognition process for the proposed system.