• Korean Journal of Applied Biomechanics
• /
• v.31 no.3
• /
• pp.199-204
• /
• 2021

Objective: The purpose of this study was to present a new idea of methodology to evaluate Poomsae performance using inertial measurement unit (IMU) sensors in terms of signal processing techniques. Method: Ten collegian Taekwondo athletes, consisting of five Poomsae elite athletes (age: 21.4 ± 0.9 years, height: 168.4 ± 11.3 cm, weight: 65.0 ± 10.6 kg, experience: 12 ± 0.7 years) and five breaking demonstration athletes (age: 21.0 ± 0.0 years, height: 168.4 ± 4.7 cm, weight: 63.8 ± 8.2 kg, experience: 13.0 ± 2.1 years), voluntarily participated in this study. They performed three different black belt Poomsae such as Goryeo, Geumgang, and Taebaek Poomsae repeatedly twice. Repeated measured motion data on the wrist and ankle were calculated by the methods of cosine similarity and Euclidean distance. Results: The Poomsse athletes showed superior performance in terms of temporal consistency at Goryeo and Taebaek Poomsae, cosine similarity at Geumgang and Taebaek Poomsae, and Euclidian distance at Geumgang Poomsae. Conclusion: IMU sensor would be a useful tool for monitoring and evaluating within-subject temporal variability of Taekwondo Poomsae motions. As well it distinguished spatiotemporal characteristics among three different Poomsae.

• The Journal of the Acoustical Society of Korea
• /
• v.31 no.4
• /
• pp.266-272
• /
• 2012

Speaker segmentation is a process of automatically detecting the speaker boundary points in the audio data. Speaker segmentation methods are divided into two categories depending on whether they use a prior knowledge or not: One is the model-based segmentation and the other is the metric-based segmentation. In this paper, we introduce the eigenvoice-based speaker weight distance method and compare it with the representative metric-based methods. Also, we employ and compare the Euclidean and cosine similarity functions to calculate the distance between speaker weight vectors. And we verify that the speaker weight distance method is computationally very efficient compared with the method directly using the distance between the speaker adapted models constructed by the eigenvoice technique.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.185-199
• /
• 2024

In this paper, an improved automated spectral clustering (IASC) algorithm is proposed to address the limitations of the traditional spectral clustering (TSC) algorithm, particularly its inability to automatically determine the number of clusters. Firstly, a cluster number evaluation factor based on the optimal clustering principle is proposed. By iterating through different k values, the value corresponding to the largest evaluation factor was selected as the first-rank number of clusters. Secondly, the IASC algorithm adopts a density-sensitive distance to measure the similarity between the sample points. This rendered a high similarity to the data distributed in the same high-density area. Thirdly, to improve clustering accuracy, the IASC algorithm uses the cosine angle classification method instead of K-means to classify the eigenvectors. Six algorithms-K-means, fuzzy C-means, TSC, EIGENGAP, DBSCAN, and density peak-were compared with the proposed algorithm on six datasets. The results show that the IASC algorithm not only automatically determines the number of clusters but also obtains better clustering accuracy on both synthetic and UCI datasets.

• Journal of Power System Engineering
• /
• v.21 no.6
• /
• pp.5-12
• /
• 2017

The steady-state, incompressible and three-dimensional numerical analysis was carried out to investigate the internal flow fields characteristics according to wind tunnel contraction type. The turbulence model used in this study is a realizable $k-{\varepsilon}$ modified from the standard $k-{\varepsilon}$ model. As a results, the distribution of the axial mean velocity components along the central axis of the flow model is very similar to the ASME and BE types, and the cubic and cosine types. When the flow passes through the interior space of the analytical models, the flow resistance at the inlet of the plenum chamber is the largest at BS type contraction, but the smallest at cubic type contraction. The boundary layer thickness is the smallest in the cosine type contraction as the axial distance increases. The maximum turbulent kinetic energy in the test section is the smallest in the order of the contraction of cubic type and cosine type. Comprehensively, cubic type contraction is the best choice for wind tunnel performance, and cosine type contraction can be the next best solution.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.27 no.3
• /
• pp.162-166
• /
• 2014

We propose an analysis method of an autostereoscopic display system with lenticular lens array using finite ray-tracing method that is verified by the geometrical optics. In the present work, we adopt the cylinder equation for the mathematical expression of the lenticular lens. For the calculation of the direction cosine of the transmitted ray, we first calculate the refracting point at bottom of the lens and the direction cosine of the incident ray that propagating through the lens by the Snell's law, and then apply to finite ray-tracing method. Finally, we obtain the simulation results for the intensity distribution of the ray at optimal viewing distance. From these results, we confirm the realization of 3D image that exists separately according to the viewing position at an optimal viewing distance.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.6
• /
• pp.2098-2114
• /
• 2021

