基于骨架特征的层次化识别算法在异形纤维识别中的应用

针对基于骨架的单一特征的算法在异形纤维图像识别方面的不足,提出一种基于骨架特征并融合其他几何特征的层次化识别算法.首先采用轮廓跟踪算法将骨架信息映射到一种骨架树结构中,然后构造骨架特征邻接矩阵并求出该矩阵特征值,以特征值对异形纤维图像进行大类识别,再结合骨架周长统计特征和异形纤维图像轮廓的凹凸特征对每一大类异形纤维图像...     

基于解剖结构模型和外极线约束的冠脉血管段匹配算法

采用基于解剖结构模型和外极线约束相结合的血管段匹配算法对两幅不同角度的血管骨架图进行匹配. 利用解剖结构模型匹配大部分血管骨架点,形成特征点对,利用这些特征点对计算两幅图像间的几何变换矩阵. 利用外极线约束法匹配剩余血管骨架点,通过互相关算法对匹配点对进一步优化. 该综合算法可以弥补单一算法的不足并结合基于边缘检测的血管宽度提取方法获取血管的宽度信息,为医生的确诊提供参考依据.     

融合梯度信息的最小生成树医学图像配准

针对传统的均匀子采样的最小生成树配准方法对采样率敏感,导致配准鲁棒性降低的问题,提出了一种融合梯度信息的最小生成树医学图像配准算法.该算法首先提取均匀子采样点集,并在此基础上构造最小生成树;然后使用最小生成树来估计Rényi熵;最后将图像间的边缘梯度信息融入到配准框架中.通过在公共数据集RREP上,与传统的基于均匀子采样的最小生成树配准算法和基于归一化互信息配准算法相比,提出的算法在达到良好配准精度的同时,具有更平滑的配准函数和较强的鲁棒性.     

基于细化和最小生成树的多边形主骨架线提取

现有的不规则多边形主骨架线提取方法存在设计复杂、执行效率低等缺点,对此提出一种基于细化和最小生成树的多边形主骨架线提取方法 .首先,确定多边形的最小包围盒,并在其中生成均匀分布、数值分别为0或1的点,运用细化算法提取多边形骨架;再利用Prim算法生成最小生成树;最后,计算最小生成树上的两个叶子节点间的路径长度,将长度最长的路径定义为主骨架线.实验结果表明：本方法提取出的主骨架线效果较好,具有一定的实用性.     

基于向量内积的骨架提取算法

骨架是形状表示的重要特征,传统的骨架算法往往不能直接用于物体识别,且连通性难以保证.用求向量内积的方法对骨架进行提取,通过距离变换得到连接图像各点与最近边沿点的向量,并利用内积计算求取两个相邻点向量的内积值;再根据内积值进行骨架种子点的选择,经两次骨架生长处理得到连通的骨架.实验证明本算法复杂度低,能很好保证骨架的连通性.     

基于Canny算子和轮廓方向图的异形纤维轮廓增强算法

显微包埋采集纤维图像过程中,由于背景光照不均、景深和聚焦等造成纤维图像对比度较低、目标与背景区分不明显的问题.传统的Canny算子对于异形纤维的轮廓提取存在边缘不连续、虚假边缘等不足,尤其是对于粘连纤维无法确定其轮廓.针对这些不足,提出了一种利用轮廓跟踪算法剔除Canny算子产生的噪声边缘,并在方向图的基础上利用矩形方框确定真正的轮廓区域,然后对此区域内的像素进行模糊域非线性拉伸,从而得到增强后的异形纤维图像.对增强后的异形纤维图像进行Otsu二值化处理,其结果表明该算法能够得到准确完整的异形纤维轮廓.     

基于改进ICP算法和CAD模型库的单目视觉位姿测量

针对单目视觉条件下测量三维物体的位姿问题,提出一种基于改进迭代最近点(iterative closest point, ICP)算法和CAD(computer aided design)模型库的单目相机位姿测量方法.首先,利用OpenGL绘制物体几何模型,基于一系列虚拟观察点得到物体在虚拟相机下的投影图,提取边缘点集构成模板库;然后,通过改进的Hausdorff距离将待处理图像的边缘点集与模板库的点集模型进行匹配,得到粗略位姿,再在此基础上采用改进的ICP算法对待测图像的边缘点集与物体三维边缘点集进行迭代优化得到精确的位姿参数.实验结果表明,该方法求得的位姿参数误差较小,进而验证了所提方法的有效性.     

基于贪心算法的离散单位圆盘覆盖问题研究

提出了一种基于贪心启发式的计算方法,可以在多项式时间复杂度内获得DUDC问题的近似最优解.首先生成了可替代二维平面的离散单元格,在每一单元格中心建立能够覆盖一定数量目标点的替代集,使用贪心算法确定替代集的最小组合方式,实现了对目标点的全覆盖.基于每个子集内所包含的点的具体位置,计算了其最小覆盖圆.最小覆盖圆的中心视为选址位置.基于具体案例证明了算法的有效性.讨论了该算法的影响因素,分析了时间复杂度以及近似度比率.     

基于时空上下文信息的混合交通视频检测算法

前景物体的边缘信息对混合交通视频检测的参数提取和表达具有非常重要的作用. 为克服孤立地利用当前图像无法准确提取边缘信息的问题,提出了基于时空上下文表达的混合交通边缘提取新算法. 在获取当前边缘信息基础上,结合运动目标的特征属性与时空上下文相关信息,通过检索文本的关联性,进行前景边缘提取. 实验表明,文中算法能够准确而充分利用上下文信息实现前景边缘的提取,前景边缘的有效提取率可达95%以上,为后续混合交通视频检测的分类识别和参数提取提供了有效的依据.      

一种快速的虹膜定位算法

提出一种结合傅里叶描绘子和最小二乘法的虹膜定位算法.在虹膜内圆定位时,先用改进的轮廓跟踪算法检测二值化瞳孔边缘的点序列,再用傅里叶描绘子提取该点序列的整体轮廓,最后用最小二乘法拟合内圆.在虹膜外圆定位时,先利用虹膜左、右部分的灰度梯度信息,提取外边缘点序列,再用最小二乘法拟合外圆.实验结果表明,该算法提高了虹膜定位的速...     

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.