A continuum robot is a unique type of robots which move because of the elastic deformation of their bodies. The kinematics of such robots is typically described using constant curvature assumption. Such an assumption, however, does not completely describe the kinematics of a real-life continuum robot. As a result, variable curvature assumptions describe the kinematics of the continuum robot better, however, they are more complicated to formulate and work with. In particular, the existing methods of solving the inverse kinematics problem of multisection continuum robots with variable curvature suffer from a variety of deficiencies. Those deficiencies include complex matrix calculations, singularity problems, unscalability, and inability to find a numeric solution in some cases. In this work, we present FABRIKx: fast and reliable algorithm to solve the problem of inverse kinematics of the multisection continuum robot with variable curvature. In particular, to describe the variable curvature, we utilize a piecewise constant curvature assumption. The proposed algorithm combines both tangent and chord approaches to solve the inverse kinematics problem. The inverse kinematics of a single bending section of piecewise constant curvature is also described. To evaluate FABRIKx effectiveness, we compare it with the Jacobian-based and FABRIKc-based algorithms via simulation studies for different robots. The obtained results show that FABRIKx demonstrates a higher success rate and a lower solution time.
This research is devoted to the segmentation of heart and brain anatomical structures. In the study, we present a segmentation algorithm based on the square blocks (superpixels) propagation. The square blocks propagation algorithm checks two criteria. For the first criteria, the current intensity of the pixel is compared to the average intensity of the segmented region. For the second criterion, the intensity difference of the pixels lying on the superpixel sides is compared to the threshold. Once these criteria are successfully checked, the algorithm merges homogeneous superpixels into one region. Then the following superpixels are attached to the final superpixel set. The last step of the proposed method is the spline generation. The spline delineates the borders of the region of interest. The main parameter of the algorithm is the size of a square block. The cardiac MRI dataset of the University of York and the brain tumor dataset of Southern Medical University were used to estimate the segmentation accuracy and processing time. The highest Dice similarity coefficients obtained by the presented algorithm for the left ventricle and the brain tumor are 0.93±0.03 and 0.89±0.07 respectively. One of the most important features of the border detection step is its scalability. It allows implementing different one-dimensional methods for border detection.