کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4973884 | 1451718 | 2017 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Transfer orthogonal sparsifying transform learning for phase retrieval
ترجمه فارسی عنوان
انتقال یادگیری تبدیل افراطی متعادلی برای بازیابی فاز
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
پردازش سیگنال
چکیده انگلیسی
The phase retrieval (PR) problem of recovering an image from its Fourier magnitudes is an important issue. Several PR algorithms have been proposed to address this problem. Recent efforts of exploiting sparsity were developed to improve the performance of PR algorithms, such as the reconstruction quality, robustness to noise, and convergence behavior. In this paper, we propose a novel sparsity-based algorithm, which can adaptively learn an orthogonal sparsifying transform, and reconstruct the image simultaneously from the Fourier magnitudes. However, the estimated images at the early iterations are extremely bad. Training samples from these images cannot provide much useful information for sparsifying transform learning. To avoid unnecessary updating, an orthogonal sparsifying transform learning method based on transfer learning is proposed. Through transfer learning, we transfer the fixed sparsifying transform to an adaptive one. We apply this new sparsifying transform learning method to PR, and exploit the alternating directions method of multipliers (ADMM) technique to solve the formulated problem. Since the learnt sparsifying transform is adaptive to data, it favors better sparsity. Using this learnt sparsifying transform for image reconstruction can improve the reconstruction quality at low oversampling ratios. Experimental results show that the proposed PR algorithm can improve nearly 6 dB compared with the recently proposed PR-TIHP-l1 algorithm in terms of the average PSNR (Peak Signal to Noise Ratio) at oversampling ratio 2.47, 2.53, 2.59. Moreover, our algorithm is robust to noise and has better convergence behavior heuristically.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Digital Signal Processing - Volume 62, March 2017, Pages 11-25
Journal: Digital Signal Processing - Volume 62, March 2017, Pages 11-25
نویسندگان
Qiusheng Lian, Baoshun Shi, Shuzhen Chen,