基于改进的后退型最优正交匹配追踪的图像重建方法

摘要：正交匹配追踪OMP(Orthogonal Matching Pursuit)是可压缩传感理论CS(Compressed Sensing)中一种贪婪迭代的图像重建方法,该方法以快速高效而著称。但现有的OMP算法都是在给定迭代次数(待重建图像的稀疏度)的条件下重建,这样强制迭代过程停止的方法使得OMP方法需要非常多的线性测量来保证精确重建。本文提出一种改进的后退型最优OMP算法。该方法首先利用最优正交匹配追踪OOMP (Optimized Orthogonal Matching Pursuit)算法,在迭代过程通过最优的正交化性来约束原子的选择,保证原子的选择在最小化当前冗余误差的意义下最优;利用稀疏度作为适应性迭代次数的标准,给出一种非常简单的原子选择机制对得到的迭代结果进行后处理,向后剔除其中多余的原子从而获得精确重建。实验结果表明,与OMP相比较,改进算法可以获得精确重建并大大降低了对测量数目的要求。     

基于AOMP 重建的宽带频谱感知算法

为解决OMP(Orthogonal Matching Pursuit)算法在盲稀疏度情况下迭代终止条件带来的过匹配问题, 提出了一种AOMP(Adptive Orthogonal Matching Pursuit)算法。该算法在迭代过程中通过额外增加观测样本估算原始信号的重构误差, 通过寻找最小误差点自适应地确定最佳频谱重构对应的迭代次数。仿真结果表明, 该算法在
低信噪比下, 能有效地重构原始信号, 与已知信号稀疏度的重构效果相当。     

基于ROMP算法的人脸识别

针对用传统方法进行人脸识别的识别率不够高的问题,本文在人脸识别中采用正则化正交匹配追踪算法(ROMP),并把其与基于NN,匹配追踪(MP),正交匹配追踪(OMP)的人脸识别算法进行了对比.该算法能一次从冗余字典中选取多个原子,并能够通过正则化准则对选取的原子进行再次筛选,获得最优的原子.实验结果表明,在不同特征提取方法和训练样本数改变的情况下,基于ROMP的人脸识别算法的识别率优于其他算法.     

ROMP的正则化分析研究

正则化正交匹配追踪(ROMP)算法通过引入正则化的方式提升重构过程的稳定性和速度。该算法在不同正则化参数值时,每次迭代均会选出多个能量值最大的位置索引数不同,导致重构算法的重构误差和运行速度不同。正则化参数常值被赋值为2,本文通过对ROMP的正则化过程进行分析,并在MATLAB上进行仿真,找出不同稀疏度的信号在不同信噪比下最佳的正则化参数值,以保证稳定性的情况下提升算法的速度。     

基于OMP方法的语音信号重构

压缩传感是近年来的研究热点,本文简单阐述了压缩传感（CS）的理论框架,在研究Orthogonal Matching Pursuit（正交匹配跟踪）算法的基础上,探索了其在信号稀疏分解中的应用,实验结果表明基于OMP算法的语音信号稀疏分解具有较好的重建精度。     

基于随机解调器的射电天文信号的采样与恢复算法

谱线检测技术在射电天文观测中具有举足轻重的地位,可根据谱线诊断天体的基本物理情况,如总粒子数密度、速度、磁感应强度等。射电天文信号有多条谱线,且谱线频率都很高,从几GHz到几十GHz。随机解调器是基于压缩感知理论的均匀亚奈奎斯特采样方法,描述、分析随机解调器系统及正交匹配追踪(Orthogonal Matching Pursuit,OMP)恢复算法,并在Matlab上进行采样与恢复算法仿真分析,结果表明了此算法的可行性。     

基于l_1与l_0正则化的压缩感知数值算法

针对压缩感知模型,讨论了基于l0正则化的正交匹配追踪算法(OMP)与基于l1正则化的同伦算法(HM)和迭代加权最小二乘法(IRLS).通过数值实验结果分析,验证了3种算法的有效性,且相对于2种基于l1正则化的算法,OMP算法的迭代次数与耗时更少,均方误差更小.     

基于压缩感知的时频双选信道估计研究

针对时频双选信道,利用信道的时间相关性,即同一条时延径在相邻时刻对应的信道系数之间具有很强的相关性,提出一种线性近似方法对时频双选信道进行建模,有效降低了未知参数的个数.考虑到无线信道在时延域具有稀疏性,基于压缩感知(Compressed sensing,CS)理论对线性近似模型进行了恢复重构.分别对未线性近似模型和线性近似模型的系统性能进行了仿真,并结合最小二乘(leastsquare,LS)算法、正交匹配追踪(Orthogonal Matching Pursuit,OMP)算法、稀疏贝叶斯学习(Sparse Bayesian Learning,SBL)算法给出了系统的归一化均方误差(Normalized Mean Square Error,NMSE)曲线.仿真结果显示,线性近似方法能有效对时频双选信道进行建模,针对本研究提出的线性近似模型,SBL算法能精确恢复出信道响应,并能有效地克服多谱勒效应.     

基于OMP算法的快速压缩感知图像重构

针对正交匹配追踪(OMP)算法在压缩感知理论下的重构效果和所需时间相互矛盾的问题,基于子空间追踪(SP)算法的回溯思想,使用共轭梯度下降算法代替最小二乘法对正交匹配追踪(OMP)算法进行改进.并且对所改进算法的重构精度、重构稳定性进行了仿真实验,结果表明所提算法能保证重构质量良好并且有更好的重构速度和稳定性.     

一种基于压缩感知的时变稀疏信道估计方法

对于快时变且稀疏环境下的正交频分复用(Orthogonal Frequency Division Multiplexing,OFDM)系统模型,现有的方法是基于基扩展模型(Basic Expansion Model,BEM)进行估计,并利用恒定幅值零自相关(Constant Amplitude Zero Auto Correlation,CAZAC)序列估计时延。本文利用信道响应中稀疏的观测矩阵,用压缩感知(Compress Sensing,CS)的正交匹配跟踪(Orthogonal Matching Pursuit,OMP)算法进行时延估计。仿真结果表明,两种方法都能对时延进行有效的筛选,但当多普勒频移增大、信噪比较低时,本文将OMP、BEM相结合的方法效果较优。     

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.