基于PCNN模型的生物细胞图像分割

在基于脉冲耦合神经网络（PCNN）模型中,讨论了模型中阈值θ、链接权ω和迭代次数量N等参数的求解方法;采用最大熵值及PCNN模型对生物细胞图像进行了分割,并分析了各参数对图像分割质量的影响.实验结果表明,分割图像熵值越大,分割图像总体效果越好.     

自动阈值法在生长环境茄子图像分割中的应用

在果蔬采摘机器人系统中,果实目标的智能化识别和定位问题一直是没有解决的问题。为此,研究生长环境中茄子图像的分割算法问题。通过对生长环境中茄子果实与周围环境颜色特征的试验与统计,得出了EXG颜色因子对于茄子果实分割最为有利的结论。采用自动阈值法对EXG灰度图像进行了分割。选择图像灰度的均值作为初始阈值的估算值,然后连续不断的进行迭代,直到取得满意的结果。试验表明,分割效率分别大于81%,平均用时为0.116s,能够满足果蔬采摘机器人对视觉系统的要求。     

基于C-V方法改进的红外图像自动分割

基于简化的Mumford-Shah水平集图像分割模型,Chan-Vese提出了不依赖于图像边缘的水平集图像分割算法(C-V方法).但是该方法分割参数难以确定,对于具有非均匀灰度背景的红外目标图像常常分割失败.针对这一问题给出了改进的拟合能量模型,新模型兼顾到了目标的同质性信息与其所占面积比例的关系.基于该模型的水平集图像分割方法自适应于灰度起伏的背景,可以较为理想地分割出与背景灰度差异不太明显的目标,对小目标也具有很强的适应性.实验结果表明,在固定水平集分割参数的情况下,新方法对于不同类型、不同背景的红外图像具有了良好的适应性.     

基于灰狼优化算法的PCNN中药材显微图像分割

为有效分割中药材显微图像的目标信息,提出了一种基于灰狼优化算法(Gray wolf optimization, GWO)的改进型脉冲耦合神经网络(Pulse coupled neural networks, PCNN)中药材显微图像自动分割方法。首先,从适应处理显微图像的角度出发对传统PCNN模型进行简化与改进;其次,在训练图像中提取香农熵值作为GWO的适应度函数来自适应调节PCNN关键参数——链接系数β,进而实现图像目标的最优分割;最后,将所提算法与聚类分割法、OTSU法、传统PCNN法进行了实验比较,并用骰子系数、体积重叠误差、相对体积、精确度和交并比等常用医学图像分割评判标准对4种处理方法做了客观评价。实验结果表明,所提方法能够实现图像的自适应分割,较好地保持了图像细节、纹理及边缘等信息,对不同显微图像分割准确度高,改善了图像的分割性能,具有较强的适用性。     

基于局部最大熵的多目标图像分割方法

提出了利用图像局部最大熵进行区域增长的多目标分割方法．以局部熵最大值作为目标种子,运用区域增长技术实现多目标分割,用图像的局部熵值相似性判决准则和图像灰度相似性判决准则对复杂多目标砾石图像进行了实验．实验结果表明,用图像局部熵相似性判决准则的图像分割结果优于用图像灰度值相似性判决准则的图像分割结果．     

一种基于PCNN的参数自适应图像分割方法

针对在基于脉冲耦合神经网络（PCNN）模型的图像分割中,如何确定合适的网络参数的问题,提出一种基于PCNN的参数自适应图像分割方法。该方法通过设定神经元合适的捕获范围和连接值,综合利用图像像素邻域的灰度信息,结合PCNN网络参数间的相互联系,实现对模型参数自动确定。仿真实验表明,该方法可有效地对不同图像进行自适应分割。与传统的PCNN图像分割方法相比具有一定的优越性。     

基于局部最大熵的多目标图像分割方法

提出了利用图像局部最大熵进行区域增长的多目标分割方法．以局部熵最大值作为目标种子,运用区域增长技术实现多目标分割,用图像的局部熵值相似性判决准则和图像灰度相似性判决准则对复杂多目标砾石图像进行了实验．实验结果表明,用图像局部熵相似性判决准则的图像分割结果优于用图像灰度值相似性判决准则的图像分割结果．     

自主足球机器人视觉系统结构及关键技术

提出了自主足球机器人嵌入式多处理器体系结构以及视觉系统的构成框架.对单目视觉系统所涉及的关键技术进行了详细的分析和研究,其中包括图像分割、目标搜索算法、目标定位和机器人自定位技术.基于YUV颜色空间,对目标进行分割,并通过连通区合并来快速搜索目标,同时根据摄像机模型来确定目标的空间位置.实验表明分布式视觉体现结构能够实时准确地完成视觉处理任务.以上新算法可以快速鲁棒地搜索图像目标,并能较精确地确定目标的位置信息和机器人的自定位信息.     

变电站巡检机器人避障方法研究与应用

为提升变电站巡检机器人的导航避障能力,将深度学习技术应用于变电站场景识别中,提出了一种基于深度卷积神经网络的避障方法.该方法联合图像分类和语义分割两个分支来共同辅助机器人导航避障,分类分支通过获取图像全局信息,保证机器人正确行驶方向;而语义分割支路则根据图像局部信息以及机器人前方目标类别,指导机器人准确避障.实验结果表明,避障方法可以高效地对图像进行分类和分割,同时,在实际变电站环境中,该方法也能为巡检机器人提供有效的避障信息,实现实时自主避障.     

自动权值的马尔科夫彩色图像纹理分割方法

为准确获得目标图像,提出一种自动权值的马尔科夫彩色图像纹理分割方法。在HSV颜色空间中以颜色直方图作为颜色特征．设计Gabor滤波器提取图像纹理特征,对马尔科夫算法进行研究．设计自动权值算法。实验证明．该方法能有效降低算法复杂度,减少了分割过程中人为设置参数的主观性．较好地屏蔽图像噪声影响,可以很好地提取出目标图像。     

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.