Volume 4, Issue 12, December – 2019
ISSN No:-2456-2165
A Method of Vehicle License Plate
Detection for Traffic Violation Detection
Based on Vertical Edge Detection
Swaranjali S. Shelake1, M.M. Sardeshmukh2
Electronics and Telecommunication Engineering
Sinhgad Academy of Engineering
Kondhwa (BK), Pune, India
Abstract:- Edge detection is exceptionally much
imperative handle in picture preparing and it’s
applications like vehicle License plate detection and
acknowledgment system.We handled a vertical edge
detection calculation for the reason of vehicle License
plate Detection for the necessity of checking street
infringement and to recognize and track the peccant
vehicle.It presents two primary membership. The primary
one is that we handled a vertical edge detection calculation
which is related to the differentiate in gray scale values,
which increments the speed of the VLPD strategy. We are
utilizing versatile thresholding and undesirable line
disposal calculation for upgrade of the binarized picture.
At that point after vertical edge detection algorithm
(VEDA) is utilized here for encourage handling. The
second membership is our handled VLPD strategy forms
low determination pictures moreover. Vertical edge
discovery calculation is one of the most excellent utilized
for identifying Vertical edges within the license plate
image, and at that point after number plate points of
interest depends on color data covered up in images are
centered. At that point candidate locale depends on
coherent operations and factual operations will be
extricated. And at last, License plate (LP) have been
identified.
Keywords:- Adaptive Thresholding (AT), Unwanted Line
Elimination Algorithm (ULEA), Vehicle License Plate
Detection (VLPD), Vertical Edge Detection Algorithm
(VEDA).
I. INTRODUCTION
The number of vehicles increments quickly, the activity
issues increments as well, for illustration, car burglary, over
speeding and running on the ruddy light. Various automobiles
are on the street consequently checking vehicles for
requirement and security purposes gets to be a troublesome
issue. The license plate recognition framework is
accommodating for distinguishing proof of vehicles with the
assistance of their license plates.
IJISRT19DEC069 www.ijisrt.com
International Journal of Innovative Science and Research Technology
The LP acknowledgment strategies are commonplace as
programmed license plate acknowledgment, programmed
vehicle distinguishing proof, LP acknowledgment, or optical
character acknowledgment for cars. The LP detection and
acknowledgment framework got to be a most vital region of
investigate due to its different applications, like thruway toll
fees, parking expenses installment, avoidance of
wrongdoing, and collection of activity information [1].
Ordinarily, a LPR framework has three primary parts in
which to begin with one is license plate discovery at that point
character division and character acknowledgment. The
portion of recognizing the license plate area is of most
extreme significance due to its affect on the by and large
execution of the system [3] Presently a day, Vehicle License
Plate Location And Acknowledgment gets to be a key method
to numerous transport systems. Therefore, different
procedures were proposed for permit plate location. Chen
et.al. presents a strategy of recognizing vigorous license plat
es. Division stage finds the license plate within the picture, by
utilizing striking features. Then, feature projection separates
the license plates into characters which is on the license plate.
At long last, within the character acknowledgment, it
extricates a few characters and uses templates coordinating
administrators to induce a vigorous solution.[10] Within the
strategy of Vehicle permit plate acknowledgment by neural
systems pictures of permit plates preprocessed by a quick and
strong 1-D DFT conspire for finding the plate and character
positions. Multilayer neural organize classifies the characters
and prepared by the as of now created BRLS learning
calculation. And it replaces the classifier and the conventional
include extractor moreover.
The really characters recognized rate comes to the most
excellent scores gotten in writing, being exceedingly harsh to
the natural condition whereas the design is best suited for
parallel usage on programmable DSP processors.[8] T. Naito
et.al. proposed the strategies to recognize permit plates
heartily. A detecting framework with a gigantic dynamic
extends is created to obtain clear pictures of vehicles beneath
variable brightening conditions. The detecting framework is
utilized to grow the energetic run of the picture by taking
combination of a match of pictures taken beneath diverse
399
Volume 4, Issue 12, December – 2019
expo-sure conditions. To maintain a strategic distance from
obscuring of pictures against rapid vehicles, crystal bar
splitter employments multilayered channel, and two charge
coupled gadgets are utilized to capture the pictures
simultaneously [9]. Debi et.al. presents three fundamental
modules:
1) sliding concentric windows (SCW) which is division
method depends on versatile picture which is utilized for
identifying candidate locale, (2) HSI color show depends on
escalated and tint in HSI color demonstrate recognizing green,
yellow LP and white LP, separately and (3) At final, detection
of VLP locale which is containing foreordained alphanumeric
character by utilizing histogram. In this method, conversion of
color input vehicle pictures into gray pictures takes place.
Then the candidate locale is found by sliding concentric
windows and plates locale is recognized by utilizing
alphanumeric character which is containing foreordained LP
color and HSI color demonstrate by utilizing histogram. Test
comes about appear that the displayed strategy is
exceptionally successful completely different illumination
conditions and the separate from the vehicle changes
concurring to the camera [11]. Zhang et al. proposes a vertical
point diagram to remove truthful highlights. They have been
Fig 1:- Basic Diagram of Proposed Method
A. Adaptive Thresholding
The method of adaptive thresholding has been connected
to urge the binarized image, after transformation of input
picture into gray scale.
 Procedure of AT: In Wellners calculation, the pixel is
