压缩感知图像的块子带自适应稀疏表示规则化重构

针对自然图像信号的非平稳特性和不同图像块的变换域系数的分布差异较大, 基于分块图像子带自适应 稀疏表示规则化,提出了一种新的压缩感知图像重构方法．先利用非局部相似块组估计每个分块图像变换域各子 带系数的均值和标准差,再将图像块各子带系数进行去均值并关于标准差归一化, 最后将去均值归一化处理的子 带系数的l₁范数表示用于规则化压缩感知重构．由于块子带自适应稀疏表示更加合理地表达了稀疏系数的重要 性,使得重构图像能够更好地保留纹理、边缘等细节信息．大量的实验结果表明: 相比组稀疏表示的压缩感知重构 算法,该方法重构图像的峰值信噪比平均提高了0.69 dB．     

基于变分稀疏贝叶斯学习的频谱检测方法

为了降低对宽带信号进行压缩频谱感知的复杂度,提出了一种基于变分稀疏贝叶斯学习的频谱检测方法.该算法直接利用压缩测量值对授权用户的位置、个数以及功率传播图进行了估计,在先验知识未知的情况下,利用变分稀疏贝叶斯求解稀疏权值.而且用简单函数因子逼近的方法降低了边缘似然函数的计算难度.实验结果表明:该方法在感知精度和速度上有显著提高.     

方向提升小波变换域稀疏滤波的自然图像贝叶斯压缩感知

针对压缩感知(CS)重构算法在实际应用中自然图像的小波变换系数往往无法稀疏的问题,提出了一种方向提升小波变换(DLWT)域稀疏滤波的自然图像贝叶斯压缩感知算法(DLWT-SFTSW-BCS)。首先对自然图像进行方向提升小波变换得到小波变换系数;然后在随机测量之前利用稀疏滤波切除小系数,消除了小系数对大系数重构时的混叠干扰;最后结合小波树结构的贝叶斯压缩感知重构算法得到自然图像的重构图像。实验结果表明,与仅利用尺度间相关性的小波树结构的压缩感知重构算法相比,DLWT-SF-TSW-BCS算法的重构峰值信噪比最大可提高10dB。     

模式耦合稀疏贝叶斯MIMO雷达成像

通过压缩感知稀疏恢复理论可利用少量MIMO雷达收发阵元实现对目标的高分辨成像。利用MIMO雷达目标图像的块稀疏特性,将模式耦合稀疏贝叶斯学习算法应用于MIMO雷达成像,首先建立MIMO面阵回波信号模型,引入模式耦合稀疏贝叶斯分层模型,将相邻系数通过共用超参数的方法耦合起来。通过贝叶斯推理得到雷达信号的估计式,再通过EM算法实现对超参数的迭代估计,进而实现对雷达信号的估计,直到信号满足误差允许范围,最后重构信号实现MIMO阵列高分辨成像。仿真实验表明,该方法的成像效果在图像的聚焦性能上优于传统的傅里叶、稀疏贝叶斯算法,在散射点重构上优于OMP算法。     

非参数回归模型基于残差的样条估计

为了探究固定设计下具有α-混合相依误差的非参数回归模型的估计理论,基于多样式样条方法对均值函数进行了估计,利用残差构造了方差函数的样条估计。在一般假设条件下,均值函数估计量和方差函数估计量具有相同的一致收敛速度。数值模拟结果显示:基于贝叶斯信息准则下的样条估计优于赤池信息准则下的样条估计和局部线性估计。     

基于多任务贝叶斯压缩感知的宽带频谱检测

