Jianyong Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jianyong Yu has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
Xue Han
Hunan Software Vocational and Technical University
5 shared publicationsZekun Liu
Hunan University of Science and Technology
3 shared publications- Xiuyu Li
Sanya Institute of Hunan University of Science and Technology, Sanya, Hainan, China
2 shared publications - Yulong Wang
School of Computer Science and Engineering, Hunan University of Science and Technology, Xiangtan, China
2 shared publications - Zijuan Chen
Sanya Institute of Hunan University of Science and Technology
2 shared publications Chao Wang
Hunan University of Science and Technology
1 shared publication
Latest Publications
- 2 July 2026
- Published by Springer Nature
- p. 172-186
Fusing Hierarchical Attention and Hawkes Processes for Embedding Dynamic Heterogeneous Graphs
- 2 July 2026
- Published by Springer Nature
- p. 172-186
Fusing Hierarchical Attention and Hawkes Processes for Embedding Dynamic Heterogeneous Graphs
- Open Access
- 12 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 109-115
Multimodal Rumor Detection Based on Visual-Text Conversion and Multi-Granularity Similarity Fusion
- 12 June 2026
- Published by Association for Computing Machinery (ACM)
- p. 109-115
Open AccessMultimodal Rumor Detection Based on Visual-Text Conversion and Multi-Granularity Similarity Fusion
- Open Access
DualOadamNet: Dual-Branch Lightweight Network for Underwater Image Processing with Optical-Aware Detail Augmentation
The deep water environment is complex and variable, and underwater images are easily affected by light scattering, water absorption and other factors, resulting in blurred details and color distortion. The existing enhancement methods generally suffer from poor model generalization, parallel task conflicts, and imbalance between real-time performance and optimization effect. To address this challenge, this study proposes a dual-branch lightweight network named DualOadamNet for underwater image processing with optical-aware detail augmentation. The model is based on the branches of global and local feature extraction, and the Optical-Aware Detail Augmentation Module with the characteristics of human visual simulation repair is introduced to repair the image naturally. Combined with pixel rearrangement operation, the model achieves efficient feature scale extraction. The experimental results on UIEB, EUVP and LSUI datasets show that the proposed method achieves average full-color evaluation metrics of 24.63 for PSNR, 0.919 for SSIM, and 3.267 for UIQM. Additionally, the real-time enhancement speed of a 1080p resolution image is 85.299 FPS.
Open AccessDualOadamNet: Dual-Branch Lightweight Network for Underwater Image Processing with Optical-Aware Detail Augmentation
The deep water environment is complex and variable, and underwater images are easily affected by light scattering, water absorption and other factors, resulting in blurred details and color distortion. The existing enhancement methods generally suffer from poor model generalization, parallel task conflicts, and imbalance between real-time performance and optimization effect. To address this challenge, this study proposes a dual-branch lightweight network named DualOadamNet for underwater image processing with optical-aware detail augmentation. The model is based on the branches of global and local feature extraction, and the Optical-Aware Detail Augmentation Module with the characteristics of human visual simulation repair is introduced to repair the image naturally. Combined with pixel rearrangement operation, the model achieves efficient feature scale extraction. The experimental results on UIEB, EUVP and LSUI datasets show that the proposed method achieves average full-color evaluation metrics of 24.63 for PSNR, 0.919 for SSIM, and 3.267 for UIQM. Additionally, the real-time enhancement speed of a 1080p resolution image is 85.299 FPS.
- 11 October 2025
- Published by Springer Nature
- p. 111-121
Rumor Detection Method Based on Multi-modal Mixture of Experts and Cross-modal Enhancement
- 11 October 2025
- Published by Springer Nature
- p. 111-121
Rumor Detection Method Based on Multi-modal Mixture of Experts and Cross-modal Enhancement
- 11 October 2025
- Published by Springer Nature
- p. 130-139
Non-Fungible Token Verification Scheme Based on Core Peripheral Sharding
- 11 October 2025
- Published by Springer Nature
- p. 130-139
Non-Fungible Token Verification Scheme Based on Core Peripheral Sharding
- 28 March 2025
- Published by Springer Nature
- p. 22-30
A Decomposition Method of Microservice-Oriented Based on Community Detection Strategy
- 28 March 2025
- Published by Springer Nature
- p. 22-30
A Decomposition Method of Microservice-Oriented Based on Community Detection Strategy
- Open Access
Analysis of Core–Periphery Structure Based on Clustering Aggregation in the NFT Transfer Network
With the rise of blockchain technology and the Ethereum platform, non-fungible tokens (NFTs) have emerged as a new class of digital assets. The NFT transfer network exhibits core–periphery structures derived from different partitioning methods, leading to local discrepancies and global diversity. We propose a core–periphery structure characterization method based on Bayesian and stochastic block models (SBMs). This method incorporates prior knowledge to improve the fit of core–periphery structures obtained from various partitioning methods. Additionally, we introduce a locally weighted core–periphery structure aggregation (LWCSA) scheme, which determines local aggregation weights using the minimum description length (MDL) principle. This approach results in a more accurate and representative core–periphery structure. The experimental results indicate that core nodes in the NFT transfer network constitute approximately 2.3–5% of all nodes. Compared to baseline methods, our approach improves the normalized mutual information (NMI) index by 6–10%, demonstrating enhanced structural representation. This study provides a theoretical foundation for further analysis of the NFT market.
Open AccessAnalysis of Core–Periphery Structure Based on Clustering Aggregation in the NFT Transfer Network
With the rise of blockchain technology and the Ethereum platform, non-fungible tokens (NFTs) have emerged as a new class of digital assets. The NFT transfer network exhibits core–periphery structures derived from different partitioning methods, leading to local discrepancies and global diversity. We propose a core–periphery structure characterization method based on Bayesian and stochastic block models (SBMs). This method incorporates prior knowledge to improve the fit of core–periphery structures obtained from various partitioning methods. Additionally, we introduce a locally weighted core–periphery structure aggregation (LWCSA) scheme, which determines local aggregation weights using the minimum description length (MDL) principle. This approach results in a more accurate and representative core–periphery structure. The experimental results indicate that core nodes in the NFT transfer network constitute approximately 2.3–5% of all nodes. Compared to baseline methods, our approach improves the normalized mutual information (NMI) index by 6–10%, demonstrating enhanced structural representation. This study provides a theoretical foundation for further analysis of the NFT market.
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (6) , 6704-6717
ULBRF: A Framework for Maximizing Influence in Dynamic Networks Based on Upper and Lower Bounds of Propagation
The influence maximization problem that selects a set of seed nodes to maximize the influence spread has been becoming a hot research topic. The classical algorithms select the seed nodes at the initial moment based on the topological properties in static networks, which are not suitable for solving the problem in dynamic networks. In this paper, we propose the Upper and Lower Bound Radix Forward framework to solve this problem in the dynamic network. First, we propose the upper bound of the influence spread and derive the corresponding lower bound to find the seed nodes. When extending the classical IM to the dynamic network, we find the problem that the final influence spreads increase logarithmically with the linear expansion of the initial seed sets. Therefore, the Dynamic Network Path Dispersion is proposed to solve the problem by measuring the heterogeneity of the snaphots on the dynamic network. The Upper and Lower Bound Radix Forward (ULBRF) is tested and applied in two real dynamic networks and two synthetic networks. Experimental results show that the ULBRF is better than the widely recognized improved greedy algorithms. The Dynamic Network Path Dispersion (DNPD) and the strategy based on the heterogeneities also expand the final influence spread by $35\% \sim 45\%$ .
- 23 October 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 11 (6) , 6704-6717
ULBRF: A Framework for Maximizing Influence in Dynamic Networks Based on Upper and Lower Bounds of Propagation
The influence maximization problem that selects a set of seed nodes to maximize the influence spread has been becoming a hot research topic. The classical algorithms select the seed nodes at the initial moment based on the topological properties in static networks, which are not suitable for solving the problem in dynamic networks. In this paper, we propose the Upper and Lower Bound Radix Forward framework to solve this problem in the dynamic network. First, we propose the upper bound of the influence spread and derive the corresponding lower bound to find the seed nodes. When extending the classical IM to the dynamic network, we find the problem that the final influence spreads increase logarithmically with the linear expansion of the initial seed sets. Therefore, the Dynamic Network Path Dispersion is proposed to solve the problem by measuring the heterogeneity of the snaphots on the dynamic network. The Upper and Lower Bound Radix Forward (ULBRF) is tested and applied in two real dynamic networks and two synthetic networks. Experimental results show that the ULBRF is better than the widely recognized improved greedy algorithms. The Dynamic Network Path Dispersion (DNPD) and the strategy based on the heterogeneities also expand the final influence spread by $35\% \sim 45\%$ .
- 25 November 2022
- Published by Springer Nature
- p. 94-107
A Community Detection Algorithm Fusing Node Similarity and Label Propagation
- 25 November 2022
- Published by Springer Nature
- p. 94-107
A Community Detection Algorithm Fusing Node Similarity and Label Propagation