Wenjie Yu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Wenjie Yu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
Xunbo Li
School of Mechanical and Electrical Engineering, University Of Electronic Science And Technology Of China, Chengdu, China
5 shared publications- Zhi Zeng
University of Electronic Science and Technology of China
3 shared publications Xiang Li
School of Mechanical and Electrical Engineering, University Of Electronic Science And Technology Of China, Chengdu, China
2 shared publicationsZhi Zeng
School of Mechanical and Electrical Engineering, University Of Electronic Science And Technology Of China, Chengdu, China
2 shared publicationsBei Peng
School of Mechatronics Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan 611731 China
1 shared publicationBo Huang
1 shared publication
Latest Publications
- Open Access
- 22 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 90-95
Pedestrian Detection Algorithm of YOLOV8 Based on Feature Enhancement
In an effort to overcome the problem of insufficient network ability of YOLOV8 backbone feature extraction and poor feature fusion ability, a C2f module based on attention mechanism is introduced to carry to a new and higher level the model’s ability to express input features. Aiming at the feature fusion in improved YOLOV8, this paper first modifies the structure of FPN in order to effectively integrate the feature information extracted by backbone, so as to enhance the feature fusion ability of the model. In addition, this paper designs a new feature fusion structure to replace the existing PAN structure, make the feature map information input by FPN more reasonably utilized, so as to improve the overall detection accuracy of the model. The experimental results show that the improved YOLOV8 algorithm performs well on the CUHK dataset [email protected] Improved by 1.7%, and the detection speed remained basically unchanged, with excellent performance on WiderPerson, [email protected] Reaching 91.3%, it can quickly and accurately achieve pedestrian detection. In addition, this paper conducts relevant ablation experiments and comparative experiments to validate the effectiveness of each proposed improvement.
- 22 March 2024
- Published by Association for Computing Machinery (ACM)
- p. 90-95
Open AccessPedestrian Detection Algorithm of YOLOV8 Based on Feature Enhancement
In an effort to overcome the problem of insufficient network ability of YOLOV8 backbone feature extraction and poor feature fusion ability, a C2f module based on attention mechanism is introduced to carry to a new and higher level the model’s ability to express input features. Aiming at the feature fusion in improved YOLOV8, this paper first modifies the structure of FPN in order to effectively integrate the feature information extracted by backbone, so as to enhance the feature fusion ability of the model. In addition, this paper designs a new feature fusion structure to replace the existing PAN structure, make the feature map information input by FPN more reasonably utilized, so as to improve the overall detection accuracy of the model. The experimental results show that the improved YOLOV8 algorithm performs well on the CUHK dataset [email protected] Improved by 1.7%, and the detection speed remained basically unchanged, with excellent performance on WiderPerson, [email protected] Reaching 91.3%, it can quickly and accurately achieve pedestrian detection. In addition, this paper conducts relevant ablation experiments and comparative experiments to validate the effectiveness of each proposed improvement.
- Top Cited PapersOpen Access
Particle Swarm Algorithm Path-Planning Method for Mobile Robots Based on Artificial Potential Fields
Path planning is an important part of the navigation control system of mobile robots since it plays a decisive role in whether mobile robots can realize autonomy and intelligence. The particle swarm algorithm can effectively solve the path-planning problem of a mobile robot, but the traditional particle swarm algorithm has the problems of a too-long path, poor global search ability, and local development ability. Moreover, the existence of obstacles makes the actual environment more complex, thus putting forward more stringent requirements on the environmental adaptation ability, path-planning accuracy, and path-planning efficiency of mobile robots. In this study, an artificial potential field-based particle swarm algorithm (apfrPSO) was proposed. First, the method generates robot planning paths by adjusting the inertia weight parameter and ranking the position vector of particles (rPSO), and second, the artificial potential field method is introduced. Through comparative numerical experiments with other state-of-the-art algorithms, the results show that the algorithm proposed was very competitive.
Top Cited PapersOpen AccessParticle Swarm Algorithm Path-Planning Method for Mobile Robots Based on Artificial Potential Fields
Path planning is an important part of the navigation control system of mobile robots since it plays a decisive role in whether mobile robots can realize autonomy and intelligence. The particle swarm algorithm can effectively solve the path-planning problem of a mobile robot, but the traditional particle swarm algorithm has the problems of a too-long path, poor global search ability, and local development ability. Moreover, the existence of obstacles makes the actual environment more complex, thus putting forward more stringent requirements on the environmental adaptation ability, path-planning accuracy, and path-planning efficiency of mobile robots. In this study, an artificial potential field-based particle swarm algorithm (apfrPSO) was proposed. First, the method generates robot planning paths by adjusting the inertia weight parameter and ranking the position vector of particles (rPSO), and second, the artificial potential field method is introduced. Through comparative numerical experiments with other state-of-the-art algorithms, the results show that the algorithm proposed was very competitive.
- Open Access
Problem Characteristics and Dynamic Search Balance-Based Artificial Bee Colony for the Optimization of Two-Tiered WSN Lifetime with Relay Nodes Deployment
Lifetime optimization is one of the key issues among the many challenges of wireless sensor networks. The introduction of a small number of high-performance relay nodes can effectively improve the quality of the network services. However, how to deploy these nodes reasonably to fully enhance the network lifetime becomes a very difficult problem. In this study, a modified and enhanced Artificial Bee Colony is proposed to maximize the lifetime of a two-tiered wireless sensor network by optimal deployment of relay nodes. First, the dimension of the problem is introduced into the candidate search equation and the local search is adjusted according to the fitness of the problem and number of iterations, which helps to balance the exploration and exploitation ability of the algorithm. Second, in order to prevent the algorithm from falling into local convergence, a dynamic search balance strategy is proposed instead of the scout bee phase in the original Artificial Bee Colony. Then, a feasible solution formation method is proposed to ensure that the relay nodes can form the upper-layer backbone of the network. Finally, we employ this algorithm on a test dataset obtained from the literature. The simulation results show that the proposed algorithm for two-tiered wireless sensor network lifetime optimization can obtain higher and stable average network lifetime and more reasonable relay node deployment compared to other classical and state-of-the-art algorithms, verifying the competitive performance of the proposed algorithm.
Open AccessProblem Characteristics and Dynamic Search Balance-Based Artificial Bee Colony for the Optimization of Two-Tiered WSN Lifetime with Relay Nodes Deployment
Lifetime optimization is one of the key issues among the many challenges of wireless sensor networks. The introduction of a small number of high-performance relay nodes can effectively improve the quality of the network services. However, how to deploy these nodes reasonably to fully enhance the network lifetime becomes a very difficult problem. In this study, a modified and enhanced Artificial Bee Colony is proposed to maximize the lifetime of a two-tiered wireless sensor network by optimal deployment of relay nodes. First, the dimension of the problem is introduced into the candidate search equation and the local search is adjusted according to the fitness of the problem and number of iterations, which helps to balance the exploration and exploitation ability of the algorithm. Second, in order to prevent the algorithm from falling into local convergence, a dynamic search balance strategy is proposed instead of the scout bee phase in the original Artificial Bee Colony. Then, a feasible solution formation method is proposed to ensure that the relay nodes can form the upper-layer backbone of the network. Finally, we employ this algorithm on a test dataset obtained from the literature. The simulation results show that the proposed algorithm for two-tiered wireless sensor network lifetime optimization can obtain higher and stable average network lifetime and more reasonable relay node deployment compared to other classical and state-of-the-art algorithms, verifying the competitive performance of the proposed algorithm.
- 1 February 2021
- Published by Springer Nature in Computing
- Vol. 103 (7) , 1439-1460
Sensor network sensing coverage optimization with improved artificial bee colony algorithm using teaching strategy
- 1 February 2021
- Published by Springer Nature in Computing
- Vol. 103 (7) , 1439-1460
Sensor network sensing coverage optimization with improved artificial bee colony algorithm using teaching strategy
- Open Access
- 15 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 35182-35193
Multi-Objective Optimum Design of High-Speed Backplane Connector Using Particle Swarm Optimization
This research was supported by the Science and Technology Planning Project of Sichuan Province (Grant No. 2018GZ0284) and the National Natural Science Foundation of China (Grant No. 51205047). The authors would also like to acknowledge the anonymous reviewers for their valuable comments and suggestions that helped to improve the quality of the paper. This paper outlines a new procedure for computer modeling and optimum design for the dynamic mechanical and electrical study of a high-speed backplane connector, which is a key electrical interconnection technology in large communications equipment, ultra-high performance servers, supercomputers, industrial computers and high-end storage devices, etc. The optimum structure design of contact pairs is important for a backplane connector in meeting multiple challenges in terms of minimizing the maximum insertion force and the contact resistance. Current optimization schemes, such as the quadrature method, are relatively complex. Therefore, we designed the connector contact pairs for simultaneously obtaining the proper insertion force and the contact resistance through a multi-objective particle swarm optimization method of simpler settings and faster convergence speed. In this analysis, the required insertion force was minimized during the entire process, and the minimum contact resistance was maintained after insertion. To this end, a multi-objective particle-swarm optimization algorithm (MCDPSO) was proposed for the connector-design. A dynamic weight coefficient was developed to calculate the interval values of the reserved solutions for the selection of the operator, and an external archive update based on roulette wheel selection and gbest selection strategies was developed to increase the diversity of the solutions. A set of optimal structure solutions of the contact pairs was obtained for the subsequent design optimization. The feasibility and effectiveness of the proposed method was verified by comparing with the results from ANSYS finite element simulation.
- 15 June 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 6, 35182-35193
Open AccessMulti-Objective Optimum Design of High-Speed Backplane Connector Using Particle Swarm Optimization
This research was supported by the Science and Technology Planning Project of Sichuan Province (Grant No. 2018GZ0284) and the National Natural Science Foundation of China (Grant No. 51205047). The authors would also like to acknowledge the anonymous reviewers for their valuable comments and suggestions that helped to improve the quality of the paper. This paper outlines a new procedure for computer modeling and optimum design for the dynamic mechanical and electrical study of a high-speed backplane connector, which is a key electrical interconnection technology in large communications equipment, ultra-high performance servers, supercomputers, industrial computers and high-end storage devices, etc. The optimum structure design of contact pairs is important for a backplane connector in meeting multiple challenges in terms of minimizing the maximum insertion force and the contact resistance. Current optimization schemes, such as the quadrature method, are relatively complex. Therefore, we designed the connector contact pairs for simultaneously obtaining the proper insertion force and the contact resistance through a multi-objective particle swarm optimization method of simpler settings and faster convergence speed. In this analysis, the required insertion force was minimized during the entire process, and the minimum contact resistance was maintained after insertion. To this end, a multi-objective particle-swarm optimization algorithm (MCDPSO) was proposed for the connector-design. A dynamic weight coefficient was developed to calculate the interval values of the reserved solutions for the selection of the operator, and an external archive update based on roulette wheel selection and gbest selection strategies was developed to increase the diversity of the solutions. A set of optimal structure solutions of the contact pairs was obtained for the subsequent design optimization. The feasibility and effectiveness of the proposed method was verified by comparing with the results from ANSYS finite element simulation.
- 1 June 2018
- Published by Tech Science Press in Intelligent Automation and Soft Computing
- Vol. 24 (2) , 367-376
A Multi-Objective Metaheuristics Study on Solving Constrained Relay Node Deployment Problem in WSNS
- 1 June 2018
- Published by Tech Science Press in Intelligent Automation and Soft Computing
- Vol. 24 (2) , 367-376
A Multi-Objective Metaheuristics Study on Solving Constrained Relay Node Deployment Problem in WSNS
- Open Access
- 1 June 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E101.D (6) , 1677-1681
On Maximizing the Lifetime of Wireless Sensor Networks in 3D Vegetation-Covered Fields
In this paper, the problem of lifetime extension of wireless sensor networks (WSNs) with redundant sensor nodes deployed in 3D vegetation-covered fields is modeled, which includes building communication models, network model and energy model. Generally, such a problem cannot be solved by a conventional method directly. Here we propose an Artificial Bee Colony (ABC) based optimal grouping algorithm (ABC-OG) to solve it. The main contribution of the algorithm is to find the optimal number of feasible subsets (FSs) of WSN and assign them to work in rotation. It is verified that reasonably grouping sensors into FSs can average the network energy consumption and prolong the lifetime of the network. In order to further verify the effectiveness of ABC-OG, two other algorithms are included for comparison. The experimental results show that the proposed ABC-OG algorithm provides better optimization performance.
- 1 June 2018
- Published by Institute of Electronics, Information and Communications Engineers (IEICE) in IEICE Transactions on Information and Systems
- Vol. E101.D (6) , 1677-1681
Open AccessOn Maximizing the Lifetime of Wireless Sensor Networks in 3D Vegetation-Covered Fields
In this paper, the problem of lifetime extension of wireless sensor networks (WSNs) with redundant sensor nodes deployed in 3D vegetation-covered fields is modeled, which includes building communication models, network model and energy model. Generally, such a problem cannot be solved by a conventional method directly. Here we propose an Artificial Bee Colony (ABC) based optimal grouping algorithm (ABC-OG) to solve it. The main contribution of the algorithm is to find the optimal number of feasible subsets (FSs) of WSN and assign them to work in rotation. It is verified that reasonably grouping sensors into FSs can average the network energy consumption and prolong the lifetime of the network. In order to further verify the effectiveness of ABC-OG, two other algorithms are included for comparison. The experimental results show that the proposed ABC-OG algorithm provides better optimization performance.
- Open Access
- 28 January 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-16
An Improved Artificial Bee Colony Algorithm Based on Factor Library and Dynamic Search Balance
The artificial bee colony (ABC) algorithm is a relatively new optimization technique for simulating the honey bee swarms foraging behavior. Due to its simplicity and effectiveness, it has attracted much attention in recent years. However, ABC search equation is good at global search but poor at local search. Some different search equations are developed to tackle this problem, while there is no particular algorithm to substantially attain the best solution for all optimization problems. Therefore, we proposed an improved ABC with a new search equation, which incorporates the global search factor based on the optimization problem dimension and the local search factor based on the factor library (FL). Furthermore, aimed at preventing the algorithm from falling into local optima, dynamic search balance strategy is proposed and applied to replace the scout bee procedure in ABC. Thus, a hybrid, fast, and enhanced algorithm, HFEABC, is presented. In order to verify its effectiveness, some comprehensive tests among HFEABC and ABC and its variants are conducted on 21 basic benchmark functions and 20 complicated functions from CEC 2017. The experimental results show HFEABC offers better compatibility for different problems than ABC and some of its variants. The HFEABC performance is very competitive.
- 28 January 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-16
Open AccessAn Improved Artificial Bee Colony Algorithm Based on Factor Library and Dynamic Search Balance
The artificial bee colony (ABC) algorithm is a relatively new optimization technique for simulating the honey bee swarms foraging behavior. Due to its simplicity and effectiveness, it has attracted much attention in recent years. However, ABC search equation is good at global search but poor at local search. Some different search equations are developed to tackle this problem, while there is no particular algorithm to substantially attain the best solution for all optimization problems. Therefore, we proposed an improved ABC with a new search equation, which incorporates the global search factor based on the optimization problem dimension and the local search factor based on the factor library (FL). Furthermore, aimed at preventing the algorithm from falling into local optima, dynamic search balance strategy is proposed and applied to replace the scout bee procedure in ABC. Thus, a hybrid, fast, and enhanced algorithm, HFEABC, is presented. In order to verify its effectiveness, some comprehensive tests among HFEABC and ABC and its variants are conducted on 21 basic benchmark functions and 20 complicated functions from CEC 2017. The experimental results show HFEABC offers better compatibility for different problems than ABC and some of its variants. The HFEABC performance is very competitive.