Wenjun Song
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Wenjun Song has a total of 15 co-authors. Here are the top co-authors by number of shared publications:
- Qiuwen Zhang
College of Computer Science and Technology, Zhengzhou University of Light Industry, Zhengzhou, China
3 shared publications - Chengye Zou
School of Information Science and Engineering, Yanshan University, Qinhuangdao 066004, China
2 shared publications - Xuncai Zhang
School of Electrical and Information Engineering, Zhengzhou University of Light Industry, Zhengzhou, China
2 shared publications - Congxian Li
College of Electrical and Information Engineering, Henan University of Engineering, Zhengzhou, China
1 shared publication - Guanxin Li
College of Computer and Communication Engineering, Zhengzhou University of Light Industry, Zhengzhou 450002, China
1 shared publication - Hao Shen
School of Computer Science and Artificial Intelligence, Zhengzhou University of Light Industry, Zhengzhou 450002, China
1 shared publication
Latest Publications
- Open Access
Topology-Evolving Image Encryption Algorithm Utilizing 2D Rosenbrock–Schwefel Hyperchaotic Map
Traditional image encryption methods based on static permutation and diffusion are vulnerable to structural cryptanalysis and often exhibit limited robustness under imperfect communication conditions. To address these issues, this paper proposes a robust topology-evolving image encryption algorithm driven by complex hyperchaotic dynamics for secure visual data transmission. First, a two-dimensional Rosenbrock–Schwefel hyperchaotic map is constructed to generate high-quality pseudorandom sequences for both permutation and diffusion. Based on this map, a bidirectional oscillatory spatial permutation mechanism governed by a dynamic linked-list topology is developed. Unlike fixed-path permutation strategies, the proposed topology continuously evolves with the system state during image traversal, thereby increasing nonlinear path complexity and improving resistance to structural attacks. Furthermore, a plaintext-dependent adaptive diffusion mechanism is designed to enhance sensitivity to plaintext variations and produce a strong global avalanche effect. Experimental results demonstrate that the proposed algorithm achieves favorable encryption performance, with an information entropy of up to 7.9994, a Number of Pixels Change Rate (NPCR) of 99.6076%, and a Unified Average Changing Intensity (UACI) of 33.4683%. In addition, the algorithm maintains good recovery performance under cropping attacks and noise interference, indicating its robustness and applicability for secure image transmission in complex communication environments.
Open AccessTopology-Evolving Image Encryption Algorithm Utilizing 2D Rosenbrock–Schwefel Hyperchaotic Map
Traditional image encryption methods based on static permutation and diffusion are vulnerable to structural cryptanalysis and often exhibit limited robustness under imperfect communication conditions. To address these issues, this paper proposes a robust topology-evolving image encryption algorithm driven by complex hyperchaotic dynamics for secure visual data transmission. First, a two-dimensional Rosenbrock–Schwefel hyperchaotic map is constructed to generate high-quality pseudorandom sequences for both permutation and diffusion. Based on this map, a bidirectional oscillatory spatial permutation mechanism governed by a dynamic linked-list topology is developed. Unlike fixed-path permutation strategies, the proposed topology continuously evolves with the system state during image traversal, thereby increasing nonlinear path complexity and improving resistance to structural attacks. Furthermore, a plaintext-dependent adaptive diffusion mechanism is designed to enhance sensitivity to plaintext variations and produce a strong global avalanche effect. Experimental results demonstrate that the proposed algorithm achieves favorable encryption performance, with an information entropy of up to 7.9994, a Number of Pixels Change Rate (NPCR) of 99.6076%, and a Unified Average Changing Intensity (UACI) of 33.4683%. In addition, the algorithm maintains good recovery performance under cropping attacks and noise interference, indicating its robustness and applicability for secure image transmission in complex communication environments.
- Open Access
- 25 March 2025
- Published by MDPI AG in Electronics
- Vol. 14 (7) , 1295
Fast Coding Unit Partitioning Method for Video-Based Point Cloud Compression: Combining Convolutional Neural Networks and Bayesian Optimization
As 5G technology and 3D capture techniques have been rapidly developing, there has been a remarkable increase in the demand for effectively compressing dynamic 3D point cloud data. Video-based point cloud compression (V-PCC), which is an innovative method for 3D point cloud compression, makes use of High-Efficiency Video Coding (HEVC) to carry out the compression of 3D point clouds. This is accomplished through the projection of the point clouds onto two-dimensional video frames. However, V-PCC faces significant coding complexity, particularly for dynamic 3D point clouds, which can be up to four times more complex to process than a conventional video. To address this challenge, we propose an adaptive coding unit (CU) partitioning method that integrates occupancy graphs, convolutional neural networks (CNNs), and Bayesian optimization. In this approach, the coding units (CUs) are first divided into dense regions, sparse regions, and complex composite regions by calculating the occupancy rate R of the CUs, and then an initial classification decision is made using a convolutional neural network (CNN) framework. For regions where the CNN outputs low-confidence classifications, Bayesian optimization is employed to refine the partitioning and enhance accuracy. The findings from the experiments show that the suggested method can efficiently decrease the coding complexity of V-PCC, all the while maintaining a high level of coding quality. Specifically, the average coding time of the geometric graph is reduced by 57.37%, the attribute graph by 54.43%, and the overall coding time by 54.75%. Although the BD rate slightly increases compared with that of the baseline V-PCC method, the impact on video quality is negligible. Additionally, the proposed algorithm outperforms existing methods in terms of geometric compression efficiency and computational time savings. This study’s innovation lies in combining deep learning with Bayesian optimization to deliver an efficient CU partitioning strategy for V-PCC, improving coding speed and reducing computational resource consumption, thereby advancing the practical application of V-PCC.
- 25 March 2025
- Published by MDPI AG in Electronics
- Vol. 14 (7) , 1295
Open AccessFast Coding Unit Partitioning Method for Video-Based Point Cloud Compression: Combining Convolutional Neural Networks and Bayesian Optimization
As 5G technology and 3D capture techniques have been rapidly developing, there has been a remarkable increase in the demand for effectively compressing dynamic 3D point cloud data. Video-based point cloud compression (V-PCC), which is an innovative method for 3D point cloud compression, makes use of High-Efficiency Video Coding (HEVC) to carry out the compression of 3D point clouds. This is accomplished through the projection of the point clouds onto two-dimensional video frames. However, V-PCC faces significant coding complexity, particularly for dynamic 3D point clouds, which can be up to four times more complex to process than a conventional video. To address this challenge, we propose an adaptive coding unit (CU) partitioning method that integrates occupancy graphs, convolutional neural networks (CNNs), and Bayesian optimization. In this approach, the coding units (CUs) are first divided into dense regions, sparse regions, and complex composite regions by calculating the occupancy rate R of the CUs, and then an initial classification decision is made using a convolutional neural network (CNN) framework. For regions where the CNN outputs low-confidence classifications, Bayesian optimization is employed to refine the partitioning and enhance accuracy. The findings from the experiments show that the suggested method can efficiently decrease the coding complexity of V-PCC, all the while maintaining a high level of coding quality. Specifically, the average coding time of the geometric graph is reduced by 57.37%, the attribute graph by 54.43%, and the overall coding time by 54.75%. Although the BD rate slightly increases compared with that of the baseline V-PCC method, the impact on video quality is negligible. Additionally, the proposed algorithm outperforms existing methods in terms of geometric compression efficiency and computational time savings. This study’s innovation lies in combining deep learning with Bayesian optimization to deliver an efficient CU partitioning strategy for V-PCC, improving coding speed and reducing computational resource consumption, thereby advancing the practical application of V-PCC.
- Open Access
Image Encryption Method Based on Three-Dimensional Chaotic Systems and V-Shaped Scrambling
With the increasing importance of securing images during network transmission, this paper introduces a novel image encryption algorithm that integrates a 3D chaotic system with V-shaped scrambling techniques. The proposed method begins by constructing a unique 3D chaotic system to generate chaotic sequences for encryption. These sequences determine a random starting point for V-shaped scrambling, which facilitates the transformation of image pixels into quaternary numbers. Subsequently, four innovative bit-level scrambling strategies are employed to enhance encryption strength. To further improve randomness, DNA encoding is applied to both the image and chaotic sequences, with chaotic sequences directing crossover and DNA operations. Ciphertext feedback is then utilized to propagate changes across the image, ensuring increased complexity and security. Extensive simulation experiments validate the algorithm’s robust encryption performance for grayscale images, yielding uniformly distributed histograms, near-zero correlation values, and an information entropy value of 7.9975, approaching the ideal threshold. The algorithm also features a large key space, providing robust protection against brute force attacks while effectively resisting statistical, differential, noise, and cropping attacks. These results affirm the algorithm’s reliability and security for image communication and transmission.
Open AccessImage Encryption Method Based on Three-Dimensional Chaotic Systems and V-Shaped Scrambling
With the increasing importance of securing images during network transmission, this paper introduces a novel image encryption algorithm that integrates a 3D chaotic system with V-shaped scrambling techniques. The proposed method begins by constructing a unique 3D chaotic system to generate chaotic sequences for encryption. These sequences determine a random starting point for V-shaped scrambling, which facilitates the transformation of image pixels into quaternary numbers. Subsequently, four innovative bit-level scrambling strategies are employed to enhance encryption strength. To further improve randomness, DNA encoding is applied to both the image and chaotic sequences, with chaotic sequences directing crossover and DNA operations. Ciphertext feedback is then utilized to propagate changes across the image, ensuring increased complexity and security. Extensive simulation experiments validate the algorithm’s robust encryption performance for grayscale images, yielding uniformly distributed histograms, near-zero correlation values, and an information entropy value of 7.9975, approaching the ideal threshold. The algorithm also features a large key space, providing robust protection against brute force attacks while effectively resisting statistical, differential, noise, and cropping attacks. These results affirm the algorithm’s reliability and security for image communication and transmission.
- 13 January 2025
- Published by Springer Nature in The Visual Computer
- Vol. 41 (8) , 6087-6102
Deep residual PLSR model with manifold optimization and Gaussian filter for enhanced image classification
- 13 January 2025
- Published by Springer Nature in The Visual Computer
- Vol. 41 (8) , 6087-6102
Deep residual PLSR model with manifold optimization and Gaussian filter for enhanced image classification
- Open Access
- 31 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (17) , 3465
Rapid CU Partitioning and Joint Intra-Frame Mode Decision Algorithm
H.266/Versatile Video Coding (VVC) introduces new techniques that build upon previous standards, proposing a nested multi-type tree quadtree (QTMT). The introduction of this structure significantly enhances video coding efficiency; additionally, the number of directional modes in H.266 has increased by 32 compared to H.265, accommodating a greater variety of texture patterns. However, the changes in the related structures have also led to a significant increase in encoding complexity. To address the issue of excessive computational complexity, this paper proposes a targeted rapid Coding Units segmenting approach combined with decision-making for an intra-frame modes algorithm. In the first phase of the algorithm, we extract different features for CU blocks of various sizes and input them into the decision tree model’s classifier for classification processing, determining the CU partitioning mode to prematurely terminate the partitioning, thereby reducing the encoding complexity to some extent. In the second phase of the algorithm, we put forward an intra-frame mode decision strategy grounded in gradient descent techniques with a bidirectional search mode. This maximizes the approach to the global optimum, thereby obtaining the optimal intra-frame mode and further reducing the encoding complexity. Experimentation has demonstrated that the algorithm achieves a 54.53% reduction in encoding time. In comparison, the BD-BR (Bitrate-Distortion Rate) only increases by 1.38%, striking an optimal balance between the fidelity of video and the efficacy of the encoding process.
- 31 August 2024
- Published by MDPI AG in Electronics
- Vol. 13 (17) , 3465
Open AccessRapid CU Partitioning and Joint Intra-Frame Mode Decision Algorithm
H.266/Versatile Video Coding (VVC) introduces new techniques that build upon previous standards, proposing a nested multi-type tree quadtree (QTMT). The introduction of this structure significantly enhances video coding efficiency; additionally, the number of directional modes in H.266 has increased by 32 compared to H.265, accommodating a greater variety of texture patterns. However, the changes in the related structures have also led to a significant increase in encoding complexity. To address the issue of excessive computational complexity, this paper proposes a targeted rapid Coding Units segmenting approach combined with decision-making for an intra-frame modes algorithm. In the first phase of the algorithm, we extract different features for CU blocks of various sizes and input them into the decision tree model’s classifier for classification processing, determining the CU partitioning mode to prematurely terminate the partitioning, thereby reducing the encoding complexity to some extent. In the second phase of the algorithm, we put forward an intra-frame mode decision strategy grounded in gradient descent techniques with a bidirectional search mode. This maximizes the approach to the global optimum, thereby obtaining the optimal intra-frame mode and further reducing the encoding complexity. Experimentation has demonstrated that the algorithm achieves a 54.53% reduction in encoding time. In comparison, the BD-BR (Bitrate-Distortion Rate) only increases by 1.38%, striking an optimal balance between the fidelity of video and the efficacy of the encoding process.
- Open Access
- 17 July 2023
- Published by MDPI AG in Electronics
- Vol. 12 (14) , 3098
Fast Algorithm for CU Size Decision Based on Ensemble Clustering for Intra Coding of VVC 3D Video Depth Map
As many new coding techniques and coding structures have been introduced to further improve the coding efficiency of depth maps in 3D video extensions, the coding complexity has been greatly increased. Fast algorithms are now needed to improve coding unit (CU) depth decisions as well as the coding pattern decision based on the coding. This paper presents an innovative machine learning-based approach aimed at mitigating the complexity associated with in-frame coding algorithms. We build different clustering models for different CU sizes to cluster CUs of the same size to decide their CU sizes. This is achieved by augmenting ensemble clustering through the expedited propagation of clustering similarities, considering CU with the same or similar texture complexity the same as for CU depth selection, which is informed by a comprehensive analysis of the original texture and its neighboring elements. The experimental findings demonstrate that the proposed scheme yields a substantial average reduction of 44.24% in the coding time. Remarkably, the corresponding Bjøntegaard delta bit rate (BDBR) increment observed for the synthetic view is a mere 0.26%.
- 17 July 2023
- Published by MDPI AG in Electronics
- Vol. 12 (14) , 3098
Open AccessFast Algorithm for CU Size Decision Based on Ensemble Clustering for Intra Coding of VVC 3D Video Depth Map
As many new coding techniques and coding structures have been introduced to further improve the coding efficiency of depth maps in 3D video extensions, the coding complexity has been greatly increased. Fast algorithms are now needed to improve coding unit (CU) depth decisions as well as the coding pattern decision based on the coding. This paper presents an innovative machine learning-based approach aimed at mitigating the complexity associated with in-frame coding algorithms. We build different clustering models for different CU sizes to cluster CUs of the same size to decide their CU sizes. This is achieved by augmenting ensemble clustering through the expedited propagation of clustering similarities, considering CU with the same or similar texture complexity the same as for CU depth selection, which is informed by a comprehensive analysis of the original texture and its neighboring elements. The experimental findings demonstrate that the proposed scheme yields a substantial average reduction of 44.24% in the coding time. Remarkably, the corresponding Bjøntegaard delta bit rate (BDBR) increment observed for the synthetic view is a mere 0.26%.