基于最大稳定极限区域的车牌定位

车牌定位是车牌识别系统的重要组成部分,目前常用的车牌定位方法主要受环境尤其是光照影响较大。针对这一情况,提出基于最大稳定极值区域特征的车牌定位算法,利用最大稳定极值区域特征特有的仿射不变性和对光照的适应性,提取图像中最大稳定极值区域;尤其是车牌字符区域。在排除部分噪声区域后,根据车牌字符区域稳定的几何特征和排列规则,将满足条件的相邻字符区域组成最近邻对,进一步剔除噪声区域。然后将所提取的最近邻对进行合并即可以得到所有可能的车牌区域。实验结果表明,相比较目前常用车牌字符切分算法,在切分的准确性和稳定性上都有较大提高。     

基于相位一致性和字符纹理特征的车牌定位算法

针对在光照变化和光线不足环境下车牌定位困难的问题, 将相位一致性应用于车牌定位, 提出了基于相位一致性和字符纹理特征的车牌检测算法。利用相位一致性不受亮度和对比度变化影响的特点, 提取图像边缘信息; 在获得的图像相位一致性边缘上, 扫描车牌图像。将扫描区域垂直投影为一维信号, 并利用小波多分辨率的特性滤除噪声的干扰, 再根据车牌中的字符纹理的统计量特征进行车牌提取。实验表明, 该算法在光照变化和光线不足的环境下, 能获得96%的车牌识别准确率。     

机动车辆牌照自动定位算法研究

受光照、车型及周围景物的影响 ,将牌照从复杂背景中定位出来具有较大的难度 ,经典的定位方法不适用于此种场合 为寻求有效的解决途径 ,笔者对定位算法进行了探讨 提出了快速Bernsen二值化方法 ,用以将灰度原图二值化 采用复合极值形态滤波去除不符合牌照形状特征的线条 ,以顺序连通成分标记法标记字符区域 ,再根据牌照的纹理特征去除非法区域 ,然后对剩余区域进行模糊评判 ,选择最优 ,最终得出牌照区域 实验结果说明该算法是有效的 ,并且定位后的牌照字符完整 ,有利于下一步的字符切分和识别     

基于Gabor特征和协同神经网络的车牌识别方法

研究了车牌字符识别问题,针对车牌识别系统易受天气及光照变化影响的实际应用,将Gabor特征和协同神经网络应用在车牌字符识别中,提高了识别率.首先对车牌字符进行二值化和切分,然后利用Gabor滤波器提取车牌字符的特征参数;再利用协同模式训练特征参数,进而得出训练样本;最后根据协同神经网络进一步识别车牌字符.通过大量仿真实验表明,该方法在不同场景、光照条件下,与传统方法相比,识别率有了较大改进,该方法在车牌识别领域有较强的实用性.     

关于高速公路收费系统车牌识别技术的研究

车牌识别是指通过计算机视觉、图像处理与模式识别等方法从车辆图像中提取车牌字符信息。从而确定车辆身份的技术。车牌识别分为车牌定位、字符分割、字符识别三大部分。车牌定位是一个难题：车牌区域在整幅图像中所占比例很小,车牌的颜色、大小、位置也不确定,并且定位算法要能够克服不同光照和复杂背景的影响,还要兼顾准确性和实时性,因此快速准确的定位车牌是比较困难的。本文通过车牌的纹理和颜色特征采用粗定位和细定位相结合的方法进行识别。     

基于最大稳定极值区域与主要旋转不变局部二值模式的复杂场景车牌检测方法

为了解决在复杂场景中进行车牌定位的问题,提出了一种基于MSER与DRLBP特征的车牌定位方法。首先对输入图像进行预处理,然后在多个通道上进行MSER候选区域提取;接着利用所设计的基于车牌字符合并的车牌定位方法进行车牌字符合并;最后利用DRLBP纹理特征对合并后的区域进行验证从而得到最终的车牌区域。实验结果表明该方法具有较好的定位能力。由于方法是通过寻找车牌字符进而定位车牌位置,因此其受车牌颜色、车牌格式的影响较小,在复杂环境中对国内外不同车牌均有较好定位效果。     

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

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

基于图像处理的车牌定位方法的研究

对智能交通系统的核心技术——汽车牌照识别技术进行了研究,在图像处理技术的基础上,着重研究了车牌区域定位技术,分析了目前有代表性的车牌定位方法,介绍了利用粒子图像测速关联PIV（Particle Image Velocimeter）算法原理,提出了一种采用车牌字符笔画2个边缘互相关值最大的方法进行车牌定位的算法,准确而快速地检出了车牌区域,为后续车牌字符识别打下了很好的基础。     

车牌定位及字符切分算法的研究与MATLAB仿真

车牌识别主要包括4个环节,分别是:图像预处理、车牌定位、字符切分和字符识别。运用MATLAB软件,对车牌识别算法进行仿真,实现了汽车牌的定位以及字符切分。在预处理方面,对图像进行降噪,将其转化为灰度图像;在边缘检测方面,运用Roberts等算子进行边缘检测,实验比较后,最终采取较优的Roberts算子;在车牌定位方面,对边缘检测后的图像进行数学形态的闭合和腐蚀运算,去除面积较小的部分,得到车牌位置;在字符切分方面,对车牌进行二值化处理,去除车牌上的间隔符,运用比例分割和垂直投影法混合进行字符切分。     

基于最大间隔符号特征的车牌字符分割算法

车牌识别系统是智能交通中的重要环节之一,字符分割则是车牌识别的重要步骤,其目的是将车牌字符串分割为更易于识别的单个字符。字符分割算法一般分为投影法、连通域分析法和先验知识法3种。投影法和连通域分析法会受噪声、光照变化、污染等情况的影响,先验知识法具有较强的抗噪能力,可以弥补上述2种方法的缺陷,但是其分割效果取决于分割基准点的准确选择。为了提高分割基准点选取的准确性,采用了一种以车牌最大间隔位置的符号作为基准点的字符分割算法。实验表明,此种以最大间隔符号特征为基准点的分割算法抗干扰能力强,解决了对噪声、光照变化、污染等情况的干扰,分割准确率高且速度快,并能够通过分割基准点的特征准确地细分出武警车、警车、军车车牌的类别,分割率达到94%以上,具有较强的鲁棒性和实用性。     

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).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

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.