Shouliang Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Shouliang Li has a total of 79 co-authors. Here are the top co-authors by number of shared publications:
- Yide Ma
School of Information Science and Engineering, Lanzhou University, Lanzhou, Gansu, China
9 shared publications - Zhen Yang
School of Information Science and Engineering, Lanzhou University, Lanzhou, China
7 shared publications Yide Ma
Lanzhou University
5 shared publicationsJing Lian
Lanzhou Jiaotong University
4 shared publicationsRongjun Ge
Lanzhou Univ. (China)
4 shared publicationsTongfeng Zhang
Lanzhou Univ. (China)
4 shared publications
Latest Publications
- Open Access
SAF-Net: Stage-Aware Semantic Allocation with Frequency-Refined Vision-Language Decoding for Medical Lesion Segmentation
Medical lesion segmentation remains challenging due to ambiguous boundaries, heterogeneous appearances, and the limited ability of visual features alone to capture clinically meaningful semantics. Existing vision-language segmentation methods have demonstrated the value of textual guidance, but they often rely on fixed or shared textual representations across different decoder stages, despite the fact that visual features progressively evolve from coarse semantic representations to finer spatial details. To address this stage-wise representation mismatch, we propose SAF-Net, a stage-aware vision-language segmentation framework that couples stage-specific semantic allocation with frequency-refined progressive decoding. Specifically, Adaptive Hierarchical Text Allocation (AHTA) retains the hidden representations from all layers of a frozen medical language encoder and learns independent layer-mixing distributions for different text-guided decoder stages, enabling stage-specific semantic guidance without manually predefined layer-to-stage correspondence. Meanwhile, Frequency-Gated Spatial-aware Channel Attention (FGSCA) refines the incoming decoder features through complementary frequency-aware spatial-channel modeling before cross-modal interaction. By coordinating hierarchical textual semantics with frequency-aware visual refinement across progressive decoding stages, SAF-Net allows the representations participating in multimodal interaction to better adapt to the changing requirements of hierarchical decoding. Extensive experiments on QaTa-COV19 and MosMedData+ demonstrate the effectiveness and competitiveness of the proposed framework.
Open AccessSAF-Net: Stage-Aware Semantic Allocation with Frequency-Refined Vision-Language Decoding for Medical Lesion Segmentation
Medical lesion segmentation remains challenging due to ambiguous boundaries, heterogeneous appearances, and the limited ability of visual features alone to capture clinically meaningful semantics. Existing vision-language segmentation methods have demonstrated the value of textual guidance, but they often rely on fixed or shared textual representations across different decoder stages, despite the fact that visual features progressively evolve from coarse semantic representations to finer spatial details. To address this stage-wise representation mismatch, we propose SAF-Net, a stage-aware vision-language segmentation framework that couples stage-specific semantic allocation with frequency-refined progressive decoding. Specifically, Adaptive Hierarchical Text Allocation (AHTA) retains the hidden representations from all layers of a frozen medical language encoder and learns independent layer-mixing distributions for different text-guided decoder stages, enabling stage-specific semantic guidance without manually predefined layer-to-stage correspondence. Meanwhile, Frequency-Gated Spatial-aware Channel Attention (FGSCA) refines the incoming decoder features through complementary frequency-aware spatial-channel modeling before cross-modal interaction. By coordinating hierarchical textual semantics with frequency-aware visual refinement across progressive decoding stages, SAF-Net allows the representations participating in multimodal interaction to better adapt to the changing requirements of hierarchical decoding. Extensive experiments on QaTa-COV19 and MosMedData+ demonstrate the effectiveness and competitiveness of the proposed framework.
- 1 September 2026
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 20 (11) , 610
Enhancement of decrypted images degraded by ciphertext cropping
- 1 September 2026
- Published by Springer Nature in Signal, Image and Video Processing
- Vol. 20 (11) , 610
Enhancement of decrypted images degraded by ciphertext cropping
- 11 February 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (3) , 217
Designing high-efficiency pseudorandom number generators via the modulated rotated tent map
- 11 February 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (3) , 217
Designing high-efficiency pseudorandom number generators via the modulated rotated tent map
- Open Access
Dynamic-Step-Size Regulation in Pulse-Coupled Neural Networks
Pulse-coupled neural networks (PCNNs) are capable of segmenting digital images in a multistage unsupervised fashion; however, optimal output selection remains challenging. To address the above problem, this paper emphasizes the role of the step size, which influences the decreasing speed of the membrane potential and the dynamic threshold profoundly. A dynamic-step-size mechanism is proposed, utilizing trigonometric functions to adaptively control segmentation granularity, along with the supervised optimization of a single parameter via intersection over union (IoU) maximization, reducing tuning complexity. Thus, the number of groups of image segmentation becomes controllable and the model itself becomes more adaptive than ever for various scenarios. Experimental results further demonstrate the enhanced robustness under noise (92.1% Dice at ), outperforming SPCNN and PCNN with IoU = 0.8863, Dice = 0.901, and 0.8684 s/image.Open AccessDynamic-Step-Size Regulation in Pulse-Coupled Neural Networks
Pulse-coupled neural networks (PCNNs) are capable of segmenting digital images in a multistage unsupervised fashion; however, optimal output selection remains challenging. To address the above problem, this paper emphasizes the role of the step size, which influences the decreasing speed of the membrane potential and the dynamic threshold profoundly. A dynamic-step-size mechanism is proposed, utilizing trigonometric functions to adaptively control segmentation granularity, along with the supervised optimization of a single parameter via intersection over union (IoU) maximization, reducing tuning complexity. Thus, the number of groups of image segmentation becomes controllable and the model itself becomes more adaptive than ever for various scenarios. Experimental results further demonstrate the enhanced robustness under noise (92.1% Dice at ), outperforming SPCNN and PCNN with IoU = 0.8863, Dice = 0.901, and 0.8684 s/image. - 10 March 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (4) , 1-26
A digital signature scheme based on general Chebyshev polynomial
- 10 March 2025
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 81 (4) , 1-26
A digital signature scheme based on general Chebyshev polynomial
- Open Access
- 14 February 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-20
Hyperchaotic hashing: a chaotic hash function based on 2D linear cross-coupled map with parallel feedback structure
Chaotic systems have been widely employed in constructing hash functions because of their nonlinear characteristics. Nonetheless, some chaotic hash functions are intricately designed, significantly increasing their computational overhead, and some can only generate a single hash value of fixed length, thus lacking flexibility. To overcome the above problems, a novel hash function based on a 2D linear cross-coupled hyperchaotic map (HF-2DLCHM) is introduced and has a parallel feedback structure. Compared to the typical 1D chaotic maps, 2DLCHM has superior dynamic complexity, allowing HF-2DLCHM to resist phase space reconstruction attacks. A parallelizable structure is introduced, enhancing computational efficiency through concurrent processing of operational units. Simultaneously, the feedback mechanism is incorporated to augment the diffusion effect, ensuring better mixing and distribution of information. Moreover, by controlling the size of the input parameter T, the scheme can generate a hash value of \(32 \times T\) bits. The experimental results illustrate that this scheme exhibits distribution, confusion, diffusion and collision resistance characteristics approaching their nearly ideal benchmarks while maintaining an acceptable speed. Therefore, this scheme holds substantial practical potential in the domain of data security and privacy protection.- 14 February 2025
- Published by Springer Nature in Scientific Reports
- Vol. 15 (1) , 1-20
Open AccessHyperchaotic hashing: a chaotic hash function based on 2D linear cross-coupled map with parallel feedback structure
Chaotic systems have been widely employed in constructing hash functions because of their nonlinear characteristics. Nonetheless, some chaotic hash functions are intricately designed, significantly increasing their computational overhead, and some can only generate a single hash value of fixed length, thus lacking flexibility. To overcome the above problems, a novel hash function based on a 2D linear cross-coupled hyperchaotic map (HF-2DLCHM) is introduced and has a parallel feedback structure. Compared to the typical 1D chaotic maps, 2DLCHM has superior dynamic complexity, allowing HF-2DLCHM to resist phase space reconstruction attacks. A parallelizable structure is introduced, enhancing computational efficiency through concurrent processing of operational units. Simultaneously, the feedback mechanism is incorporated to augment the diffusion effect, ensuring better mixing and distribution of information. Moreover, by controlling the size of the input parameter T, the scheme can generate a hash value of \(32 \times T\) bits. The experimental results illustrate that this scheme exhibits distribution, confusion, diffusion and collision resistance characteristics approaching their nearly ideal benchmarks while maintaining an acceptable speed. Therefore, this scheme holds substantial practical potential in the domain of data security and privacy protection. - 30 January 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1809-1836
A public key encryption algorithm based on multi-dimensional general Chebyshev polynomial
- 30 January 2025
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 93 (6) , 1809-1836
A public key encryption algorithm based on multi-dimensional general Chebyshev polynomial
- 2 January 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (4) , 1-12
Parameters security strategy formulated by hyperchaos in federal learning
- 2 January 2025
- Published by Springer Nature in Applied Intelligence
- Vol. 55 (4) , 1-12
Parameters security strategy formulated by hyperchaos in federal learning
- Open Access
A High-Performance FPGA PRNG Based on Multiple Deep-Dynamic Transformations
Pseudo-random number generators (PRNGs) are important cornerstones of many fields, such as statistical analysis and cryptography, and the need for PRNGs for information security (in fields such as blockchain, big data, and artificial intelligence) is becoming increasingly prominent, resulting in a steadily growing demand for high-speed, high-quality random number generators. To meet this demand, the multiple deep-dynamic transformation (MDDT) algorithm is innovatively developed. This algorithm is incorporated into the skewed tent map, endowing it with more complex dynamical properties. The improved one-dimensional discrete chaotic mapping method is effectively realized on a field-programmable gate array (FPGA), specifically the Xilinx xc7k325tffg900-2 model. The proposed pseudo-random number generator (PRNG) successfully passes all evaluations of the National Institute of Standards and Technology (NIST) SP800-22, diehard, and TestU01 test suites. Additional experimental results show that the PRNG, possessing high novelty performance, operates efficiently at a clock frequency of 150 MHz, achieving a maximum throughput of 14.4 Gbps. This performance not only surpasses that of most related studies but also makes it exceptionally suitable for embedded applications.
Open AccessA High-Performance FPGA PRNG Based on Multiple Deep-Dynamic Transformations
Pseudo-random number generators (PRNGs) are important cornerstones of many fields, such as statistical analysis and cryptography, and the need for PRNGs for information security (in fields such as blockchain, big data, and artificial intelligence) is becoming increasingly prominent, resulting in a steadily growing demand for high-speed, high-quality random number generators. To meet this demand, the multiple deep-dynamic transformation (MDDT) algorithm is innovatively developed. This algorithm is incorporated into the skewed tent map, endowing it with more complex dynamical properties. The improved one-dimensional discrete chaotic mapping method is effectively realized on a field-programmable gate array (FPGA), specifically the Xilinx xc7k325tffg900-2 model. The proposed pseudo-random number generator (PRNG) successfully passes all evaluations of the National Institute of Standards and Technology (NIST) SP800-22, diehard, and TestU01 test suites. Additional experimental results show that the PRNG, possessing high novelty performance, operates efficiently at a clock frequency of 150 MHz, achieving a maximum throughput of 14.4 Gbps. This performance not only surpasses that of most related studies but also makes it exceptionally suitable for embedded applications.
- Open Access
- 2 August 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (15) , 2846
Fire-Net: Rapid Recognition of Forest Fires in UAV Remote Sensing Imagery Using Embedded Devices
Forest fires pose a catastrophic threat to Earth’s ecology as well as threaten human beings. Timely and accurate monitoring of forest fires can significantly reduce potential casualties and property damage. Thus, to address the aforementioned problems, this paper proposed an unmanned aerial vehicle (UAV) based on a lightweight forest fire recognition model, Fire-Net, which has a multi-stage structure and incorporates cross-channel attention following the fifth stage. This is to enable the model’s ability to perceive features at various scales, particularly small-scale fire sources in wild forest scenes. Through training and testing on a real-world dataset, various lightweight convolutional neural networks were evaluated on embedded devices. The experimental outcomes indicate that Fire-Net attained an accuracy of 98.18%, a precision of 99.14%, and a recall of 98.01%, surpassing the current leading methods. Furthermore, the model showcases an average inference time of 10 milliseconds per image and operates at 86 frames per second (FPS) on embedded devices.
- 2 August 2024
- Published by MDPI AG in Remote Sensing
- Vol. 16 (15) , 2846
Open AccessFire-Net: Rapid Recognition of Forest Fires in UAV Remote Sensing Imagery Using Embedded Devices
Forest fires pose a catastrophic threat to Earth’s ecology as well as threaten human beings. Timely and accurate monitoring of forest fires can significantly reduce potential casualties and property damage. Thus, to address the aforementioned problems, this paper proposed an unmanned aerial vehicle (UAV) based on a lightweight forest fire recognition model, Fire-Net, which has a multi-stage structure and incorporates cross-channel attention following the fifth stage. This is to enable the model’s ability to perceive features at various scales, particularly small-scale fire sources in wild forest scenes. Through training and testing on a real-world dataset, various lightweight convolutional neural networks were evaluated on embedded devices. The experimental outcomes indicate that Fire-Net attained an accuracy of 98.18%, a precision of 99.14%, and a recall of 98.01%, surpassing the current leading methods. Furthermore, the model showcases an average inference time of 10 milliseconds per image and operates at 86 frames per second (FPS) on embedded devices.