针对认知无线网络中主用户信号在空频域的稀疏性,基于贝叶斯压缩感知(BCS)的信号重构通过层次化贝叶斯分析分级先验模型获得稀疏信号估计.将贝叶斯压缩感知应用于认知无线电宽带压缩频谱检测,利用多认知用户感知信号的时空相关性实现在多用户多任务传输条件下的稀疏信号重构与宽带压缩频谱检测.研究了基于期望最大化算法和相关向量机模型的多任务BCS参数估计.仿真结果表明:相比于传统单任务BCS重构方法,多任务BCS在节点能耗与网络带宽受限的条件下,通过对估计参数的合理优化,在较低压缩比区域可实现重构均方误差的快速收敛,且检测性能随着任务数的增加而提高.当感知数据相关性从25%增加到75%,且任务数一定时,所提方法的重构观测数明显下降,宽带频谱检测性能显著提高.     

基于变分贝叶斯推理的高光谱图像恢复

提出一种基于变分贝叶斯推理的高光谱图像恢复方法.建立描述高斯噪声的最大似然函数项,采用小波基矩阵变换,构建小波变换后因子稀疏分布的先验函数;然后建立估计图像和相关超参数的联合后验概率估计模型,并通过变分贝叶斯推理得到估计的图像.利用实际的高光谱图像进行实验,从恢复的衡量指标和视觉效果图两方面验证所提出方法的有效性,结果优于目前常用的图像恢复方法.     

合成孔径雷达图像的贝叶斯压缩感知重构算法

针对目前合成孔径雷达(SAR)图像压缩感知重构算法没有充分利用小波系数相关性的缺点,提出了一种综合利用尺度间衰减性和尺度内方向能量聚集性的SAR图像贝叶斯压缩感知重构算法(DLWT-TDC)。首先采用方向提升小波变换(DLWT)对SAR图像进行稀疏表示,然后在3个高频子带中分别使用3×5、5×3、5×5邻域设计了具有方向和空间局部自适应的先验概率分布模型,最后利用马尔科夫链蒙特卡罗采样的贝叶斯推理恢复出图像的小波系数,进而得到重构图像。实验结果表明,DLWT-TDC算法在采样率为50%～90%下可以提高图像的重构性能,与仅利用尺度间相关性的小波树结构的压缩感知重构算法相比,在90%高采样率下的重构性能可提高3dB左右。     

基于小波变换的图像零树压缩感知方法

稀疏性是压缩感知的前提,然而,自然图像通常不是稀疏的,因此对图像直接应用压缩感知算法很难取得高压缩效率.针对图像信号,将编码思想融入压缩感知理论,提出一种简单有效的零树压缩感知方法.该方法先利用零树思想辅助压缩感知测量,在得到测量值的同时编码重要系数的位置;然后提出零树追踪重构算法,通过精确解码重要系数位置来重构原始图像小波系数,提高重构精度.实验结果表明,相比于现有匹配追踪算法和EZW算法,本文方法有更高的压缩比和更好的图像重构质量.     

结合随机投影和稀疏表示的图像融合方法

引入压缩感知理论解决基于稀疏表示的图像融合方法中融合质量和数据压缩问题,探索在达到一定融合质量的同时降低融合所需计算代价的方法.该方法首先利用随机投影对待融合图像数据进行压缩,再对压缩数据进行稀疏表示得到稀疏系数,根据融合影响因子确定融合稀疏表示系数获得融合图像.实验验证了该算法的合理性和有效性,及在较低压缩比下具有与传统方法可比拟的融合质量.     

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).     

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.     

Tracking data management using topology of moving object database system for moving object constrained trajectory in LBS application

Advances in wireless technologies and positioning technologies and spread of wireless devices, an interest in LBS (Location Based Service) is arising. To provide location based service, tracking data should have been stored in moving object database management system (called MODBMS) with proper policies and managed efficiently. So the methods which acquire the location information at regular time intervals then, store and manage have been studied. In this paper, we suggest tracking data management techniques using topology that is corresponding to the moving path of moving object. In our techniques, we update the MODBMS when moving object arrived at a street intersection or a curved road which is represented as the node in topology and predict the location at past and future with attribute of topology and linear function. In this technique, location data that are corresponding to the node in topology are stored, thus reduce the number of update and amount of data. Also in case predicting the location,because topology are used as well as existing location information, accuracy for prediction is increased than applying linear function or spline function.