自适应先验马尔可夫随机场模型的图像分割算法

针对全局同态先验马尔可夫随机场(Markov random field,MRF)模型在图像分割中不能有效利用图像局部统计特征的问题,提出了一种基于局部自适应先验MRF模型的图像分割算法.该算法基于贝叶斯理论,利用局部先验Potts模型描述图像的局部特征,建立了一种局部自适应先验MRF模型;提出了基于区域的置信度传播(Belief Propagation,BP)算法,把图像的局部区域特征传递到全局,最终基于最大后验准则(MAP)得到图像的分割结果.实验结果表明:所提模型对于图像中的噪声或者纹理特征等具有较好的分割,分割结果明显优于全局同态先验MRF模型;提出的自适应先验MRF模型对于图像的噪声或者纹理突变信号的干扰具有较强的鲁棒性;算法具有较少的迭代次数和较好的分割结果,且分割时间较短.     

基于非下采样contourlet变换的纹理图像检索算法

提出一种应用非下采样contourlet变换(nonsubsampled contourlet transform,NSCT)进行图像检索的算法,以获取一种兼顾纹理图像概貌和细节信息的特征,从而提高图像检索的性能.该算法利用NSCT对图像进行多尺度、多方向分解,获得子带系数矩阵;对低频子带系数提取能量和方差作为全局纹理特征,并对高频子带系数分别提取尺度间和尺度内纹理信息;通过非高斯双变量模型拟合子带系数,利用信息熵描述尺度间特征;尺度内特征通过对同一层子带图像按主方向排序,获得直方图图像,计算其加权信息熵作为特征向量.对Brodatz标准纹理库的检索实验结果表明,与同类算法相比,该文方法具有更高的检索性能.     

马尔可夫随机场在可见光图像分割中的应用

在可见光图像生成红外图像的过程中，图像分割至关重要。马尔可夫随机场（MRF）具有局部特性，由此特性建立了纹理特征的MRF模型。利用纹理的MRF模型，将参数的期望最大化用于该模型中的参数估计。最后将图像中的所有像素经该模型计算后得到纹理信息并分割图像。通过实验取得了较好的效果。     

基于投影的三维打印模型纹理着色

针对三维打印模型着色的设备复杂、昂贵和着色算法难以实现的问题,本文实现了一种设备简易、易于实现的着色方法.该方法首先使用结构光对场景做编码,同时摄像机拍摄编码后的场景图.然后在场景图的三维模型上至少选取4个二维特征点,通过对结构光解码求取投影仪投射的结构光模板图对应的二维特征点集,并在三维模型上选择对应的三维特征点集.通过点集之间的对应关系,该方法可以正确的投射纹理到三维模型上.实验证明,该文提出的纹理着色方法可以有效地、正确地将纹理动态投射到三维打印物体上.     

基于多通道自注意力网络的遥感图像场景分类

高分辨率遥感图像场景分类广泛应用于土地监测、环境保护及城市规划等诸多领域.现有场景分类方法不能很好地结合局部纹理信息和全局语义信息,同时各通道特征之间的关系没有得到有效挖掘.因此,本文提出了一种基于多通道自注意力网络的遥感图像场景分类模型.通过卷积网络提取遥感图像的多尺度特征;随后采用特征融合单元建立多尺度特征间的局部-全局关系,基于多头自注意力机制的Inter-Channel Transformer在通道维度对融合后的特征建模,并推导特征在通道间的关系,进一步扩大全局感受野,以捕捉其语义结构信息,有效提高了网络的分类精度.在数据集AISC和SIRI-WHU上,本文所提算法的整体分类准确率(OA)分别为95.70%和94.00%,超过了当前最新的研究算法,证明了所提模型在高分辨率遥感图像场景分类任务中的有效性.     

基于多尺度深度卷积特征的图像检索

