Empirical Study of Car License Plates Recognition

The number of vehicles on the road has increased drastically in recent years. The license plate is an identity card for a vehicle. It can map to the owner and further information about vehicle. License plate information is useful to help traffic management systems. For example, traffic management systems can check for vehicles moving at speeds not permitted by law and can also be installed in parking areas to se-cure the entrance or exit way for vehicles. License plate recognition algorithms have been proposed by many researchers. License plate recognition requires license plate detection, segmentation, and charac-ters recognition. The algorithm detects the position of a license plate and extracts the characters. Various license plate recognition algorithms have been implemented, and each algorithm has its strengths and weaknesses. In this research, I implement three algorithms for detecting license plates, three algorithms for segmenting license plates, and two algorithms for recognizing license plate characters. I evaluate each of these algorithms on the same two datasets, one from Greece and one from Thailand. For detecting li-cense plates, the best result is obtained by a Haar cascade algorithm. After the best result of license plate detection is obtained, for the segmentation part a Laplacian based method has the highest accuracy. Last, the license plate recognition experiment shows that a neural network has better accuracy than other algo-rithm. I summarize and analyze the overall performance of each method for comparison

License plate localization based on statistical measures of license plate features

— License plate localization is considered as the most important part of license plate recognition system. The high accuracy rate of license plate recognition is depended on the ability of license plate detection. This paper presents a novel method for license plate localization bases on license plate features. This proposed method consists of two main processes. First, candidate regions extraction step, Sobel operator is applied to obtain vertical edges and then potential candidate regions are extracted by deploying mathematical morphology operations [5]. Last, license plate verification step, this step employs the standard deviation of license plate features to confirm license plate position. The experimental results show that the proposed method can achieve high quality license plate localization results with high accuracy rate of 98.26 %

Automatic Vehicle Detection and Identification using Visual Features

In recent decades, a vehicle has become the most popular transportation mechanism in the world. High accuracy and success rate are key factors in automatic vehicle detection and identification. As the most important label on vehicles, the license plate serves as a mean of public identification for them. However, it can be stolen and affixed to different vehicles by criminals to conceal their identities. Furthermore, in some cases, the plate numbers can be the same for two vehicles coming from different countries. In this thesis, we propose a new vehicle identification system that provides high degree of accuracy and success rates. The proposed system consists of four stages: license plate detection, license plate recognition, license plate province detection and vehicle shape detection. In the proposed system, the features are converted into local binary pattern (LBP) and histogram of oriented gradients (HOG) as training dataset. To reach high accuracy in real-time application, a novel method is used to update the system. Meanwhile, via the proposed system, we can store the vehicles features and information in the database. Additionally, with the database, the procedure can automatically detect any discrepancy between license plate and vehicles

Learning and Using Taxonomies For Fast Visual Categorization

The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously N_(cat) = 10^4 - 10^5 visual categories requires sub-linear classification costs. We explore algorithms for automatically building classification trees which have, in principle, log N_(cat) complexity. We find that a greedy algorithm that recursively splits the set of categories into the two minimally confused subsets achieves 5-20 fold speedups at a small cost in classification performance. Our approach is independent of the specific classification algorithm used. A welcome by-product of our algorithm is a very reasonable taxonomy of the Caltech-256 dataset