QQ客服 官方微博 反馈留言

	基于近似l_0范数最小化的NMR波谱稀疏重建算法; A Sparse Reconstruction Algorithm for NMR Spectroscopy Based on Approximate l_0 Norm Minimization
	张正炎 ; 屈小波 ; 林雁勤 ; 陈忠
	2013-12-05
关键词	NMR波谱 压缩传感 近似l0范数 迭代重复加权 信噪比 NMR spectroscopy compressed sensing approximate l0 norm re-weigh-ted signal-to-noise ratio
英文摘要	在核磁共振(nMr)波谱中,过长的数据采集时间会使很多化学以及分子生物学领域的高分辨率多维谱应用难以实现.传统的解决办法是使用随机非均匀采样代替奈奎斯特采样,但这样会使谱图质量受损.压缩传感的出现为此提供了更好的解决办法,合适的压缩传感重建算法可以通过很少的随机非均匀采样将谱图高质量的重建出来.该文先介绍了一种可用于谱图重建的压缩传感重建算法,名为“平滑l0范数最小化法“,然后针对该算法对采样噪声鲁棒性较差的缺点进行了改进.通过将改进后的算法与原算法在一维实数域信号以及nMr波谱信号重建实验中进行对比后表明,改进后的算法对噪声的鲁棒性明显提高,并能获得更好的重建性能.; Long acquisition time often hinders the routine application of multidimensional NMR spectroscopy.A common approach to reduce the acquisition time is to replace the commonly used Nyquist grid sampling scheme with a random non-uniform sampling(NUS)scheme.However,NUS is inherently associated with degradation of spectrum quality.It has been demonstrated recently compressed sensing(CS)algorithms can be used to reconstruct high-quality spectra from sparse NUS data.In this paper,a CS reconstruction algorithm called"Smoothed l0Norm Minimization"was introduced.The typical version of the algorithm was then modified to improve its robustness under high noise condition.The improved algorithm was applied to reconstruct 1Dreal-valued signal and 2D NMR spectroscopy,and the results were compared with those obtained by other methods.The results showed that the algorithm proposed had better robustness to noise,and could be used to reconstruct high-quality spectra with fewer sampling data.; 国家自然科学基金资助项目(11105114、11174239和61201045); 中央高校基本科研业务费资助项目(2010121010)
语种	zh_CN
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/121497]
专题	物理技术－已发表论文
推荐引用方式 GB/T 7714	张正炎,屈小波,林雁勤,等. 基于近似l_0范数最小化的NMR波谱稀疏重建算法, A Sparse Reconstruction Algorithm for NMR Spectroscopy Based on Approximate l_0 Norm Minimization[J],2013.
APA	张正炎,屈小波,林雁勤,&陈忠.(2013).基于近似l_0范数最小化的NMR波谱稀疏重建算法..
MLA	张正炎,et al."基于近似l_0范数最小化的NMR波谱稀疏重建算法".(2013).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。