• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.624-633
• /
• 2003

We propose a novel method of selecting key VOPs from MPEG-4 compressed domain without fully decoding the compressed data. Approximated shapes of VOPs are obtained from the shape coding mode and then VOPs are clustered by shape similarity to generate key VOPs. The proposed method reduces the computation time of shape approximation, compared with Erol's method. Nevertheless, the resulting VOPs have a good summarizing capability of a video sequence. NMHD (normalized mean Hausdorff distance) values are 2-means clustered to generate key VOPs. In the video search, the MHD of a query VOP from key VOPs are computed and the VOP with the lowest distance is returned. Tests on standard MPEG-4 test sequences show that the computational complexity is very low. Recursive clustering proved to be very effective for generating suitable key VOPs.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.5
• /
• pp.452-459
• /
• 2021

Estimating the mutual time delay between two acoustic sensors is used in various fields such as tracking and estimating the location of a target in room acoustics and sonar. In the time delay estimation methods, there are a non-parametric method, such as Generalized Cross Correlation (GCC), and a parametric method based on system identification. In this paper, we propose a time delay estimation method based on the parametric method. In particular, we propose a method that considers the noise in each receiving acoustic sensor. Simulation confirms that the proposed algorithm is superior to the existing generalized cross-correlation and adaptive eigenvalue analysis methods in white noise and reverberation environments.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.10
• /
• pp.717-727
• /
• 2022

An algorithm is realized for estimating the component fault and health diagnosis such as a deterioration. Based on the turbofan engine health diagnosis model, from the health parameters which are estimated by a real time tracking filter, the outliers are eliminated efficiently by an effective median filter to minimize an false alarm. The difference between the fault and deterioration trends is identified by the detection measure for abrupt change, thereby the clear diagnosis classifying the fault and the health condition is possible. The effectiveness of the algorithm for fault and health diagnosis is verified from the simulated results of engine component faults and deterioration.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.6
• /
• pp.55-61
• /
• 2021

As the demand for distance education increases, it is necessary to present a problem solving path through a learning tracking algorithm in order to support the efficient learning of learners. In this paper, we proposed a problem solving path of various difficulty levels in various subjects by supplementing the existing learning tracking algorithm. Through the data set obtained through the path for solving the learner's problem, the path through the prim's minimum Spanning tree was secured, and the optimal problem solving path through the recursive neural network was suggested through the path data set. As a result of the performance evaluation of the contents proposed in this paper, it was confirmed that more than 52% of the test subjects included the problem solving path suggested in the problem solving process, and the problem solving time was also improved by more than 45%.

• Journal for History of Mathematics
• /
• v.21 no.3
• /
• pp.127-142
• /
• 2008

In this paper, we introduce four different approaches of proving Cayley formula, which counts the number of trees(acyclic connected simple graphs). The first proof was done by Cayley using recursive formulas. On the other hands the core idea of the other three proofs is the bijective method-find an one to one correspondence between the set of trees and a suitable family of combinatorial objects. Each of the three bijection gives its own generalization of Cayley formula. In particular, the last proof, done by Seo and Shin, has an application to computer science(theoretical computation), which is a typical example that pure mathematics supply powerful tools to other research fields.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.11-17
• /
• 2007

One of the popular methods used for pattern classification is the MBR (Memory-Based Reasoning) algorithm. Since it simply computes distances between a test pattern and training patterns or hyperplanes stored in memory, and then assigns the class of the nearest training pattern, it cannot explain how the classification result is obtained. In order to overcome this problem, we propose an incremental teaming algorithm based on RPA (Recursive Partition Averaging) to extract IF-THEN rules that describe regularities inherent in training patterns. But rules generated by RPA eventually show an overfitting phenomenon, because they depend too strongly on the details of given training patterns. Also RPA produces more number of rules than necessary, due to over-partitioning of the pattern space. Consequently, we present the IREA (Incremental Rule Extraction Algorithm) that overcomes overfitting problem by removing useless conditions from rules and reduces the number of rules at the same time. We verify the performance of proposed algorithm using benchmark data sets from UCI Machine Learning Repository.

• Journal of Science and Technology Studies
• /
• v.19 no.3
• /
• pp.1-49
• /
• 2019

First proposed by Paul Crutzen and Eugene Stoermer in 2000, the concept of the Anthropocene has had staggering repercussions in a variety of disciplines. In response to the Anthropocene narrative as a problematization of the eco-ontological emergency that humanity is confronted with in the 21st-century, I will deal with the following theoretical themes in this article. Firstly, I will analyze the central agendas underlying the Anthropocene discourse: the expansion of human agency into the planetary level and the possibility of unprecedented catastrophes in the near future. Secondly, I will propose to address the Anthropocene discourse as problem-assemblage. Thirdly, I will examine Clive Himilton and Dipesh Chakrabarty's theses in order to understand the shock that was brought to bear on the humanities and social sciences by the Anthropocene narrative. Fourthly, I will reinterpret the allegory of the angel appearing in Benjamin's Theses on the Philosophy of History to explore new possibilities of transformative becoming of the subjectivity, focusing on the concept of patiency. Finally, I will present the concept of reflexive catastrophism.

• The Journal of the Acoustical Society of Korea
• /
• v.40 no.3
• /
• pp.213-218
• /
• 2021

It is known that total least-squares method shows better estimation performance than least-squares method when noise is present at the input and output at the same time. When total least squares method is applied to data with time series characteristics, Recursive Total Least Squares (RTS) algorithm has been proposed to improve the real-time performance. However, RTLS has numerical instability in calculating the inverse matrix. In this paper, we propose an algorithm for reducing numerical instability as well as having similar convergence to RTLS. For this algorithm, we propose a new RTLS using Iterative Wiener Filter (IWF). Through the simulation, it is shown that the convergence of the proposed algorithm is similar to that of the RTLS, and the numerical robustness is superior to the RTLS.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.9
• /
• pp.55-62
• /
• 2023

In this paper, we present a method that utilizes geometry-based sound generation techniques to efficiently handle multiple sound sources, wind turbulence, and temperature-dependent interactions. Recently, a method based on reduced raytracing has been proposed to update the sound position and efficiently calculate sound propagation and diffraction without recursive reflection/refraction of many rays, but this approach only considers the propagation characteristics of sound and does not consider the interaction of multiple sound sources, wind currents, and temperature. These limitations make it difficult to create sound scenes in a variety of virtual environments because they only generate static sounds. In this paper, we propose a method for efficiently constructing a sound map in a situation where multiple sounds are placed, and a method for efficiently controlling the movement of an agent through it. In addition, we propose a method for controlling sound propagation by considering wind currents and temperature. The method proposed in this paper can be utilized in various fields such as metaverse environment design and crowd simulation, as well as games that can improve content immersion based on sound.

• Convergence Security Journal
• /
• v.22 no.4
• /
• pp.169-178
• /
• 2022

In general, organizations operating multi-domain networks find it difficult to represent and manage multiple domain net works on a single screen space. Instead, most of them are managed with multiple screens visualizing network topology by domain or partitioning one screen area into multiple domains. We propose an efficient method to visualize the topology using only minimal connection information between domain-agnostic nodes in this work. This method visualizes the topology by utilizing centrality indices representing the influence of nodes in the network. Furthermore, the method dynamically segments the entire node's display area using virtual Root nodes to auto-separate domains and weights of child nodes and placing nodes in 3D space. Thus, although it is a straightforward method, the multi-domain network topology can be visualized with only minimal connection information between nodes.