基于BP神经网络的车牌识别系统

车牌识别系统是智能交通领域的重要组成部分,在现代交通管理中的作用举足轻重.基于VC++ 6.0进行实验,针对中国的车牌进行研究,用BP神经网络来实现车牌识别.车牌识别分为图像预处理、车牌定位、字符分割和字符识别四个步骤.利用车牌的先验知识进行定位,引进双阈值进行字符分割,利用13段特征提取法提取特征向量,实验表明该识别算法行之有效.     

车牌定位系统中关健技术的研究与实现

针对车牌识别系统中由于分割不准确而造成识别率低的问题,提出一种基于一阶水平差分算子的自适应边缘检测的分割方法,以便更好的将汽车图像从复杂的背景中分割出来,同时用优化投影法对车牌进行定位,并在字符识别中利用改进15特征点提取法实现了车牌字符的识别.实验结果表明,该算法对车牌识别的准确性高,识别速度快,鲁棒性好.     

实时车牌识别边缘系统设计及FPGA实现

为解决边缘设备端车牌识别系统适应性差和识别率低的问题,提出一种基于深度学习处理单元(DPU)的车牌识别系统设计方法.该方法首先将车牌识别网络进行改造使其可在DPU上运行,并通过压缩与激励(SE)模块组合优化神经网络识别率.将DPU部署在现场可编程门阵列(FPGA)上,调用神经网络对视频图像进行车牌识别,设计出可兼顾新能源车牌的车牌识别系统.实验结果表明,以大规模数据集作为图像输入,车牌识别系统的平均识别准确率可达94.1%,运行速率可达4 ms.     

车牌识别系统中的关键技术研究

针对目前车牌识别系统中的多项关键技术做了改进。车牌识别系统主要包括车牌定位、字符分割和字符识别。首先提出了基于图像转换和数学形态学的车牌定位技术;然后结合垂直投影和连通域算法对车牌进行字符分割;最后采用13点特征法提取字符特征和改进BP网络神经算法对车牌字符进行识别。实验结果表明,本算法能大大提高了车牌识别系统的准确性和鲁棒性,具有较强的实用性。     

基于字符笔画斜率特征的车牌识别算法研究

车牌字符识别是车牌智能识别系统中的关键技术之一,为了提高车牌字符识别准确率和实时性,提出了一种基于车牌字符笔画斜率特征的字符识别算法,新算法在对准确分割后的车牌字符图像进行归一化、二值化和细化等预处理后,提取车牌字符笔画像素点的斜率值,再将斜率值构造成识别向量,进而通过计算特征向量的夹角值实现待识别字符与标准模板字符的相似度判断;实验结果表明,新的算法与已有的传统字符识别算法相比,既提高了识别准确率,又降低了识别耗时,结果满足实际工程应用需要.     

基于灰度跳变与形态学的车牌定位法

车牌定位是车牌识别系统的关键步骤,定位的准确与否直接影响车牌识别的结果.提出了一种基于灰度跳变与形态学的定位方法.对于车牌候选区的二值图像,根据车牌的水平分布特点,从长宽之比、面积之比等多个方面进行综合分析,从而可以更加精确地对车牌进行识别.实验验证表明,基于该算法的车牌识别系统能够达到较高的车牌识别率.     

基于BP神经网络的车牌识别系统

车牌识别系统是智能交通领域的重要组成部分,在现代交通管理中的作用举足轻重。基于VC++6.0进行实验,针对中国的车牌进行研究,用BP神经网络来实现车牌识别。车牌识别分为图像预处理、车牌定位、字符分割和字符识别四个步骤。利用车牌的先验知识进行定位,引进双阈值进行字符分割,利用13段特征提取法提取特征向量,实验表明该识别算法行之有效。     

基于最大梯度差和边缘搜索的车牌定位方法

车牌定位是车牌识别系统的关键技术,定位的准确与否直接影响车牌识别的结果.为了实现车牌的准确定位及车牌识别,依据车牌区域具有丰富的边缘信息,提出了一种改进的车牌定位算法.利用最大梯度差缩小车牌图像范围和矩形匹配法粗定位车牌,根据搜索车牌的边缘信息来精确定位车牌.实验结果证明了该方法的可行性及定位的准确性,并且比单一使用最大梯度差法的定位准确率有较大的提高.     

基于Matlab的车辆牌照识别系统

介绍了一种基于Matlab的车辆牌照识别系统,采用基于灰度跳变的定位方法,先对图像进行预处理,再用CAN-NY算子做边缘检测、开闭运算子和车牌长宽比特征识别以实现车牌的定位,最后用二次水平投影分析和阈值技术有效检测了车牌图像的上下左右边框、旋转角度,从而准确实现车牌字符的分割.     

基于BP分类器的数字识别研究

本文通过分析BP(Back Propogation)神经网络的结构、原理及其算法,对已经经过预处理的图像进行分析和识别,使分类器能够对0～9之间的数字在最短的时间进行准确分类,从而达到识别出图片中的数字。系统既可以单独使用,也可以作为一个识别系统的软件核心应用到大规模数据统计、财务、税金、金融和车牌识别等系统中。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.