With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evoluti...With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming （CSEP） algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.展开更多
It well known that vehicle detection is an important component of the field of object detection.However,the environment of vehicle detection is particularly sophisticated in practical processes.It is comparatively dif...It well known that vehicle detection is an important component of the field of object detection.However,the environment of vehicle detection is particularly sophisticated in practical processes.It is comparatively difficult to detect vehicles of various scales in traffic scene images,because the vehicles partially obscured by green belts,roadblocks or other vehicles,as well as influence of some low illumination weather.In this paper,we present a model based on Faster ReCNN with NAS optimization and feature enrichment to realize the effective detection of multi-scale vehicle targets in traffic scenes.First,we proposed a Retinex-based image adaptive correction algorithm(RIAC)to enhance the traffic images in the dataset to reduce the influence of shadow and illumination,and improve the image quality.Second,in order to improve the feature expression of the backbone network,we conducted Neural Architecture Search(NAS)on the backbone network used for feature extraction of Faster ReCNN to generate the optimal cross-layer connection to extract multi-layer features more effectively.Third,we used the object Feature Enrichment that combines the multi-layer feature information and the context information of the last layer after cross-layer connection to enrich the information of vehicle targets,and improve the robustness of the model for challenging targets such as small scale and severe occlusion.In the implementation of the model,K-means clustering algorithm was used to select the suitable anchor size for our dataset to improve the convergence speed of the model.Our model has been trained and tested on the UN-DETRAC dataset,and the obtained results indicate that our method has art-of-state detection performance.展开更多
Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering ...Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering method to divide all cities into several categories based on the center of various samples;the large-scale MTSP is divided into multiple separate traveling salesman problems(TSPs),and the TSP is solved through the DSA.The proposed algorithm adopts a solution strategy of clustering first and then carrying out,which can not only greatly reduce the search space of the algorithm but also make the search space more fully explored so that the optimal solution of the problem can be more quickly obtained.The experimental results from solving several test cases in the TSPLIB database show that compared with other related intelligent algorithms,the K-DSA has good solving performance and computational efficiency in MTSPs of different scales,especially with large-scale MTSP and when the convergence speed is faster;thus,the advantages of this algorithm are more obvious compared to other algorithms.展开更多
文摘With an aim to the fact that the K-means clustering algorithm usually ends in local optimization and is hard to harvest global optimization, a new web clustering method is presented based on the chaotic social evolutionary programming （CSEP） algorithm. This method brings up the manner of that a cognitive agent inherits a paradigm in clustering to enable the cognitive agent to acquire a chaotic mutation operator in the betrayal. As proven in the experiment, this method can not only effectively increase web clustering efficiency, but it can also practically improve the precision of web clustering.
基金This research was funded by the National Natural Science Foundation of China(grant number:61671470)the Key Research and Development Program of China(grant number:2016YFC0802900).
文摘It well known that vehicle detection is an important component of the field of object detection.However,the environment of vehicle detection is particularly sophisticated in practical processes.It is comparatively difficult to detect vehicles of various scales in traffic scene images,because the vehicles partially obscured by green belts,roadblocks or other vehicles,as well as influence of some low illumination weather.In this paper,we present a model based on Faster ReCNN with NAS optimization and feature enrichment to realize the effective detection of multi-scale vehicle targets in traffic scenes.First,we proposed a Retinex-based image adaptive correction algorithm(RIAC)to enhance the traffic images in the dataset to reduce the influence of shadow and illumination,and improve the image quality.Second,in order to improve the feature expression of the backbone network,we conducted Neural Architecture Search(NAS)on the backbone network used for feature extraction of Faster ReCNN to generate the optimal cross-layer connection to extract multi-layer features more effectively.Third,we used the object Feature Enrichment that combines the multi-layer feature information and the context information of the last layer after cross-layer connection to enrich the information of vehicle targets,and improve the robustness of the model for challenging targets such as small scale and severe occlusion.In the implementation of the model,K-means clustering algorithm was used to select the suitable anchor size for our dataset to improve the convergence speed of the model.Our model has been trained and tested on the UN-DETRAC dataset,and the obtained results indicate that our method has art-of-state detection performance.
基金the Natural Science Basic Research Program of Shaanxi(2021JQ-368).
文摘Aimed at a multiple traveling salesman problem(MTSP)with multiple depots and closed paths,this paper proposes a k-means clustering donkey and a smuggler algorithm(KDSA).The algorithm first uses the k-means clustering method to divide all cities into several categories based on the center of various samples;the large-scale MTSP is divided into multiple separate traveling salesman problems(TSPs),and the TSP is solved through the DSA.The proposed algorithm adopts a solution strategy of clustering first and then carrying out,which can not only greatly reduce the search space of the algorithm but also make the search space more fully explored so that the optimal solution of the problem can be more quickly obtained.The experimental results from solving several test cases in the TSPLIB database show that compared with other related intelligent algorithms,the K-DSA has good solving performance and computational efficiency in MTSPs of different scales,especially with large-scale MTSP and when the convergence speed is faster;thus,the advantages of this algorithm are more obvious compared to other algorithms.
