基于局部感受野和半监督深度自编码的肺结节检测方法

深度学习在肺部影像方面的研究主要集中于肺部CT图像。对肺结节的快速准确检测是肺部疾病治疗的关键步骤。结节检测本身就是一项具有挑战性的工作,且已有的研究均很难得到较高的检测率。针对这样的问题,提出一种改进的深度半监督稀疏自编码的肺结节检测方法。首先,采用局部感受野对肺结节图像进行多层特征提取。然后,利用半监督稀疏自编码自主学习肺部影像中的结节特征。最后,融合多种临床信息实现对肺结节的准确检测。实验结果表明,该方法可以达到准确率90.14%,敏感度89.67%和平均检测率96.64%,明显优于其他方法检测性能,更适用于肺结节的精准检测。     

基于稀疏自编码神经网络的抽油机井故障诊断

针对传统示功图识别方法对抽油机井进行故障诊断存在人工选取示功图几何特征,识别准确度低等问题,提出一种基于稀疏自编码神经网络的示功图智能识别模型。采用无监督学习方式的稀疏自编码器构建特征学习网络自动提取无标签示功图训练集图像特征,然后采用有标签示功图训练集对softmax分类器进行有监督训练,最后通过稀疏自编码神经网络对学习到的有标签示功图测试集特征进行分类并给出故障诊断结果。结果表明,将稀疏自编码神经网络应用于示功图识别,测试准确度能够达到99.44%,优于其它分类模型。稀疏自编码神经网络直接从像素层面提取所需要的特征,不需要人为选定设计特征,为提高示功图识别准确度提供了帮助,进而解决了抽油机井故障难以准确诊断的难题。     

基于无监督学习的编码衍射成像方法研究

编码衍射成像旨在利用衍射强度图样重建原始图像，而现有基于人工设计先验的编码衍射成像算法大都在低信噪比下成像质量低。通过基于深度神经网络学习的深度先验能够解决上述问题，但有监督学习需要大规模样本对，不利于实际应用。针对这一问题，本文提出一种基于无监督学习的编码衍射成像方法。该方法结合双数据保真项、卷积稀疏编码模型和深度图像先验模型构建了能够融合互补先验的优化模型，并利用交替优化方法对其进行有效求解。实验结果表明，提出的方法能够在低信噪比下仅通过单幅编码衍射强度图样重建出高质量的图像。     

用于肺结节检测和分类的两阶段深度学习方法

针对肺部CT数据具有空间信息的特点, 提出一种基于深度学习的两阶段方法, 即使用两个3D卷积网络有效学习结节特征, 对CT图像中的肺结节进行检测和分类. 该方法的检测器部分采用基于U Net的编码器 解码器结构的3D语义分割模型, 以预测结节的位置、 大小和语义掩码; 分类器部分采用3D双路径网络, 用于特征的汇总和收缩, 并给出分类结果. 为充分利用原始数据中的特征信息, 将检测器的结果应用于对原始数据进行采样和掩码操作, 并通过空间金字塔池化层获得一致的输入尺度. 在公开数据集上的实验结果表明, 该深度学习方法对CT图像肺结节的检测和分类具有良好的性能.     

基于全局和局部信息融合的显著性检测

为提高低对比度、复杂自然图像显著性检测的准确率和泛化性能,提出一种贝叶斯框架下的全局和局部信息融合的显著性检测模型.首先,构建深度卷积自编码网络,采用对称编解码结构,监督学习图像全局特征,得到全局显著图;然后,根据全局显著图产生前景和背景码本,利用局部约束线性编码算法进行编码,采用稀疏编码描述局部特征,产生局部显著图;最后,提出采用贝叶斯框架,将全局和局部信息融合,生成最终显著图.实验结果表明,所提模型在ECSSD,DUT-OMRON和PASCAL数据集上F-measure值分别为76.53%、59.45%和72.52%,MAE值分别为0.143 28、0.137 87和0.181 05,且能够有效对低对比度、复杂真实自然图像进行显著性检测.     

