Jinhong Ren

Jinhong Ren

Auto-generated profile, based on publicly available information

Jinhong Ren

Key Laboratory of Intelligent Perception and Image Understanding of the Ministry of Education, School of Artificial Intelligence, Xidian University, Xian, Shaanxi, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 November 2022 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
Ronghua ShangRonghua Shang
Ronghua Shang
JRJinhong Ren
Jinhong Ren
SZSongling Zhu
Songling Zhu
WZWeitong Zhang
Weitong Zhang
JFJie Feng
Jie Feng
LJLicheng Jiao
Licheng Jiao
Attention mechanism-based Hyperspectral Image (HSI) classification algorithms typically extract spectral and spatial features by spectral attention and spatial attention network respectively. However, these algorithms lack joint attention and ignore imbalanced samples, leading to insufficient information extraction. To address this problem, this paper proposes a novel HSI classification algorithm based on the pyramidal coordinate attention and weighted self-distillation (PCA-WSD). To perform the joint attention of spectral and spatial features, the proposed PCA mechanism uses spectral attention to cope with the diverse spatial features. The PCA mechanism consists of two components. First, the spatial pyramid coordinate squeeze (SPCS) is designed to aggregate spatial features with local and global information. Then, the tailored spatial pyramid coordinate excitation (SPCE) adaptively enhances their informative spectral features for the obtained spatial features, realizing the joint attention to spectral-spatial features. Further, considering the imbalance of samples, WSD is proposed. Specifically, weighted cross-entropy is integrated into WSD. Extensive experiments are evaluated on the four HSI benchmark datasets: Indian Pine (IP), Pavia University (UP), Kennedy Space Center (KSC), and Pavia Center (PC). Compared with the seven advanced algorithms, experimental results of the proposed algorithm 1 . reveal superior classification performance, especially for the imbalanced samples.

15 November 2024 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
JRJinhong Ren
Jinhong Ren
Ronghua ShangRonghua Shang
Ronghua Shang
JCJiansheng Chen
Jiansheng Chen
WZWeitong Zhang
Weitong Zhang
Jie FengJie Feng
Jie Feng
RSRustam Stolkin
Rustam Stolkin
Superpixel segmentation algorithms are predominently based on Simple Linear Iterative Clustering (SLIC), and treat homogeneous and complex regions equally. This can lead to sub-optimal segmentation results, especially in complex images with multiple objects. We address this problem by proposing a SAR image segmentation algorithm based on complicated region-sensitive adaptive superpixel generation and hybrid edge correction (RSASGEC). Firstly, a dynamic initialization algorithm for superpixel seeds based on region complexity is designed. Specifically, a new superpixel representation structure for superpixel seeds is constructed by combining superpixel complexity and the number of contained pixels. The algorithm gives priority to regions with high complexity, dynamically selecting the region with the highest complexity for further partitioning. This results in a dense distribution of superpixel seeds in complex regions, and sparse distributions in homogeneous regions with low complexity. Secondly, an iterative superpixel segmentation process based on an adaptive energy function is proposed. The Lagrange multiplier mathematical strategy is employed to optimize the adaptive energy function within an adjustable search window, resulting in more compact superpixel segmentation. Finally, a label correction method, based on edge mixture model constraints, is proposed for post-processing. By integrating edge information from the Gaussian edge detector and the Canny algorithm as constraints, this method leverages majority voting and region growth methods to mitigate edge noise and outliers, refining the superpixel labels. The RSASGEC algorithm is verified in experiments, using one simulated image and six real SAR images. The results indicate that RSASGEC outperforms six representative algorithms, achieving more satisfactory segmentation performance.

13 November 2025 in Expert Systems with Applications
Verified
Journal Article
Closed access
JRJinhong Ren
Jinhong Ren
JYJie Yang
Jie Yang
Ronghua ShangRonghua Shang
Ronghua Shang
KXKun Xie
Kun Xie
Jie FengJie Feng
Jie Feng
DFDongzhu Feng
Dongzhu Feng

