A new segmentation method has been developed for PET fast imaging. The technique automatically segments the transmission images into different anatomical regions, it efficiently reduced the PET transmission scan time....A new segmentation method has been developed for PET fast imaging. The technique automatically segments the transmission images into different anatomical regions, it efficiently reduced the PET transmission scan time. The result shows that this method gives only 3 min-scan time which is perfect for attenuation correction of the PET images instead of the original 15-30 min-scan time. This approach has been successfully tested both on phantom and clinical data.展开更多
In this paper, we propose a Fast Iteration Method for solving mixture regression problem, which can be treated as a model-based clustering. Compared to the EM algorithm, the proposed method is faster, more flexible an...In this paper, we propose a Fast Iteration Method for solving mixture regression problem, which can be treated as a model-based clustering. Compared to the EM algorithm, the proposed method is faster, more flexible and can solve mixture regression problem with different error distributions (i.e. Laplace and t distribution). Extensive numeric experiments show that our proposed method has better performance on randomly simulations and real data.展开更多
A method about fault identification is proposed to solve the relationship among fault features of large rotating machinery, which is extremely complicated and nonlinear. This paper studies the rotor test-rig and the c...A method about fault identification is proposed to solve the relationship among fault features of large rotating machinery, which is extremely complicated and nonlinear. This paper studies the rotor test-rig and the clustering of data sets and fault pattern recognitions. The present method firstly maps the data from their original space to a high dimensional Kernel space which makes the highly nonlinear data in low-dimensional space become linearly separable in Kernel space. It highlights the differences among the features of the data set. Then fuzzy C-means (FCM) is conducted in the Kernel space. Each data is assigned to the nearest class by computing the distance to the clustering center. Finally, test set is used to judge the results. The convergence rate and clustering accuracy are better than traditional FCM. The study shows that the method is effective for the accuracy of pattern recognition on rotating machinery.展开更多
文摘A new segmentation method has been developed for PET fast imaging. The technique automatically segments the transmission images into different anatomical regions, it efficiently reduced the PET transmission scan time. The result shows that this method gives only 3 min-scan time which is perfect for attenuation correction of the PET images instead of the original 15-30 min-scan time. This approach has been successfully tested both on phantom and clinical data.
文摘In this paper, we propose a Fast Iteration Method for solving mixture regression problem, which can be treated as a model-based clustering. Compared to the EM algorithm, the proposed method is faster, more flexible and can solve mixture regression problem with different error distributions (i.e. Laplace and t distribution). Extensive numeric experiments show that our proposed method has better performance on randomly simulations and real data.
基金supported by the National Natural Science Foundation of China(51675253)
文摘A method about fault identification is proposed to solve the relationship among fault features of large rotating machinery, which is extremely complicated and nonlinear. This paper studies the rotor test-rig and the clustering of data sets and fault pattern recognitions. The present method firstly maps the data from their original space to a high dimensional Kernel space which makes the highly nonlinear data in low-dimensional space become linearly separable in Kernel space. It highlights the differences among the features of the data set. Then fuzzy C-means (FCM) is conducted in the Kernel space. Each data is assigned to the nearest class by computing the distance to the clustering center. Finally, test set is used to judge the results. The convergence rate and clustering accuracy are better than traditional FCM. The study shows that the method is effective for the accuracy of pattern recognition on rotating machinery.