compared with the normal of adjacent pixels. And the
normal is calculated of final pixels. As the esteem of the
current pixel (T) percent is lower than the normal, at that
point it is set to dark; el se, it is set to white. This method
is supportive since it'll keep difficult differentiate lines and
disregard delicate angle changes [2]. The current pixel
value could be a small bit changed by Wellner on the
premise of pictures. The Wellners calculation is on
premise of the filtering arrange of pixels. Be that as it
may, the neighborhood tests are not equally distributed in
all bearings, the method of moving normal isn't
appropriate for great representation of the comparing
pixel.
Subsequently, utilizing the fundamentally picture this
issue will be illuminated.
IJISRT19DEC069 www.ijisrt.com
International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
utilized two cascade classifiers depends on quantifiable and
Haar highlights to decrease the complexity of the system and
to create strides the disclosure rate of the system. In any case,
this methodology will take much pro-cessing time for low-
quality pictures too [3] Itey Benou et.al. describes our
algorithm of vertical edge detection, and it contains two parts:
Unwanted Lines Elimination Algorithm (ULEA) process and
VEDA process. Experimental results are given in section III
Section IV draws the conclusion.
II. PROPOSED STRATEGY FOR VEHICLE LICENSE
PLATE DETECTION
The VEDA is utilized for the discovery of vertical edges
within the license plate. In that, the color input picture is
changed over to a gray scale picture after that versatile
thresholding is connected on the picture and gotten the
binarized picture. After that, the ULEA is utilized here to
heighten the binarized picture by evacuating the noise. And at
that point vertical edges are extricated by utilizing the VEDA.
At that point discovery of the license plate locale carried out,
the plate subtle elements are shown on premise of the pixel
esteem utilizing the VEDA yield.
 AT Details: For the necessarily picture arrangement, the
