基于改进暗通道算法的雾天车辆偏离预警研究

针对在雾天工况下仅凭常规车道线识别方法无法准确提取车道线这一现状,给出了一种基于改进暗通道算法的雾天车道线识别算法.首先利用基于双边滤波器的暗通道算法对雾天工况下的图片进行去雾并对去雾图像进行亮度修正;然后利用Sobel算子和大津法得到包含清晰道路边缘的二值化图像;最后利用Hough变换对车道线精确提取.实验表明:该算法能够在雾天工况下对车道线进行准确、快速地识别;与常规算法相比,该算法具有更高的准确性和实时性,对于提高雾天车辆主动安全性具有较大意义.     

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

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

基于雾天图像退化模型的自适应参数优化的去雾算法

针对单幅雾霾图像中包含有大面积浓雾、高亮以及白色物体等,而导致无法清晰识别的问题,基于雾天退化模型,提出了一种改进暗通道和运用灰度开运算求解环境光值相结合的去雾算法。首先根据暗通道先验理论运用图像阈值分割出暗原色区域和明原色区域,并将暗原色区域与明原色区域相结合以求得更加精准的原始透射率;然后采用引导滤波算法细化原始透射率;并通过灰度开运算对环境光值进行区间估计,提高了环境光值的精准性和鲁棒性。使得该算法适用于暗通道去雾效果不好的浓雾高亮区域,去雾后的图像更加真实自然,边缘细节信息更加丰富,有效去除了Halo效应;同时也有效地解决了单幅图片去雾后图片偏暗,图片视觉效果不好等问题。与经典去雾算法作比较,验证在图像的对比度、失真度、细节信息和边缘保持等方面都优于其他算法。     

基于暗通道先验的快速图像去雾算法

探讨了暗通道先验去雾算法的原理,针对暗通道先验去雾算法时间复杂度太大的缺点,提出用快速有效的巴特沃兹低通滤波器代替复杂的软抠图方法实现对透射率的平滑与细化;针对暗原色图像在景深交界处存在白边现象采用求区域最大值法加以修正;并给出了自适应的求解全局大气光算法.实验结果表明,改进的暗通道去雾算法在获得满意的图像去雾效果的同时能大大提高图像去雾算法的速度,能满足工程上的实时应用要求.     

基于暗通道先验的快速图像去雾

为提高雾天降质图像的清晰度,基于暗通道先验提出单幅图像去雾的快速算法;其主要思想是摒弃复杂的软抠像方法,通过引入多分辨率处理,并结合最小滤波和联合双边滤波,对利用暗通道先验估计得到的透射图进行细化处理。针对天空区域暗通道先验失效引起色偏的问题,结合天空的特征先验和概率分布特征,识别出图像中的天空部分;并依据天空亮度来自适应调整透射率下限值。仿真表明:在保持良好去雾能力的同时,极大地降低了计算复杂度,满足一般工程的实时性要求。     

多雾霾天气车牌识别系统图像预处理算法

为提高车牌识别系统在雾霾环境下识别车牌的准确性,提出了一种新的图像预处理算法.首先,用主成分分析(PCA)和Fisher线性判别分析(LDA)方法对车牌图像进行雾霾检测;然后,用基于暗原色先验的方法对有雾图像进行去雾处理.仿真结果表明:该预处理算法不仅可以满足车牌识别系统实时性要求,而且可以提高系统在雾霾环境下识别车牌的准确性.     

基于引导滤波的单幅图像去雾算法研究

基于暗原色先验的单幅图像去雾算法较好地解决了估算雾天场景透射率的问题,算法复原的图像清晰颜色自然。但原始算法计算复杂度高、耗时长、无法满足实时性需求。介绍了引导图像滤波的原理,并将其与暗原色先验结合以改进原始算法;同时分析了滤波参数对去雾结果的影响。实验证明改进的算法在保证原算法去雾效果的同时能使算法复杂度大大降低。     

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

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

基于暗原色先验的低照度图像增强

低照度图像亮度低、对比度低、细节信息缺失,对后续处理造成不便。针对这种情况,提出一种基于改进的暗原色先验低照度图像增强算法。采用输入图像暗通道的最大值估计大气光值,并用输入图像暗通道替代用大气光值来归一化输入图像,以其暗通道估计透射率,提高了算法效率。对输入图像取反,得到一副类似雾化的图像,用暗原色先验去雾,将结果再次取反,得到增强图像。暗原色先验会放大图像噪声,引入导向滤波实现保边去噪。实验结果表明,算法能有效增强低照度图像,提高图像亮度、对比度和突出图像细节信息。     

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

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