Light intensity variation is one of the key factors which affect the accuracy of vehicle face re-identification, so in order to improve the robustness of vehicle face features to light intensity variation, a Nonnegative Matrix Factorization model with the constraint of image acquisition time difference is proposed. First, the original features vectors of all pairs of positive samples which are used for training are placed in two original feature matrices respectively, where the same columns of the two matrices represent the same vehicle; Then, the new features obtained after decomposition are divided into stable and variable features proportionally, where the constraints of intra-class similarity and inter-class difference are imposed on the stable feature, and the constraint of image acquisition time difference is imposed on the variable feature; At last, vehicle face matching is achieved through calculating the cosine distance of stable features. Experimental results show that the average False Reject Rate and the average False Accept Rate of the proposed algorithm can be reduced to 0.14 and 0.11 respectively on five different datasets, and even sometimes under the large difference of light intensities, the vehicle face image can be still recognized accurately, which verifies that the extracted features have good robustness to light variation.

• Journal of Information Processing Systems
• /
• v.19 no.1
• /
• pp.17-32
• /
• 2023

Centralized hierarchical routing protocols are often used to solve the problems of uneven energy consumption and short network life in wireless sensor networks (WSNs). Clustering and cluster head election have become the focuses of WSNs. In this paper, an energy balanced clustering routing algorithm optimized by sine cosine algorithm (SCA) is proposed. Firstly, optimal cluster head number per round is determined according to surviving node, and the candidate cluster head set is formed by selecting high-energy node. Secondly, a random population with a certain scale is constructed to represent a group of cluster head selection scheme, and fitness function is designed according to inter-cluster distance. Thirdly, the SCA algorithm is improved by using monotone decreasing convex function, and then a certain number of iterations are carried out to select a group of individuals with the minimum fitness function value. From simulation experiments, the process from the first death node to 80% only needs about 30 rounds. This improved algorithm balances the energy consumption among nodes and avoids premature death of some nodes. And it greatly improves the energy utilization and extends the effective life of the whole network.

• Journal of Information Processing Systems
• /
• v.12 no.3
• /
• pp.392-409
• /
• 2016

The aim of this paper is to examine the effectiveness of combining three popular tools used in pattern recognition, which are the Active Appearance Model (AAM), the two-dimensional discrete cosine transform (2D-DCT), and Kernel Fisher Analysis (KFA), for face recognition across age variations. For this purpose, we first used AAM to generate an AAM-based face representation; then, we applied 2D-DCT to get the descriptor of the image; and finally, we used a multiclass KFA for dimension reduction. Classification was made through a K-nearest neighbor classifier, based on Euclidean distance. Our experimental results on face images, which were obtained from the publicly available FG-NET face database, showed that the proposed descriptor worked satisfactorily for both face identification and verification across age progression.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.5
• /
• pp.111-120
• /
• 2004

The MPEG-7 standard defines a set of descriptors that extracts low-level features such as color, texture and object shape from an image and generates metadata in order to represent these extracted information. But the matching performance for image mining ma y not be satisfactory by u sing only on e of these features. Rather than by combining these features we can achieve a better query performance. In this paper we propose a new image retrieval technique for image mining that combines the features extracted from MPEG-7 visual color and texture descriptors. Specifically, we use only some specifications of Scalable Color Descriptor (SCD) and Non-Homogeneous Texture Descriptor also known as Edge Histogram Descriptor (EHD) for the implementation of the color and edge histograms respectively. MPEG-7 standard defines $l_{1}$-norm based matching in EHD and SCD. But in our approach, for distance measurement, we achieve a better result by using cosine similarity coefficient for color histograms and Euclidean distance for edge histograms. Our approach toward this system is more experimental based than hypothetical.

• International Journal of Computer Science & Network Security
• /
• v.22 no.1
• /
• pp.139-148
• /
• 2022

Research into wireless sensor networks (WSNs) is a trendy issue with a wide range of applications. With hundreds to thousands of nodes, most wireless sensor networks interact with each other through radio waves. Limited computational power, storage, battery, and transmission bandwidth are some of the obstacles in designing WSNs. Clustering and routing procedures have been proposed to address these concerns. The wireless sensor network's most complex and vital duty is routing. With the Greedy Perimeter Stateless Routing method (GPSR), an efficient and responsive routing protocol is built. In packet forwarding, the nodes' locations are taken into account while making choices. In order to send a message, the GPSR always takes the shortest route between the source and destination nodes. Weighted directed graphs may be constructed utilising four distinct distance metrics, such as Euclidean, city block, cosine, and correlation distances, in this study. NS-2 has been used for a thorough simulation. Additionally, the GPSR's performance with various distance metrics is evaluated and verified. When compared to alternative distance measures, the proposed GPSR with correlation distance performs better in terms of packet delivery ratio, throughput, routing overhead and average stability time of the cluster head.