Sparse Phase Retrieval Via Iteratively Reweighted Amplitude Flow

G. Wang, Liang Zhang, G. Giannakis, Jie Chen
{"title":"Sparse Phase Retrieval Via Iteratively Reweighted Amplitude Flow","authors":"G. Wang, Liang Zhang, G. Giannakis, Jie Chen","doi":"10.23919/EUSIPCO.2018.8553118","DOIUrl":null,"url":null,"abstract":"Sparse phase retrieval (PR) aims at reconstructing a sparse signal vector from a few phaseless linear measurements. It emerges naturally in diverse applications, but it is NP-hard in general. Drawing from advances in nonconvex optimization, this paper presents a new algorithm that is termed compressive reweighted amplitude flow (CRAF) for sparse PR. CRAF operates in two stages: Stage one computes an initial guess by means of a new spectral procedure, and stage two implements a few hard thresholding based iteratively reweighted gradient iterations on the amplitude-based least-squares cost. When there are sufficient measurements, CRAF reconstructs the true signal vector exactly under suitable conditions. Furthermore, its sample complexity coincides with that of the state-of-the-art approaches. Numerical experiments showcase improved performance of the proposed approach relative to existing alternatives.","PeriodicalId":303069,"journal":{"name":"2018 26th European Signal Processing Conference (EUSIPCO)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 26th European Signal Processing Conference (EUSIPCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/EUSIPCO.2018.8553118","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Sparse phase retrieval (PR) aims at reconstructing a sparse signal vector from a few phaseless linear measurements. It emerges naturally in diverse applications, but it is NP-hard in general. Drawing from advances in nonconvex optimization, this paper presents a new algorithm that is termed compressive reweighted amplitude flow (CRAF) for sparse PR. CRAF operates in two stages: Stage one computes an initial guess by means of a new spectral procedure, and stage two implements a few hard thresholding based iteratively reweighted gradient iterations on the amplitude-based least-squares cost. When there are sufficient measurements, CRAF reconstructs the true signal vector exactly under suitable conditions. Furthermore, its sample complexity coincides with that of the state-of-the-art approaches. Numerical experiments showcase improved performance of the proposed approach relative to existing alternatives.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于迭代重加权振幅流的稀疏相位恢复
稀疏相位恢复(PR)的目的是从少量的无相位线性测量数据中重构稀疏信号向量。它自然地出现在各种应用程序中,但通常是NP-hard的。借鉴非凸优化的进展,本文提出了一种新的稀疏PR的压缩重加权振幅流(CRAF)算法。crf分为两个阶段:第一阶段通过新的谱过程计算初始猜测,第二阶段在基于振幅的最小二乘代价上实现一些基于硬阈值的迭代重加权梯度迭代。当有足够的测量值时,CRAF在适当的条件下精确地重建真实的信号矢量。此外,它的样本复杂度与最先进的方法一致。数值实验表明,与现有的替代方法相比,该方法的性能有所提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Missing Sample Estimation Based on High-Order Sparse Linear Prediction for Audio Signals Multi-Shot Single Sensor Light Field Camera Using a Color Coded Mask Knowledge-Aided Normalized Iterative Hard Thresholding Algorithms for Sparse Recovery Two-Step Hybrid Multiuser Equalizer for Sub-Connected mmWave Massive MIMO SC-FDMA Systems How Much Will Tiny IoT Nodes Profit from Massive Base Station Arrays?
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1