Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, concepti...Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted, the final path was found. The valid path and invalid path were defined to ensure the path valid. Finally, the strategies of the pheromone search were applied to search the optimum path. However, when only the pheromone was used to search the optimum path, ACO converges easily. In order to avoid this premature convergence, combining pheromone search and random search, a hybrid ant colony algorithm(HACO) was used to find the optimum path. The comparison between ACO and HACO shows that HACO can be used to find the shortest path.展开更多
The performances of repaired image depend on the local information in the repaired area and the consistency between the repair directions with structural content.Image repair algorithm with texture information perform...The performances of repaired image depend on the local information in the repaired area and the consistency between the repair directions with structural content.Image repair algorithm with texture information performs well in repairing seriously damaged images,but it has bad performances when the images have the abundant structure information.The dual optimization image repair algorithm based on the linear structure and the optimal texture is proposed.The algorithm uses the double-constraint sparse model to reconstruct the missed information in large area in order to improve the clarity of repaired images.After adopting the preference of Criminisi priority,the image repair algorithm of self-similarity characteristics is proposed to improve the fault and fuzzy distortion phenomena in the repaired image.The results show that the proposed algorithm has more clarity in the image texture and structure and better effectiveness,and the peak signal-to-noise ratio of the repaired images by proposed algorithm is superior to that by other algorithms.展开更多
基金Projects(60234030, 60404021) supported by the National Natural Science Foundation of China
文摘Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted, the final path was found. The valid path and invalid path were defined to ensure the path valid. Finally, the strategies of the pheromone search were applied to search the optimum path. However, when only the pheromone was used to search the optimum path, ACO converges easily. In order to avoid this premature convergence, combining pheromone search and random search, a hybrid ant colony algorithm(HACO) was used to find the optimum path. The comparison between ACO and HACO shows that HACO can be used to find the shortest path.
基金Project(12GJ6055)supported by the Natural Science Foundation of Hunan Province,ChinaProject(2010FJ4107)supported by Hunan Provincial Science and Technology Department,China
文摘The performances of repaired image depend on the local information in the repaired area and the consistency between the repair directions with structural content.Image repair algorithm with texture information performs well in repairing seriously damaged images,but it has bad performances when the images have the abundant structure information.The dual optimization image repair algorithm based on the linear structure and the optimal texture is proposed.The algorithm uses the double-constraint sparse model to reconstruct the missed information in large area in order to improve the clarity of repaired images.After adopting the preference of Criminisi priority,the image repair algorithm of self-similarity characteristics is proposed to improve the fault and fuzzy distortion phenomena in the repaired image.The results show that the proposed algorithm has more clarity in the image texture and structure and better effectiveness,and the peak signal-to-noise ratio of the repaired images by proposed algorithm is superior to that by other algorithms.
