A Preliminary Investigation Into the Feasibility of Semi-Autonomous Surgical Path Planning for a Mastoidectomy Using LSTM-Recurrent Neural Networks

2021 ◽  
Vol 15 (1) ◽  
Author(s):  
Christopher Korte ◽  
Grant Schaffner ◽  
Catharine L. R. McGhan

Abstract Path planning algorithms for robotics can be as simple as having an operator program waypoints into a robot's controller and having the robot perform a simple task such as welding. This works well in an industrial setting but will not work for complicated tasks such as performing surgery. Another approach would be to use a constraint function in programing a robot to perform surgery, but it would be difficult to capture and represent all of the surgeon's information in the mathematical terms required for a cost function. A third approach, and the one utilized in this study, is to train a set of artificial neural networks (ANNs) using recorded surgeons' motions when manipulating a surgical instrument during procedure training using a surgery simulator. This has the advantage of indirectly capturing the surgeon's abilities and intentions without needing to explicitly capture all of the motion information that must be encoded from their trajectory planning and decision-making, and then, say, creating a complex constraint function using that information. In this research effort, virtually captured surgical trajectories from trained surgeons were used to train ANNs, after being preprocessed into three subtasks. Each set of subtask data was used to train a separate ANN. Each of the ANNs was trained using a custom cost function and evaluated using custom metrics. During the training, the positions of fiducial markers, recorded during procedure attempts, were used to orient the recorded path relative to the patient's anatomy. Although the ANN-generated trajectories were not used to perform surgery on a live patient in this study, the fiducial marker position information is intended to be exploited during a real procedure to position, orient, and scale a tool trajectory to suit a patient's specific anatomy. The trained ANNs were subjected to several tests to assess their safety and robustness. We found that even when trained on a small number of datasets, the ANNs converged and could generate output trajectories that were still assessed to be safe even when slight changes in the fiducial marker placement locations were given.

2021 ◽  
Vol 11 (7) ◽  
pp. 2925
Author(s):  
Edgar Cortés Gallardo Medina ◽  
Victor Miguel Velazquez Espitia ◽  
Daniela Chípuli Silva ◽  
Sebastián Fernández Ruiz de las Cuevas ◽  
Marco Palacios Hirata ◽  
...  

Autonomous vehicles are increasingly becoming a necessary trend towards building the smart cities of the future. Numerous proposals have been presented in recent years to tackle particular aspects of the working pipeline towards creating a functional end-to-end system, such as object detection, tracking, path planning, sentiment or intent detection, amongst others. Nevertheless, few efforts have been made to systematically compile all of these systems into a single proposal that also considers the real challenges these systems will have on the road, such as real-time computation, hardware capabilities, etc. This paper reviews the latest techniques towards creating our own end-to-end autonomous vehicle system, considering the state-of-the-art methods on object detection, and the possible incorporation of distributed systems and parallelization to deploy these methods. Our findings show that while techniques such as convolutional neural networks, recurrent neural networks, and long short-term memory can effectively handle the initial detection and path planning tasks, more efforts are required to implement cloud computing to reduce the computational time that these methods demand. Additionally, we have mapped different strategies to handle the parallelization task, both within and between the networks.


2002 ◽  
Vol 12 (01) ◽  
pp. 31-43 ◽  
Author(s):  
GARY YEN ◽  
HAIMING LU

In this paper, we propose a genetic algorithm based design procedure for a multi-layer feed-forward neural network. A hierarchical genetic algorithm is used to evolve both the neural network's topology and weighting parameters. Compared with traditional genetic algorithm based designs for neural networks, the hierarchical approach addresses several deficiencies, including a feasibility check highlighted in literature. A multi-objective cost function is used herein to optimize the performance and topology of the evolved neural network simultaneously. In the prediction of Mackey–Glass chaotic time series, the networks designed by the proposed approach prove to be competitive, or even superior, to traditional learning algorithms for the multi-layer Perceptron networks and radial-basis function networks. Based upon the chosen cost function, a linear weight combination decision-making approach has been applied to derive an approximated Pareto-optimal solution set. Therefore, designing a set of neural networks can be considered as solving a two-objective optimization problem.


2019 ◽  
Vol 8 (4) ◽  
pp. 3902-3910

In the field of mobile robotics, path planning is one of the most widely-sought areas of interest due to its nature of complexity, where such issue is also practically evident in the case of mobile robots used for waste disposal purposes. To overcome issues on path planning, researchers have studied various classical and heuristic methods, however, the extent of optimization applicability and accuracy still remain an opportunity for further improvements. This paper presents the exploration of Artificial Neural Networks (ANN) in characterizing the path planning capability of a mobile waste-robot in order to improve navigational accuracy and path tracking time. The author utilized proximity and sound sensors as input vectors, dual H-bridge Direct Current (DC) motors as target vectors, and trained the ANN model using Levenberg-Marquardt (LM) and Scaled Conjugate (SCG) algorithms. Results revealed that LM was significantly more accurate than SCG algorithm in local path planning with Mean Square Error (MSE) values of 1.75966, 2.67946, and 2.04963, and Regression (R) values of 0.995671, 0.991247, and 0.983187 in training, testing, and validation environments, respectively. Furthermore, based on simulation results, LM was also found to be more accurate and faster than SCG with Pearson R correlation coefficients of rx=.975, nx=6, px=0.001 and ry=.987, ny=6, py=0.000 and path tracking time of 8.47s.


2021 ◽  
pp. 1-17
Author(s):  
Luis Sa-Couto ◽  
Andreas Wichert

Abstract Convolutional neural networks (CNNs) evolved from Fukushima's neocognitron model, which is based on the ideas of Hubel and Wiesel about the early stages of the visual cortex. Unlike other branches of neocognitron-based models, the typical CNN is based on end-to-end supervised learning by backpropagation and removes the focus from built-in invariance mechanisms, using pooling not as a way to tolerate small shifts but as a regularization tool that decreases model complexity. These properties of end-to-end supervision and flexibility of structure allow the typical CNN to become highly tuned to the training data, leading to extremely high accuracies on typical visual pattern recognition data sets. However, in this work, we hypothesize that there is a flip side to this capability, a hidden overfitting. More concretely, a supervised, backpropagation based CNN will outperform a neocognitron/map transformation cascade (MTCCXC) when trained and tested inside the same data set. Yet if we take both models trained and test them on the same task but on another data set (without retraining), the overfitting appears. Other neocognitron descendants like the What-Where model go in a different direction. In these models, learning remains unsupervised, but more structure is added to capture invariance to typical changes. Knowing that, we further hypothesize that if we repeat the same experiments with this model, the lack of supervision may make it worse than the typical CNN inside the same data set, but the added structure will make it generalize even better to another one. To put our hypothesis to the test, we choose the simple task of handwritten digit classification and take two well-known data sets of it: MNIST and ETL-1. To try to make the two data sets as similar as possible, we experiment with several types of preprocessing. However, regardless of the type in question, the results align exactly with expectation.


Sign in / Sign up

Export Citation Format

Share Document