• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.823-834
• /
• 2004

In this research, the similarity search algorithms are provided for large video data streams. A video stream that consists of a number of frames can be expressed by a sequence in the multidimensional data space, by representing each frame with a multidimensional vector By analyzing various characteristics of the sequence, it is partitioned into multiple video segments and clusters which are represented by hyper-rectangles. Using the hyper-rectangles of video segments and clusters, similarity functions between two video streams are defined, and two similarity search algorithms are proposed based on the similarity functions algorithms by hyper-rectangles and by representative frames. The former is an algorithm that guarantees the correctness while the latter focuses on the efficiency with a slight sacrifice of the correctness Experiments on different types of video streams and synthetically generated stream data show the strength of our proposed algorithms.

• Journal of the Korea Society of Computer and Information
• /
• v.27 no.7
• /
• pp.93-100
• /
• 2022

In the era of information overload on the Internet, the recommendation system, which is an indispensable function, is a service that recommends products that a user may prefer, and has been successfully provided in various commercial sites. Recently, studies to reflect the rating time of items to improve the performance of collaborative filtering, a representative recommendation technique, are active. The core idea of these studies is to generate the recommendation list by giving an exponentially lower weight to the items rated in the past. However, this has a disadvantage in that a time function is uniformly applied to all items without considering changes in users' preferences according to the characteristics of the items. In this study, we propose a time-aware collaborative filtering technique from a completely different point of view by developing a new similarity measure that integrates the change in similarity values between items over time into a weighted sum. As a result of the experiment, the prediction performance and recommendation performance of the proposed method were significantly superior to the existing representative time aware methods and traditional methods.

• Journal of Software Assessment and Valuation
• /
• v.17 no.2
• /
• pp.31-38
• /
• 2021

In order to analyze the similarity of the source code object material, the source code on both sides must be able to be compiled and executed. In particular, in the case of hardware-integrated software, it is necessary to check whether the hardware interface matches. However, currently, the source code is provided in an incomplete state which is not original of source code used in developing steps. The complainant confirms that the executing characteristics are similar to their own in the expression and function of the output, and request an evaluation. When a source code compilation error occurs during the evaluation process, the experts draw a flowchart of the source code and applies the method of tracing the code flow for each function as indirect method. However, this method is indirect and the subjective judgment is applied, so there is concern about the contention of objectivity in the similarity evaluation result. In this paper, the problems of unverified source code similarity analysis and improvement directions are dealt with, through the analysis cases of source code disputes applied to embedded systems.

• Journal of Korean Society of Rural Planning
• /
• v.23 no.2
• /
• pp.67-74
• /
• 2017

Migration is defined as the movement of people between residential places, and represents interactions between regions. Changes in migration involve changes in both the number of migrants toward/from regions and migration patterns across regions. However, most migration studies have focused only on the change in migrants, while no empirical study captures changes in migration patterns. In this paper, I present a function using the cosine similarity to measure changes in migration patterns, and apply it to 2001-2016 migration data of Korea. The results show that the migration patterns of Korea shifted in 2007, resulting in two distinct clusters. Local areas experienced various migration pattern changes despite few changes in the number of migrants.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.32 no.3
• /
• pp.127-134
• /
• 2009

RAM(Reliability, Availability, Maintainability) is important performance factor to keep combat readiness and optimize operational and maintenance cost of weapon systems. This paper discusses the method to establish RAM for combat readiness by using field failure data from similarity equipments. Operational availability is estimated from a binomial distribution function of user's operational conditions such as combat readiness preservation probability, operational rate, operational availability and total number of equipment. Reliability and maintainability is estimated from field failure data from similarity equipment to accomplish operational availability. The effectiveness of established RAM is verified through analysis of combat readiness preservation probability and mission reliability. A case study of weapon system illustrates the process of the proposed method.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1274-1276
• /
• 1993

We have designed a multiple-valued fuzzy Approximate Analogical-Reseaning system (AARS). The system uses a similarity measure of fuzzy sets and a threshold of similarity ST to determine whether a rule should be fired, with a Modification Function inferred from the Similarity Measure to deduce a consequent. Multiple-valued basic fuzzy blocks are used to construct the system. A description of the system is presented to illustrate the operation of the schema. The results of simulations show that the system can perform about 3.5 x 106 inferences per second. Finally, we compare the system with Yamakawa's chip which is based on the Compositional Rule of Inference (CRI) with Mamdani's implication.

