BP神经网络探析脱机手写汉字识别

神经网络是一种新型的信息处理模型,通过对生物神经系统的模拟,凭借自适应学习以及自动处理等功能,可达到预期目的。脱机手写汉字识别难度较大,为提高识别速度和精确度,采用了建立在反向传播法基础上的神经网络模型,对脱机手写汉字进行识别。以小字符集汉字识别为例,针对反向传播法中存在的缺陷,如收敛速度过慢,易陷入局部最小点等,对其算法进行了改进,取得了较好的效果。     

基于改进神经网络的边坡岩体弹性力学参数识别方法

基于人工神经网络的 BP算法 ,建立了根据边坡开挖后岩体位移观测数据识别岩体弹性力学参数的数值方法 .在网络训练过程中采用改进的 BP算法 ,通过对学习算子的优化搜索 ,大大提高了网络的收敛速度 ,解决了 BP算法迭代过程中目标函数振荡问题 .通过算例表明 ,提出的改进的 BP算法有助于提高岩土材料参数识别收敛速度和识别精度 .图5 ,表 3,参 15     

基于BP神经网络的脱机手写混排字符集的识别方法

脱机手写字符自动识别是计算机光学字符识别(OCR)领域的一个活跃课题,有着十分广泛的应用前景.文中提出了基于BP神经网络的脱机手写中英文和数字混合字符集的识别方法,给出一种特征提取方法,通过实验说明如何选取网络隐含层神经元个数,以及如何选取网络连接权值的初值.对由不同人手写的中英文字符的混合字符集做识别实验,结果表明文中所设计的神经网络分类器,不仅能保证识别精度和识别速度,而且能有效的识别混合字符集.     

果蔬机器人采摘中基于改进SDD模型的目标自动化识别研究

为了提高果蔬机器人采摘的识别准确率,利用SDD网络进行实时检测。对基础网络的构造和检测层默认框进行改进,增加卷积层数量,减少计算参数,使其利于对不同尺度的果蔬进行识别,得到基于改进SDD模型的目标自动化识别框架。分析激活函数,发现Relu函数具有更快的收敛速度,利用Relu函数进行激活操作,并对训练结果进行分析,结果表明,改进后的SDD模型具有更快的收敛速度;当置信度为0.45时,改进后的SDD模型具有较理想的准确率、召回率、FI值和IOU值,可以满足果蔬机器人采摘的识别要求。     

基于改进LeNet-5模型的手写体中文识别

手写体中文的自动识别是中文文档数字化的前提和基础,由于中文字符数目繁多、相似性强、字体种类繁多、书写随意、缺乏统一规范等原因,一直是计算机视觉领域中一个具有挑战性的问题.为解决这一难题,提出了一种基于卷积神经网络的手写体中文识别方法.在经典LeNet-5网络模型的基础上进行改进,提出了一种LeNet-Ⅱ模型.利用改进的Inception模块和空洞卷积,设计了一种并行的双路卷积神经网络结构;两路分支可分别提取手写中文图像中不同尺度的特征,获得多个尺度的特征图像;通过对其进行特征融合,可以达到丰富特征图像多样性、提升识别准确率的目的;最后经过全连接层进行分类.利用经典手写体中文数据集进行训练,利用该模型实现了3 755类手写体中文字符及相关文本的自动识别.实验结果表明,基于改进LeNet-5模型的手写体中文识别方法,在同一训练数据集上的收敛速度和识别准确率明显优于经典LeNet-5模型,对经典数据集的识别准确率可以达到95.21%,也高于其他传统算法;此外,对4幅手写体中文文本的平均识别准确率达到97.30%,超出了人类表现,取得了理想的实际效果.     

改进BP网络在重组大肠杆菌高密度发酵中的应用

目的 将改进BP网络应用于重组类人胶原蛋白工程菌高密度发酵过程分析.方法 通过添加动量项和可变学习速度的方法对传统BP网络算法进行改进.结果 确定了5-9-1的网络结构,选择15组发酵实验数据对其进行训练.改进的方法对网络的收敛起到明显效果.得到的发酵过程BP网络模型收敛性和预测性能较高,平均相对误差仅2.42%.结论 该模型较传统动力学模型误差更小,更接近实验过程.     

基于神经网络的小样本手写汉字识别

文字图像识别具有重要的研究价值,为了完成复杂的字体图像识别任务,基于VGG结构思想,设计了基于卷积神经网络结构的手写字体识别模型,使用HWDB1. 1数据集中最常用的100个汉字组成的子数据集,应用Batch-Normalization等方法进行优化训练。实验结果表明,模型能够以很快的速度收敛,在有限的训练迭代次数下,模型在测试集上的识别准确率为96.77%。     

基于深度学习One-stage方法的焊缝缺陷智能识别研究

目前基于深度学习的卷积神经网络在对焊缝缺陷射线图像进行智能识别时,多采用基于候选区域的two-stage方法,检测速度难以满足实时性要求。针对该问题,提出基于深度卷积神经网络的one-stage焊缝缺陷识别定位算法,将整张图像输入网络,并直接在输出图像上标定目标缺陷位置及类别。通过采用特征金字塔、减小网络深度、引入跳跃连接卷积块和K-means算法等方法对YOLO网络进行改进,提高了网络对焊缝缺陷识别定位的准确率和速度。实验结果表明:该方法比two-stage识别定位算法和YOLO原网络在检测速度和检测精度方面都有所提升,单个图像的平均识别准确率为94.9%,召回率为94.1%,处理时间为19.58 ms,具备焊缝缺陷在线实时识别的工程应用价值。     

基于BP网络的同面多电极技术图像重构算法

为实现同面多电极技术对飞机用复合材料损伤区域和大小的识别,采用BP神经网络算法建立采样电容值与检测区域介电常数分布的非线性映射,利用输出灰度值实现损伤区域的图像重构.利用主元分析法对输入电容值进行降维处理.采用自适应调整学习率与动量因子方法加快了BP网络训练的收敛速度.仿真结果表明,该算法重构的损伤区域图像成像速度较快,准确度满足实现同面多电极技术对复合材料损伤区域大小和位置识别的要求.     

一种基于BP网络的改进

BP神经网络存在其固有的缺陷:收敛速度慢、易陷入局部极小、网络结构难以确定等.本文针对BP网络学习速度慢的缺点.用熵函数作为误差函数来对BP算法进行改进,提高了收敛速度和稳定性.通过对标准BP网络和相对熵方法在不同学习速率上收敛速度的比较实验证明,相对熵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).     

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.