Search arXivSearch

arXiv · 2512.10740

Fast and Robust LRSD-based SAR/ISAR Imaging and Decomposition

Abstract

The earlier works in the context of low-rank-sparse-decomposition (LRSD)-driven stationary synthetic aperture radar (SAR) imaging have shown significant improvement in the reconstruction-decomposition process. Neither of the proposed frameworks, however, can achieve satisfactory performance when facing a platform residual phase error (PRPE) arising from the instability of airborne platforms. More importantly, in spite of the significance of real-time processing requirements in remote sensing applications, these prior works have only focused on enhancing the quality of the formed image, not reducing the computational burden. To address these two concerns, this article presents a fast and unified joint SAR imaging framework where the dominant sparse objects and low-rank features of the image background are decomposed and enhanced through a robust LRSD. In particular, our unified algorithm circumvents the tedious task of computing the inverse of large matrices for image formation and takes advantage of the recent advances in constrained quadratic programming to handle the unimodular constraint imposed due to the PRPE. Furthermore, we extend our approach to ISAR autofocusing and imaging. Specifically, due to the intrinsic sparsity of ISAR images, the LRSD framework is essentially tasked with the recovery of a sparse image. Several experiments based on synthetic and real data are presented to validate the superiority of the proposed method in terms of imaging quality and computational cost compared to the state-of-the-art methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hamid Reza Hashempour, Majid Moradikia, Hamed Bastami, Ahmed Abdelhadi, Mojtaba Soltanalian. 2025-12-11. Fast and Robust LRSD-based SAR/ISAR Imaging and Decomposition. https://doi.org/10.1109/tgrs.2022.3172018

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Anatomy-Change-Aware Bidirectional Selective State-Space Memory for Clinically Deployed Thoracic Radiotherapy Auto-Contouring

We developed DAMM-Net++, a 2.5D architecture for thoracic OAR and target volume segmentation that addresses three persistent challenges in radiotherapy auto-contouring: inter-slice surface incoherence, systematic failure on small low-contrast targets, and the absence of per-case reliability signals. The central component is an anatomy-change-aware bidirectional selective state-space memory that models through-plane anatomical change and selectively propagates context along the axial slice sequence. A boundary-aware decoder sharpens near-surface predictions, and an uncertainty head provides calibrated per-voxel confidence for clinical triage. We evaluated 2,146 patients across four centers, an independent external cohort of 112 patients, and a multicenter reader study involving 17 radiation oncologists on 305 cases. The model achieves a mean Dice of 0.955 and HD95 of 3.78 mm, with the largest gains on low-contrast organs-at-risk (OARs) and target volumes where through-plane context is most critical. The uncertainty head is well-calibrated and supports case-level triage. In the reader study, AI assistance reduced contouring time by 75-80% across experience levels and raised junior-reader IoU from 0.861 to 0.925, matching the unedited model. External validation showed a modest internal-to-external drop (< 5%) with calibrated uncertainty transferring without recalibration. The complete deployment pipeline from DICOM ingestion to TPS-compatible RTSTRUCT export has been integrated into the clinical workflow at a partner hospital, where it is used to assist with contouring. These results suggest that anatomically motivated inter-slice memory, paired with uncertainty-guided review, offers a clinically viable path for thoracic auto-contouring.

eess.IV

A Controlled Evaluation of Quantum Correlation Refinement for Few-Shot Semantic Segmentation: Resource Cost and IBM Quantum Hardware Validation

PQCs are increasingly proposed as trainable components in classical ML pipelines, but rarely characterized alongside a controlled measurement of task-level benefit. We report such an evaluation, using few shot segmentation as testbed. We integrate a Quantum Correlation Refiner (QCR), a six-qubit variational circuit with amplitude embedding and a gated residual connection into a classical correlation-based architecture, under the four fold PASCAL 5i protocol, three seeds per fold, against an unrefined baseline and a matched MLP refiner. Across 12 fold-seed comparisons, QCR changes mIoU by only +0.0001 (t(11)=0.10, p=0.92, dz=0.03); the MLP control and an expanded Pauli-measurement variant show similarly no improvement. QCR adds just 473 parameters but roughly doubles per epoch training time. A trained circuit on IBM hardware (18 patches) agrees closely with the noiseless simulator (r=0.954, MAE=0.101), a fidelity check, not an accuracy gain. The module is functional, trainable, and hardware deployable, yet shows no task-level advantage over a matched classical alternative under this regime, a template for evaluating quantum components jointly via matched controls, repeated seeds, resource measurement, and hardware validation, rather than any one alone.

eess.IV

Scalable SSIM Estimation from PSNR for Per-Title and Context-Adaptive Encoding Workflows

Modern streaming pipelines run hundreds of candidate encodes per asset to support per-title encoding, shot-based optimization, and context-adaptive ABR ladder construction. These techniques have moved perceptual quality metrics into the critical path: SSIM and VMAF now guide encoding decisions rather than passively monitor them. We measure that SSIM evaluation accounts for 7-35% of x264 encode time at production speed presets, with the cost ratio rising as encoders run faster. We propose ApproxSSIMate, a low-complexity method for estimating SSIM from PSNR combined with reference-sequence statistics computed once per sequence and reused across every candidate encode. This decouples quality estimation from the encode-decode-compare loop, enabling perceptual quality feedback in live encoding and amortizing quality measurement across candidate encodes in per-title workflows. We validate the approach across H.264/AVC, H.265/HEVC, and AV1 on the Objective-1-fast dataset and release the implementation as free and open-source software.

eess.IV