基于压缩传感的全息图压缩研究

提出将压缩传感理论用于数字全息图的压缩研究.研究了2种不同变换域对全息图稀疏化的影响,针对全息图的特点选取合适的稀疏域,然后根据压缩传感理论直接获取图像的压缩表示,最后利用得到的压缩数据采用2种不同算法重构全息图并对比其重构效果.实验证实这种压缩方法是可行的,并且在傅里叶稀疏域下使用正交匹配追踪(OMP)重构算法能获得1.5%的压缩率.     

基于压缩感知的图像重构GUI系统

本文利用MATLAB平台设计了基于压缩感知的图像重构GUI系统,针对不同的变换基、测量矩阵、重构算法对图像的压缩采样及重构进行了比较和讨论,其中变换基包括小波变换基和离散余弦变换基;测量矩阵包括随机矩阵如高斯矩阵和贝努利矩阵,以及确定矩阵如哈达玛矩阵和托普利兹矩阵;重构算法包括正交匹配追踪算法和压缩采样匹配追踪算法.并通过峰值信噪比PSNR衡量了图像重构的性能.该GUI系统能够为基于压缩感知的图像重构提供直观的实现平台.     

结合系数重用正交匹配追踪的字典学习算法

针对压缩感知中字典对信号稀疏表示能力不足的问题,文中提出了一种结合系数重用正交匹配追踪的自适应字典学习算法,该算法使用系数重用正交匹配追踪算法得到稀疏系数,在字典更新阶段引入上一次迭代过程的先验信息.首先对稀疏系数矩阵进行奇异值分解,再分别用前一次更新的字典对左奇异矩阵和用训练信号对右奇异矩阵进行变换,然后采用变换后的左、右奇异矩阵构造新矩阵,最后利用新矩阵进行字典训练.实验结果表明,采用文中算法得到的字典对图像具有更好的稀疏表示能力,提高了重构图像的质量.     

基于DWT的图像分块压缩感知重构算法

运用压缩感知理论对大尺寸图像进行重构耗时较长,观测矩阵要求的存储空间较大,且重构后的图像存在明显的块状效应.根据图像小波变换系数的特点,将图像分块思想与DWT变换相结合,提出了一种改进的基于DWT的图像分块压缩感知算法.将图像子块经DWT变换后,保留图像低频系数,只对高频系数进行观测.重构时采用正交匹配追踪算法（OMP）对高频系数进行恢复.Matlab仿真结果表明,新算法跟基于DCT分块压缩感知算法相比,重构图像的PSNR值提高了2~4 dB,重构时间明显减少,与基于二维离散余弦变换(DCT)的分块压缩感知算法相比,块效应有明显的改善,重构图像质量明显提高.     

基于DCS的矿山物联网微震数据重构算法研究

煤矿物联网是近几年兴起的热点研究领域。针对煤矿物联网分布式环境下微震数据量大的问题,引入分布式压缩感知理论对微震数据进行压缩以减小数据传输量。以分布式微震信号为对象,通过傅里叶变换基对其进行稀疏性分析,论证了可以用压缩感知相关理论对微震数据进行压缩处理。基于广义正交匹配追踪算法及稀疏度自适应匹配追踪算法,提出了一种改进的分布式稀疏度自适应正交匹配追踪重构算法。基于MATLAB仿真平台,用改进的算法重构稀疏测量后的分布式微震信号,仿真结果表明,该算法在减少计算量的前提下有效地恢复了原始微震信号。     

稀疏线性预测字典在语音压缩感知中的应用

压缩感知理论框架可以同时实现信号的采样和压缩,将压缩感知应用于语音信号处理是近年来的研究热点之一.本文根据语音信号的特点,采用K-SVD算法获得稀疏线性预测字典,作为语音信号的稀疏变换矩阵.高斯随机矩阵用于原语音信号的采样从而实现信号的压缩,最后通过正交匹配追踪算法(OMP)和采样压缩匹配追踪算法(Co Sa MP)将已采样压缩的语音信号进行信号重构.实验考察了待处理语音信号帧的长度、压缩比,稀疏变换字典以及压缩感知重构算法等因素对语音压缩感知重构性能的影响,结果表明,基于数据集训练的稀疏线性预测字典相比传统解析构造的离散余弦变换字典,对语音的重构性能具有0.6 d B左右的提升.     

压缩感知重构算法在稀疏信号恢复中的应用

阐述了压缩感知理论产生的背景、基本原理和应用方式,研究了两类压缩感知重构算法的重构思想和方法,并将两类重构算法的典型算法正交匹配追踪和基追踪应用于稀疏信号的重构。结果表明：对于无噪观测和含较小噪声的观测,正交匹配追踪算法从重构频率和重构时间两方面显示出更好的性能。     

基于单层小波变换的加权压缩感知图像处理

针对简单正交基不能足够稀疏表示信号问题,提出了一种基于单层小波变换改进的加权压缩感知算法。根据图像小波变换的特点,对图像进行单层小波分解,保留低频系数,对高频系数进行测量;并提出设置加权系数矩阵,作用于信号小波正交变换后的高频稀疏系数,增强其系数的稀疏性,增强图像的重构质量;重构算法采用贪婪算法中的OMP算法。实验结果表明该算法对重构精度有进一步提高。     

基于非下采样contourlet变换的压缩感知图像重建

受传统采样定理限制,直接从信号采集系统得到高分辨率图像较困难,且信号获取过程会导致大量的采样数据.压缩感知理论指出可用特定测量矩阵将高维信号投影到低维空间上,求解数值优化问题准确重构原始信号,突破了传统采样定理的限制.传统压缩感知图像重建算法对所有系数测量,需进行多层小波变换保证图像质量,且小波捕捉方向信息有限,重建图像质量较差.故此提出采用非下采样contourlet变换(NSCT)做信号稀疏变换,并针对变换系数的特点,选择性的对系数测量,利用正交匹配追踪算法进行重构.实验结果表明,仅用单层NSCT变换可重建出高质量图像,克服传统算法需进行多层小波变换的缺点,降低采样和存储的数据量且重建的图像质量得到极大提升.     

一种基于压缩感知的单样本人脸识别方法

针对人脸姿态、光照和表情等各方面原因引起人脸识别率不高的问题,提出了一种基于单样本特征点形变成冗余样本的压缩传感人脸识别方法.将人脸图像信号进行小波变换得到系数的稀疏表示,采用高斯随机测量矩阵进行测量得到离散人脸单样本,基于特征点形变人脸三维模型生成冗余样本,通过稀疏特征点正交匹配追踪非线性重建算法重建冗余图像进行人脸识别.仿真实验结果表明,所提出的算法相对于同类算法,时间复杂度较低、精确度较高、鲁棒性较强,且随复杂环境变化,其优势更明显.     

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.