Xiao Feng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xiao Feng has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Yongbin Yu
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China
13 shared publications - Xiangxiang Wang
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu 610054, China
12 shared publications - Jiarun Shen
University of Electronic Science and Technology of China
10 shared publications - Pinaki Mazumder
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, USA
10 shared publications - Nyima Tashi
School of Information Science and Technology, Xizang University, Lhasa 850000, China
8 shared publications - Favour Ekong
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, People’s Republic of China
2 shared publications
Latest Publications
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Systems Engineering and Electronics
- Vol. 36 (4) , 892-902
Bayesian-Based Ant Colony Optimization Algorithm for Edge Detection
Ant colony optimization (ACO) is a random search algorithm based on probability calculation. However, the uninformed search strategy has a slow convergence speed. The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process, reducing the uncertainty in the random search process. Due to the ability of the Bayesian algorithm to reduce uncertainty, a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection. In addition, this paper has the following two innovations on the basis of the classical algorithm, one of which is to add random perturbations after completing the pheromone update. The second is the use of adaptive pheromone heuristics. Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm, due to the improvement of the pheromone utilization rate. Moreover, Bayesian ACO algorithm outperforms the other comparative methods in edge detection task.
- 1 August 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Journal of Systems Engineering and Electronics
- Vol. 36 (4) , 892-902
Bayesian-Based Ant Colony Optimization Algorithm for Edge Detection
Ant colony optimization (ACO) is a random search algorithm based on probability calculation. However, the uninformed search strategy has a slow convergence speed. The Bayesian algorithm uses the historical information of the searched point to determine the next search point during the search process, reducing the uncertainty in the random search process. Due to the ability of the Bayesian algorithm to reduce uncertainty, a Bayesian ACO algorithm is proposed in this paper to increase the convergence speed of the conventional ACO algorithm for image edge detection. In addition, this paper has the following two innovations on the basis of the classical algorithm, one of which is to add random perturbations after completing the pheromone update. The second is the use of adaptive pheromone heuristics. Experimental results illustrate that the proposed Bayesian ACO algorithm has faster convergence and higher precision and recall than the traditional ant colony algorithm, due to the improvement of the pheromone utilization rate. Moreover, Bayesian ACO algorithm outperforms the other comparative methods in edge detection task.
- Open Access
- 15 July 2025
- Published by Elsevier in Materials & Design
- Vol. 256
A competitive coevolution-based evolutionary algorithm for the parallel inverse design of multiple soft network materials
- 15 July 2025
- Published by Elsevier in Materials & Design
- Vol. 256
Open AccessA competitive coevolution-based evolutionary algorithm for the parallel inverse design of multiple soft network materials
- 27 April 2025
- Published by Springer Nature
- p. 1-32
Memristor and Its Emulator
- 27 April 2025
- Published by Springer Nature
- p. 33-68
Chaotic Circuits Based on Memristor
- 27 April 2025
- Published by Springer Nature
- p. 237-326
Dynamic Analysis of Memristive Neural Network
- 27 April 2025
- Published by Springer Nature
- p. 131-156
Memristive Filter for Signal Processing
- 27 April 2025
- Published by Springer Nature
- p. 69-89
Memristor-Based En/Decryption System
- 27 April 2025
- Published by Springer Nature
- p. 327-376
Memristor-Based Neural Network and Its Application
- 27 April 2025
- Published by Springer Nature
- p. 327-376
Memristor-Based Neural Network and Its Application
- 27 April 2025
- Published by Springer Nature
- p. 91-130
Filter Design Based on Memristive Family
- 27 April 2025
- Published by Springer Nature
- p. 157-235
Memristor Network-Based Swarm Intelligence