<?xml version="1.0" encoding="UTF-8"?>

<?xml-stylesheet type="text/xsl" href="/static/oaitohtml.xsl"?>

<!--
<?xml-stylesheet type="text/xsl" href="/oaitohtml.xsl"?>
-->

<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
    <responseDate>2026-10-14T10:58:45Z</responseDate>
    <request verb="GetRecord" metadataPrefix="oai_dc" identifier="10.57760/sciencedb.30708" >https://www.scidb.cn/oai</request>
<GetRecord>
    <record>
    <header >
    <identifier>10.57760/sciencedb.30708</identifier>
    <datestamp>2025-10-30T17:57:12Z</datestamp>
</header>
    <metadata>
        
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:date>2025-10-30</dc:date>
  <dc:title>Non-convex sparse regularization for radio interferometric imaging via smoothly clipped absolute deviation</dc:title>
  <dc:identifier>doi:10.57760/sciencedb.30708</dc:identifier>
  <dc:language>en</dc:language>
  <dc:description>Context: Reconstructing a high-resolution image of observed radio sources from the incomplete visibilities poses a challenging ill-posed inverse problem. Although compressive sensing has demonstrated remarkable performance in radio interferometric imaging, traditional compressed sensing methods approximately replace the L0-norm minimization problem by the L1-norm minimization problem, which brings about a bias issue.Aims: To ameliorate the bias problem and efficiently obtain an accurate solution in radio interferometry, we propose a novel non convex sparse regularization method based on smoothly clipped absolute deviation (SCAD) in this paper.Methods: The proposed method utilizes the continuous SCAD penalty function to approximate the L0-norm and efficiently solves the non-convex optimization problem by using an improved proximal gradient algorithm. The improved proximal gradient algorithm introduces a restart strategy and an adaptive non-monotonic step size strategy to improve the convergence speed of the algorithm. Besides, the regularization parameter is adaptively updated by using the prior information of the image.Results: Numerical simulation experiments are carried out on the Very Large Array (VLA) and Square Kilometre Array (SKA). We compare the proposed method with state-of-the-art imaging methods. The results show that it performs better in terms of reconstruction quality and computational efficiency.</dc:description>
  <dc:subject> interferometers;  image processing;  numerical</dc:subject>
  <dc:creator>杨晓城</dc:creator>
  <dc:creator>程黄峰</dc:creator>
  <dc:creator>武林</dc:creator>
  <dc:creator>阎敬业</dc:creator>
  <dc:rights>PUBLIC</dc:rights>
  <dc:rights>https://api.github.com/licenses/mit</dc:rights>
  <dc:type>dataset</dc:type>
  <dc:publisher>Science Data Bank</dc:publisher>
</oai_dc:dc>

    </metadata>
</record>
</GetRecord>
</OAI-PMH>