基于LVQ神经网络的手写字母识别

提出了一种基于LVQ神经网络的手写英文字母识别方案.介绍了LVQ神经网络的基本原理,并利用LVQ神经网络的结构简单、泛化性能好、收敛速度快的特点,将它应用于复杂的英文字母识别.通过对英文字母图像进行预处理和特征提取,将提取的特征对网络进行训练,并利用训练好的网络对英文字母进行识别.Matlab仿真实验结果表明,LVQ神经网络可以对英文字母获得较高的识别率.     

遗传算法优化LVQ网络的监控视频关键帧内容识别

为解决监控视频检索中公安视频侦查关注目标的识别问题,提出一种基于遗传算法优化LVQ神经网络的关键帧内容识别方法。首先通过运动目标检测及二值图像的聚散熵,对监控视频进行子镜头划分,从而提取视频关键帧。其次归一化关键帧中的待识别目标,提取待识别目标的形状统计特征。再次构造LVQ网络并利用遗传算法对网络的初始权值进行优化,训练网络实现关键帧内容识别。最后列举出该方法的实验结果及性能分析。该方法在关键帧内容识别的准确性和鲁棒性上都有良好表现。     

基于学习向量量化在蜂蜜LIF光谱图像识别的应用

针对目前蜂蜜检测技术存在的无法快速、准确识别的问题,提出了一种基于激光诱导荧光(LIF)与学习向量量化(LVQ)有机结合对蜂蜜进行快速识别的方法;采用LIF获取蜂蜜的光谱数据,利用主成分分析(PCA)对光谱数据处理,将处理后的数据输入已建立好LVQ分类学习模型中进行分类识别;实验将挑选4种不同的蜂蜜,每种采集50组蜂蜜光谱数据,随机抽取120组蜂蜜光谱数据用于LVQ神经网络模型的训练,其余80组蜂蜜数据将输入训练好的LVQ模型进行测试; LVQ分类学习模型用于蜂蜜分类鉴定需要的时间为0.8 s,LVQ分类学习模型用于蜂蜜分类鉴定的准确率达到99.45%;实验结果表明:将基于LIF与LVQ有机结合,可以满足蜂蜜快速、准确识别的要求。     

基于LVQ神经网络的植物种类识别

提出一种基于学习矢量量化（LVQ）神经网络的计算机植物种类识别新方法. 使用2-D不变矩、 多尺度2-D Gabor滤波器等多种方法分别提取了叶片的几何特征和纹理特征, 应用LVQ神经网络识别植物种类. 实验结果表明, 该方法对植物种类的识别效率较高.     

基于LVQ神经网络算法的脱机手写数字识别研究

针对BP神经网络进行脱机手写数字识别所存在的问题,提出用自组织竞争神经网络(LVQ)对脱机手写数字识别的方法.介绍了LVQ神经网络算法,并构建了LVQ神经网络的识别模型,用Matlab软件进行了仿真.将获得的仿真结果数据与BP神经网络的测试结果进行对比分析,发现LVQ神经网络对脱机手写数字的识别率明显高于BP神经网络,且收敛速度更快.该方法在脱机手写数字识别领域具有一定的可行性与指导性.     

人工神经网络对电子鼻性能的影响

电子鼻原型由4个气体传感器组成的阵列和人工神经网络识别软件组成,可识别不同品牌的白酒.以它为例,研究了3种人工神经网络,即反向传输网络(BPN)、学习矢量量化网络(LVQ)和概率神经网络(PNN)对电子鼻性能的影响.结果表明,在需要精细识别时,虽然传感器阵列对白酒的响应谱的差别是电子鼻识别的基础,但是人工神经网络结构和算法包括相关训练参数的选择对决定电子鼻的性能也有重要的作用.比较而言,学习矢量量化网络在分类能力和训练成本方面更胜一筹,而概率神经网络则在计算负载和易用性方面更好一些.     

基于共空间模式和神经元网络的脑-机接口信号的识别

提出了一种基于共空间模式和LVQ神经元网络对不同意识的脑电信号进行分类的方法.脑电信号是通过电极在头皮表面采集的脑-机接口的控制信号,提取脑电信号特征并对其进行分类,组成不依赖于正常的由外围神经和肌肉组成的输出通路的通讯系统.首先利用小波包分解对原始脑电信号进行预处理,对分解后特定小波包子带的脑电信号进行共空间模式分解,提取最优的特征;然后利用LVQ网络对不同意识任务特征进行分类,实验结果表明,该方法取得了92.7%的平均分类识别率,已经达到脑-机接口实际应用的标准.     

基于LVQ神经网络的冷轧带钢表面缺陷分类方法

将LVQ神经网络用于冷轧带钢表面缺陷的自动分类中,解决了以往分类方法在多噜缺陷模式类型情况下耗时多和准确率低的问题.对现场采集到的14种主要缺陷类型进行了实验.实验结果表明,基于LVQ神经网络的分类器训练与分类的时间短,在多缺陷种类分类的过程中准确率能得到保证.     

成人高校毕业生学位评审预测模型及其应用

在定性分析的基础上,提取影响成人高校毕业生学位评审的12个指标,并利用粗糙集理论与LVQ神经网络的各自优势,构建了一个粗糙集-LVQ神经网络成人高校毕业生学位评审预测模型。粗糙集作为前置系统,在分类能力不变的前提下对属性进行约简,得到两个属性个数均为7的最小条件属性约简集,利用LVQ神经网络进行分类处理。实证分析中,该模型对两个最小条件属性约简集进行择优选择,并对胜选的属性约简训练样本与全部属性训练样本的分类能力进行对比,最后,利用该模型与LVQ进行了相关参数比较。结果表明,文章构建的粗糙集-LVQ预测模型与LVQ网络相比,输入矢量减少了42%,运行效率提高了75%,准确识别率提高了14.4%。     

BP网络与LVQ网络在遥感影像分类中的比较分析

遥感影像分类是遥感技术研究发展应用中的一个重要组成部分。基于Matlab平台应用BP、LVQ两种神经网络算法对TM多光谱影像进行了分类研究,最后应用混淆矩阵对这两种网络算法与最大似然法的影像分类结果做了精度评价与对比分析。实验结果表明,神经网络分类器作为一种非参数分类器,进行影像光谱特征分类时能获得较高的分类精度,引入对比度纹理特征后精度有更进一步的提高。两种神经网络算法中,LVQ网络算法的影像分类精度比BP网络要高。     

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.