基于CT图像3D特征的肺结节检测

为了提高肺结节检测的性能,提出一种基于中心点连续性的肺结节检测算法.该算法使用基于简单线性迭代聚类超像素方法分割CT图像,并根据相似度合并超像素,进而得到肺部区域及疑似肺结节区域,降低了疑似肺结节的漏检率.根据各帧CT图像中疑似肺结节区域的中心点偏移程度评价其中心点连续性,最终判断出阳性肺结节.文中的实验数据来自于上海市胸科医院和LIDC数据库.实验结果表明,改进后算法的敏感度达到86.36%,假阳性率为1.76.     

基于深度学习的监控视频树叶遮挡检测

结合稀疏自编码器的自动提取数据特征能力和深度置信网络较好的分类性能,提出一种基于深度学习的监控视频树叶遮挡检测方法。首先从视频中随机选取一帧图像,通过栈式稀疏自编码器主动学习视频图像的特征信息,然后采用深度置信网络建立分类检测模型,最后引入学习速率自适应调整策略对整个神经网络进行微调。该方法不需要对视频连续取帧,具有较好的图像特征主动学习能力,克服了人工提取特征能力有限的缺陷。实验结果表明,在样本量充足的条件下,使用本文方法进行监控视频树叶遮挡检测可以达到88.97%的准确率。     

基于深度学习的CT影像肺结节检测

为辅助医生检测大量肺部CT( Computed Tomography) 图像中难以发现的肺结节的问题,提出使用深度U-Net网络对肺部结节进行分割。由于U-Net 网络出自于全卷积网络( FCN: Full Convolution Network) ,特点是端到端,像素到像素,网络对每个像素点进行分类,能将深层特征抽象的特征信息和浅层特征具象的位置信息相结合得到CT 图像的分割掩膜。实验结果表明,该方法对肺结节的检测效果良好。     

基于弱监督的VGG深度学习网络遥感影像云检测

大多遥感影像云检测方法中,训练数据需要对影像的每个像素进行标记,标记成本非常昂贵,为了减轻深度学习遥感影像云检测中人工劳动标记数据的成本,图像块标签代替像素标签进行深度学习训练。首先,将多种下垫面的遥感影像裁剪成图像块并标记,带有标签的图像块作为数据集;然后,块状的数据集训练改进VGG深度学习网络,训练好的网络对大型遥感影像进行云检测;最后,选取多种中分辨率卫星图像分别用改进VGG与VGG网络进行了云检测对比实验。结果表明,改进VGG遥感影像云检测方法能很好地检测出碎云和厚云,整个云区的平均精度都在90%以上。使用带标签的图像块,不仅减少了人工劳动,而且有效地进行遥感影像云检测,可为弱监督深度学习的遥感影像相关研究提供参考。     

一种基于自编码的混凝土裂纹识别方法

混凝土表面图像裂纹识别的传统深度学习模型往往需要大量的裂纹图像训练样本,但是在基础设施检测实际场景中,裂纹图像获取和标注困难,无裂纹图像收集则相对便利.提出了基于无裂纹图像单类样本的半监督学习方法,设计了基于自编码网络的混凝土裂纹图像识别模型CrackNet.该模型的主干网络由自编码网络和对抗网络构成,但是为了进一步扩大裂纹图像的重构误差,CrackNet引入了近邻编码策略.近邻编码模块把输入样本的隐向量用码本中最相近的k个隐向量线性编码,编码后的向量经过解码器重构输入.为了进一步提高CrackNet的识别性能和执行效率,提出了CrackNet-T模型.该模型应用K-Means聚类算法学习紧凑的码本,同时引入阈值策略自动决策输入图像是否进行近邻编码,从而避免无裂纹图像被近邻编码改变在隐空间中的表征.本文方法在公开数据集CCIC上进行实验,结果表明CrackNet-T性能不仅优于经典的异常检测模型,而且与有监督深度学习模型识别性能相当.     

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.     

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.     

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.