• Journal of the Korea Society of Computer and Information
• /
• v.28 no.1
• /
• pp.39-47
• /
• 2023

In this paper, we propose a method to measure the similarity between golf swings in videos. As it is known that deep learning-based artificial intelligence technology is effective in the field of computer vision, attempts to utilize artificial intelligence in video-based sports data analysis are increasing. In this study, the joint coordinates of a person in a golf swing video were obtained using a deep learning-based pose estimation model, and based on this, the similarity of each swing segment was measured. For the evaluation of the proposed method, driver swing videos from the GolfDB dataset were used. As a result of measuring swing similarity by pairing swing videos of a total of 36 players, 26 players evaluated that their other swing sequence was the most similar, and the average ranking of similarity was confirmed to be about 5th. This ensured that the similarity could be measured in detail even when the motion was performed similarly.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1565-1568
• /
• 1997

In this paper, a fuzzy based machine-cell formation algorithm for cellular manufacturing is presented. The fuzzy lovic is employed to express the degree of appropriateness when alternative machnies are specified to process a part shape. For machine grouping, the similarity coefficient based approach is used. The algorithm produces efficient machine cells and part families which maximize the similarity values.

• International Journal of Contents
• /
• v.13 no.4
• /
• pp.70-79
• /
• 2017

Images are an important element in patents and many experts use images to analyze a patent or to check differences between patents. However, there is little research on image analysis for patents partly because image processing is an advanced technology and typically patent images consist of visual parts as well as of text and numbers. This study suggests two methods for using image processing; the Scale Invariant Feature Transform(SIFT) algorithm and Optical Character Recognition(OCR). The first method which works with SIFT uses image feature points. Through feature matching, it can be applied to calculate the similarity between documents containing these images. And in the second method, OCR is used to extract text from the images. By using numbers which are extracted from an image, it is possible to extract the corresponding related text within the text passages. Subsequently, document similarity can be calculated based on the extracted text. Through comparing the suggested methods and an existing method based only on text for calculating the similarity, the feasibility is achieved. Additionally, the correlation between both the similarity measures is low which shows that they capture different aspects of the patent content.

• Smart Structures and Systems
• /
• v.23 no.3
• /
• pp.279-293
• /
• 2019

To ensure high quality data being used for data mining or feature extraction in the bridge structural health monitoring (SHM) system, a practical sensor fault diagnosis methodology has been developed based on the similarity of symmetric structure responses. First, the similarity of symmetric response is discussed using field monitoring data from different sensor types. All the sensors are initially paired and sensor faults are then detected pair by pair to achieve the multi-fault diagnosis of sensor systems. To resolve the coupling response issue between structural damage and sensor fault, the similarity for the target zone (where the studied sensor pair is located) is assessed to determine whether the localized structural damage or sensor fault results in the dissimilarity of the studied sensor pair. If the suspected sensor pair is detected with at least one sensor being faulty, field test could be implemented to support the regression analysis based on the monitoring and field test data for sensor fault isolation and reconstruction. Finally, a case study is adopted to demonstrate the effectiveness of the proposed methodology. As a result, Dasarathy's information fusion model is adopted for multi-sensor information fusion. Euclidean distance is selected as the index to assess the similarity. In conclusion, the proposed method is practical for actual engineering which ensures the reliability of further analysis based on monitoring data.

• 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 Society for Precision Engineering
• /
• v.23 no.9 s.186
• /
• pp.119-126
• /
• 2006

This paper addresses the methodology development far the automated machining setup planning system using case-based reasoning(CBR). The case-based reasoning is used to develop a setup planning system. which consists of part input and representation module, case retrieval module, and case adaptation module. We present new approaches in the part input and representation module and the case retrieval module focusing on the similarity index determination. An illustrative example is included to demonstrate the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.187-190
• /
• 2007

In this paper, we introduce concepts of entropy and similarity measure of interval-valued intuitionistic fuzzy sets (IVIFSs), discuss their relationship between similarity measure and entropy of IVIFSs, show that similarity measure and entropy of IVIFSs can be transformed by each other based on their axiomatic definitions and give some formulas to calculate entropy and similarity measure of IVIFSs.

• International Journal of Advanced Culture Technology
• /
• v.1 no.2
• /
• pp.1-6
• /
• 2013

In this paper, we evaluate performance of existing similarity measurement metric and propose a novel method using user's preferences information entropy to reduce MAE in memory-based collaborative recommender systems. The proposed method applies a similarity of individual inclination to traditional similarity measurement methods. We experiment on various similarity metrics under different conditions, which include an amount of data and significance weighting from n/10 to n/60, to verify the proposed method. As a result, we confirm the proposed method is robust and efficient from the viewpoint of a sparse data set, applying existing various similarity measurement methods and Significance Weighting.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.413-424
• /
• 2011

A variety of different metrics has been introduced to measure the similarity of two given sequences. These widely used metrics are ranging from spell correctors and categorizers to new sequence mining applications. Different metrics consider different aspects of sequences, but the essence of any sequence is extracted from the ordering of its elements. In this paper, we propose a novel sequence similarity measure that is based on all ordered pairs of one sequence and where a Hasse diagram is built in the other sequence. In contrast with existing approaches, the idea behind the proposed sequence similarity metric is to extract all ordering features to capture sequence properties. We designed a clustering problem to evaluate our sequence similarity metric. Experimental results showed the superiority of our proposed sequence similarity metric in maximizing the purity of clustering compared to metrics such as d2, Smith-Waterman, Levenshtein, and Needleman-Wunsch. The limitation of those methods originates from some neglected sequence features, which are considered in our proposed sequence similarity metric.

• KOREAN JOURNAL OF CROP SCIENCE
• /
• v.47 no.5
• /
• pp.379-383
• /
• 2002

Allelic diversity of 44 microsatellite marker loci originated from the coding regions of specific genes or the non-coding regions of barley genome was analyzed for 19 barley genotypes. Multi-allelic variation was observed at the most of marker loci except for HVM13, HVM15, HVM22, and HVM64. The number of different alleles ranged from 2 to 12 with a mean of 4.0 alleles per micro-satellite. Twenty-one alleles derived from 10 marker loci are specific for certain genotypes. The level of polymorphism (Polymorphic Information Content, PIC) based on the band pattern frequencies among genotypes was relatively high at the several loci such as HVM3, HVM5, HVM14, HVM36, HVM62 and HVM67. In the cluster analysis using genetic similarity matrix calculated from microsatellite-derived DNA profiles, two major groups were classified and the spike-row type was a major factor for clustering. Correlation between genetic similarity matrices based on microsatellite markers and pedigree data was highly significant ($r=0.57^{**}$), but these two parameters were moderately associated each other. On the other hand, RAPD-based genetic similarity matrix was more highly associated with microsatellite-based genetic similarity ($r=0.63^{**}$) than coefficient of parentage.