摘要
In this paper, we address the problem of phase retrieval to re- cover a signal from the magnitude of its Fourier transform. In many applications of phase retrieval, the signals encountered are naturally sparse. In this work, we consider the case where the signal is sparse under the assumption that few components are nonzero. We exploit further the sparse nature of the signal- s and propose a two stage sparse phase retrieval algorithm. A simple iterative minimization algorithm recovers a sparse sig- nal from measurements of its Fourier transform (or other lin- ear transform) magnitude based on the minimization of a block l1 norm. We show in the experiments that the proposed algorithm achieves a competitive performance. It is robust to noise and scalable in practical implementation. The proposed method converges to a more accurate and stable solution than other ex- isting techniques for synthetic signals. For speech signals, ex- periments show that the voice quality of reconstructed speech signals is almost as good as the original signals.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 3426-3430 |
| 页数 | 5 |
| 期刊 | Proceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH |
| 卷 | 2015-January |
| 出版状态 | 已出版 - 2015 |
| 活动 | 16th Annual Conference of the International Speech Communication Association, INTERSPEECH 2015 - Dresden, 德国 期限: 6 9月 2015 → 10 9月 2015 |
指纹
探究 'An alternating optimization approach for phase retrieval' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver