《汽车牌照识别系统的车牌定位技术研究外文资料翻译.doc》由会员分享，可在线阅读，更多相关《汽车牌照识别系统的车牌定位技术研究外文资料翻译.doc（16页珍藏版）》请在taowenge.com淘文阁网|工程机械CAD图纸|机械工程制图|CAD装配图下载|SolidWorks_CaTia_CAD_UG_PROE_设计图分享下载上搜索。
1、. .建立一个自动车辆车牌识别系统车辆由于数量庞大的抽象,现代化的城市要建立有效的交通自动系统管理和调度。最有用的系统之一是车辆车牌识别系统，它能自动捕获车辆图像和阅读这些板块的在本文中，我们提出一个自动心室晚电位识别系统，ISeeCarRecognizer，阅读越南样颗粒在交通费的注册。我们的系统包括三个主要模块：心室晚电位检测，板数分割和车牌识别。在心室晚电位检测模块，我们提出一个有效的边界限为根底Hough变换相结合的方法和轮廓算法。该方法优化速度和准确性处理图像取自不同职位。然后，我们使用水平和垂直投影的车牌分开心室晚电位分段模块.最后，每个车牌将被OCR的识别模块实现了由隐马尔可夫模
2、型。该系统在两个形象评价实证套并证明其有效性是适用于实际交通收费系统。该系统也可适用于轻微改变一些其他类型的病毒样颗粒。一.导言车牌识别的问题是一个非常有趣，且困难的一个问题.这在许多交通管理系统中是非常有用的.心室晚电位识别需要一些复杂的任务，如车牌的检测，分割和识别。这些任务变得更加复杂时，处理各种倾斜角度拍摄的图像或含有噪音的图像。由于此问题通常是在实时系统中使用，它不仅需要准确性，而且要效率。大多数心室晚电位识别应用通过建立减少一些复杂的约束的位置和距离相机车辆，倾斜角度。通过这种方式，车牌识别系统的识别率已得到明显改善.在此外，我们可以更准确地获得通过一些具体的当地样颗粒的功能，如字
3、符数，行数在一板，或板的背景颜色或的宽度比为一板高.二.相关工作心室晚电位的自动识别问题在20世纪90年代开场就有研究。第一种方法是基于特征的边界限。首次输入图像处理，以丰富的边界限的一些信息如梯度算法过滤器，导致在一边缘图像。这照片是二值化处理，然后用某些算法，如Hough变换，检测线。最终，2平行线视为板候选人4 5。另一种方法是基于形态学2。这种方法侧重于一些板块图像性质如亮度，对称，角度等.由于这些特性，这种方法可以检测出图像中的某些相似的性质和找到车牌区域的位置。第三种方法是基于纹理3。在这种方法中，一个心室晚电位被认为是一个对象和不同的纹理帧。大小不同的纹理窗框用于检测板的候选人。
4、每个人获得通过一个分类，以确认它是否是一个盘子或没有。这常用的方法是寻找图像中的文字任务。此外，已经出现了一些其他有关这个问题的方法上注重检测心室晚电位在视频数据。三.拟议的系统我们的系统，ISeeCarRecognizer，由四个模块：前处理，心室晚电位检测，字符分割，和光学字符识别OCR，在其中最后三个模块处理三个主要问题一个心室晚电位识别域。是VLP检测模块接收到的图像有被处理的预处理模块 -第一个输入该系统的模块。这个模块的结果图像发送到分段模块。分割段模块板的图像，成为独立的characterimages。这些字符的图像，然后认可光学字符识别模块和最终结果是ASCII字符和板块中的数
5、字。1.预处理从相机拍摄的图像进展处理的预处理模块。本模块的目的是丰富的边缘特征。由于我们的检测方法在边界上的基地功能，它可以改善成功率的心室晚电位检测模块。该算法在此模块顺序使用的老龄化，规化和直方图均衡。在得到一个灰阶图片中，我们使用过滤器来提取索贝尔边缘图像，然后以一个二进制阈值的一个图像。我们用于局部自适应阈值算法二值化的一步。特别是，我们开展一种基于动态规划，优化其速度，使其适用于实时应用1。图像的结果被用作心室晚电位检测模块的输入。2.心室晚电位检测算法在边界为根底的方法，最重要的步骤是检测边界限。最有效的算法之一是Hough变换申请提取的二进制映像线从对象的图像。然后我们找两平行
6、线，其包含的区域被认为platecandidates。然而，这种方法的缺点是，霍夫变换的执行时间需要太多多的运算时，被应用到一个二进制图像与大量的像素。特别是，较大的图像慢的算法。该算法的速度可能会通过细化图像改良，然后再应用霍夫变换。然而，细化算法也慢。这种限制使这种方法不适合实时交通管理系统。该算法在本系统中我们采用的是组合Hough变换的算法和轮廓产生更高的精度和更快的速度，它可以适用于实时系统。1结合Hough变换和轮廓算法心室晚电位检测我们的做法是：从提取的边缘图片中，我们使用封闭的轮廓检测算法边界的对象。这些轮廓线改造到霍夫协调，找到两个平行线互动2 -平行线之一成立回另两平行线并
7、建立一个平行四边形表对象是作为板候选人考虑。由于有相当少黑在等高线的像素，转化这些需要协调霍夫点少得多计算。因此，该算法的速度提高没有明显的精度损失。然而，有些板块可能会覆盖眼镜或装饰灯。这些对象还可能有形状两个相互作用二平行线，因此是错误地检测为板候选人。要拒绝这样不正确的候选人，我们评估一个模块的实施无论候选人是板或没有。2板考生核查从两个候选人的水平线，我们可以如何准确地计算出它从水平倾斜坐标。然后，我们应用旋转转换调整它为平角。经过处理，这些标准二进制板候选区域被传递给一个启发式检测和评估算法。我们的评价板候选人在两个算法基地主要步骤，分别采取。这两个步骤是：1评价之间的高度和宽度的比
8、例候选人，2使用水平横切来计算数切入候选人的对象。我们只选择了检查和候选人有宽度与高度之比满足预先定义约束：minWHRatio宽/高maxWHRatio既然有两种主要类型的越南板：1 -行和2行，我们有两个充足两种类型的限制。3.5宽/高4.5一排板候选人0.8宽/高1.4二排板候选人。这些候选人是满足了上述两个一约束选择，并传递到下一个评估。利用水平评价横切。在这个阶段，我们使用两个水平削减和再算上该由这些横切削减对象的数量。一候选人将被视为一个盘子，如果数量的减少选择对象为每个板块在一定围适当通过实验类型。这个数字必须在数量大致围在一类病毒颗粒的字符，我们有两个适宜的约束两个越南板类型：
9、预处理OCR的分割拍摄的图像心室晚电位检测从相机许可证帕泰字符:418排板候选人72n时排板候选人16与N是禁对象的数量。候选人是满足了上述两个约束选定为最终结果。在我们的制度，我们实施的1 /3两hoziontal削减和2 / 3的板候选人的高度。平均的数目切对象将被计算。这种评估有助于确定正确的板候选人。(3).分割要正确认识字，我们要一车牌图像二值图像的设置只包含一车牌字符。这些形象将被传递到对于OCR的识别模块。这个任务常见的算法是运用预测。然而，在一些情况下，无常工作。我们现在将描述我们在分割方法添加一些增强此方法。我们用一个水平投影检测和局部行排在二板。因为二进制图像进展了调整板他
10、们的倾斜角度为零，分割结果的行几乎是完美的。与最低值的位置水平投影是启动或在最后一排板。不同形式的行分割，字符分割更为困难，因为许多原因，如卡字符，螺丝，和泥覆盖板。这些噪音事情的原因使用的字符分割算法垂直投影，有一些错误。在一些最严重的图像质量差板的情况下，一个字符可以分割成两局部。我们应用的假设干制约因素比到一个字符的宽度高度。我们寻求的最低值在垂直 投影，只有这给削减最低位置 件满足所有预定义的限制被认为是 字符分割点。通过此增强，我们在这项任务中取得了较好的效果。经过这一步,我们有一个人物候选人。并不是所有的考生实际上是人物形象。到那时，我们可以重新评估候选人是否板是一盘或不检查的字符
11、数候选人。在越南，一盘只包含7或8字符。最后一盘的候选人，连同与他们的字符列表传递到OCR模块负责确认。(4).用于光学字符识别隐马尔可夫模型在这个系统中，我们使用的字符的HMM模型成认。我们的特点，在此模型中使用的在窗口中的比例前景像素。我们使用的9 9大小的窗口，这个扫描在图像窗口中，从左至右，从上到下这些窗口可以由两个互相重叠三分之二的大小。通过这种方式，我们有一个特征向量其中包括196值。在识别模块，我们需要一个字符分类成一个形象的36个班26个英文字母：甲，乙，丙.和10个数字字符：0，1，2 .。要培养我们的模型，我们使用的训练，是从图像中提取套病毒样颗粒。对每类样本数约为60.T
12、hese提取样品图像实时心室晚电位一点点的噪音，所以在良好的训练，该模型可以正是认识到板的同类型的噪音。在最后一步，我们使用越南的一些具体规那么病毒样颗粒以提高准确性。我们了解到，第三次在车牌字符必须是字母，四是有时信，但通常是一个数字，其他位置当然是数字。四.实证评价我们的系统进展了评价与越南两个套车辆的车牌。图像由索尼DC350数码相机，具有800x600像素大小，在不同地点和时间。我们使用Microsoft Visual C+ 6.0，运行惠普工作站X2000奔腾IV，1.4千兆赫，512 MB的的RAM，Windows XP操作系统。五.结论和未来工作该系统运行良好的越南各类 心室晚电
13、位的图像，甚至抓伤，缩放板的图像。在 此外，它可以处理多个板块中的案件 一样的图像，或不同类型的车辆，如摩托车 板，汽车板或车板。然而，它仍然有几个 错误在处理劣质板材。我们正在数的算法在预处理模块。其目的是探测地区的第一盘地区可能，从而减少 计算本钱的心室晚电位检测算法。在 此外，我们打算结合的纹理为根底的数 方法，和机器学习的方法来评价platecadidates。我们相信，这些将提高信息的准确性和该算法的速度进一步。索引词:车载车牌识别，实时系统，Hough变换，轮廓算法。Building an Automatic Vehicle License-PlateRecognition Sys
14、temAbstractDue to a huge number of vehicles, modern cities need to establish effectively automatic systems for traffic management and scheduling.One of the most useful systems isthe Vehicle License-Plate (VLP) Recognition System which captures images of vehicles and read these plates registration nu
15、mbers automatically.In this paper, we present an automatic VLP Recognition System, ISeeCarRecognizer, to readVietnamese VLPs registration numbers at traffic tolls.Our system consists of three main modules: VLP detection, plate number segmentation, and plate number recognition.In VLP detection module
16、, we propose an efficient boundary line-based method bining the Hough transform and Contouralgorithm.This method optimizes speed and accuracy in processing images taken from various positions.Then, we use horizontal and vertical projection to separate plate numbers in VLP segmentationmodule.Finally,
17、 each plate number will berecognized by OCR module implemented by Hidden Markov Model.The system was evaluated in two empirical image sets and has proved its effectiveness (see section IV) which isapplicable in real traffic toll systems. The system can also be applied to some other types of VLPs wit
18、h minor changes.I. INTRODUCTIONThe problem of VLP recognition is a very interesting butdifficult one.It is very useful for many trafficmanagement systems.VLP recognition requires some plex tasks, such as VLP detection, segmentation and recognition.These tasks bee more sophisticated when dealing with
19、 plate images taken in various inclined angles orplate images with noise.Because this problem is usually used in real-time systems, it requires not only accuracy but also fast processing.Most VLP recognition applications reduce the plexity by establishing some constrains on the position and distance
20、 from the camera to vehicles, and the inclined angles.By that way, the recognition rate of VLP recognition systems has been improved significantly.In addition, we can gain more accuracy by using some specific features of local VLPs, such as the number of characters, thenumber of rows in a plate, or
21、colors of plate background, or the ratio of width to height of a plate .II. RELATED WORKThe problem of automatic VLP recognition has beenstudied since 1990s.The first approach was based on characteristics of boundary lines.The input image was first processed to enrich boundary lines information by s
22、ome algorithms such as the gradient filter, and resulted in an edging image.This image was binarized and then processed by certain algorithms, such as Hough transform, to detect lines.Eventually, couples of 2-parallel lines were considered as a plate-candidate 45.Another approach was morphology-base
23、d 2.This approach focuses on some properties of plate images such as their brightness,symmetry, angles, etc.Due to these properties, this methodcan detect the similar properties in a certain image and locate the position of license plate regions.The third approach was texture-based 3.In this approac
24、h, a VLP was considered as an object with different textures and frames.The texture window frames of different sizes wereused to detect plate-candidates.Each candidate was passed to a classifier to confirm whether it is a plate or not.This approach was monly used in finding text in images tasks.In a
25、ddition, there have been a number of other methods relating to this problem focusing on detecting VLP in video data.III. THE PROPOSED SYSTEMOur system, ISeeCarRecognizer, consists of fourmodules: Pre-processing, VLP detection, charactersegmentation, and optical character recognition (OCR), in which
26、the last three modules deal with three main problems of a VLP recognition domain.The VLP detection module receives images which have been processed by the preprocessing module the first input module of this system.The resulted images of this module are sent to the segmentation module.The segmentatio
27、nmodule segments plate-images into separate characterimages.These character-images are then recognized by the OCR module and the final results are ASCII characters andnumbers in plates.A. PreprocessingImages taken from camera were processed by the preprocessing module.The purpose of this module was
28、to enrich the edge features.Because our detection method bases on the boundary features, it will improve the successful rate of the VLP detection module.The algorithms sequentially used in this module are graying, normalizing and histogram equalization.After having obtained a greyscale image, we use
29、 Sobel filters to extract the edging image, and then thresholds the image to a binary one.We used the local adaptive thresholding algorithm for the binarization step.Especially, we develop an algorithm basedon dynamic programming to optimize its speed and make it suitable to real-time applications 1
30、.The resulted images are used as inputs for the VLP detection module.B. VLP Detection AlgorithmIn boundary-based approach, the most important step is to detect boundary lines.One of most efficient algorithms is Hough transform applying to the binary image to extract lines from object-images.Then we
31、look for two parallel lines, whose the contained region is considered platecandidates.However, the drawback of this approach is that the execution time of the Hough transform requires too much putation when being applied to a binary image with great number of pixels.Especially, the larger image thes
32、lower the algorithm is. The speed of the algorithm may beimproved by thinning image before applying the Houghtransform.Nevertheless, the thinning algorithm is also slow. This limitation makes the approach unsuitable for real timetraffic management systems.The algorithm we used in this system is the
33、bination of the Hough Transform and Contour algorithm which produces higher accuracy and faster speed so that it can be applied to real time systems.1) bine Hough Transform and Contour Algorithm for Detecting VLPOur approach is as follows: from the extracted edging image, we use the contour algorith
34、m to detect closed boundaries of objects.considered as a plate-candidate.Since there are quite few(black) pixels in the contour lines, the transformation ofthese points to Hough coordinate required much lessputation. Hence, the speed of the algorithm is improved significantly without the loss of acc
35、uracy .However, some plates may be covered by glasses ordecorated with headlights.These objects may also have the shape of two interacted 2-parallel lines, and therefore, arealso falsely detected as plate-candidates. To reject suchincorrect candidates, we implement a module for evaluating whether a
36、candidate is a plate or not.2) Plate-Candidates VerificationFrom the two horizontal lines of a candidate, we can calculate exactly how inclined it was from horizontal coordinate. Then we apply a rotate transformation to adjust it to straight angle. After processed, these straight binaryplate-candida
37、te regions were passed to a number ofheuristics and algorithms for evaluating.Our evaluating plate-candidates algorithm bases on twomain steps, which are taken respectively. The two steps are:(a) evaluate the ratios between the heights and the widths of the candidates, (b) use horizontal crosscuts t
38、o count the number of cut-objects in the candidates.In this stage, we check and only select out candidates thathave the ratios of width to height satisfying pre-defined constraint: minWHRatio W/H maxWHRatioSince there are two main types of Vietnamese plates: 1-row and 2-row , we have two adequate co
39、nstraints for two types.3.5 W/H 4.5 with 1-row plate-candidates0.8 W/H 1.4 with 2-row plate-candidatesThose candidates which satisfied one of the two aboveconstraints are selected and passed to the nextevaluation.Evaluate by using horizontal crosscutsIn this stage, we use two horizontal cuts and the
40、n count the number of objects that are cut by these crosscuts.Acandidate will be considered as a plate if the number of cut objects is in the given range chosen suitably for each plate type by experiments .This number must be in the approximate range of the number of characters in a VLP, we have two
41、 appropriate constraints for two types of Vietnamese plates:Preprocessing OCR Segmentation.Images taken VLP Detection from camera License-patecharacters:4 N 8 with 1-row plate-candidates7 N 16 with 2-row plate-candidatesWith N is the number of cut-objects.The candidates that satisfied one of the two
42、 above constraints are selected as the final result.In our system, we implemented two hoziontal cuts at 1/3and 2/3 of plate-candidates height. The average of number of cut objects will be calculated. This evaluation helps to identify the correct plate-candidates.C. SegmentationTo correctly recognize
43、 characters, we have to segment a binary plate image to set of images which only contain one license character. These character images will be passed to the OCR module for recognizing. The mon algorithm for this task is applying projections. However, in somecases, it does not work correctly. We will
44、 now describe our approach in segmentation by adding someenhancements to this method.We use a horizontal projection to detect and segment rows in 2 row plates. Because binary plate images were adjustedtheir inclined angles to zero, the result of row segmentation is nearly perfect. The positions with
45、 minimum values of horizontal projection are the start or the end of a row inplate.Different form row segmentation, character segmentation is more difficult due to many reasons such as stuck characters, screws, and mud covered in plates. These noise things cause the character segmentation algorithm
46、using vertical projection to have some mistakes. In some worst cases of bad quality plate images, a character can be segmented into two pieces.We apply several constraints ofratio of the height to the width of a character.We search for the minimum values in the verticalprojection and only the minimu
47、m positions which give cut pieces satisfied all predefined constraints are considered as the points for character segmentation. By this enhancement,we have achieved better results in this task. After this step,we have a list of character candidates. Not all of the candidates are actually images of c
48、haracters.By that time, we can re-evaluate whether a plate candidate is a plate or not by checking the number of characters of candidates. In Vietnam, a plate contains only 7 or 8 characters . The final plate candidates, together with their list of characters are passed to the OCR module for recognizing.D. Hidden Markov Model for OCRIn this system, we use the HMM model for characterrecognition. The features which we used in this model are the ratio of foregr