• Journal of Korea Multimedia Society
• /
• v.21 no.12
• /
• pp.1407-1416
• /
• 2018

The purpose of this study was to train a model for the ulna and radius bone segmentation based on Convolutional Neural Networks and to verify the segmentation model. The data consisted of 840 training data, 210 tuning data, and 200 verification data. The learning model for the ulna and radius bone bwas based on U-Net (19 convolutional and 8 maximum pooling) and trained with 8 batch sizes, 0.0001 learning rate, and 200 epochs. As a result, the average sensitivity of the training data was 0.998, the specificity was 0.972, the accuracy was 0.979, and the Dice's similarity coefficient was 0.968. In the validation data, the average sensitivity was 0.961, specificity was 0.978, accuracy was 0.972, and Dice's similarity coefficient was 0.961. The performance of deep convolutional neural network based models for the segmentation was good for ulna and radius bone.

• Korean Journal of Cognitive Science
• /
• v.23 no.3
• /
• pp.295-322
• /
• 2012

In this paper, we cluster similar word senses applying vector space model and HAL (Hyperspace Analog to Language). HAL measures corelation among words through a certain size of context (Lund and Burgess 1996). The similarity measurement between a word pair is cosine similarity based on the vector space model, which reduces distortion of space between high frequency words and low frequency words (Salton et al. 1975, Widdows 2004). We use PCA (Principal Component Analysis) and SVD (Singular Value Decomposition) to reduce a large amount of dimensions caused by similarity matrix. For sense similarity clustering, we adopt supervised and non-supervised learning methods. For non-supervised method, we use clustering. For supervised method, we use SVM (Support Vector Machine), Naive Bayes Classifier, and Maximum Entropy Method.

• Smart Media Journal
• /
• v.9 no.4
• /
• pp.162-169
• /
• 2020

Design is a key factor that determines the competitiveness of products in the textile and fashion industry. It is very important to measure the similarity of the proposed design in order to prevent unauthorized copying and to confirm the originality. In this study, a deep learning technique was used to quantify features from images of textile designs, and similarity was measured using Spearman correlation coefficients. To verify that similar samples were actually detected, 300 images were randomly rotated and color changed. The results of Top-3 and Top-5 in the order of similarity value were measured to see if samples that rotated or changed color were detected. As a result, the VGG-16 model recorded significantly higher performance than did AlexNet. The performance of the VGG-16 model was the highest at 64% and 73.67% in the Top-3 and Top-5, where similarity results were high in the case of the rotated image. appear. In the case of color change, the highest in Top-3 and Top-5 at 86.33% and 90%, respectively.

• Journal of Information Processing Systems
• /
• v.11 no.4
• /
• pp.643-654
• /
• 2015

Face recognition under controlled settings, such as limited viewpoint and illumination change, can achieve good performance nowadays. However, real world application for face recognition is still challenging. In this paper, we propose using the combination of Affine Scale Invariant Feature Transform (SIFT) and Probabilistic Similarity for face recognition under a large viewpoint change. Affine SIFT is an extension of SIFT algorithm to detect affine invariant local descriptors. Affine SIFT generates a series of different viewpoints using affine transformation. In this way, it allows for a viewpoint difference between the gallery face and probe face. However, the human face is not planar as it contains significant 3D depth. Affine SIFT does not work well for significant change in pose. To complement this, we combined it with probabilistic similarity, which gets the log likelihood between the probe and gallery face based on sum of squared difference (SSD) distribution in an offline learning process. Our experiment results show that our framework achieves impressive better recognition accuracy than other algorithms compared on the FERET database.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.3
• /
• pp.314-319
• /
• 2019

Computing chromagram similarity is indispensable in constructing cover song identification system. This paper proposes a code-based chromagram similarity to reduce the computational and the storage costs for cover song identification. By learning a song-specific codebook, a chromagram sequence is converted into a code sequence, which results in the reduction of the feature storage cost. We build a lookup table over the learned codebooks to compute chromagram similarity efficiently. Experiments on two music datasets were performed to compare the proposed code-based similarity with the conventional one in terms of cover song search accuracy, feature storage, and computational cost.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.7
• /
• pp.816-820
• /
• 2004

