No abstract

No abstract

To mitigate the problem of low classification accuracy in solid color printing and dyeing, a color difference classification model based on the differential evolution (DE) improved whale optimization algorithm (WOA) for extreme learning machine (ELM) optimization, named the DE–WOA–ELM, was developed in this study. Considering that the initial population of the WOA has a significant influence on the solution speed and quality, DE was used to generate a more suitable initial population for the WOA by avoiding local optima, thereby improving the performance. The method used an excellent global search ability to improve the WOA for optimization and obtained an optimal parameter combination for the ELM. Thus, the problem of randomly initializing the input weight and the hidden layer bias of the ELM, which leads to a nonuniform training model and unstable algorithm, was solved. Finally, by optimizing the input weight and hidden layer bias, the color difference classification model of the ELM with a strong generalization ability was constructed. The results of the color difference classification experiments on fabric images collected under standard light sources show that the average classification accuracy for the dataset is increased by 2.15%, 11.06%, 12.11%, and 0.47% compared with those of the ELM, support vector machine, back propagation neural network, and kernel ELM, respectively.

No abstract

For patients with one-level CDDD, TDR was found to be more superior than ACDF in terms of neurological success, secondary surgical procedures, visual analogue scale pain scores and range of motion at 24 months post-operatively. Therefore, cervical arthroplasty is a safe and effective surgical procedure for treating one-level CDDD. We suggest adopting TDR on a large scale; with failure of TDR, ACDF would be performed.

Path planning, as the core of navigation control for mobile robots, has become the focus of research in the field of mobile robots. Various path planning algorithms have been recently proposed. In this paper, in view of the advantages and disadvantages of different path planning algorithms, a heuristic elastic particle swarm algorithm is proposed. Using the path planned by the A* algorithm in a large-scale grid for global guidance, the elastic particle swarm optimization algorithm uses a shrinking operation to determine the globally optimal path formed by locally optimal nodes so that the particles can converge to it rapidly. Furthermore, in the iterative process, the diversity of the particles is ensured by a rebound operation. Computer simulation and real experimental results show that the proposed algorithm not only overcomes the shortcomings of the A* algorithm, which cannot yield the shortest path, but also avoids the problem of failure to converge to the globally optimal path, owing to a lack of heuristic information. Additionally, the proposed algorithm maintains the simplicity and high efficiency of both the algorithms.

This study proposes an ensemble differential evolution online sequential extreme learning machine (DE-OSELM) for textile image illumination correction based on the rotation forest framework. The DE-OSELM solves the inaccuracy and long training time problems associated with traditional illumination correction algorithms. First, the Grey–Edge framework is used to extract the low-dimensional and efficient image features as online sequential extreme learning machine (OSELM) input vectors to improve the training and learning speed of the OSELM. Since the input weight and hidden-layer bias of OSELMs are randomly obtained, the OSELM algorithm has poor prediction accuracy and low robustness. To overcome this shortcoming, a differential evolution algorithm that has the advantages of good global search ability and robustness is used to optimize the input weight and hidden-layer bias of the DE-OSELM. To further improve the generalization ability and robustness of the illumination correction model, the rotation forest algorithm is used as the ensemble framework, and the DE-OSELM is used as the base learner to replace the regression tree algorithm in the original rotation forest algorithm. Then, the obtained multiple different DE-OSELM learners are aggregated to establish the prediction model. The experimental results show that compared with the textile color correction algorithm based on the support vector regression and extreme learning machine algorithms, the ensemble illumination correction method achieves high prediction accuracy, strong robustness, and good generalization ability.

No abstract