Академический Документы
Профессиональный Документы
Культура Документы
T
Abstract - License Plate Recognition System (LPRS) is one of works in three steps, the first step is the detection and
capturing a vehicle image, the second steps is the detection
the most important part of the Intelligent Transportation and extraction of number plate in an image. The third
System (ITS). License plate automatic recognition has been section use image segmentation technique to get individual
extensively applied in the Intellectual traffic system and character and optical character recognition (OCR) to
recognize the individual character with the help of database
Public transit security system. The main objective is to design stored for each and every alphanumeric character.
ES
an efficient automatic authorized vehicle identification system
by using the vehicle number plate. Location of the license
plate is performed using its inherent texture characteristics
In India, Vehicles used for domestic purpose contains the
license plate with white color as its background and black
characters as its foreground whereas vehicles used for
and wavelets. Character segmentation is done using
commercial purpose contains the license plate with yellow
Connected Component Analysis. Character Recognition of the color as its background and black characters as its
vehicle license plate based on template matching. This system foreground.
is implemented using MATLAB. The proposed system mainly
II. Related work
applicable to Indian License Plates.
A
There are several common algorithms to locate the license
Keywords : LPR, Wavelets, Location, Segmentation, Character plate. Searching algorithms mainly rely on color
Recognition. information and special signs. Widely used procedures that
are solely based on image processing are as Hough
transform, Top-Hat and Bottom-Hat filtering (highlights
I.INTRODUCTION
the black-white transitions) [3] Binary morphology
IJ
T
method[11][12], this system needs training to recognise the algorithm for License Plate Images with complicated
characters. In this computational time depends on the background. License Plate consists of many vertical edges
training set and also it is very expensive. because it consists of Borders, Characters, and Digits.
Sobel mask is used to detect vertical edges in the input
image. Wavelet decomposition is performed to have better
III. STRUCTURE OF TYPICAL LPR SYSTEM analysis. The resultant image is converted into a binary
ES
The typical LPR system consists of four major parts:
Image capture, license plate location, character
segmentation and character recognition. As shown in
Figure 1.
image. Morphological operations such as erosion and
dilation are performed to find the location of the license
plate.
C. Character Segmentation
Character Segmentation
IJ
Scan the figure of license plate from the half of it to the Scan the figure from left to right column by column after
T
bottom of it line by line. If the total number of Jumps in a precise location of the top and bottom boundary and count
certain line is less than twelve, it can be marked as the the total number of black points in every column. The
bottom boundary of character region. result is stored in array projection . It is obvious that the
length of Project is C.
(b) Thresholding
Input B
ES Suppose that one represents peak and zero represents
trough. The threshold value is set to h/10. Judge every
value in array projection . If Projection[i] is greater than
h/10, Projection[i] is set to one. Otherwise, Projection[i] is
set to zero. Where h is the modified no of rows of the
Row = R/2 binary image after precise location of top and bottom
boundaries.
Count Transitions
A
from 0 to1 and 1 to
0 and store it as n Row=Row+1 Figure.5. Character segmentation
n>=12
template matching algorithm, low-resolution template
matching method is adopted, namely the using of a lower
N pixel resolution (such as 4 x 8) to represent the images and
templates to be recognized. Each matrix element
Bottom=Row corresponds to a sub-matrix in a high-resolution matrix.
The element's value is the average of the pixel gray value
in the corresponding high-resolution sub-matrix. Compared
with the high-resolution matching algorithm, correct
Figure.3. Algorithm for location of bottom boundary. identification rate of the letters and numbers is greatly
enhanced. The reason is that if the resolution rate goes
through a moderate reduction, the error generated by the
image distortion and the noise will be decreased. The
recognition errors of letters and numbers mainly occur in
1) Calculation of Similarity
T
and templates. In the template matching method, the
formula of similarity has important implications on the
recognition results. In the low-resolution template
matching method, using the similarity discriminate method
mainly include two kinds: absolute distance and similarity.
The absolute value distance regards the sum of the distance
between image and the corresponding image pixel value of
ES
template as a function to measure the similarity.
X 1 Y 1
D( F , M ) F (i, j ) M (i, j ) (1)
i 0 j 0
ACKNOWLEDGEMENT
REFERENCES
T
Frame of Reference” 2010 International Conference on
Information, Networking and Automation (ICINA)
[7] Deng Hongyao, Song Xiuli “License Plate Characters
Segmentation Using Projection and Template Matching”, 2009
International Conference on Information Technology and
Computer Science
[8] Shuang Qiaol , Yan Zhul , Xiufen Li l , Taihui Liu2 ,3,
[9]
ES
Baoxue Zhangl “Research of improving the accuracy of
license plate character segmentation” 2010 Fifth International
Conference on Frontier of Computer Science and Technology.
Dong- June Lee, Seong-Whan Lee” A New Methodology for
Gray-Scale Character Segmentation and Recognition”, 1995
IEEE.
[10] Yucheng Li, Yisong Liu Mushu Wang “Study and Realization
for License Plate Recognition System”,2009 IEEE.
[11] c. Nelson Kennedy Babu, Krishnan Nallaperumal “A License
Plate Localization using Morphology and Recognition”, 2008
IEEE.
[12] Baoming shan “License Plate Character Segmentation and
Recognition Based on RBF Neural Network”,2010 IEEE
A
IJ