paper-with-me

홈 › Papers

Sparse regularization with a non-convex penalty for SAR imaging and autofocusing

2021-08-22 · Zi-Yao Zhang, Odysseas Pappas, Igor G. Rizaev, Alin Achim

In this paper, SAR image reconstruction with joint phase error estimation (autofocusing) is formulated as an inverse problem. An optimization model utilising a sparsity-enforcing Cauchy regularizer is proposed, and an alternating minimization framework is used to solve it, in which the desired image and the phase errors are optimized alternatively. For the image reconstruction sub-problem (f-sub-problem), two methods are presented capable of handling the problem's complex nature, and we thus present two variants of our SAR image autofocusing algorithm. Firstly, we design a complex version of the forward-backward splitting algorithm (CFBA) to solve the f-sub-problem iteratively. For the second variant, the Wirtinger alternating minimization autofocusing (WAMA) method is presented, in which techniques of Wirtinger calculus are utilized to minimize the complex-valued cost function in the f-sub-problem in a direct fashion. For both methods, the phase error estimation sub-problem is solved by simply expanding and observing its cost function. Moreover, the convergence of both algorithms is discussed in detail. By conducting experiments on both simulated scenes and real SAR images, the proposed method is demonstrated to give impressive autofocusing results compared to other state of the art methods.

📄 PDF Abstract BibTeX arXiv:2108.09855

Code (0)

등록된 구현이 없습니다.

Tasks

Image Reconstruction

Similar Papers 제목 키워드 기반

A Survey on Nonconvex Regularization Based Sparse and Low-Rank Recovery in Signal Processing, Statistics, and Machine Learning

2018-08-16 · Fei Wen, Lei Chu, Peilin Liu, Robert C. Qiu

In the past decade, sparse and low-rank recovery have drawn much attention in many areas such as signal/image processing, statistics, bioinformatics and machine learning. To achieve sparsity and/or low-rankness inducing,…

BIG-bench Machine LearningCompressive SensingMatrix CompletionVariable Selection

Sparse Signal Estimation by Maximally Sparse Convex Optimization

2013-02-22 · Ivan W. Selesnick, Ilker Bayram

This paper addresses the problem of sparsity penalized least squares for applications in sparse signal processing, e.g. sparse deconvolution. This paper aims to induce sparsity more strongly than L1 norm regularization, …

Autofocusing+: Noise-Resilient Motion Correction in Magnetic Resonance Imaging

2022-03-10 · Ekaterina Kuzmina, Artem Razumov, Oleg Y. Rogov, Elfar Adalsteinsson 외

Image corruption by motion artifacts is an ingrained problem in Magnetic Resonance Imaging (MRI). In this work, we propose a neural network-based regularization term to enhance Autofocusing, a classic optimization-based …

Non-convex Regularizations for Feature Selection in Ranking With Sparse SVM

2015-07-02 · Léa Laporte, Rémi Flamary, Stephane Canu, Sébastien Déjean 외

Feature selection in learning to rank has recently emerged as a crucial issue. Whereas several preprocessing approaches have been proposed, only a few works have been focused on integrating the feature selection into the…

feature selectionLearning-To-Rank

On Solving SAR Imaging Inverse Problems Using Non-Convex Regularization with a Cauchy-based Penalty

2020-05-01 · Oktay Karakuş, Alin Achim

Synthetic aperture radar (SAR) imagery can provide useful information in a multitude of applications, including climate change, environmental monitoring, meteorology, high dimensional mapping, ship monitoring, or planeta…

Image ReconstructionSuper-Resolution