Chain code representation gives the
boundary of character image in which the codes represent the direction of where is the location of the next pixel. The
first approach of chain code was introduced by Freeman in
1961 that is known as Freeman Chain Code (FCC) [8].
There are two directions of chain code, namely 4-neighborhood and 8-neighborhood as shown “Fig. 3”. As in
many papers usually the researchers start from zero until
seven in 8-neighbourhood. But for this paper will start from
one until eight because is easy for distinguish direction or
non direction (value is zero) of chain code.
Heuristic is a method to find a solution that is closed to
the best but it does not guarantee that the best will be found.
In this paper a heuristic methods are proposed which is
randomized algorithm.
The pseudo-code of randomized algorithm is depicted in
Table 1 and the description of randomized algorithm is
shown in “Fig. 4”.