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

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

结合暗通道先验的单幅图像快速去雾算法

基于暗通道先验的单幅图像去雾算法对天空区域的恢复效果不佳,且运行效率较低.为此,文中提出了一种快速、有效的单幅图像去雾算法.该算法首先根据颜色衰减先验建立场景深度模型,并基于场景深度模型估计透射率,再基于局部一致性和暗通道先验得到粗透射率;然后利用图像融合的方法,将基于场景深度模型估计的透射率与粗透射率融合,实现天空区域透射率的修正;最后采用导向滤波细化的透射率复原图像,并对复原图像进行色调调整.实验结果表明,文中算法运行效率高,并且有效地提高了复原图像的清晰度和对比度.     

一种自适应基于暗通道先验的去雾方法

基于暗通道先验去雾方法, 提出一种改进的自适应基于暗通道先验去雾方法, 并使用均方误差对已有雾模型数据库中多组数据进行误差分析. 实验结果表明, 该方法对光线不足或天空等背景的图像实验效果优于已有方法, 并且恢复的图像更接近真实图像.     

一种暗通道先验结合小波变换的图像去雾优化算法

基于暗通道先验的去雾算法是最具有代表性的图像复原算法之一,但仅仅利用暗通道去雾的图像会产生一定程度的颜色失真。针对单幅图像暗通道先验算法造成的图像色彩失真问题,提出了一种基于小波变换的色阶补偿方法。将待去雾图像的低频通道和粗暗通道去雾后图像的高频通道添加合适的权重,之后通过小波变换将待去雾图像与粗暗通道处理过后得到的图像进行多次融合,从而基于原有图像的色阶对暗通道处理造成的颜色失真进行一定程度的补偿。采用信息熵为依据的客观计算机评价,将该算法与其他去雾算法进行比较。仿真结果表明,补偿过后的图像具有较好的观测效果,优于仅采用暗通道先验去雾算法的图像。     

利用中通道补偿的单幅图像去雾

针对雾天图像对比度低和细节模糊等问题,将图像分解为纹理层和结构层,对含有大部分雾气的结构层进行去雾,对纹理层进行增强.为了避免大气光估计易受白色物体影响,提出一种RGB空间立体判决图,并设计基于自适应阈值约束的大气光估计方法,可有效区分天空和非天空区域;针对暗通道先验处理大面积天空、浓雾区域失效问题,提出一种基于中通道补偿的透射率估计方法,可有效克服去雾后图像颜色失真;同时,基于侧窗导向滤波对上述透射率进行修正,能够较好地保持细节.实验表明,本文方法能有效去除雾气,去雾后图像颜色自然,细节保持良好.     

基于暗原色先验模型的混合滤波图像去雾算法

基于暗原色先验模型去雾方法,提出混合滤波快速图像去雾算法.该算法在暗原色先验模型的基础上,对雾图的暗原色图像进行最大值滤波,继而求出透射率矩阵;利用最小值滤波估算透射率矩阵的下限值作为透射率的补偿值,再使用指导滤波修复透射率矩阵;利用小波变换方法对去雾后的图像进行滤波和平滑处理,有效改善了去雾图像的视觉效果.本算法有效解决了由于图像边缘估值失真导致的重建后去雾图像存在景深边缘处白色晕块和斑状奇异点的问题,以及带雾图像不同景深、景深边缘透射率的误差修复问题.     

基于暗原色先验的快速视频去雾优化算法

对目前高分辨率视频图像去雾算法实时性差,天空及大量明亮区域处理不理想等问题,提出一种基于暗原色先验的快速视频去雾优化算法。针对视频图像,采用导向滤波和帧差法,实现快速视频去雾。根据经典大气散射物理模型,首先,利用暗原色先验估计大气光值和透射率图;然后,下采样透射率图并用导向滤波得到优化的透射率图后,上采样并改善透射率图;最终,得到去雾视频帧。与带颜色恢复的多尺度Retinex算法(MSRCR)和He算法进行对比,实验结果表明,所提优化算法能有效提高视频去雾速度,改善去雾效果。     

一种改进的暗原色单幅图像去雾方法

暗原色先验方法可以较好地处理单幅图像去雾,但对理图像中的灰白区域处理效果不好。通过分析暗原色先验原理,得出了暗通道图像和雾的透射分布率以及雾的浓度系数的关系,提出了一种结合峰值信噪比和暗原色优先法则的去雾方法。由实验结果分析,该方法能够更清晰的表现去雾后图像的细节,并且一定程度上克服了原方法在处理图像中灰白区域效果不佳的弱点。     

航拍图像暗通道先验去雾算法速度改进

针对暗通道先验去雾算法复杂程度较高, 利用引导滤波精细化大气透射率图层时间较长的问题, 提出一种用中值滤波精细化透射率图层的算法改进航拍图像去雾速度. 改进算法定义了一种算法简单且具有边缘保护效果、与滤波窗口无关、 时间复杂度为O(1)的中值滤波器, 对云雾均匀的输入图像, 用中值滤波较好地模糊了计算暗通道图层而产生的块状处理结果. 通过计算机编码并采用无参考的客观图像质量评价方法比较算法改进前后的去雾图像效果, 定量分析与实验结果表明, 当原始图像云雾分布较均匀时, 用中值滤波算法时间复杂度低, 相比引导滤波更易实现, 既能节约去雾时间, 又能实现图像平滑处理.     

基于边缘保持滤波的单幅图像快速去雾

为了解决基于暗通道先验的图像去雾算法运行效率低下的问题以及天空等明亮灰白区域去雾后的色彩失真问题,提出一种基于边缘保持滤波的单幅图像快速去雾算法。首先根据暗通道先验规律,得到粗略的透射率图和大气光估计值;然后用边缘保持滤波算法对粗略透射率滤波得到细节平滑、轮廓清晰的精细透射率图;再用阈值法对灰白明亮区域的透射率修正,之后用边缘保持滤波算法对修正后的透射率进行平滑,得到最终的透射率图。根据估计的大气光和透射率,利用大气散射模型即可恢复出无雾图像。经测试,该算法不仅具有很高的运行效率,而且对各种类型的薄雾图像都有较好的去雾效果。客观评测也表明,该算法在对比度增强程度、色调还原程度、结构信息复原程度方面的综合指标都优于其他算法。另外,所提算法还能够实现图像处理器(GPU)像素级的并行运算,对于分辨率为1 280像素×1 024像素的彩色图像,用型号为NVIDIA GeForce 9 800GT的GPU处理,速度可达10帧/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.