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

Oey Endra, D. Gunawan
{"title":"Comparison of l1-Minimization and Iteratively Reweighted least Squares-l p-Minimization for Image Reconstruction from Compressive Sensing","authors":"Oey Endra, D. Gunawan","doi":"10.1109/ACT.2010.31","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":147311,"journal":{"name":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on Advances in Computing, Control, and Telecommunication Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACT.2010.31","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

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.
压缩感知图像重构的1-最小化与迭代重加权最小二乘1- p-最小化的比较
压缩感知是一种最新的数据采集技术,它允许从比传统方法更少的样本中重建信号,即使用香农-奈奎斯特定理。在本文中,我们比较了从压缩测量中重建图像的l1-最小化算法和迭代重加权最小二乘(IRlS)-lp-最小化算法。压缩测量是利用随机高斯矩阵对图像进行编码,首先将图像分成若干块,以减少计算复杂度。结果表明,IRlS-lp算法与l1-最小化算法的图像重建质量基本一致,但IRlS-lp-最小化算法的计算速度比l1-最小化算法快。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信