Ronghao Fu

Ronghao Fu

Auto-generated profile, based on publicly available information

Ronghao Fu

College of Computer Science and Technology, Jilin University, Changchun, China

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
29 April 2024 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
RFRonghao Fu
Ronghao Fu
CCchengcheng chen
chengcheng chen
SYShuang Yan
Shuang Yan
RZRui Zhang
Rui Zhang
XWxianchang wang
xianchang wang
Huiling ChenHuiling Chen
Huiling Chen
In the field of Earth observation and computer vision, oriented object detection for remotesensing images is a crucial task that aims to locate objects more accurately in complex scenes containing a large number of densely arranged, large aspect ratio, and arbitrarily oriented objects. Although recently proposed methods have achieved remarkable performance, there are still several challenges to address: 1) interference from complex backgrounds, 2) imbalanced and mismatched label assignments caused by tiny objects and objects with large aspect ratios, and 3) misalignment between the tasks of classification and localization. In this article, we propose a frequency-assisted dynamic learning network (FADL-Net) to overcome the crucial challenges. Concretely, we introduce a spatial-spectral feature pyramid network to adaptively capture global long-range dependency feature representations containing various frequency domains. Meanwhile, to produce more reliable training samples for objects with extreme shapes, we design a geometric aware dynamic label assignment to dynamically mitigate the imbalance and mismatch in label assignment in a coarse-to-fine manner, thereby achieving more stable optimization during the training process. Moreover, we propose a joint-learning rotated quality loss that addresses the inconsistency between classification and localization by dynamically adapting the weights of different samples in the training stage. Extensive experiments on several public remote sensing datasets demonstrate that our method performs favorably against state-of-the-art detection approaches.

31 May 2024 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
RFRonghao Fu
Ronghao Fu
SYShuang Yan
Shuang Yan
CCchengcheng chen
chengcheng chen
XWxianchang wang
xianchang wang
Ali Asghar HeidariAli Asghar Heidari
Ali Asghar Heidari
Huiling ChenHuiling Chen
Huiling Chen
Semisupervised object detection (SSOD) has garnered significant interest for its capability to enhance the detection performance by leveraging large amounts of unlabeled data. However, current SSOD methods primarily focus on detecting horizontal objects, with little research devoted to the detection of arbitrary-oriented objects in remote sensing images. Drawing inspiration from this limitation, this article proposes a semisupervised oriented object detection framework (S $^{2}$ O-Det) to reduce annotation costs while improving detection performance in a semisupervised manner. Initially, the proposed task-consistent learning aims to alleviate the inconsistencies between classification and localization, which provides consistent confidence for the pseudolabels. Subsequently, the introduced coarse-to-fine sample mining employs dense prediction for pseudolabel assignment, adopting a divide-and-conquer approach to independently identify consistent and reliable labels for both classification and localization tasks. Finally, a probabilistic distillation loss ensures the harmonization of the probability distributions across the teacher and student feature domains, thereby reciprocally enhancing the learning competencies. Experimental results on the DOTA-v1.0 and DOTA-v1.5 datasets demonstrate that S $^{2}$ O-Det achieves promising performance across different labeling ratios.

24 September 2024 in Knowledge-Based Systems
Verified
Journal Article
Closed access
RFRonghao Fu
Ronghao Fu
CCchengcheng chen
chengcheng chen
SYShuang Yan
Shuang Yan
XWxianchang wang
xianchang wang
Huiling ChenHuiling Chen
Huiling Chen

16 November 2020 in IEEE Access
Verified
Journal Article
Open access
XWXianchang Wang
Xianchang Wang
RFRonghao Fu
Ronghao Fu
RZRui Zhang
Rui Zhang
A norm regulates the run-time behavior of the agent with the action and condition to trigger the action. Because of the incomplete understanding of the world, the result of the action may be different for the same agent with the ‘same’ context, or unintended different context. To study this phenomenon, the classical norm definition is extended from the condition-action pair to cover the expectation , in order to verify the result of the action. The Norm evolution can be defined as a gradual process which makes a norm more complete and effective. In the terminology of evolution, a norm is called mutated if the result contradicts to the expectation, i.e. at least one of the expected conditions is invalid. At run-time, norms are executed in series. A mutation brings new knowledge to the following states and might affect the later execution of the norms. Such knowledge provides will help the norm designer to complete the definitions. A mutation based norm evolution (Mone) method is proposed in this paper to detect the mutations, to propagate the evidence and to crossover the norms for completeness. The method is formalized in the Description Logic, and implemented with the algorithms for mutation detection and norm crossover. The case study illustrates the Description Logic $\mathcal {ALCI}$ of the method and shows the potential to evolve the norms autonomously in the Blackboard system, GBBopen.

5 December 2025 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
YLYun Long
Yun Long
SYShuang Yan
Shuang Yan
RFRonghao Fu
Ronghao Fu
JZJianbin Zheng
Jianbin Zheng
JLJing Li
Jing Li
Huiling ChenHuiling Chen
Huiling Chen
The marine vibrators (MVibs) have become indispensable in marine industrial exploration due to its controllable energy output, high repeatability, and environmental compatibility. MVib-based blended acquisition improves exploration efficiency by reducing sampling duration and operational costs, but it introduces significant challenges in source separation due to blending noise. Since the subsequent processing method of MVibs require precorrelation data, this article presents a deblending framework for precorrelation MVib data by integrating a prior network into the inversion framework. To address the scarcity of labeled MVib data for deep learning, a data augmentation strategy is proposed in which natural images are converted into seismic-like data using band-pass filtering to train the prior network. This approach enhances model generalization and alleviates the limitations of MVib datasets. The proposed framework is validated through multi-MVib simulations and large scale open sea trials. Experimental results demonstrate that the method effectively suppresses blending noise while preserving key signal features, outperforming conventional deblending techniques and demonstrating strong practical value in real-world marine exploration.

12 April 2026
Verified
Conference Paper
Open access
RHRenda Han
Renda Han
XWXiaobao Wang
Xiaobao Wang
LWLongbiao Wang
Longbiao Wang
WZWenxin Zhang
Wenxin Zhang
RFRonghao Fu
Ronghao Fu
KKKuntharrgyal Khysru
Kuntharrgyal Khysru
Clustering is a fundamental task in graph data mining, including both node-level and graph-level clustering. While the former has been extensively explored to capture local structures and features, the latter has gained attention for its ability to capture global relationships and high-level abstractions. However, existing methods often address these two tasks in isolation, which not only wastes computational resources but also fails to fully leverage the knowledge from both levels to improve each other, hindering consistent performance improvement. To this end, we propose a novel Unified Graph Clustering Network called UGCN, which employs both local and global graph information to address node- and graph-level clustering collaboratively. In detail, we design a dual-branch projector that performs joint learning at both node and graph levels. The first branch extracts node-level features and projects them into distinct cluster layers, where the derived prototypes are used to refine graph attributes and highlight clustering-friendly substructures. In parallel, the second branch captures subgraph embeddings and aggregates them into discriminative graph-level representations. we align the two branches through joint contrastive objectives to establish a bidirectional interaction: refined prototypes guide subgraph and graph-level clustering, while graph-level pseudo-labels provide feedback to enhance node-level clustering. Extensive experimental results across seven datasets demonstrate that our method significantly outperforms existing state-of-the-art approaches.