首页> 外文会议>2010 Second International Conference on Advances in Computing, Control and Telecommunication Technologies >Comparison of l1-Minimization and Iteratively Reweighted least Squares-l p-Minimization for Image Reconstruction from Compressive Sensing
【24h】

Comparison of l1-Minimization and Iteratively Reweighted least Squares-l p-Minimization for Image Reconstruction from Compressive Sensing

机译:从压缩感测重构图像的l1-最小化和迭代加权最小二乘-l p-最小化的比较

获取原文

摘要

Compressive sensing is the recent technique in data acquisition that allows to reconstruct signal form far fewer samples than conventional method i.e. Shannon-Nyquist theorem use. In this paper, we compare l1-minimization and Iteratively Reweighted least Squares (IRlS)-lp-minimization algorithm to reconstruct image from compressive measurement. Compressive measurement is done by using random Gaussian matrix to encode the image that the first be divided into number of blocks to reduce to the computational complexity. From the results, IRlS-lp and l1-minimization provided almost the same image reconstruction quality, but the IRlS-lp-minimization resulted the faster computation than l1-minimization algorithm.
机译:压缩感测是数据采集中的最新技术,它允许比传统方法即Shannon-Nyquist定理使用更少的样本来重构信号。在本文中,我们比较了l1最小化和迭代加权最小二乘(IRlS)-lp最小化算法,从压缩测量中重建图像。压缩测量是通过使用随机高斯矩阵对图像进行编码的,该图像首先被划分为多个块以降低计算复杂度。从结果来看,IRlS-lp和l1最小化提供了几乎相同的图像重建质量,但是IRlS-lp最小化比l1最小化算法具有更快的计算速度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号