• Journal of Korean Society for Geospatial Information Science
• /
• v.24 no.1
• /
• pp.89-98
• /
• 2016

In this paper, we proposed an automated areal feature matching method based on geometric similarity without user intervention and is applied into areal features of many-to-many relation, for confusion of spatial data-sets of different scale and updating cycle. Firstly, areal feature(node) that a value of inclusion function is more than 0.4 was connected as an edge in adjacency matrix and candidate corresponding areal features included many-to-many relation was identified by multiplication of adjacency matrix. For geometrical matching, these multiple candidates corresponding areal features were transformed into an aggregated polygon as a convex hull generated by a curve-fitting algorithm. Secondly, we defined matching criteria to measure geometrical quality, and these criteria were changed into normalized values, similarity, by similarity function. Next, shape similarity is defined as a weighted linear combination of these similarities and weights which are calculated by Criteria Importance Through Intercriteria Correlation(CRITIC) method. Finally, in training data, we identified Equal Error Rate(EER) which is trade-off value in a plot of precision versus recall for all threshold values(PR curve) as a threshold and decided if these candidate pairs are corresponding pairs or not. To the result of applying the proposed method in a digital topographic map and a base map of address system(KAIS), we confirmed that some many-to-many areal features were mis-detected in visual evaluation and precision, recall and F-Measure was highly 0.951, 0.906, 0.928, respectively in statistical evaluation. These means that accuracy of the automated matching between different spatial data-sets by the proposed method is highly. However, we should do a research on an inclusion function and a detail matching criterion to exactly quantify many-to-many areal features in future.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.12
• /
• pp.5464-5484
• /
• 2016

Few samples face recognition has become a highly challenging task due to the limitation of available labeled samples. As two popular paradigms in face image representation, sparse component analysis is highly robust while parts-based paradigm is particularly flexible. In this paper, we propose a probabilistic generative model to incorporate the strengths of the two paradigms for face representation. This model finds a common spatial partition for given images and simultaneously learns a sparse component analysis model for each part of the partition. The two procedures are built into a probabilistic generative model. Then we derive the score function (i.e. feature mapping) from the generative score space. A similarity measure is defined over the derived score function for few samples face recognition. This model is driven by data and specifically good at representing face images. The derived generative score function and similarity measure encode information hidden in the data distribution. To validate the effectiveness of the proposed method, we perform few samples face recognition on two face datasets. The results show its advantages.

• Journal of the Society of Naval Architects of Korea
• /
• v.59 no.2
• /
• pp.72-79
• /
• 2022

Deep-learning-based Super-Resolution (SR) methods were evaluated to reconstruct pressure fields with a high resolution from low-resolution images taken from a coarse grid simulation. In addition to a canonical SRCNN(super-resolution convolutional neural network) model, two modified models from SRCNN, adding an activation function (ReLU or Sigmoid function) to the output layer, were considered in the present study. High resolution images obtained by three models were more vivid and reliable qualitatively, compared with a conventional super-resolution method of bicubic interpolation. A quantitative comparison of statistical similarity showed that SRCNN model with Sigmoid function achieved best performance with less dependency on original resolution of input images.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.5
• /
• pp.476-486
• /
• 2022

Synthetic dynamic infrared image generation from the given virtual environment is being the primary goal to simulate the output of the infra-red(IR) camera installed on a vehicle to evaluate the control algorithm for various search & reconnaissance missions. Due to the difficulty to obtain actual IR data in complex environments, Artificial intelligence(AI) has been used recently in the field of image data generation. In this paper, CycleGAN technique is applied to obtain a more realistic synthetic IR image. We added the Structural Similarity Index Measure(SSIM) loss function to the L1 loss function to generate a more realistic synthetic IR image when the CycleGAN image is generated. From the simulation, it is applicable to the guided-missile flight simulation tests by using the synthetic infrared image generated by the proposed technique.