一种彩色汽车车牌的自动分割方法

汽车牌照的定位是一个公认的较难解决的图像分割问题,文章提出了一个综合多种特征的车牌分割算法;该算法首先利用颜色信息特征加强输入图像的车牌区域,然后基于车牌区域的灰度变化和纹理特征提出一种垂直边缘检测方法实现牌照与背景的进一步分离,使用数学形态学滤波和区域合并,最后运用投影法确定牌照区域;实验结果表明,该方法取得了良好的效果。     

基于Relief算法的智能车辆牌照模糊识别方法

由于当前已有方法未能对车牌照进行降维处理,导致车牌照识别结果不准确,为此,提出一种基于Relief算法的智能车辆牌照模糊识别方法。采用Relief算法计算不同车牌图像特征的权重系数,对特征集进行降维处理。通过序列视频图像对智能车牌进行增强处理,利用全卷积网络对车牌照显著区域进行检测,粗略提取图像中的显著区域,使用滑动窗方法对候选区域车牌进行精准检测,定位车牌准确位置,加入字符的上下文信息,对字符进行精确检测和识别,最终实现智能车辆牌照模糊识别。仿真实验结果表明,所提方法可获取高精度的车牌照识别结果。     

基于区域最大有效信息量的牌照定位新方法

汽车牌照定位的效果直接影响车牌识别系统的工作性能。为了提高定位的准确性,在对现有牌照定位算法的研究和分析的基础上,结合实际工程实例,提出了一种基于区域最大有效信息量的车牌定位新方法,该算法提取图像的垂直信息,通过阈值判断准确定位车牌区域。并使用在不同光照情况下,不同种类车牌图像对该算法进行实验。实验结果表明,该新方法不仅具有良好的定位能力,而且定位速度快,定位准确率高。     

基于小波变换和亮度矩的车牌图像分割算法

车辆牌照图像的分割是车牌识别的前提和基础，针对牌照与车身背景的分割问题，该文提出了基于小波变换和这度矩方法的车辆牌照阈值分割算法，首先，对车牌图像进行小波去噪，然后利用亮度矩对去噪后的车牌图像进行阈值分割，实验结果表明：此方法能够从含有较强噪声的车辆图像中获得车牌图像，且具有相对于图像的平移、尺度变化和旋转的低敏感性。     

基于形态学原理的车牌定位方法

在智能交通系统中,车牌自动识别是一个重要的组成部分.本文展示了一个实时、有效的车牌识别方法.首先增强图像并利用车牌中字符的特点,用形态学的原理构成一系列算法,将汽车图像中车牌区域于其它部份分离,随后依据车牌的比例作一个掩模,利用形态学重构算法,在汽车图像中最终定位车牌并返回原图像分割出汽车牌照.实验证明这是一个非常有效的方法.     

边缘点颜色分布结合车牌自身结构的车牌检测

提出了一种基于边缘点颜色分布结合车牌自身结构的二次车牌定位方法。首先,根据牌照区域的纵向纹理特性,提取灰度图像的竖直边缘突出车牌特征,然后计算边缘点的颜色分布,滤除不满足车牌特定颜色搭配的背景边缘点,最后通过形态学运算、滤波、矩形区域覆盖等得到候选目标。在验证模块中,依据车牌的结构特征对候选区域进行验证分类,最终确定车牌位置。本文对实际收集的样本车牌图像进行试验,结果表明,算法对车牌目标定位具有较高的准确率。     

车牌自动识别系统中的牌照区域图像分割技术

以车牌自动识别技术中的牌照区域图像分割技术为重点,介绍运用车牌图像进行牌照边缘检测,从而实现图像区域分割,克服整体识别技术中的关键问题的相关内容．     

高速公路收费系统图像识别技术的研究

本论文主要完成对于车辆牌照的图像识别,车辆牌照的识别是基于图像分割和图像识剐理论,对含有车辆号牌的图像进行分析处理,从而确定牌照在图像中的位置,并进一步提取和识别出文本字符。识别步骤概括为：车牌定位、车牌提取、字符识别。     

基于数学形态学的车牌定位算法

在汽车牌照识别系统中,车牌定位是整个识别模块实现的前提,为了能对汽车牌照精确定位,提出了一种基于数学形态学的车牌定位方法。首先利用中值滤波方法对汽车图像进行消噪处理,然后用迭代阈值选择法将图像进行二值化,并运用数学形态学的膨胀、腐蚀对二值图像进行处理,得到几个车牌候选区,然后利用面积、长宽比以及垂直投影特征值等进行综合分析,准确定位车牌区域。实验结果表明,该方法简单易行、准确率高、并且具有一定实效性,可用于对实际车牌图像的准确定位。     

汽车牌照的检测与文字分割

为了从车辆图像中检测汽车牌照的位置,并分割出牌照中的文字,实现对车辆身份的认定,利用牌照的边缘、文字及字符间距特征,构造了两个模板矩阵,并在此基础上设计了模板响应算法.结果表明:通过计算模板的响应,可以检测到车牌的位置及像素高度,并按车牌实际高度和像素高度的比例关系分割出牌照中的文字;该算法效率高,稳定性好,抗噪声能力强.     

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.