织物起球等级客观评估的图像采集方法

研究了织物起球等级计算机视觉评估中单侧向照明、圆周向照明及多角度投影这3种方式下起球图像采集原理,并进行了包括规则、不规则及深色等多种织物起球图像采集的可靠性列表比较及分析.结果表明:圆周向照明采集方式为最佳方式;基于特征向量分析对多角度投影起球图像进行合成,是一种可行的采集方式;最适合起球图像评估的织物类型为非深色规则纹理织物.     

应用图像分析技术评估织物起球等级

探讨了应用图像分析技术对织物起球进行客观的等级评估.首先介绍了应用Wold分解纹理模型从织物图像中分离出毛球信息,然后对提取的毛球信息进行阈值化处理,再以毛球的面积百分比、总数和分布等三个特征指标对起球等级进行客观评估.运用上述技术途径对素色、印花及色织的简单与复杂组织等7种织物样品进行起球等级的客观评估,结果与专家的人工主观评定极为吻合.     

基于Wold模型的织物起球纹理非确定性成分提取

通过对Wold纹理模型理论及其在织物起球纹理分解应用可行性的分析,提出包括谐波峰状点结构、线结构及其支撑区域扩展的二维Wold分解算法流程,并设计了二维多尺度B-样条小波匹配滤波器进行峰结构奇异目标检测,提高了Wold分解的鲁棒性.几种典型起球织物纹理的Wold纹理模型分解结果表明,该分解算法能将含有毛球信息的非确定性纹理成分从织物底纹中分解出来,较好地解决了复杂织物底纹对毛球目标识别与分割的影响.     

织物图像中起球特征值的提取与分析

研究了织物图像中的起球特征值与起球等级之间的关系.对13个起球特征如毛球个数、毛球面积、毛球体积、毛球分行维等进行描述和提取,对15幅织物图像中的特征值与起球等级的相关性、可分离性和近似函数关系进行了分析.根据分析结果,选取10个特征值作为起球等级客观评定的依据.     

基于光照投影的起球织物图像的采集、预处理和毛球分割

采用一种新的图像分析方法进行织物起球等级的分析。先获取一系列起球织物切面光照投影图，利用LOG边缘检测算子和线性插值提取每帧图像中织物的轮廓线高度数据，并拼接成一幅反映织物三维轮廓高度的距离图像，最后对该距离图像进行预处理和基于自适应阈值法的毛球分割。     

基于视觉显著性的织物起球客观等级评价

传统的主观织物起球等级评价容易受检验人员经验、心理等因素影响,难以满足准确评价起球等级的需要。在分析视觉显著性机制的基础上,提出一种基于视觉显著性的织物起球等级客观评价新方法。首先利用小波多层静态分解以及各子图之间选择性的中央-周边操作,提高织物起球的近似、水平及垂直细节信息的显著度;在此基础上,通过差分子图融合形成织物起球显著图。然后,根据织物起球特征所确定的阈值分割出织物起球兴趣区。最后,从兴趣区提取织物起球特征,并通过BP(back propagation)人工神经网络进行起球疵点客观等级评价。试验结果表明,该方法能够有效地进行织物起球疵点客观等级评价,并且具有较强的抗噪声能力。     

织物起球标准样照的图像分析

探讨了运用图像分析技术对织物起球程度做客观和定量的描述．首先对精梳毛织物的起球标准样照进行处理分析，然后提取织物起球的特征参数，分析特征值与起球等级间的相关性，再选取相关性较好的3个特征参数，归一化处理后建立特征向量模板，最后对实际织物图像进行分析处理，提取表征毛球特征的参数值描述实际织物起球信息，运用最小距离法时实际织物起球等级进行客观评定，结果与主观评定的结果一致．     

基于光度立体视觉的织物褶裥等级评定

针对目前织物褶裥等级依赖专家主观评定存在不确定因素的问题,提出了利用光度立体视觉算法进行织物褶裥等级评定的方法.在8个不同方向的光照下拍摄多幅织物图像,得到二维灰度图像,并通过一次差分运算重建织物表面各点的高度,利用三维重建获取织物表面形状信息.通过试验提取高度值和尖锐度来表征褶裥特征,以此客观评估织物褶裥的等级.     

小波分析在织物起毛起球客观评级中的应用

本文将小波分析方法应用于织物起毛起球图像分析,建立了基于二维离散小波变换的织物起球图像分析模型,提出了优化分析小波及相应的分析尺度的步骤,并利用Haar小波的方波形状与机织物的织纹结构具有相似性的原理,采用Haar小波对机织物起毛起球进行了分析,给出了织物起毛起球客观评定方法.     

用图像分析技术评价织物起球

首先采用图像分析技术对起球织物的图像进行预处理;其次以织物起球总面积M和起球形态S等指标定量地综合评价织物的起球状况;最后以针织物为例,通过实验验证此方法的可行性.     

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.