An Imaging Algorithm Based on Generalized Minimax-concave Penalty in Radio Interferometry

Abstract Reconstructing the sky brightness distribution from the incomplete visibilities involves an ill-posed inverse problem. Although compressive sensing methods based on convex optimization have demonstrated outstanding performance in radio interferometry, convex optimization yields a computable but biased approximate solution for compressive sensing. To reduce the bias and efficiently obtain an accurate solution, we proposed an imaging algorithm based on generalized minimax-concave penalty, which maintains the convexity of the sparsity-regularized least-squares objective function. Furthermore, we employ the forward-backward splitting algorithm to solve the optimization problem and adaptively update the regularization parameter by using a maximum likelihood estimator. We have verified the effectiveness of the proposed method based on the Very Large Array and DAocheng Radio Telescope.

Authors

Institutions

Publication Details

Journal
The Astronomical Journal
Published
2026-03-11
DOI
https://doi.org/10.3847/1538-3881/ae45a1
Primary Topic
Radio Astronomy Observations and Technology
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Imaging Algorithm Based on Generalized Minimax-concave Penalty in Radio Interferometry

Xiaocheng Yang, Bo Wei, Gaofeng Wu, Xuning Lv et al.
The Astronomical Journal
Radio Astronomy Observations and Technology
article

An Imaging Algorithm Based on Generalized Minimax-concave Penalty in Radio Interferometry

Xiaocheng Yang, Bo Wei, Gaofeng Wu, Xuning Lv, Lei Deng, Lin Wu, Jingye Yan, Yang Yang
article en

Abstract

Abstract Reconstructing the sky brightness distribution from the incomplete visibilities involves an ill-posed inverse problem. Although compressive sensing methods based on convex optimization have demonstrated outstanding performance in radio interferometry, convex optimization yields a computable but biased approximate solution for compressive sensing. To reduce the bias and efficiently obtain an accurate solution, we proposed an imaging algorithm based on generalized minimax-concave penalty, which maintains the convexity of the sparsity-regularized least-squares objective function. Furthermore, we employ the forward-backward splitting algorithm to solve the optimization problem and adaptively update the regularization parameter by using a maximum likelihood estimator. We have verified the effectiveness of the proposed method based on the Very Large Array and DAocheng Radio Telescope.

The Astronomical JournalVol. 171(4)
Zhejiang Sci-Tech University (CN), National Space Science Center (CN), Science and Technology Department of Sichuan Province (CN)
Openalex Percentile: Top 28%
Radio Astronomy Observations and Technology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Imaging Algorithm Based on Generalized Minimax-concave Penalty in Radio Interferometry — Xiaocheng Yang, Bo Wei, et al. · The Astronomical Journal (2026) | TGRS Research Map | TGRS