Clustering is a process of dividing similar data objects in data set into clusters and acquiring meaningful information in the data. The main issues related to clustering are the effective clustering of high dimensional data and optimization. This study proposed a method of measuring similarity based on SVM and a new method of calculating the number of clusters in an efficient way. The high dimensional data are mapped to Feature Space ones using kernel functions and then similarity between neighboring clusters is measured. As for created clusters, the desired number of clusters can be got using the value of similarity measured and the value of Δd. In order to verify the proposed methods, the author used data of six UCI Machine Learning Repositories and obtained the presented number of clusters as well as improved cohesiveness compared to the results of previous researches.

• The Mathematical Education
• /
• v.42 no.3
• /
• pp.353-368
• /
• 2003

Analogy, based on a similarity, is to infer the properties of the similar object from properties of an object. It can be a very useful thinking tool for learning mathematical patterns and laws, noticing on relational properties among various situations. The purpose of this study, when manipulating hint condition, figure and table conditions and the amount of original learning by using algebra word problems, is to verify the effects of analogical transfer in solving equivalent, isomorphic and similar problems according to the similarity of source problems and target ones. Five study questions were set up for the above purpose. It was 354 first grade students of S and G middle schools in Seoul that were experimented for this study. The data was processed by MANOVA analysis of statistical program, SPSS 10.0. The results of this studies would indicate that most of the students would be poor at solving isomorphic and similar problems in the performance of analogical transfer according to the similarity of source and target problems. Hints, figure and table conditions did not facilitate the analogical transfer. Merely, on the condition that amount of teaming was increased, analogical transfer of the students was facilitated. Therefore, it is necessary to have students do much more analogical problem-solving experience to improve their analogical reasoning ability through the instruction program development in the educational fields.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.235-241
• /
• 2019

In this paper, we propose a new algorithm to detect rear-approaching vehicle using the frame similarity of ROI(Region of Interest) based on deep learning algorithm for use in agricultural machinery systems. Since the vehicle detection system for agricultural machinery needs to detect only a vehicle approaching from the rear. we use Faster R-CNN model that shows excellent accuracy rate in deep learning for vehicle detection. And we proposed an algorithm that uses the frame similarity for ROI using constrained conditions. Experimental results show that the proposed method has a detection rate of 99.9% and reduced the false positive values.

• Journal of Wellbeing Management and Applied Psychology
• /
• v.5 no.2
• /
• pp.15-19
• /
• 2022

Purpose: This pilot study aimed to clarify features of motor module during walking in exercise experts who experienced lately repeated training for sports skill. To identify motor modules, autoencoder machine learning algorithm was used, and modules were extracted from muscle activities of lower extremities. Research design, data and methodology: A total of 10 university students were participated. 5 students did not experience any sports training before, and 5 students did experience sports training more than 5 years. Eight muscle activities of dominant lower extremity were measured. After modules were extracted by autoencoder, the numbers of modules and spatial muscle weight values were compared between two groups. Results: There was no significant difference in the minimal number of motor modules that explain more than 90% of original data between groups. However, in similarity analysis, three motor modules were shown high similarity (r>0.8) while one module was shown low similarity (r<0.5). Conclusions: This study found not only common motor modules between exercise novice and expert during walking, but also found that a specific motor module, which would be associated with high motor control ability to distinguish the level of motor performance in the field of sports.

• Journal of the Institute of Convergence Signal Processing
• /
• v.23 no.3
• /
• pp.143-149
• /
• 2022

This excerpt delineates a quantitative measure of relationship between a research title and its respective abstract extracted from different journal articles documented through a Korean Citation Index (KCI) database published through various journals. In this paper, we propose a machine learning-based similarity metric that does not assume normality on dataset, realizes the imbalanced dataset problem, and zero-variance problem that affects most of the rule-based algorithms. The advantage of using this algorithm is that, it eliminates the limitations experienced by Pearson correlation coefficient (r) and additionally, it solves imbalanced dataset problem. A total of 107 journal articles collected from the database were used to develop a corpus with authors, year of publication, title, and an abstract per each. Based on the experimental results, the proposed algorithm achieved high correlation coefficient values compared to others which are cosine similarity, euclidean, and pearson correlation coefficients by scoring a maximum correlation of 1, whereas others had obtained non-a-number value to some experiments. With these results, we found that an effective title must have high correlation coefficient with the respective abstract.