15 October 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
JRJinhong Ren
Jinhong Ren
KZKeyao Zhu
Keyao Zhu
MHMingwei Hu
Mingwei Hu
Ronghua ShangRonghua Shang
Ronghua Shang
MZMengxuan Zhang
Mengxuan Zhang

6 November 2025 in IEEE Transactions on Circuits and Systems for Video Technology
Verified
Journal Article
Closed access
JZJingyu Zhong
Jingyu Zhong
Ronghua ShangRonghua Shang
Ronghua Shang
SMShasha Mao
Shasha Mao
JRJinhong Ren
Jinhong Ren
Jie FengJie Feng
Jie Feng
Partial multi-label image classification (PMLIC) learns from typical weak supervision, where each image is labeled with a set of candidate labels, only some of which are correct. We find that noisy labels generate conflicting gradient signals that disrupt the learning of latent true labels, causing the model to prefer learning clean negative labels that provide consistent supervisory signals, thereby hindering disambiguation. Meanwhile, noisy labels cause the model to activate misattributed pixel regions, which interfere with feature pattern extraction, leading to inaccurate label correlation. In this paper, we propose a PMLIC framework that constructs a correlation-induced negative suppression disambiguation loss (CoNeS). First, we exploit the property that networks tend to learn clean labels first by extracting class activation maps to identify and screen misattributed pixel regions. Meanwhile, we aggregate noise-disturbed feature patterns into more expressive representations via k-means clustering and construct accurate label correlations to aid disambiguation. In addition, we design the negative suppression disambiguation loss to focus the model on disambiguation by introducing a weight distribution to suppress the contribution of negative labels. This weighting distribution can be adaptively inferred by a closed-form solution. Extensive experiments demonstrate that the CoNeS framework achieves significant advantages over current state-of-the-art methods. Specifically, it achieves average mAP improvements of 1.26%, 2.74%, 0.85%, and 0.33% on the VOC 2007, MS-COCO, VG-256, and CUB-200 datasets at different resolutions and noise rates. Code has been made available at https://github.com/zhongjingyu1/CoNeS.

24 July 2025 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
WZWeitong Zhang
Weitong Zhang
ZWZihong Wang
Zihong Wang
JRJinhong Ren
Jinhong Ren
Ronghua ShangRonghua Shang
Ronghua Shang
LJLicheng Jiao
Licheng Jiao
Recently, cross-domain few-shot learning (FSL) has achieved remarkable performance in hyperspectral image classification (HSIC). However, current prototype-based FSL methods overlook the redundancy between prototypes, which may lead to intradomain redundancy dependence and interfere with the effective alignment of data distributions between the source domain (SD) and the target domain (TD). To address these issues, we propose a prototype mask contrast and cross-stage feature refinement (PMC-CFR) method for few-shot HSIC. Specifically, a neighbor-resistant multidimensional feature fusion (NRMFF) network is designed to fuse features inclined toward different dimensional information after random neighboring-pixel removal. Next, the parameter-free adaptive mask generator (PAMG) identifies potential redundant components based on the statistical distribution of intradomain prototypes to form negative pairs, while treating other components as key features to form positive pairs. Contrastive pairs are further processed through graph convolution (GC) for supervised contrastive learning (SCL), which mitigates the dependence on intradomain redundancy and enhances the learning of key features. To extract more representative features, multilevel representations are formed depending on whether the shared multilayer perceptron (MLP) is applied to focus on key components in each domain by fitting positive pairs. Meanwhile, the directional calibration (DC) separates interclass prototypes across levels by balancing direction and distance. The synergy between MLP and DC in hierarchical feature modeling and semantic separation enables cross-stage feature refinement. Experimental results on four public HSI datasets demonstrate that the PMC-CFR outperforms many advanced contrastive methods, and feature visualizations further support its effectiveness in cross-domain feature distribution alignment.