To determine the thickness from MR images, segmentation, that is, boundary detection, of the two adjacent thin structures (e.g., femoral cartilage and acetabular cartilage in the hip joint) is needed before thickness determination. Traditional techniques such as zero-crossings of the second derivatives are not suitable for the detection of these boundaries. A theoretical simulation analysis reveals that the zero-crossing method yields considerable biases in boundary detection and thickness measurement of the two adjacent thin structures from MR images. This paper studies the accurate detection of hip cartilage boundaries in the image plane, and a new method based on a model of the MR imaging process is proposed for this application. Based on the newly developed model, a hip cartilage boundary detection algorithm is developed. The in-plane thickness is computed based on the boundaries detected using the proposed algorithm. In order to correct the image plane thickness for overestimation due to oblique slicing, a three-dimensional (3-D) thickness computation approach is introduced. Experimental results show that the thickness measurement obtained by the new thickness computation approach is more accurate than that obtained by the existing thickness computation approaches.

We describe a technique for the registration of three dimensional (3D) knee femur surface points from MR image data sets; it is a technique that can track local cartilage thickness changes over time. In the first coarse registration step, we use the direction vectors of the volume given by the cloud of points of the MR image to correct for different knee joint positions and orientations in the MR scanner. In the second fine registration step, we propose a global search algorithm that simultaneously determines the optimal transformation parameters and point correspondences through searching a six dimensional space of Euclidean motion vectors (translation and rotation). The present algorithm is grounded on a mathematical theory - Lipschitz optimization. Compared with the other three registration approaches (ICP, EM-ICP, and genetic algorithms), the proposed method achieved the highest registration accuracy on both animal and clinical data.

With the rapid development of Internet technology, the type and quantity of network traffic data have increased accordingly, and network traffic classification has become an important research task. In previous research, there are methods based on traditional machine learning and deep learning; compared to machine learning, deep learning can obtain good results by converting network traffic into two-dimensional images and utilizing deep learning classification models. However, all of these methods have some limitations: the trained models cannot learn sustainably, and the generalization ability of the models is limited. In order to solve this problem, we propose a network traffic classification methods based on incremental learning and Mixup, which is based on generative adversarial networks. First, the network traffic is converted into a 2D image, the original database is linearly interpolated using Mixup to reduce the overfitting tendency of the model and improve the generalization ability, and the traffic is classified using the ability of deep learning on the image. Secondly, we improve the traditional incremental learning algorithm. To effectively address the imbalance between old and new categories in incremental learning. The experimental results show that the model performs well in classification experiments, reaching 92.26% and 93.86% accuracy on the ISCXVPN2016 and USTC datasets, respectively, and we can maintain a high accuracy rate with limited storage space in the process of increasing new categories.