一种改进的局部对比度图像增强算法

基于加权自适应直方图均衡法,本文提出了一种局部对比度增强算法.它既考虑了图像细节的增强,也考虑了噪声的抑制.针对图像中不同区域存在对比度差异的情况,通过参数设置使高对比度的区域细节增强较少,而低对比度的区域则加大增强细节的力度,从而改善图像视觉效果.由于在图像的增强处理过程中,忽略了对应于原图像中梯度小于某一域值ε的像素的计算,从而减少了图像增强需要的计算量.实验表明算法是有效的.     

基于CLAHE的X射线行李图像增强

提出了一种基于对比度受限自适应直方图均衡化(CLAHE)的X射线行李图像增强算法.首先使用一种背景区域快速填充方法降低背景噪声的干扰,然后采用CLAHE技术增强图像的对比度,最后采用一套组合锐化方案增强图像的细节.实验结果表明,使用所提方法能够快速有效地增强X射线行李图像的对比度,突出行李物品的细节.     

基于双窗口区域激励的边缘提取算法

针对常用的边缘提取算法如Sobel、Lo G及Canny在实际使用过程中存在的一些问题,提出了一种对噪声和光照更加鲁棒的边缘提取算法.通过提取双窗口区域的加权灰度比值到预先设置的对比函数中,结合Sigmoid函数生成边缘图像的激励值,从而削弱了噪声和光照对边缘检测的影响.为了进一步提高边缘图像的对比度,通过引入对比度增强算法如自适应直方图均衡化来提高图像对比度.实验结果表明:采用此方法能够更好地提取出图像中的边缘信息,有效缓解了Sobel算法存在的局部细节丢失以及Lo G和Canny算法易受光照干扰产生伪边缘等问题.     

基于曲波变换的视网膜血管图像增强算法

视网膜血管图像存在像素对比度低等特点,干扰正常的视网膜图像分割.针对视网膜血管的图像特性,提出了一种改进的基于曲波变换的视网膜血管图像增强算法.首先选取视网膜图像的绿色通道分量进行预处理,然后通过对变换系数的自适应增强完成图像的增强处理,并结合改进的形态学变换,实现图像细节的增强和背景噪声的抑制,使得图像对比度得到增强,细节信息更加明显.通过与其他增强算法的比较表明,该算法在增强对比度、降低噪声干扰等方面优于其他算法.     

一种多尺度X射线胸片图像增强算法

针对医学X射线胸片增强的同时会在大尺度边缘产生伪影从而影响医学诊断的问题,提出了一种基于边缘的非线性X射线胸片增强算法(MSCE).该算法先将图像进行多尺度分解,然后结合人眼视觉对对比度敏感的感知特性,计算图像基于边缘的局部对比度,通过结合其局部对比度信息控制各尺度信号增强系数,最后重建得到增强后的图像.MSCE算法能在保证小信号增强能力的同时,较大限度地抑止大尺度信号边缘伪影.实验结果表明,与Vuylsteke以及Stahl的非线性增强算法相比,在保证同样细节增强能力的同时,其大尺度边缘区的平均局部方差分别下降了约36.78%和29.64%,实验验证了MSCE算法具有优越的整体视觉质量.     

红外图像增强方法的研究

为解决对比度差、边缘细节模糊等问题,提出了用分段增强法提高红外图像对比度.分段小波增强算法能有效地同时增强红外图像对比度及边缘细节,并抑制噪声.建立了表征图像边缘的特征向量.根据红外图像边缘的特征,准确提取红外图像的边缘.通过神经网络边缘检测法对样本集训练,使网络具有依据边缘特征向量求解场景中物理边缘的能力.实验结果表明神经网络边缘检测算法的精度优于其他算法,抗噪声能力强、边缘定位能力强、检测精度高.     

基于对比度受限直方图均衡法的牛羊眼部图像增强方法

针对牛羊眼部纹理信息提取前需要对牛羊眼部图像进行增强处理的问题,采用对比度受限直方图均衡化方法对牛羊眼部图像进行增强处理。该算法首先将原始图像分割成若干个大小相同的子区域,再计算截取值对每个子区域的直方图进行截取,并将截取下的像素均匀分配到每个灰度级,得到限定对比度直方图,根据限定对比度直方图对原图进行灰度双线性插值生成增强图像。实验结果表明,使用对比度受限直方图均衡化方法对牛羊眼部图像进行增强处理,增强后的图像具有更高的图像细节和层次感,同时减少了图像的失真,具有较高的理论和实用价值。     

基于改进的高斯混合模型牙齿图像分割研究

针对边界模糊和对比度低的口腔CT图像中牙齿目标区域提取难的问题,提出了一种基于高斯混合模型与K-均值的改进聚类分割算法.该算法首先通过各向异性滤波对图像预处理,实现去噪平滑的同时增强图像的细节;然后利用K-均值完成初始划分,并根据分类后的像素值给出EM算法迭代的初始值,加快算法迭代到最优解,从而大大降低算法迭代次数,有效解决EM算法求解参数时随机选取初值点易导致GMM陷入局部最优解的问题,进而使分割区域完整;最后利用EM算法学习GMM,完成ML分割.实验结果表明:改进方法降低了计算复杂度,对噪声具有较强的鲁棒性,可获得更为理想的分割结果.     

保持局部对比度的动态范围压缩算法

针对高动态范围图像在显示时不能突出部分细节的缺点,提出了一种保持局部对比度的动态范围压缩算法,解决了传统算法在动态范围压缩时会降低局部对比度和影响高亮区域的缺陷,提出了新的S形亮度转换曲线,即通过控制S形亮度映射曲线的强度来提高图像低照度和增强强光区域的显示效果.实验结果表明,该算法可以有效压缩动态范围,使图像拥有较好的视觉效果.     

一种新的红外图像的去噪和增强算法

针对红外图像信噪比小的特点,提出一种基于Prewitt算子的改进方向中值滤波（IDMF,Improved Directional Median Filter）去噪算法,通过Prewitt算子计算目标背景过渡区域(TBA, TargetandBackground Area）的梯度方向,以此找到对应的轮廓方向,在轮廓方向上进行中值滤波,在滤除噪声的同时可以较好地保留图像细节.同时,针对红外图像的灰度分布集中且对比度小的特点,提出了一种局部对比度增强和全局对比度增强相结合的增强算法.首先采用Roberts交     

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.