为了检索图像中不同位置和不同大小的感兴趣目标,提出一种基于多尺度深度卷积特征的图像检索方法.首先利用卷积神经网络构造一个深度学习框架,利用随机梯度下降和后向传播算法训练深度学习模型;其次利用训练得到的模型提取图像在不同尺度下的卷积特征,对不同尺度下的卷积特征进行PCA降维,研究降维后的检索性能;最后为了提高深度特征对图像的刻画能力,对不同尺度下降维后的卷积特征进行特征融合.大量的实验表明本文所提算法对图像检索是有效的.     

利用Relief特征加权进行基于小波变换的纹理分割

在利用小波进行纹理分割的相关研究中,通常小波分解的四个子带对分类的贡献是均匀的。为了考虑不同子带对图像分割的不同影响,提出了一种利用Relief算法对小波分解的子带特征进行加权的算法。首先对纹理图像进行标准金字塔结构小波变换,对小波变换后的各层四个子带进行特征提取作为纹理图像的四维特征;从粗尺度开始对纹理图像进行K均值分割,得到初步分割结果;然后把初步分割结果扩展到下一尺度,根据扩展后的分割标记图对相应尺度的纹理特征进行基于Relief的特征加权,得到加权后的四维特征;再进行K均值分割,经过多层迭代后,得到原纹理图像的分割结果。实验结果表明,与未加权的传统分割方法比较,该方法在分割错误率、边缘准确性以及区域一致性上都有明显改善。     

局部二值平均熵模式与深度残差网络的人群密度估计

针对人群密度估计算法中场景的人群遮挡、尺度光照变化、噪声和低分辨率等问题,提出了一种结合局部二值熵值纹理特征(ELBP)与深度残差网络的人群密度估计算法。该算法首先在原始RGB人群图像上提取LBP特征;然后通过计算邻域像素点的平均信息熵模式构建ELBP纹理特征;随后基于ELBP纹理特征构建了一个深度为18层的深度残差网络;最后形成了对人群密度估计的end-to-end模式。为验证算法的可行性和有效性,在开源的人群密度估计数据集上进行实验。首先邀请10位专家对开源的数据集进行有效的人群聚集标注作为真实输出标签;随后采用研究提出的算法对人群密度完成估计,并与真实结果进行比较。另外,在三种不同的特征和三种不同的机器学习模型上进行了横向比较。实验结果表明,提出的ELBP纹理特征能够很好地应对噪声和低分辨率问题;深度残差网络则能够解决人群遮挡、尺度光照变化的问题。与传统算法相比,提出的算法能够提升人群密度估计的性能。     

快速和尺度稳健的纹理图像识别

传统的纹理图像识别方法很难同时获得较好的识别精度、实时性和尺度稳健性,不利于实际的工程应用.因此,提出一种快速和尺度稳健的纹理图像识别方法.该方法首先利用高斯滤波构造一个纹理图像的多尺度空间,然后利用完备的局部二值计数(Completed Local Binary Count,CLBC)算法对多尺度空间中的每个图像提取局部二值特征,并跨尺度提取局部二值特征的最大值,再将多个分辨率的特征相结合作为纹理图像的最终特征描述,最后利用最近子空间分类器(Nearest Subspace Classifier,NSC)判定纹理图像的类别.在基准纹理图像数据库上的实验表明,该方法在识别精度、实时性和尺度稳健性方面获得了很好的综合性能,有利于实际的工程应用.     

基于LTCP特征的计算机生成图像鉴别算法

针对目前计算机生成图像鉴别算法在对图像纹理特征进行鉴别时精度较差的问题, 提出一种基于长期控制计划(LTCP)特征的计算机生成图像鉴别算法. 首先将彩色图像变换到颜色模型中, 对图像进行下采样, 获得较高尺度的纹理信息; 然后采用基于LTCP特征和共生矩阵的计算机生成图像盲鉴别算法, 对不同尺度的纹理图像LTCP特征及相邻像素一致性共生矩阵特征进行采集; 最后通过判别分类器对LTCP特征及相邻像素一致性共生矩阵特征实施分类预测, 根据分类预测结果实现计算机生成图像的鉴别. 实验结果证明, 该算法在计算机上生成的图像特征维度较低, 鉴别率和精度较高, 能实现计算机生成图像的准确鉴别.     

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.