Observation Method for Mathematical Graphology
I<.Toraichi' T.Horiuchil R.Haruki2
'Inst. Info. Sci. and Elec. University of Tsukuba, Tsukuba, Ibaraki, 305 JAPAN
2Doctoral Program in Engineering, University of Tsukuba, Tsukuba, Ibaraki, 305 JAPAN
Abstract
In this paper, an observation method for mathe-
matical graphology is proposed. The motivatzon of
the mathematical graphology is to realzte the informa-
tion processing b y graphologists on a machine. Fur-
thermore, the mathematical graphology aims to con-
struct new znformation theoy for vzsual communica-
tion. In order to construct the mathematical model,
as the first step, this paper focused on the observation
process whzch as the first stage an the model. Based
on the saccade phenomena an physiological aspeci, f e a -
ture points which anclude important information are
extracted. Then, contours between adjacent feature
points are approxamated b y using smooth functions.
The performance of i h e proposed method is verified by
experiments.
1 Introduction
Graphology is a science to extract a person's char-
acter from his/her handwriting [l]. Everybody has
a peculiar handwriting that is as unique as their
voiceprints and fingerprints. The way we shape the
letters and the way we produce space around our
handwriting are all an unconscious choice that reflects
how we feel about ourselves, the environment around
us and our relationships with other people. Grapholo-
gist extracts some features -zones, slant, loops, stems,
etc.- in the handwriting that relate to various person-
ality types, and says what all these unconsious choices
mean in relation t o our personality.
Our aim is t o construct the graphologic world on
the machine baged on some mathematical models.
If we will reach the aim, it is expected to be con-
structed an information theory for visual communica-
tions. Contrary to the conventional graphology, we
call it mathematical graphology. The process consists
of the four following stages:
(1) the input stage
( 2 ) the observation stage
(3) the feature extraction stage
(4) the output stage
In the input stage, handwritten characters, figures and
symbols are digitally scanned. The second stage is an
analysis of the structure of input images. The third
stage is toextract features based on the structure anal-
ysis [2], and finally, extracted characteristics from the
656
0-8186-7128-9/95$4.00 0 1995 IEEE
input images are output. Therefore, it is important
how to observe the input images precisely in this study.
In this paper, we will propose an observation
method for mathematical graphology. In order t o ob-
serve the input figures precisely, we will construct the
method based on the physiological aspects. The per-
formance of our method will be verified on experi-
ments.
2 Observation method based on phys-
iological aspects
In this section, we would propose an observation
method for mathematical graphology.
2.1 Design policy
As the physiological aspects, it is reported that
when humans understand figures, the eyeball continue
to make frequent zigzag movement [saccade) and stop
briefly at some feature points, such as corner points,
edge points and cross points [3]. Based on the as-
pects, first, we must extract feature points precisely on
the machine, because it is considered that the feature
points have much more information than other parts.
Then we must express other parts adjacents feature
points. We consider that other parts are expressed by
smooth functions, because they do not have so impor-
tant information like feature points and moreover that
may include some noise.
From the above, we try to observe input images by
extracting feature points and approximating adjacent
contours using smooth functions.
2.2 Feature points extraction and approx-
imation methods
The present method extracts feature points in fig-
ures and handwritten characters correctly through the
following three stages. In the first stage, feature points
are extracted at the intersection of the strokes, right
angled corners and both ends of straight lines by eval-
uating the digital curvature. In the second stage, addi-
tional feature points are extracted at connections be-
tween different classes of the contours such as straight
lines, arcs, and free curved lines. In this stage, some
connections may not to be extracted due to the noise,
and an adaptive function approximation is performed
for the set of boundary points between adjacent f e s
ture points which are extracted in the previous pro-
cess. Then the connections are extracted using the
curvature of this approximation function. In these
stages, feature points are extracted based on the local
alternation of the sequence of boundary points. So in
the third stage, redundant feature points are removed.
Thus, a method of extracting feature points by
multi-stage algorithm is defined as a construction de-
sign of extracting feature points. The details of this
algorithm are presented later.
2.2.1 Feature Points Extraction Based on
Digit a1 Curvature
A method of extracting plain feature points based on
digital curvature [4] is presented. Each character of
the source ima e is N x N [pixel/font] of a binary
image. A set f ( ~ i ~ , g j ~ ) } y ; =
of~ boundary points is
extracted out of the binary image by tracking the edge
according to 8-neighbor-connection. If the number of
boundary points n1 is less than 8, they are regarded
as noise, and removed.
First, a method of extracting right an led corners
is presented. At every point { ( t i l , gil)}$=l of each
set, digital curvature is evaluated as
where
ailK1 = ( Z i l + K l - Zil 1 W1+K1 -
bilKl = ( Z i l - K 1 - Zil,Y i l - K 1 - yil)-
Here the symbol '-'denotes the inner product of vec-
tors. If the point satisfying the condition P j l ~ =l 0
exists, it becomes a feature point at a right angled
corner. The constant is set as K 1 = 3.
Next, a method of extracting feature points which
are both ends of a straight line is presented. If
more than I f 2 points which satisfy the condition of
P~,K = ~-1, beginning and ending points of this se-
quence become feature points. We call the beginning
point "the feature point of a straight line". The con-
stant is set as li'2 = 25.
When these processes are done for all il(i1 =
1,2, ...,nl), right angled corners and both ends of
straight lines on the contour {(zj,, yi,)}~~=, are found
as feature points {(xi,( 4,yi2
( 4)};+. n2 is the number
of feature points extracted in this stage.
2.2.2 Feature Points Extraction Based on
Analog C u r v a t u r e
A method of extracting additional feature points
based on curvature of the approximated contour is
presented.
The second stage consists of two processes. First,
each set of boundary points between any adjacent fea-
ture points is approxima.ted by a piecewise polynomial.
Then, connections between different classes of the con-
tour such as a straight line, arc, and free curved line
are also extracted as feature point,s based on curvature
of the approximated contour.
Function Approximation
657
In this process, the set of boundary points between
any adjacent feature points is approximated with a
piecewise polynomial.
Parametric expression is one of the methods for
easily showing a curve on two-dimensional space.
It is used in the present algorithm. Each interval
{(zj3,yj3)}y:=l between any adjacent feature points is
approximated by ( s , ( t ) , s y ( t ) )with parameter t . Here,
n3 is the number of points in the sequence, and s O ( t )
and s y ( t ) is piecewise polynomials of degree 2, ap-
proximating points {(tj3, zj3)}y:=1 and {(tj3,uj3)}7:=i
respectively, when tj, = i3 - 1.
Let n be the dimension of the piecewise golyno-
mial. When n 2 3, the parameters { c ~ , , } ; , ; - ~and
{cv,,}y;f2 of s Z ( t ) and s y ( t )are determined to min-
imize the square error Q:
for
1 = -2, -1, ..., n - 3 (3)
respectively.
In order to judge if least squares approximation
converges,
is found, and n is increased until e < 0.90. Thus t e (h4)
set of boundary points between any adjacent feature
points is approximated by a piecewise polynomial in
the first process.
Additional Feature Points
In this process, connections between different
classes of the contour such as straight lines, arcs, and
free curved lines are extracted as feature points from
the curvature of the approximated contour determined
in the first process.
Next property [5] shows equations for analytically
finding the curvature from the piecewise polynomial
to express the contour.
P r o p e r t y 1 A piecewise polynomial of degree ( m - 1)
is represented in the
f o r m s,(t) = C~~_",+l.cZ,Nk,m(t). Then, the j - t h
derivative of the piecewzse polynomial of order m is
determined as, for Cm-s 5 t 5 &,+l,
with
 From this property, the curvature IKI is determined
as, for t E [ e h ,& + I ] ,
sL(t)s”(t) - s;(t)s&(t)
n(t) =
{sL(t)2 + sI/(t)2}3/2 *
Then, additional feature points are also extracted by
using this curvature as follows.
First, both ends of straight lines are extracted as
feature points. The curvature I ~ ( t j , ) is l evaluated for
.
i 3 = 1 , 2 , 3 , . .. Where the condition Itc(ti,)l < IC3
continues in IC4 points, that interval is estimated as
E
a straight line. Let [tal,t,, be this interval, and let
t:l and t:, be both ends o this interval rounded t o
the decimal place. Then the beginning point ( x ~ ; ~
+ +
1 , ~ t ; ~ 1) and the ending point (ztZ1 1,ytZl 1)
are also extracted as feature points. We mark the
beginning point ’feature point of straight line’. The
constants are set as 1<3 = 1/200 and IC4 = 30.
Next, both ends of arcs are extracted as feature
points. The curvature I ~ ( t i , ) lis evaluated for is =
1 , 2 , 3 , .. .. Let k be the mean value of an already
evaluated curvature in the interval. It is renewed ev-
ery time the curvature is evaluated, until k is not in
+
[k - IC51 and [k Kg]. Then the interval, the points in
which had been evaluated in this process, is estimated
as a candidate for an arc. If the central angle of it is
more than K G ,the interval is estimated as an arc. Let
[t8,,t,,] be this interval, and let t:z and t;, be both
ends of this interval, rounded to the decimal place.
+
Then the beginning point (ztz2 1,ytZ2 1) and the + Each feature point (z!:), yi2?) is estimated where
ending point (zt:, + +
1, yt:, 1) are also extracted as
feature points. We mark the beginning point “feature
point of arc”. The constants are set as K5 = 3/400
and ICs = a / 2 so as to not estimate straight lines or
free curved lines as arcs.
Thus, the processes is done for all i3(i3 =
1,2, ...,n 3 ) , and feature points of straight lines
and arcs are extracted in the sequence of points
{ ( x i 3 ,~ i ~ ) } r ; = ~These
. processes are repeated for all
intervals between feature points which are extracted
in the first stage and additional feature points are ex-
tracted as { ( z s ) , y ~ ~ ’ ) } ~ ~ = = nHere
2 + l 1.24 is the total
number of feature points which are extracted in the
two stages.
2.2.3 Removal Redundant Feature Points
In Subsubsection 2.2.1 and 2.2.2, feature points are ex-
tracted based on the local variance of the set of bound-
ary points. There may be some redundant feature
points which have been ext,racted because of noise.
These feature points between continuous straight lines
and between continuous arcs are removed in this stage.
First, feature points between continuous straight
lines are removed. Preparing for this process, fea-
ture points {(q, ( 4, yi2 ( J ) )}y:=l, which have been found
in first two stages are sorted in the order of the bound-
ary points { ( x i , , yil)}y:=l of the source image. Some
feature points may exist between continuous straight
lines. If the font is not inferior in quality without these
feature points, they can be removed as redundant fea-
ture points. The detail is as follows.
Each feature point (zia ( J ) );,=,
( J ) ,yja is estimated
where i 2 = 1 , 2 , . .. If there are more than two fea-
ture points of a straight line, let the set of these feature
points be {(zi;), ~ i f ) ) } T = ~ Let~ .the distance between
(zKil, y g i l ) and a straight line, which is connected
between (&?,Y%’) and (zn6+2,~ns+2)r (4 (4 be Ln,+l. If
Ln,+1 is less than 1C7, (t,,+l,ynd+l)(4 (4 are removed as
+
redundant feature points.
After this process is repeated for all feature points
+ between (&), yi;)) and (x!~) I4 ’ y!$)),
$4 where i4 = ns+
2,ns + +
3,-..,ne 1. Let the distance between
( 4)}~~;~,+,and the straight line be { L i s } ,
{ ( x i( sJ ) ,yis
and let the maximum of {Li,} be L,,. If L,, 2 IC7,
( z $ f ~ l , y ~ fis~ notl ) removed, and the estimation of
that interval is stopped. The constant is set as Ki. = 2 .
After this estimation is done for all feature points,
then redundant feature points of straight line are re-
moved.
Next , feature points between continuous arcs are
removed. Some feature points may exists between
continuous arcs. If the font is not inferior in qual-
ity without these feature points, they are removed as
redundant feature points. The detail is as follows.
i 2 = 1 , 2 , . . .. If there are more than two feature
points in the arc, let the set of these feature points
be { ( x i( ,J ) , yi4
( 4)}?&,. Let, each radius of the arc be-
ginning from (xi:), yi{)) and ( (4 + ~ , be rns and
(4
x ~ ~ynJ+!)
r,, 1 respectively, and let each central point of the arc
be r 2 n s l jjns) and (2ns+l,jjnnJ+1)
respectively. If
and
J(k’nb+l- ~ 8 ) + (jjns+l-
’ jjns)’ <1~9
then they are estimated as a single arc. So
( 4 is removed as a redundant feature point
( 4 ynns+l)
(z,,+~,
of the arc.
After this process is repeated for all feature points
between (&?, y${’) and (zi?, yi()), where i4 = ns +
+ + (4 , (4 is removed if
2, ns 3 , . , n e 1, then (zi4-l
it is a redundant feature point. The constants are set
as IC8 = 1 and K g = 2.
After this estimation is done for all feature points,
then the redundant feature points of arc are removed.
In this subsection, a method of extracting feature
points has been presented.
3 Experimental results
For verification, handwritten characters, printed
characters and figures are selected. They are observed
658
 Table 1: Data quantity

11 Printed Characters I Figures

Bitmnp II . - .
108[I<bv tel I 926[I<bvtel
Proposed method 2[I<byte] 131 i~ib;
tei
Bezier function 1O[I<bytel 2451Iibyte1

by proposed method and reconstructed. The source

image is inout with scanning machine whose resolu-
tion is 600 [DPI]. The algorithm is implemented to
Microsoft Windows 3.1 on a personal computer. In or-
der to compare with conventional technology, we also
use Bezier function as observation method on the ex-
periment. Especially, some printed characters and a
figure which are discussed in detail.
Figures l(a), l(b) and l(c) show the examples of
input figures, observed by proposed method and ob-
served by using Bezier function. The proposed method
can observe the inputs precisely, but the quality of the
observed outputs by using Bezier function are low. Ta-
ble l shows the data quantity. The proposed method
is useful for information compression.
4 Conclusions
In this paper, an observation method for mathe-
matical grapholog has been presented. First, we pro-
posed feature points extraction method for realizing
saccade phenomena in physiological aspects. Then
contour between adjacent feature points was approxi-
mated by smooth function. By applying the proposed
method to sample figures, we verified the performance
of the proposed observation method.
Further study is to develop the feature extraction
stage and construct the mat#hematicalmodel for visual
communications.
References
[l] R.Craze: “Grapholo y for beginners”, Hodder &
Stoughton, London t1994).
[2] M.I<amada, KToraichi, H.C.Yi and P.W.Ee: “A
Function to Express Hand-Drawn Letters,” Proc.
EUSIPCO-94, 3 , pp.1441 - 1444, Edinburgh,
Scotland (1994).
[3] A.L.Yarbus: “Eye movement and Vision,”
Plenum Press (1967).
[4] L.Davis: “Shape matching using relaxation tech-
niques,” IEEE Trans. PAMI, PAMI-1, pp.60-72 Figure 1: Examples of the experimental results. (a)
(1979). Input images, (b) Observed and reconstructed images
[5] C.de Boor: “On calculating with B-splines,” J. using the proposed method, (c) Observed and recon-
Approximation Theory, 6 , p.50 (1972). structed images using Bezier function.

659