基于暗通道先验的图像去雾改进算法

为了改进常规暗通道先验的图像去雾算法中,因大气光值求取不准确引起的复原图像色偏现象,在分析有雾图像天空区域灰度均值和方差特征基础上,提出一种基于二分搜索的大气光值估计算法,获得更为合理的大气光值;针对有雾图像边缘位置暗通道值计算偏差产生的复原图像光晕效应问题,依据最小值图和暗通道图的灰度值差,获取自适应阈值,根据阈值确定图像中景深变化剧烈的边缘位置,从而对边缘位置的暗通道值进行修正。测试结果表明,该方法能够有效去除复原图像中的光晕效应,改善色偏现象,提高图像对比度,以及保留图像中更多的细节信息。     

基于自适应透射率修复的去雾算法研究

雾气环境下获取的图像往往对比度低、色彩弱化,严重影响了其后续应用。已有的去雾算法存在运算速度慢、色彩失真等问题。该文对基于暗原色先验的图像去雾算法进行了改进。(1)通过边缘检测得到图像边缘和非边缘区域,并分别采用不同大小的窗口计算透射率,提高透射率计算速度;(2)通过采用自适应调节的透射率下限值解决不满足暗原色条件的区域的色彩失真问题。实验结果表明,该文方法可以有效的解决图像局部色彩失真问题,大大减少运算时间,使复原图像整体视觉效果增强。     

融合全局与区域大气光值图的暗通道图像去雾方法

针对现有图像去雾方法采用单一大气光值求解、复原图像难以兼顾亮度与远景去雾效果的问题,提出一种融合全局与区域大气光值图的暗通道图像去雾方法 .首先提出一种基于最小方差投影的大气光估计方法,减少大气光估计值受极值点的影响,提高大气光估计精度;其次,提出一种基于场景深度的区域大气光估计方法,对不同景深区域独立求解大气光估计,引入景深信息,兼顾改善近景亮度与远景去雾效果;同时,将两者融合,按照大气光值图对高亮区域透射率进行调整优化,既增加了位置相关信息,又提高了区域间的相关性,增强了复原图像亮度的均匀程度,改善了图像质量.实验结果表明,提出的算法与多种文献去雾算法相比,能够较好地平衡复原图像亮度与远景区域去雾效果,有效提高复原图像能见度,雾霾浓度评价指标(FADE)、平均梯度、信息熵及模糊系数等指标均有显著提升,复原图像更加清晰.     

结合天空分割修正的快速去雾方法

针对目前去雾算法对高亮天空区域处理不理想,以及去雾后的图像整体视觉效果较差的问题,提出一种结合天空区域分割修正的快速雾天图像复原方法.首先,对输入图像进行白平衡处理;其次,根据大气散射物理特性和光学成像特性对大气耗散函数做初始估计,判断是否存在天空区域,若存在天空区域,结合对比度增强调整,Otsu算法(大津法)分割出天空区域,修正天空区域的大气耗散函数;最后,由大气散射模型得到复原图像,并对复原图像做亮度调整.实验结果表明:该算法具有较强的场景适应能力,能很好地处理天空区域;复原图像具有较好视觉效果,而且执行速度更快.     

改进的基于均值滤波的单幅图像去雾算法研究

雾天条件下采集的图像存在低对比度和低场景可见度问题,传统的去雾算法时间复杂度高、速度慢,无法应用于实时图像处理。为此,结合大气光特性提出一种改进的基于均值滤波的单幅图像复原方法。该方法以大气散射模型为基础,首先利用均值滤波得到准确的大气耗散函数;引入直方图修正机制下的自适应保护因子,更正明亮区域的大气散射函数;大气光采用效率更高的四叉树算法求解;最后由大气散射模型计算复原图像并进行图像的亮度调整,从而得到一幅清晰的无雾图像。仿真实验结果表明:该算法的场景适应能力强,复原图像色彩感丰富。与经典的去雾算法相比,该算法在保证去雾效果的同时,克服了导向滤波算法时间复杂度高、速度慢的缺陷。     

使用局部大气光的单幅图像去雾算法

