Cheng Jin
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Cheng Jin has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Fengyuan Hu
School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Jiawei Zhang
Department of Electronic Engineering, Beijing National Research Center for Information Science and Technology, Tsinghua University, Beijing, China
1 shared publication - Junfeng Wang
School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Xingzhao Liu
Department of Electronic Engineering, Shanghai Jiao Tong University, Shanghai, China
1 shared publication - Xue Jiang
School of Electronic Information and Electrical Engineering, Shanghai Jiao Tong University, Shanghai, China
1 shared publication Yibin Ying
1 shared publication
Latest Publications
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-18
Keypoint-Based SAR Structure From Motion via Riemannian Optimization
Structure-from-motion (SfM) is the concept of estimating both sensor pose and three-dimensional (3D) scene structure from input images. The difficulty with synthetic aperture radar (SAR) SfM stems from the non-linearity of radar imaging, making it hard to decouple and calculate radar pose and structure. Existing methods typically address this issue by simplifying the imaging process or introducing auxiliary data. In this paper, we propose to jointly solve radar pose and structure by formulating an optimization problem, which only needs two-dimensional (2D) SAR observations as input. The objective function is written as the summation of all reprojection errors established by the precise range-Doppler (RD) imaging model, with radar poses embedded into the transformations between the sensor and scene coordinate systems. The rotational components in radar poses are represented as matrices and constrained on the special orthogonal group SO(3). A special orthogonal Riemannian conjugate gradient algorithm (SO-RCG) is then proposed to solve the optimization problem. The proposed algorithm preserves the orthogonality of rotation matrices and updates all variables iteratively. Furthermore, we deduce that only five degrees of freedom (DoFs) in radar pose are involved in determining the imaging results of targets. We also discuss the ambiguity issue in multiview SAR observation leading to local minimums and introduce strategies against ambiguity. Experimental results on real-measured and simulated datasets show that the proposed algorithm is effective on both near- and far-field cases, and can be applied to both side-looking and squint SAR.
- 18 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Geoscience and Remote Sensing
- Vol. 63 (01962892) , 1-18
Keypoint-Based SAR Structure From Motion via Riemannian Optimization
Structure-from-motion (SfM) is the concept of estimating both sensor pose and three-dimensional (3D) scene structure from input images. The difficulty with synthetic aperture radar (SAR) SfM stems from the non-linearity of radar imaging, making it hard to decouple and calculate radar pose and structure. Existing methods typically address this issue by simplifying the imaging process or introducing auxiliary data. In this paper, we propose to jointly solve radar pose and structure by formulating an optimization problem, which only needs two-dimensional (2D) SAR observations as input. The objective function is written as the summation of all reprojection errors established by the precise range-Doppler (RD) imaging model, with radar poses embedded into the transformations between the sensor and scene coordinate systems. The rotational components in radar poses are represented as matrices and constrained on the special orthogonal group SO(3). A special orthogonal Riemannian conjugate gradient algorithm (SO-RCG) is then proposed to solve the optimization problem. The proposed algorithm preserves the orthogonality of rotation matrices and updates all variables iteratively. Furthermore, we deduce that only five degrees of freedom (DoFs) in radar pose are involved in determining the imaging results of targets. We also discuss the ambiguity issue in multiview SAR observation leading to local minimums and introduce strategies against ambiguity. Experimental results on real-measured and simulated datasets show that the proposed algorithm is effective on both near- and far-field cases, and can be applied to both side-looking and squint SAR.
- 10 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 462-476
Adaptive Polyak Step-Size for Momentum Accelerated Stochastic Gradient Descent With General Convergence Guarantee
Momentum accelerated stochastic gradient descent (SGDM) has gained significant popularity in several signal processing and machine learning tasks. Despite its widespread success, the step size of SGDM remains a critical hyperparameter affecting its performance and often requires manual tuning. Recently, some works have introduced the Polyak step size to SGDM and provided corresponding convergence analysis. However, the convergence guarantee of existing Polyak step sizes for SGDM are limited to convex objectives and lack theoretical support for more widely applicable non-convex problems. To bridge this gap, we design a novel Polyak adaptive step size for SGDM. The proposed algorithm, termed SGDM-APS, incorporates a moving average form tailored for the momentum mechanism in SGDM. We establish the convergence guarantees of SGDM-APS for both convex and non-convex objectives, providing theoretical analysis of its effectiveness. To the best of our knowledge, SGDM-APS is the first Polyak step size for SGDM with general convergence guarantee. Our analysis can also be extended to constant step size SGDM, enriching the theoretical comprehension of the classic SGDM algorithm. Through extensive experiments on diverse benchmarks, we demonstrate that SGDM-APS achieves competitive convergence rates and generalization performance compared to several popular optimization algorithms.
- 10 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 73 (1053587X) , 462-476
Adaptive Polyak Step-Size for Momentum Accelerated Stochastic Gradient Descent With General Convergence Guarantee
Momentum accelerated stochastic gradient descent (SGDM) has gained significant popularity in several signal processing and machine learning tasks. Despite its widespread success, the step size of SGDM remains a critical hyperparameter affecting its performance and often requires manual tuning. Recently, some works have introduced the Polyak step size to SGDM and provided corresponding convergence analysis. However, the convergence guarantee of existing Polyak step sizes for SGDM are limited to convex objectives and lack theoretical support for more widely applicable non-convex problems. To bridge this gap, we design a novel Polyak adaptive step size for SGDM. The proposed algorithm, termed SGDM-APS, incorporates a moving average form tailored for the momentum mechanism in SGDM. We establish the convergence guarantees of SGDM-APS for both convex and non-convex objectives, providing theoretical analysis of its effectiveness. To the best of our knowledge, SGDM-APS is the first Polyak step size for SGDM with general convergence guarantee. Our analysis can also be extended to constant step size SGDM, enriching the theoretical comprehension of the classic SGDM algorithm. Through extensive experiments on diverse benchmarks, we demonstrate that SGDM-APS achieves competitive convergence rates and generalization performance compared to several popular optimization algorithms.