summation of the pixel values for each column through all
push values will be computed using
𝑖
𝑠𝑢𝑚(𝑖)|𝑡ℎ
𝑗 = ∑ 𝑔(𝑥, 𝑦)|𝑡ℎ
𝑗 (1)
𝑥=0
Where g (x, y) gives the input values, and sum(i)jthj
speaks to all expanding gray values for the column jth through
all columns of picture I = 0, 1, 2... tallness. At that point, the
indispensably picture can be count for each pixel as,
𝐼𝑛𝑡𝑔𝑟𝑎𝑙𝐼𝑚𝑔(𝑖, 𝑗)
𝑠𝑢𝑚(𝑖) , 𝑖𝑓 𝑗 = 0
={ (2)
𝐼𝑛𝑡𝑔𝑟𝑎𝑙𝐼𝑚𝑔(𝑖, 𝑗 − 1) + 𝑠𝑢𝑚(𝑖), 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
Where IntgralImg (i, j) gives the necessarily picture for
pixel (i, j). The following step is to perform thresholding for
each pixel. The concentrated summation for each
neighborhood window should be counted by utilizing
subtraction operations and expansion operation as given
underneath,
400
Volume 4, Issue 12, December – 2019 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
𝑠 𝑠 lines. whereas managing with the double picture, we are
𝑠𝑢𝑚𝑤𝑖𝑛𝑑𝑜𝑤 = (𝐼𝑛𝑡𝑔𝑟𝑎𝑙𝐼𝑚𝑔 (𝑖 + ; 𝑗 + )) considering the dark pixel values are the foundation, and the
2 2
𝑠 𝑠 white pixel values are the frontal area A 3 x 3 cover is utilized
+ (𝐼𝑛𝑡𝑔𝑟𝑎𝑙𝐼𝑚𝑔 (𝑖 + ; 𝑗 − )) all over the picture pixels for testing dark pixel values within
2 2 the thresholded picture as it were. when the show pixel
𝑠 𝑠 esteem is found at the cover center is dark, the eight
− (𝐼𝑛𝑡𝑔𝑟𝑎𝑙𝐼𝑚𝑔 (𝑖 − ; 𝑗 + ))
2 2 neighboring pixel values are tried. And as two adjacent values
𝑠 𝑠 are white, at that point the display pixel is changed over to a
− (𝐼𝑛𝑡𝑔𝑟𝑎𝑙𝐼𝑚𝑔 (𝑖 − ; 𝑗 − )) (3) white value which is as a frontal area pixel value (i.e., white
2 2
pixel). In yield of ULEA numerous undesirable lines have
Where 𝑠𝑢𝑚𝑤𝑖𝑛𝑑𝑜𝑤 gives summation of intensities of been expelled from the picture.
gray values intensities for a neighborhood window. The
boundaries of the window can be given by, C. VEDA
The VEDA is utilized to distinguish the plate locale,
𝑠 𝑠 𝑠 𝑠 𝑠 𝑠 𝑠 𝑠 particularly the starting and the conclusion of each character.
(𝑖 + ; 𝑗 + ) ; (𝑖 + ; 𝑗 − ) ; (𝑖 − ; 𝑗 + ) ; (𝑖 − ; 𝑗 − ) In this manner, the plate subtle elements can be effectively
2 2 2 2 2 2 2 2
identified, and the character acknowledgment prepare done
quicker. The picture is having as it were dark and white
And s speaks to the neighborhood window size/lengths regions, after thresholding and ULEA, and the VEDA is
for the identified IntgralImg, though s = picture width/8. utilized for handling these districts. It concentrates on
Hence, to assess the versatile limit esteem for the picture in crossing points of black-white and white-black. A 2 x 4 cover
which g (i, j) [0,255] is the escalated of the pixel which is is utilized for this process, in which x and y speak to columns
found at (i, j), threshold t (i, j) is computed as takes after: and columns of the picture individually. The dark and white
districts have been found by moving the veil from cleared out
t(i, j) = (1 − T) ∗ 𝑠𝑢𝑚𝑤𝑖𝑛𝑑𝑜𝑤 (4) to right. The veil of 2 x 4 fulfill the taking after two criteria.

Where t (i, j) is the threshold value for each pixel at (i,  This sort of a cover is subdivided into three masks: The to
j), and T is a constant. This value is the optimal value for best begin with 2 x 2 cover which is the cleared out veil the
thresholding performance for the whole images after testing moment 2x 1 mask which is the center and the last is the
on many images. right mask 2 x 1. After checking two pixels at once, the
primary one cover is connected in such a way that two
After comparing we get output as; columns are handled at once which can be utilized for
recognizing. This prepare is supportive for identifying the
0, 𝑔(𝑖, 𝑗) ∗ 𝑠 2 < 𝑇 vertical edges which is at the convergences of dark white
𝑜(𝑖, 𝑗) = { (5) districts. The third cover is utilized for crossing points of
255, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
white-black districts. Hence, the identified vertical edge is
of 1-pixel width.
Where o (i, j) gives the threshold output value of pixel g  The number of lines that are checked at once. The time
(i, j), and S2 gives the enumerated area of the local window devoured in this case can be less twice in each push
for the selected region. checked individually.

B. ULEA D. Highlight Desired Details (HDD).

Thresholding prepare produces numerous lines that don't
have a place to the LP region. In result ready to see that there
are numerous long frontal area lines and arbitrary clamor
edges but the LP region. These noise edges and background
are unwanted lines. It may meddled within the LP area.
Hence, we have to be propose an calculation to dispose of
them from the picture. There are four diverse cases in which
undesirable lines can be shaped. In to begin with case, the line
is level with a point break even with to degree as (-). In
moment case, the line is vertical and a point rise to 90 degree
as (—). In third case, the line which is slanted with a point
rise to 45 degree as right slanted (/). In 4th case, the line is
slanted with a point rise to 135 as cleared out slanted.
Subsequently, the ULEA has been utilized to dispose of these
It performs NAND-AND operation for each two
adjacent pixel values to highlight the plate subtle elements
and vertical edges within the picture after performing the
VEDA which are taken from ULEA and VEDA yield images.
This handle depends on the VEDA yield in highlighting the
number plate region. All the pixels within the picture will be
filtered. When there are two neighboring dark pixels which
are taken after by one dark pixel, at that point two edges can
be checked to highlight the subtle elements by taking dark flat
lines interfacing to each two vertical edges. These two vertical
edges is encompassed by a dark foundation, as within the
ULEA image. The flat remove speaks to the length between
the two vertical edges of a neighboring character. The hd
value is choosed in such way that it ought to pertinent for

IJISRT19DEC069 www.ijisrt.com 401

Volume 4, Issue 12, December – 2019
dispensing with long frontal area and irregular commotion
edges. The filtering handle begin moving all over the picture
from cleared out to right and from best to foot. After checking
of all pixels, the locale in which the genuine LP exists is
highlighted.
E. Candidate Region Extraction (CRE)
The method of CRE is partitioned into four steps as
given below:
 Calculate lines per each row: The number of lines drawn
per each row will be calculated and put away in lattice
variable H[a], where a = 0, 1, 2, . . ., h-1.
 Subdivide the picture into Multigroups: The numerous of
columns will delay the handling time. Thus, the bunch of
numerous columns is utilized here to decrease the
expended time and consequently subdividing the picture
into multigroup ought to be done by utilizing the
following:
ℎ can be given as follows:
𝑁𝑜. 𝑜𝑓 𝑔𝑟𝑜𝑢𝑝𝑠 = (6)
𝑐
Where h speaks to the full number of picture lines, and
C speaks to CRE consistent.
 Count and Store Bunch Lists and Boundaries: Most of the
lines which are not parts of the plate points of interest it is
valuable to utilize a limit to dispense with those
unsatisfied bunches and to keep the fulfilled bunches in
which the LP points of interest exist. Once each gather are
checked; the entire number of bunches counting the parts
of LP locales are numbered and put away. The remaining
bunches after thresholding step ought to have the LP
details. Hence, their areas are put away. The ultimate step
is to extricate both upper and lower boundaries of each
fulfilled gather by utilizing its possess list
 Selection of Boundaries of Candidate Districts: The flat
boundaries draw over and underneath each candidate
region.[1]
F. Plate Region Extraction (PRS)
The process of plate region extraction is used for
selectection and extraction of the true LP.
 LP Region selection: In this, region of license plate can be
examined pixel to pixel, whether it has a place to the LP
locale or not because we know some images are blurry
and having imperfections. A mathematical formulation is
used for selection of LP region, and after the detailing is
IJISRT19DEC069 www.ijisrt.com
International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
connected on each pixel, the likelihood of the pixel gets to
be a portion of the LP region. Every column checked
individually. If the blackness ratio of columns becomes
greater than 50 percent, then the present column related
the LP region. Consequently, the column will be
recovered by a vertical dark line within the yield image.
The condition for checking each column is given as, on
the off chance that blackPix 0.5 x columnHght, then the
show column is has a place the LP locale in which the
blackPix speaks to the number of dark pixels for each one
column within the display candidate locale. A few of
candidate districts pixels are not recognized when the
darkness to the entire length proportion of the locale is
more prominent than 50 percent. Then, the condition is
changed to ended up less than 50 percent, concurring to
the blurry level ratio. Hence the condition will get to be as
follows: blackPix PRS x columnHght, where PRS speaks
to the PRS factor. PRS esteem is diminished when the
blurry level is greatest to highlight vital details. It is
expanded when the foggy level is least. Subsequently, the
scientific representation for the LP locale determination
0 , 𝑃𝑅𝑆𝑥𝐶𝑜𝑙𝑢𝑚𝑛ℎ𝑡 ≥ 0
𝐶𝑟𝑒𝑔𝑖𝑜𝑛 = { (7)
255, 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒
In given condition Cregion gives the yield for the show
pixel of candidate locale. When Cregion = 0, at that point
checked pixel is coordinating to LP locale; else ways,
consider it as foundation.
 Making a Vote: The beat and foot neighbors of columns
having greatest obscurity proportion are given as one vote.
This handle is utilized for all candidate locales.
Consequently, the candidate locale which is having the
most extreme vote values will be the adjusted LP.
III. PERFORMANCE ANALYSIS
This gives overall analysis of result obtained by desired
methodology which has been used to design system. We are
having 85 database images of vehicles along with their license
plates. Within the explore, the rate of accurately recognized
LPs is 88 percent. Hence by and large precision of the
framework is 88 percent.
For performing traffic violation detection, we designed
such system in which we mark the positions for red signal
detection and stop line detection whenever the vehicle breaks
the stop line even if red signal is ON then number plate of that
particular vehicle will be detected as shown in result. Below
figures gives the GUI for traffic violation detection.
402
Volume 4, Issue 12, December – 2019 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165

Fig 2:- GUI

Fig 4:- GUI for Position Marking
We can see there are mark positions for signal region,
stop line and LP region as shown in figure 3 and 4. After
crossing the stop line the vehicle is detected as shown in
figure 5 and after that license plate number has been detected
step by processing of algorithm.

Fig 5:- Traffic signal, stop line and LP region position

marking

Fig 3:- GUI for Selection of Region

Fig.6 appears yield for license plate detection from

vehicular picture and extricate the number from plate locale
of the vehicle which break the stop line.

IV. CONCLUSION

In traffic violation we designed software model for stop

line detection and red signal detection. VEDA (Vertical Edge
Detection Algorithm) is the most excellent calculation for
vehicles license plate detection in terms of precision,
convolution and processing time. It gives superior validity,
less processing time and having less convolution. Vertical
Edge detection calculation re-quire Less memory size and
having Low cost.
Fig 6:- License Plate Detection Output

IJISRT19DEC069 www.ijisrt.com 403

Volume 4, Issue 12, December – 2019 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
REFERENCES

[1]. S. N. Huda, K. Marzuki, Y. Rubiyah, and O.

Khairuddin, “Comparison of feature extractors in license
plate recognition,” in Proc. 1st IEEE AMS, Phuket,
Thailand, 2007, pp. 502506.
[2]. Abbas M. Al Ghaili, Syamsiah mashohor, Abdul Ramli
and Alyani Ismail “Vertical edge-based car license plate
detection” IEEE transaction on vehicular technology
vol.62, no.1 January 2013, pp.26-38
[3]. H. Zhang, W. Zia, Xingjian He and Qiang Wu “A Fast
Algorithm for Li-cense Plate Detection in Various
Conditions” International Conference on System, Man
and Cybernetics October 8-11,2006, pp.1-8
[4]. Itey Benou and Rotem Yachnan, “A license plate
detection and character segmentation method under
difficult condition” IEEE 27th convention of electrical
and electronics Engineers in Israel, 978-1-4673 ,2012,
pp.1-5
[5]. Vishwanath, Somasundaram, T.S. Baburajani, N.
Krishnan Nallape-rumal, “A Hybrid Indian License Plate
Character Segmentation Algorithm for Automatic
License Plate Recognition System”978-1-4673-1344-
5/12/ 2012 IEEE.
[6]. Shan Du, Mahmoud Ibrahim and Wael Badawy,
“Automatic license plate Recognition: A State-of-the-art
Review method” IEEE Transaction of Circuits and
Systems for Video Technology vol.23 issue 2,2013,
pp.1-14
[7]. S. Saha, S. Basu and M. Nasipuri “License Plate
Localization Using Vertical Edge Map and Hough
Transform Based Technique” Proceedings of InCon
INDIA 2012 AISC 132, Springer-Verlag Berlin
Heidelberg, pp.649-656.
[8]. R. Parisi, E. D. Di Claudio, G. Lucarelli, and G. Orlandi
“Car plate recognition by neural networks and image
processing, “Proceedings of 1998 IEEE International
Symposium vol.3 pp.195-198”
[9]. T. Naito, T. Tsukada, K. Yamada, K. Kozuka, and S.
Yamamoto “license-plate recognition method for
passing vehicles under outside environ-ment,” IEEE
Transactions on Vehicular Technology, Nov.2000 vol.49
is-sues.6 pp.2309-2319 Nov.2000”
[10]. Z.-X. Chen, Y.-L. Cheng, F.-L. Chang, and G.-Y. Wang,
“Automatic license-plate location and recognition based
on feature salience,” IEEE Trans. Veh. Technol., vol. 58,
no. 7, pp. 37813785, Sep. 2009.
[11]. K. Debi, H.-U. Chae, and C. K.-H. Jo, “Parallelogram
and histogram-based vehicle license plate detection, “in
Proc. IEEE Int. Conf. Smart Manuf. Appl., Gyeonggi-
do, Korea, 2008, pp. 349353

IJISRT19DEC069 www.ijisrt.com 404