2. The character recognition method according to claim 1 , wherein the mapping the eigenvector (P 1k , P 2k . . . P Mk ) to a matrix T in step 6 comprises: step 61 comprising: assuming one component P ij of an eigenvector of any point of edge of a character as P ij =(l ij , θ ij ), wherein l ij ∈[0, L] and θ ij ∈[0,2π], forming a block matrix by dividing the interval [0, L] into u equal parts and dividing the interval [0,2π] into v equal parts, and mapping each component of the eigenvector of any point of the edge of the character to the block matrix according to values of l ij and θ ij ; and step 62 comprises: setting that a component t ij of T is the number of eigen components P ij mapped to a jth block in an ith row, then the eigenvector (P 1k , P 2k . . . P Mk ) of any point is converted into a u×v matrix T; and step 63 comprising: representing all features of each character as ( T 1 T 2 ⋮ T M ) , wherein each component T i is a u×v matrix.
1. A character recognition method, comprising the steps of: 1 : reading, by a processor, a character image; 2 : performing image preprocessing on the read character image; 3 : performing character segmentation on the preprocessed character image; 4 : edge extraction, comprising detecting edge points of the character by using an edge detecting operator; 5 : feature extraction, performing expressing features of each edge point of each character by distances from edge points of the character other than the edge point to the edge point, wherein the features of the edge point of the character are represented by an eigenvector (P 1k , P 2k . . . P Mk ), thus eigenvectors of features of the character are represented by a matrix ( P 21 P 31 … P M ⁢ ⁢ 1 P 12 P 32 … P M ⁢ ⁢ 2 ⋮ ⋮ ⋱ ⋮ P 1 ⁢ ⁢ M P 2 ⁢ ⁢ M … P ( M - 1 ) ⁢ M ) ; 6 : feature processing, performing mapping the eigenvector (P 1k , P 2k . . . P Mk ) to a matrix T, to obtain a same dimension for eigenvectors of all characters, wherein T = ( t 11 t 12 … t 1 ⁢ ⁢ v t 21 t 22 … t 2 ⁢ ⁢ v ⋮ ⋮ ⋱ ⋮ t u ⁢ ⁢ 1 t u ⁢ ⁢ 2 … t uv ) ; and 7 : template matching comprising assuming that an edge of a character Θ to be recognized has M points X 1 , X 2 . . . X M and a standard character template Δ has N points Y 1 , Y 2 . . . Y N calculating a distance between the point X i and the point Y j in the standard character template Δ by an equation as: D ij ≡ D ⁡ ( X i , Y j ) = ∑ m = 1 u ⁢ ∑ n = 1 v ⁢ ( T i ⁡ ( m , n ) - T j ⁡ ( m , n ) ) 2 ; denoting D iπ(i) =min D ij , which indicates that a point Y π(i) in the standard character template Δ is a best matching point for the point X i , a total distance from the character Θ to be recognized to the standard character template Δ being D Θ ⁢ ⁢ Δ = ∑ i = 0 M ⁢ D i ⁢ ⁢ π ⁡ ( i ) ; and in a case that there are total Γ standard character templates, calculating total distances from the character Θ to be recognized to each standard character template respectively, and a template with a minimal distance to the character is a recognition result for the character.