• The Korean Journal of Nuclear Medicine Technology
• /
• v.21 no.2
• /
• pp.55-64
• /
• 2017

Purpose Recently, with the spread of SPECT/CT, various image correction methods can be applied quickly and accurately, which enabled us to expect quantitative accuracy as well as image quality improvement. Among them, the Collimator Detector Response(CDR) recovery is a correction method aiming at resolution recovery by compensating the blurring effect generated from the distance between the detector and the object. The purpose of this study is to find out quantitative change depending on the change in detection distance in SPECT/CT images with CDR recovery applied. Materials and Methods In order to find out the error of acquisition count depending on the change of detection distance, we set the detection distance according to the obit type as X, Y axis radius 30cm for circular, X, Y axis radius 21cm, 10cm for non-circular and non-circular auto(=auto body contouring, ABC_spacing limit 1cm) and applied reconstruction methods by dividing them into Astonish(3D-OSEM with CDR recovery) and OSEM(w/o CDR recovery) to find out the difference in activity recovery depending on the use of CDR recovery. At this time, attenuation correction, scatter correction, and decay correction were applied to all images. For the quantitative evaluation, calibration scan(cylindrical phantom, $^{99m}TcO_4$ 123.3 MBq, water 9293 ml) was obtained for the purpose of calculating the calibration factor(CF). For the phantom scan, a 50 cc syringe was filled with 31 ml of water and a phantom image was obtained by setting $^{99m}TcO_4$ 123.3 MBq. We set the VOI(volume of interest) in the entire volume of the syringe in the phantom image to measure total counts for each condition and obtained the error of the measured value against true value set by setting CF to check the quantitative accuracy according to the correction. Results The calculated CF was 154.28 (Bq/ml/cps/ml) and the measured values against true values in each conditional image were analyzed to be circular 87.5%, non-circular 90.1%, ABC 91.3% and circular 93.6%, non-circular 93.6%, ABC 93.9% in OSEM and Astonish, respectively. The closer the detection distance, the higher the accuracy of OSEM, and Astonish showed almost similar values regardless of distance. The error was the largest in the OSEM circular(-13.5%) and the smallest in the Astonish ABC(-6.1%). Conclusion SPECT/CT images showed that when the distance compensation is made through the application of CDR recovery, the detection distance shows almost the same quantitative accuracy as the proximity detection even under the distant condition, and accurate correction is possible without being affected by the change in detection distance.

• Journal of Intelligence and Information Systems
• /
• v.27 no.1
• /
• pp.23-46
• /
• 2021

Collaborative filtering, which is often used in personalization recommendations, is recognized as a very useful technique to find similar customers and recommend products to them based on their purchase history. However, the traditional collaborative filtering technique has raised the question of having difficulty calculating the similarity for new customers or products due to the method of calculating similaritiesbased on direct connections and common features among customers. For this reason, a hybrid technique was designed to use content-based filtering techniques together. On the one hand, efforts have been made to solve these problems by applying the structural characteristics of social networks. This applies a method of indirectly calculating similarities through their similar customers placed between them. This means creating a customer's network based on purchasing data and calculating the similarity between the two based on the features of the network that indirectly connects the two customers within this network. Such similarity can be used as a measure to predict whether the target customer accepts recommendations. The centrality metrics of networks can be utilized for the calculation of these similarities. Different centrality metrics have important implications in that they may have different effects on recommended performance. In this study, furthermore, the effect of these centrality metrics on the performance of recommendation may vary depending on recommender algorithms. In addition, recommendation techniques using network analysis can be expected to contribute to increasing recommendation performance even if they apply not only to new customers or products but also to entire customers or products. By considering a customer's purchase of an item as a link generated between the customer and the item on the network, the prediction of user acceptance of recommendation is solved as a prediction of whether a new link will be created between them. As the classification models fit the purpose of solving the binary problem of whether the link is engaged or not, decision tree, k-nearest neighbors (KNN), logistic regression, artificial neural network, and support vector machine (SVM) are selected in the research. The data for performance evaluation used order data collected from an online shopping mall over four years and two months. Among them, the previous three years and eight months constitute social networks composed of and the experiment was conducted by organizing the data collected into the social network. The next four months' records were used to train and evaluate recommender models. Experiments with the centrality metrics applied to each model show that the recommendation acceptance rates of the centrality metrics are different for each algorithm at a meaningful level. In this work, we analyzed only four commonly used centrality metrics: degree centrality, betweenness centrality, closeness centrality, and eigenvector centrality. Eigenvector centrality records the lowest performance in all models except support vector machines. Closeness centrality and betweenness centrality show similar performance across all models. Degree centrality ranking moderate across overall models while betweenness centrality always ranking higher than degree centrality. Finally, closeness centrality is characterized by distinct differences in performance according to the model. It ranks first in logistic regression, artificial neural network, and decision tree withnumerically high performance. However, it only records very low rankings in support vector machine and K-neighborhood with low-performance levels. As the experiment results reveal, in a classification model, network centrality metrics over a subnetwork that connects the two nodes can effectively predict the connectivity between two nodes in a social network. Furthermore, each metric has a different performance depending on the classification model type. This result implies that choosing appropriate metrics for each algorithm can lead to achieving higher recommendation performance. In general, betweenness centrality can guarantee a high level of performance in any model. It would be possible to consider the introduction of proximity centrality to obtain higher performance for certain models.