printed Amazigh Character Recognition by a Syntactic Approach sing Finite Automata

We present in this paper an automatic system for isolated printed Amazigh characters recognition based on a syntactic approach using finite automata. The choice of syntactic approach is justified by the fact that most Amazigh characters have segmented forms. After a step of preprocessing, appropriate algorithms allow to build the representative chain of the character from the Freeman coding. The chain will be used in the input of a finite automaton, which recognizes all the segmented Amazigh characters. This global automaton is built from specific automata of recognition for each Amazigh character. On a local database of isolated printed Amazigh characters, the experimental results show the robustness of the approach.