An Overview of Image Analysis Algorithms for License Plate Recognition

Background and purpose: We explore the problem of License Plate Recognition (LPR) to highlight a number of algorithms that can be used in image analysis problems. In management support systems using image object recognition, the intelligence resides in the statistical algorithms that can be used in various LPR steps. We describe a number of solutions, from the initial thresholding step to localization and recognition of image elements. The objective of this paper is to present a number of probabilistic approaches in LPR steps, then combine these approaches together in one system. Most LPR approaches used deterministic models that are sensitive to many uncontrolled issues like illumination, distance of vehicles from camera, processing noise etc. The essence of our approaches resides in the statistical algorithms that can accurately localize and recognize license plate. Design/Methodology/Approach: We introduce simple and inexpensive methods to solve relatively important problems, using probabilistic approaches. In these approaches, we describe a number of statistical solutions, from the initial thresholding step to localization and recognition of image elements. In the localization step, we use frequency plate signals from the images which we analyze through the Discrete Fourier Transform. Also, a probabilistic model is adopted in the recognition of plate characters. Finally, we show how to combine results from bilingual license plates like Saudi Arabia plates. Results: The algorithms provide the effectiveness for an ever-prevalent form of vehicles, building and properties management. The result shows the advantage of using the probabilistic approached in all LPR steps. The averaged classification rates when using local dataset reached 79.13%. Conclusion: An improvement of recognition rate can be achieved when there are two source of information especially of license plates that have two independent texts.

Abstract licence: CC BY-NC-ND

13 more references, whose wording the paper’s licence keeps private.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.