Quadratic Majorization-Minimization in Regularized Radar Imaging
Quadratic majorization-minimization is found in a 1937 paper by Weiszfeld and provides an easily accessible iterative optimization algorithm for non-convex and non-smooth optimization tasks; the iteration is often referred to as “iteratively re-weighted least squares” (IRLS). In this manuscript, IRLS is employed as a unifying tutorial description of many regularized imaging techniques previously proposed for radar imaging. The cost function implicit in an IRLS imaging approach is made explicit, yielding a Bayesian interpretation with specific underlying assumptions regarding clutter, noise, and prior distribution on the unknown range-angle-Doppler maps. In particular, the IRLS framework is used to establish the convergence and sparse imaging properties of the reiterative super-resolution (RISR) [1] and background supplemental loading (BaSL) [2] algorithms.
Authors
- Samuel Pine (ORCID: https://orcid.org/0000-0002-4682-0130)
- Shannon D. Blunt (ORCID: https://orcid.org/0000-0001-8434-7957)
- Lee C. Potter (ORCID: https://orcid.org/0000-0002-1537-1627)
Institutions
- University of Kansas (US)
- Matrix Research (United States) (US)
- The Ohio State University (US)
Publication Details
- Published
- 2025-05-03
- DOI
- https://doi.org/10.1109/radar52380.2025.11031493
- Citations
- 1
- Primary Topic
- Numerical methods in inverse problems
- Type
- article
- Field-Weighted Citation Impact
- 3.69
Funders
- Air Force Research Laboratory