Académique Documents
Professionnel Documents
Culture Documents
binary object. Due to that, it is easier to compare objects using this technique. The third advantage is that the chain code is a complete representation of an object or curve. This means that we can compute any shape feature from the chain codes. Chain codes provide a lossless compressing and preserving all topological and morphological information which bring out another benefit in terms of speed and effectiveness for the analysis of line patterns. It is also suitable For detecting feature of a region such as sharp corners, area, perimeter, moments, centers, eccentricity, projection and straightline segments. Chain codes are invertible hence object can be reconstructed back from its chain code representation.
direction of chain code segments; the numbers of left hand turns of /2 or /4 needed to achieve the direction of next chain segment.
Fig.1
The chain code for the boundary of a binary image is a sequence of integers c= { , , .... } having each from the set {0,1,2, ......,7 } for i=0.1,....,n-1. The number of the elements in the sequence c is called the Length of the chain code. Chain codes may be made position-independent by ignoring the starting point. If they represent the close boundaries they may be Start point normalized by choosing the start point so that the resulting sequence of direction codes forms an integer of minimum magnitude .
Methodology
The Fig.3 below shows the methodology. There are six phases involved; image acquisition, data definition, image preprocessing, image segmentation, chain code derivation and character recognition. The images of car plates are varied in terms of its sizes and fonts for the testing process (during recognition).
Fig.2 : Chain code in 4-connectivity and its derivative. Code : 3,0,0,3,0,1,1,2,1,2,3,2 Derivative: 1.0,3,1,1,0,1,3,1,1,3,1 The derivative of the chain code is useful because it is invariant under the boundary rotation. The derivative is simply another sequence of numbers indicating the relative
Pre-processing:
Two processes are involved in preprocessing which are threshold and filtering. Images used are gray-scaled images and are converted into binary images which means that every pixel in the image is convert to the binary values (0 and 1). Fig.3 : The proposed Methodology
Segmentation:
Two processes have been done in this phase; the boundary extraction and segmentation. The boundary extraction of character is done in order to ease the process of deriving the chain codes. The segmentation has been done using the pixel count technique.
Data Definition:
Data that comes from the form of images need to be identified and analyzed first before tested. The information about types of fonts used, need to be gathered. Based on the observation on collected images, the various styles of writing can be recognized forming as raw data.
Recognition:
The character recognition has been done by using chain codes derived for character from the previous phase. The code is then used as a guide to recognize the characters by matching the chain codes extracted from the previous phase.
Conclusion:
Chain code is one of the most interesting topics in pattern recognition and image processing. Since introduced by Freeman in 1961, chain code increases rapidly. There are many extended and applications of the chain code time by the time Most of the new chain codes are extended from Freeman chain code and Vertex chain code that introduced by Bribiesca. The new chain codes need the binary image as the input, because chain code is the code based on boundary. Chain code could be applied in many parts of pattern recognition and image processing. Then it is important to extend some algorithm about the chain code, especially vertex chain code.
[5] Tran Duc Duan, Tran Le Hong Du, Tran Vinh Phuoc, Nguyen Viet Hoang, Building an Automatic Vehicle License-Plate Recognition System, 3rd International Conference on Computer Science Research, Innovation & Vision for the Future (RIVF05), pp. 59-63, 2005.
References:
[1] Xu Jianfeng, Li Shaofa and Chen Zhibin (2003). Color Analysis for Chinese Car Plate Recognition. Proceedings of the IEEE International Conference on Robotics, Intelligent Systems and Signal Processing. pp1312 1316. [2] Pedro Barroso, Joaquim Amaral, Andr Mora, Jos Manuel Fonseca, Adolfo SteigerGaro (2004). A Quadtree Based Vehicles Recognition System. 4th WSEAS International Conference on Optics, Photonics, Lasers And Imaging (ICOPLI 2004). pp12-16. [3] Wenjing Jia, Huaifeng Zhang and Xiangjian He, Region- Based License Plate Detection, Journal of network and Computer Applications, Elsevier, In Press, Corrected Proof, Available online 17 November 2006. [4] Yo-Ping Huang, Shi-Yong Lai, Wei-Po Chuang, A Template-Based Model For License Plate Recognition, Proceedings of the 2004 IEEE International Conference on Networking, Sensing and Control, vol. 2, pp. 737 742, 2004.