基于相对模糊和边缘强化的散焦求深度方法

摘 要: 研究了由散焦图像恢复物体深度的问题,改进了Favaro等人提出的基于迭代求解热扩散方程的方法.将两幅散焦图像按照相对模糊程度的不同,划分为两个区域,证明了这两个区域的边界和图像的边缘有很高的一致性,通过强化图像的边缘,使这两个区域的边界在迭代求解热扩散方程的过程中更容易确定.模拟实验与真实实验都验证了算法的有效性.     

基于空间变化窗口的信息散度算法

为解决传统信息散度算法存在物体图像大小不一致以及非连续区域深度恢复精度低等问题,提出了一种新的基于空间变化窗口的信息散度算法.该算法计算两幅原散焦图像之间的单应矩阵,并利用单应矩阵重新矫正原图像以获得相同大小的散焦图像对,通过空间变化的窗口结构来估计不连续区域附近的深度.模拟实验和实际图像实验结果表明,文中改进算法可以...     

基于边缘梯度的散焦图像深度恢复

在散焦图像中,点的模糊程度随物体的深度而变化,因此可以利用散焦图像中点的散焦程度来估计物体的深度信息。本文提出了一种基于散焦图像中物体的边缘梯度关系来恢复图像深度图的新算法,用一个已知参数的高斯函数对图像进行再模糊,然后求出模糊后的物体边缘梯度,再与原图像中物体边缘梯度相比,再将该比值与图像的深度关联,求出图像中物体边缘处的深度,再利用后续深度插值方法和深度图优化恢复出整幅图的深度信息。这种算法仅需要一幅图像即可进行深度信息恢复,有较好的有效性。     

强化边缘的单目图像深度估计

为解决目前单目图像深度估计过程中物体边界处深度跳变不明显导致的遮挡难以判别、边界处深度估计准确度较低的问题,提出了一种强化边缘的单目图像深度估计方法.采用深度估计网络输出最初预测的深度图,同时采用深度补偿网络输出应补偿深度的预测值,通过融合两组网络的输出实现对最初预测的深度图中物体边界轮廓处深度值的补偿.此外,通过设计...     

具有非局部项的Cahn-Hilliard方程的图像修复模型

图像修复是指恢复图像中破损区域的信息或者去除图像中的多余物体.Bertozzi等人提出的基于cahn-Hilliard方程的修复模型可以简单且有效地修复图像中的破损区域,但图像的边缘有模糊现象.针对这一问题进行了改进,提出了带非局部项的Cahn-Hillia耐方程的修复模型,实验结果证实了文中所介绍的模型能有效提高修复图像的感知质量.     

基于光度立体图像三维重建的起皱织物表面形态

采用不同光照条件下拍摄的多幅图像,利用光度立体技术对织物表面进行3D重建.首先根据物体表面的照度方程,引入广义逆的概念求解物体表面方向进而确定表面梯度,再运用线积分计算表面高度,结合变分和有限差分思想对所得拟合表面进行进一步的迭代和修正,获得最佳重建表面.将该算法运用到AATCC织物平整度模板图像的三维重建,可获取三维深度信息,并结合4个特征值表征织物起皱程度.     

基于矩保持法的散焦图像深度估计

提出了一种基于散焦图像计算景物深度的新方法。该方法不需要获得光学镜头的点传播函数,利用Ｓｏｂｅｌ算子将同一场景的两幅散焦程度不同的灰度图像转换成梯度图像。利用矩保护法计算边缘区的大小与整个图像区域大小的比ｐｃ,根据两幅图像的Ｐｃ值计算出景物的深度。实验结果表明了该方法的有效性。     

一种从明暗恢复形状的快速黏性解算法

针对传统的从明暗恢复形状(SFS)算法存在误差大、耗时长的问题,提出了一种SFS的快速黏性解算法(PSFS-FVS).首先假定物体表面反射模型为朗伯模型,建立透视投影下的图像辐照度方程,然后将该方程转化为包含物体表面深度信息的静态Hamilton-Jacobi偏微分方程,使用非线性规划原理逼近该微分方程的黏性解,进而得到物体表面的三维形状.合成花瓶图像的实验结果表明:与Prados-Faugeras算法相比,PSFS-FVS算法在相同迭代次数时,恢复三维形状高度的平均相对误差降低了8.7%;在相同的误差条件下,所需的CPU运行时间减少了23.5%.实际人脸图像的三维形状恢复结果表明,PSFS-FVS算法在恢复局部细节信息时更加准确有效.     

三维边界元寄生参数提取中的有效预条件方法

为研究集成电路中金属互连线的寄生效应对电路性能产生的影响,分析了三维边界元计算的预条件迭代求解问题,针对寄生参数提取中涉及的复杂多区域边界元计算,提出两种基于MN (mesh neighbor)方法的有效GMRES (generalized minimal residual)预条件.对大量来自实际版图提取实例的计算表明 该预条件方法使方程求解过程迅速收敛,迭代次数与求解时间比对角线逆预条件减少约30%或更多.     

基于分裂Bregman算法的全变差图像修复

图像修复是指对一副图像受损或缺失区域的图像内容的重建。全变差正则化是一个有效的恢复锋锐边缘图像的修复方法。本文重点研究了全变差正则化图像修复方法,并基于Bregman迭代正则化方法设计了其快速迭代求解算法。实验结果表明,基于分裂Bregman算法的全变差图像修复方法是有效的,复原图像在客观评价标准和主观视觉效果方面均有较好表现。     

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…     

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.     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

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.