By Topic

Graph Grammar Based License Plate Recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yuqing Song ; Sch. of Automotive & Transp., Tianjin Univ. of Technol. & Educ., Tianjin, China ; Jianqing Liu ; Dianwei Li

Automatic license plate recognition is still a challenging problem where severe imaging conditions must be handled. As compared with other formal tools, the graph grammar model is more suitable when dealing with the severe imaging conditions. In this paper we introduce a graph grammar based method of license plate recognition. In our approach, a level set based license location process is first employed to find candidate plate locations. Then a graph grammar is applied to each candidate location to recognize the plate. The grammar consists of 3 rules. The first two rules recognize individual characters. The third rule represents the license plate layout by a graph. The plate recognition is achieved by a graph matching process.

Published in:

Intelligent Networks and Intelligent Systems (ICINIS), 2012 Fifth International Conference on

Date of Conference:

1-3 Nov. 2012