In this paper we shall consider the intrinsic complexity of patterns and the extent to which this notion is well defined. Past work in the computer science and artificial intelligence literature on the decomposition of pictures into their basic building blocks is consistent with our motivation, but this paper will look at the simplest description over all possible methods. Thus, the program complexity of Kolmogorov given the domain is mini-mum in finite length such that a Turing Machine can compute functions in finite time. So, the string approach is well used as Kolmogorov process. The Circular Layer Chart for Recognition (CLCR) is created with total number of elements (29,-1)*4, where L is the number of layers counted from innermost cell in even 2.1 number. A sequence of string arrays, called Circular Layer String Arrays (CLSA), are achieved for each layer. In this paper there are twenty layers used for the recognition of human face pictures. The distance between both arrays of corresponding layers of test pattern and sample is calculated. The inner five layers are applied for the normalization of orientation. That is, if any of these inner layers does not match, the arrays of test pattern are rotated one position and tried again until they are rotated one circle. If any array of inner layers does not match through the normalization of orientation, the sample is rejected. Thus it can save much time for matching.
|