Jingjing Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Jingjing Li has a total of 42 co-authors. Here are the top co-authors by number of shared publications:
- Xiyan Sun
School of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, China
13 shared publications - Xiuping Li
School of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, China
10 shared publications - Yuanfa Ji
School of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, China
9 shared publications - Wentao Fu
School of Information and Communication, Guilin University of Electronic Technology, Guilin 541004, China
4 shared publications - Chengliang Zhong
Guangxi Key Laboratory of Precision Navigation Technology and Application, Guilin University of Electronic Technology, Guilin 541004, China
3 shared publications - Juan Liu
Guangxi Key Laboratory of Precision Navigation Technology and Application, Guilin University of Electronic Technology, Guilin 541004, China
3 shared publications
Latest Publications
- Open Access
- 15 September 2026
- Published by MDPI AG in Remote Sensing
- Vol. 18 (18) , 3162
Weighted Strong Product Graph Laplacian Regularization for Hyperspectral Image Mixed-Noise Removal with Superpixel Segmentation
Hyperspectral images (HSIs) are inevitably degraded by mixed noise, which hampers downstream interpretation. Recent graph-signal-processing denoisers encode the spatial–spectral structure of an HSI through a product graph over superpixel bodies, yet the adopted Kronecker (tensor) product graph retains only the joint spatial–spectral edges and discards the pure-spatial and pure-spectral edges—the two priors that govern HSI smoothness. We introduce a two-parameter weighted product-graph family that contains the Kronecker, Cartesian and strong products as exact special cases, and propose Weighted Strong Product Graph Laplacian Regularization (WSPGLR)—the strong-product branch with a tunable joint-edge weight β—embedded in a global low-rank plus sparse model solved by the Alternating Direction Method of Multipliers (ADMM) with singular-value-thresholding and soft-thresholding updates and a sparse conjugate-gradient (CG) solve. On three simulated cubes (Washington DC Mall, Pavia University, Indian Pines) under four mixed-noise scenarios, WSPGLR consistently improves Mean Peak Signal-to-Noise Ratio (MPSNR) and ERGAS (Erreur Relative Globale Adimensionnelle de Synthèse) over a matched Kronecker-product control in every tested case (and Mean Structural Similarity (MSSIM) in 11 of 12 settings)—up to 2.5 dB in MPSNR from the graph term alone—and an ablation shows that β governs a spatial–spectral fidelity trade-off (Spectral Angle Mapper, SAM). On the detailed urban scenes, WSPGLR attains the highest MPSNR against the external methods and matched control in seven of eight settings, whereas it trails LRTDTV on the smooth agricultural scene; with an optional scene-adaptive TV step it attains the best average rank across scene types; a Tucker-based variant further shows the low-rank block is modular and generally improves spectral fidelity. Tests on four no-reference real HSIs and 30 paired real-noise MEHSI samples extend the sensor coverage; on MEHSI, the native-domain RND framework remains substantially stronger, which delimits the scope of the proposed training-free regularizer.
- 15 September 2026
- Published by MDPI AG in Remote Sensing
- Vol. 18 (18) , 3162
Open AccessWeighted Strong Product Graph Laplacian Regularization for Hyperspectral Image Mixed-Noise Removal with Superpixel Segmentation
Hyperspectral images (HSIs) are inevitably degraded by mixed noise, which hampers downstream interpretation. Recent graph-signal-processing denoisers encode the spatial–spectral structure of an HSI through a product graph over superpixel bodies, yet the adopted Kronecker (tensor) product graph retains only the joint spatial–spectral edges and discards the pure-spatial and pure-spectral edges—the two priors that govern HSI smoothness. We introduce a two-parameter weighted product-graph family that contains the Kronecker, Cartesian and strong products as exact special cases, and propose Weighted Strong Product Graph Laplacian Regularization (WSPGLR)—the strong-product branch with a tunable joint-edge weight β—embedded in a global low-rank plus sparse model solved by the Alternating Direction Method of Multipliers (ADMM) with singular-value-thresholding and soft-thresholding updates and a sparse conjugate-gradient (CG) solve. On three simulated cubes (Washington DC Mall, Pavia University, Indian Pines) under four mixed-noise scenarios, WSPGLR consistently improves Mean Peak Signal-to-Noise Ratio (MPSNR) and ERGAS (Erreur Relative Globale Adimensionnelle de Synthèse) over a matched Kronecker-product control in every tested case (and Mean Structural Similarity (MSSIM) in 11 of 12 settings)—up to 2.5 dB in MPSNR from the graph term alone—and an ablation shows that β governs a spatial–spectral fidelity trade-off (Spectral Angle Mapper, SAM). On the detailed urban scenes, WSPGLR attains the highest MPSNR against the external methods and matched control in seven of eight settings, whereas it trails LRTDTV on the smooth agricultural scene; with an optional scene-adaptive TV step it attains the best average rank across scene types; a Tucker-based variant further shows the low-rank block is modular and generally improves spectral fidelity. Tests on four no-reference real HSIs and 30 paired real-noise MEHSI samples extend the sensor coverage; on MEHSI, the native-domain RND framework remains substantially stronger, which delimits the scope of the proposed training-free regularizer.
- Open Access
Physics-Guided Multi-GSO Spectral Filtering for Degradation-Aware Automotive Radar Point-Cloud Detection
Automotive millimeter-wave radar produces sparse point clouds with Doppler velocity and radar cross-section (RCS), but graph detectors typically use a shared representation for semantic prediction and box regression despite their different propagation requirements. We propose multi-GSO spectral filtering (MGSF), a residual module that filters radar features over geometry-, Doppler-, and RCS-defined graph shift operators and fuses diffusion and residual components with a node-adaptive gate. MGSF-TD applies full multi-GSO refinement to semantic prediction and geometry-only refinement to box regression. On the complete RadarScenes validation set, MGSF-TD improves the official RadarGNN checkpoint from 60.19 to 60.59 mAP and from 74.06 to 75.10 mean foreground F1 (FG-F1). Across three MGSF-TD training seeds, the FG-F1 margin under RCS noise increases from at 3 dBsm to at 20 dBsm; seed-42 full-validation mAP margins are , , and . Controls show that geometry-only diffusion explains part of the gain and the RCS operator contributes most clearly at low-to-moderate noise, whereas a parameter-matched widened baseline matches or exceeds MGSF-TD under severe RCS and Doppler corruption. Cross-sensor diagnostics reproduce the Doppler failure trend but not the severity-dependent RCS gain. MGSF-TD therefore offers a balanced, physically interpretable operating point rather than a universal robustness gain.Open AccessPhysics-Guided Multi-GSO Spectral Filtering for Degradation-Aware Automotive Radar Point-Cloud Detection
Automotive millimeter-wave radar produces sparse point clouds with Doppler velocity and radar cross-section (RCS), but graph detectors typically use a shared representation for semantic prediction and box regression despite their different propagation requirements. We propose multi-GSO spectral filtering (MGSF), a residual module that filters radar features over geometry-, Doppler-, and RCS-defined graph shift operators and fuses diffusion and residual components with a node-adaptive gate. MGSF-TD applies full multi-GSO refinement to semantic prediction and geometry-only refinement to box regression. On the complete RadarScenes validation set, MGSF-TD improves the official RadarGNN checkpoint from 60.19 to 60.59 mAP and from 74.06 to 75.10 mean foreground F1 (FG-F1). Across three MGSF-TD training seeds, the FG-F1 margin under RCS noise increases from at 3 dBsm to at 20 dBsm; seed-42 full-validation mAP margins are , , and . Controls show that geometry-only diffusion explains part of the gain and the RCS operator contributes most clearly at low-to-moderate noise, whereas a parameter-matched widened baseline matches or exceeds MGSF-TD under severe RCS and Doppler corruption. Cross-sensor diagnostics reproduce the Doppler failure trend but not the severity-dependent RCS gain. MGSF-TD therefore offers a balanced, physically interpretable operating point rather than a universal robustness gain. - 26 June 2026
- Published by Springer Nature
- p. 180-196
A Robust 3D Object Tracking Method Based on Fusion of Millimeter-Wave Radar and Camera
- 26 June 2026
- Published by Springer Nature
- p. 180-196
A Robust 3D Object Tracking Method Based on Fusion of Millimeter-Wave Radar and Camera
- 26 June 2026
- Published by Springer Nature
- p. 213-230
PRFNet-REDFormer: an Improved PillarNeXt and Transformer-Based Fusion Framework for 3D Object Detection
- 26 June 2026
- Published by Springer Nature
- p. 213-230
PRFNet-REDFormer: an Improved PillarNeXt and Transformer-Based Fusion Framework for 3D Object Detection
- Open Access
Bounded Graph Conditioning for LiDAR 3D Object Detection Under Sensor Degradation
Light Detection and Ranging (LiDAR) three-dimensional (3D) object detection degrades under point sparsity, outliers, coordinate noise, and calibration drift, yet detector evaluation remains largely limited to clean benchmarks. This study focuses on sensing robustness rather than detector redesign. We introduce Bounded Graph Conditioning (BGC)—a deterministic pre-voxelization front-end that applies k-nearest-neighbor (kNN) neighborhood averaging with bounded residual correction upstream of an unchanged detector backbone. BGC is evaluated together with a reproducible sensor-degradation stress protocol and a risk-constrained operating-boundary analysis. Experiments on KITTI with PointPillars, SECOND, and Voxel R-CNN show that BGC most clearly improves retained detection quality and feasible operating coverage under strong noise and strong outlier stress; gains under other degradation types are smaller and backbone-dependent. In the primary score-level box-disjoint calibration/test evaluation on SECOND, maximum feasible coverage at a target risk bound of improves from to under strong noise ( m) and from to under strong outliers (); a cross-backbone check on Voxel R-CNN confirms the same direction (). Comparison with traditional filtering (SOR and ROR) reveals complementary strengths across fault types. A range-adaptive BGC variant that adjusts parameters per distance bin further improves performance under mixed unknown faults, spherical-coordinate noise, and on a dataset-matched nuScenes validation (adaptive BGC mAP/NDS: vs. baseline under strong noise). Severe translation drift collapses all configurations to full rejection, exposing an explicit sensing boundary beyond the reach of local conditioning. These results support BGC as a practical sensor-side robustness enhancement under the studied degradation protocol, with conditional rather than universal applicability across backbones and fault types.Open AccessBounded Graph Conditioning for LiDAR 3D Object Detection Under Sensor Degradation
Light Detection and Ranging (LiDAR) three-dimensional (3D) object detection degrades under point sparsity, outliers, coordinate noise, and calibration drift, yet detector evaluation remains largely limited to clean benchmarks. This study focuses on sensing robustness rather than detector redesign. We introduce Bounded Graph Conditioning (BGC)—a deterministic pre-voxelization front-end that applies k-nearest-neighbor (kNN) neighborhood averaging with bounded residual correction upstream of an unchanged detector backbone. BGC is evaluated together with a reproducible sensor-degradation stress protocol and a risk-constrained operating-boundary analysis. Experiments on KITTI with PointPillars, SECOND, and Voxel R-CNN show that BGC most clearly improves retained detection quality and feasible operating coverage under strong noise and strong outlier stress; gains under other degradation types are smaller and backbone-dependent. In the primary score-level box-disjoint calibration/test evaluation on SECOND, maximum feasible coverage at a target risk bound of improves from to under strong noise ( m) and from to under strong outliers (); a cross-backbone check on Voxel R-CNN confirms the same direction (). Comparison with traditional filtering (SOR and ROR) reveals complementary strengths across fault types. A range-adaptive BGC variant that adjusts parameters per distance bin further improves performance under mixed unknown faults, spherical-coordinate noise, and on a dataset-matched nuScenes validation (adaptive BGC mAP/NDS: vs. baseline under strong noise). Severe translation drift collapses all configurations to full rejection, exposing an explicit sensing boundary beyond the reach of local conditioning. These results support BGC as a practical sensor-side robustness enhancement under the studied degradation protocol, with conditional rather than universal applicability across backbones and fault types. - Open Access
A DTW-Based Spatio-Temporal Synchronization Method for Radar and Camera Fusion
Roadside perception systems, also known as roadside units (RSUs), are critical in Vehicle-to-Everything (V2X) applications, yet spatio-temporal asynchrony between multiple sensors severely compromises the accuracy of fusion. In this paper, a spatio-temporal synchronization method for millimeter-wave (MMW) radar and camera fusion is proposed, integrating target matching based on dynamic time warping (DTW) with spatio-temporal parameter estimation. Leveraging the advantages of DTW in time-series alignment to calculate the similarity between radar and visual trajectories enables target matching and parameter estimation in sparse scenes. This method was validated on a real-world dataset containing over 30 pedestrian trajectories, covering scenarios with varying densities ranging from one to six pedestrians. The results indicate a temporal offset of 0.116 s between the camera and radar. Following synchronization, the average spatial deviation decreased from 1.4358 to 0.1074 m in the x-direction (i.e., across the road) and from 3.0732 to 0.1775 m in the y-direction (i.e., along the road). Consequently, this method provides an efficient solution for deploying roadside perception systems in sparse traffic environments.
Open AccessA DTW-Based Spatio-Temporal Synchronization Method for Radar and Camera Fusion
Roadside perception systems, also known as roadside units (RSUs), are critical in Vehicle-to-Everything (V2X) applications, yet spatio-temporal asynchrony between multiple sensors severely compromises the accuracy of fusion. In this paper, a spatio-temporal synchronization method for millimeter-wave (MMW) radar and camera fusion is proposed, integrating target matching based on dynamic time warping (DTW) with spatio-temporal parameter estimation. Leveraging the advantages of DTW in time-series alignment to calculate the similarity between radar and visual trajectories enables target matching and parameter estimation in sparse scenes. This method was validated on a real-world dataset containing over 30 pedestrian trajectories, covering scenarios with varying densities ranging from one to six pedestrians. The results indicate a temporal offset of 0.116 s between the camera and radar. Following synchronization, the average spatial deviation decreased from 1.4358 to 0.1074 m in the x-direction (i.e., across the road) and from 3.0732 to 0.1775 m in the y-direction (i.e., along the road). Consequently, this method provides an efficient solution for deploying roadside perception systems in sparse traffic environments.
- Open Access
EFA-RadNet: Efficient Feature Aggregation with Balanced Attention for Raw Radar Multi-Task Learning
Original high-definition radar data contains rich environmental information, including distance, Doppler velocity, and azimuth. However, extracting robust features from such sparse and noisy frequency-domain data remains a challenge. To address this issue, this paper proposes an improved multi-task network, the Efficient Feature Aggregation with Balanced Attention Radar Network (EFA-RadNet). This network introduces the VoVNetV2 architecture into the field of raw radar perception and effectively preserves feature diversity across different receptive fields through a One-Shot Aggregation (OSA) module, avoiding signal aliasing. In addition, we propose an attention mechanism module, Balanced effective Squeeze–Excitation (B-eSE), which is better suited for sparse radar processing and effectively addresses the problem of weak target loss in the radar spectrum. Experiments on the RADIal dataset show that our EFA-RadNet achieves excellent target detection performance while also attaining optimal accuracy in free space segmentation.
Open AccessEFA-RadNet: Efficient Feature Aggregation with Balanced Attention for Raw Radar Multi-Task Learning
Original high-definition radar data contains rich environmental information, including distance, Doppler velocity, and azimuth. However, extracting robust features from such sparse and noisy frequency-domain data remains a challenge. To address this issue, this paper proposes an improved multi-task network, the Efficient Feature Aggregation with Balanced Attention Radar Network (EFA-RadNet). This network introduces the VoVNetV2 architecture into the field of raw radar perception and effectively preserves feature diversity across different receptive fields through a One-Shot Aggregation (OSA) module, avoiding signal aliasing. In addition, we propose an attention mechanism module, Balanced effective Squeeze–Excitation (B-eSE), which is better suited for sparse radar processing and effectively addresses the problem of weak target loss in the radar spectrum. Experiments on the RADIal dataset show that our EFA-RadNet achieves excellent target detection performance while also attaining optimal accuracy in free space segmentation.
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (10) , 1-13
Adaptive Graph Construction Learning for Automotive Radar Object Detection
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 27 (10) , 1-13
Adaptive Graph Construction Learning for Automotive Radar Object Detection