针对传统算法去雾后图像偏暗的问题,根据去雾后图像对比度和亮度均应该增加的标准提出了一种高亮度和对比度的去雾算法。首先依据大气光与复原图像亮度成反比事实,设置像素红绿蓝(RGB)三个颜色分量均值为局部级粗糙大气光,使用具有较好抑制光晕效应的半全局加权最小二乘算法优化获取局部级大气光;然后根据去雾图像方差与大气透射率成反比事实,使用基于像素最小颜色分量的大气散射函数计算粗糙透射率,然后使用局部均值滤波器优化透射率;最后结合雾天成像模型恢复无雾图像。实验结果表明所提算法去雾图像的梯度、亮度和速度等客观指标均优于传统算法,其中亮度最少增强1.5倍。所提算法能提高去雾图像亮度、丰富图像细节和提高去雾速度,具有较好的工程应用价值。     

基于暗通道的快速图像去雾方法研究与实现

暗通道先验(Dark-Channel Prior)去雾方法在处理单幅户外场景图像方面已经取得了非常好的效果,但是在对高分辨率图像以及包含大片白色区域的图像进行处理时,存在运算时间过长、去雾后的图像带有块状噪声等问题。结合暗通道先验去雾算法针对以上问题提出了一种改进的图像去雾方法,首先对高分辨率带雾图像进行降维处理并获得若干子图像,选取其中部分子图像进行暗通道去雾处理后,再对去雾后的子图像进行滤波、融合以及升维处理,还原分辨率后得到清晰的无雾图像。实验结果表明,改进方法可以较好的达到去雾目的,提高图像整体的对比度,真实地复原图像场景细节,同时可以明显提升算法的运算速度,在保证去雾效果的前提下大幅度降低了计算量。     

一种雾天退化场景快速复原方法

针对雾天条件下图像退化的问题,提出一种新的场景复原方法.首先,结合大气散射模型与光学反射成像的特性,对大气耗散函数提出物理约束条件,利用双边滤波的边缘保持特性得到大气耗散函数的初始估计.然后,引入局部均值与局部标准差近似估计图像对比度,从而降低对比度较强的部分区域的雾浓度估计来获取更加准确的大气耗散函数.最后,求解雾图成像方程,恢复理想光照条件下的辐射强度.实验结果表明:该方法对图像的细节和颜色恢复非常有效,并能有效克服边缘残雾现象以及颜色过饱和等不足.     

基于亮区域暗通道矫正和加权聚合引导滤波

针对暗通道先验在天空等亮区域失效和引导滤波容易导致边缘模糊的不足,提出了一种高效的去雾算法.该算法提出一种新颖的亮区域自适应分割与校正方法,基于自适应的相对景深阈值分割亮区域,采用饱和度和灰度值校正亮区域的暗通道.然后利用加权聚合引导滤波代替引导滤波细化初始透射率,解决引导滤波引起的边缘模糊问题.最后,提出一种有效的亮度校正方法,将复原图像转化到HSV色彩空间,对亮度进行均衡化处理,使用相对雾浓度均值作为权值,对均衡化前后的结果进行线性加权得到最终的复原结果.实验结果表明,与经典算法对比,所提算法亮区域分割准确,复原图像纹理清晰,去雾彻底,复原结果的峰值信噪比、平均梯度与信息熵的最大提升分别为34.46%、99.49%和21.18%.     

基于改进的暗通道先验去雾辅助导航算法

经典的去雾算法无法满足车道线检测的实时性和准确性要求,因此提出一种改进暗通道与边缘检测融合的雾天车道线识别算法。首先对有雾图像进行对比度增强处理,突出边缘、颜色等有效信息,基于道路先验信息对图像进行感兴趣区域处理,利用暗通道先验算法对静态约束图像进行去雾操作,并通过双边滤波器细化透射率图,得到清晰的去雾图像;然后引入动态约束理念,提取车道线可能存在的区域,借助Sobel算子检测动态约束后的车道线区域,提取车道线边缘点;最后利用Hough变换进行准确的车道线拟合。实验表明,改进的去雾算法得到的图像清晰度与对比度更高,满足了车道线检测的准确性与实时性要求;去雾及车道线检测算法平均处理时间为297. 305 ms,满足无人驾驶时间要求。     

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.