• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.711-716
• /
• 2006

Since the introduction of digital camera to the mass market, the number of digital photos owned by an individual is growing at an alarming rate. This phenomenon naturally leads to the issues of difficulties while searching and browsing in the personal digital photo archive. Traditional approach typically involves content-based image retrieval using computer vision algorithms. However, due to the performance limitations of these algorithms, at least on the casual digital photos taken by non-professional photographers, more recent approaches are centered on time-based clustering algorithms, analyzing the shot times of photos. These time-based clustering algorithms are based on the insight that when these photos are clustered according to the shot-time similarity, we have "event clusters" that will help the user browse through her photo archive. It is also reported that one of the remaining problems with the time-based approach is that people perceive events in different scales. In this paper, we present an adaptive time-based clustering algorithm that exploits the usage history of digital photos in order to infer the user's preference on the event granularity. Experiments show significant performance improvements in the clustering accuracy.

• Journal of KIISE:Software and Applications
• /
• v.36 no.2
• /
• pp.169-177
• /
• 2009

In this paper, we propose a new shot boundary detection method which is optimized for news video story parsing. This new news shot boundary detection method was designed to satisfy all the following requirements: 1) minimizing the incorrect data in data set for anchor shot detection by improving the recall ratio 2) detecting abrupt cuts and gradual transitions with one single algorithm so as to divide news video into shots with one scan of data set; 3) classifying shots into static or dynamic, therefore, reducing the search space for the subsequent stage of anchor shot detection. The proposed method, based on singular value decomposition with incremental clustering and mercer kernel, has additional desirable features. Applying singular value decomposition, the noise or trivial variations in the video sequence are removed. Therefore, the separability is improved. Mercer kernel improves the possibility of detection of shots which is not separable in input space by mapping data to high dimensional feature space. The experimental results illustrated the superiority of the proposed method with respect to recall criteria and search space reduction for anchor shot detection.

• Journal of KIISE:Software and Applications
• /
• v.27 no.5
• /
• pp.529-542
• /
• 2000

Recent years, the use of multimedia information is rapidly increasing, and the video media is the most rising one than any others, and this field Integrates all the media into a single data stream. Though the availability of digital video is raised largely, it is very difficult for users to make the effective video access, due to its length and unstructured video format. Thus, the minimal interaction of users and the explicit definition of video structure is a key requirement in the lately developing image and video management systems. This paper defines the terms and hierarchical video structure, and presents the system, which construct the clustering-based video hierarchy, which facilitate users by browsing the summary and do a random access to the video content. Instead of using a single feature and domain-specific thresholds, we use multiple features that have complementary relationship for each other and clustering-based methods that use normalization so as to interact with users minimally. The stage of shot boundary detection extracts multiple features, performs the adaptive filtering process for each features to enhance the performance by eliminating the false factors, and does k-means clustering with two classes. The shot list of a result after the proposed procedure is represented as the video hierarchy by the intelligent unsupervised clustering technique. We experimented the static and the dynamic movie videos that represent characteristics of various video types. In the result of shot boundary detection, we had almost more than 95% good performance, and had also rood result in the video hierarchy.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.74-83
• /
• 2000

There is a rapid increase in the use of digital video information in recent years. Especially, user requires the environment which retrieves video from passive access to active access, to be more efficiently. we need to implement video retrieval system including video parsing, clustering, and browsing to satisfy user's requirement. In this paper, we first divide video sequence to shots which are primary unit for automatic indexing, using a hybrid method with mixing histogram method and pixel-based method. After the shot boundaries are detected, corresponding key frames can be extracted. Key frames are very important portion because they help to understand overall contents of video. In this paper, we first analyze camera operation in video and then select different number of key frames depend on shot complexity. At last, we compose panorama images from shots which are containing panning or tilting in order to provide more useful and understandable browsing environment to users.

• Journal of Internet Computing and Services
• /
• v.23 no.2
• /
• pp.45-52
• /
• 2022

With the development of artificial intelligence analysis methods, especially machine learning, various fields are widely expanding their application ranges. However, in the case of classical music, there still remain some difficulties in applying machine learning techniques. Genre classification or music recommendation systems generated by deep learning algorithms are actively used in general music, but not in classical music. In this paper, we attempted to classify opera among classical music. To this end, an experiment was conducted to determine which criteria are most suitable among, composer, period of composition, and emotional atmosphere, which are the basic features of music. To generate emotional labels, we adopted zero-shot classification with four basic emotions, 'happiness', 'sadness', 'anger', and 'fear.' After embedding the opera libretto with the doc2vec processing model, the optimal number of clusters is computed based on the result of the elbow method. Decided four centroids are then adopted in k-means clustering to classify unsupervised libretto datasets. We were able to get optimized clustering based on the result of adjusted rand index scores. With these results, we compared them with notated variables of music. As a result, it was confirmed that the four clusterings calculated by machine after training were most similar to the grouping result by period. Additionally, we were able to verify that the emotional similarity between composer and period did not appear significantly. At the end of the study, by knowing the period is the right criteria, we hope that it makes easier for music listeners to find music that suits their tastes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.149-150
• /
• 2012

This paper presents a shot boundary detection method based on the global decision tree that allows for extraction of boundaries of high variations occurring due to camera breaks from frame difference values. For a start, difference values between frames are calculated through local X2-histogram and normalization. Next, the distances between difference values are calculated through normalization.

• Journal of the Korea Society for Simulation
• /
• v.29 no.1
• /
• pp.47-55
• /
• 2020

This paper presents a real-time autonomous computation of shot numbers and aiming points against multiple soft targets on grounds by applying an unsupervised learning, k-mean clustering and Monte carlo simulation. For this computation, a 100 × 200 square meters size of virtual battlefield is created where an augmented enemy infantry platoon unit attacks, defences, and is scatted, and a virtual weapon with a lethal range of 15m is modeled. In order to determine damage types of the enemy unit: no damage, light wound, heavy wound and death, Monte carlo simulation is performed to apply the Carlton damage function for the damage effect of the soft targets. In addition, in order to achieve the damage effectiveness of the enemy units in line with the commander's intention, the optimal shot numbers and aiming point locations are calculated in less than 0.4 seconds by applying the k-mean clustering and repetitive Monte carlo simulation. It is hoped that this study will help to develop a system that reduces the decision time for 'detection-decision-shoot' process in battalion-scaled combat units operating Dronebot combat system.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.3
• /
• pp.112-119
• /
• 2001

This paper proposes an adaptive reclosing scheme which is based on the classification of fault patterns. In case that the first reclosing is unsuccessful in distribution system employing with two-shot reclosing scheme, the proposed method can determine whether the second reclosing will be attempted of not. If the first reclosing is unsuccessful two fault currents can be measured before the second reclosing is attempted, where these two fault currents are utilized for an adaptive reclosing scheme. Total harmonic distortion and RMS are used for extracting the characteristics of two fault currents. And the pattern of two fault currents is respectively classified using a mountain clustering method a minimum-distance classifier. Mountain clustering method searches the cluster centers using the acquired past data. And minimum-distance classifier is used for classifying the measured two currents into one of the searched centers respectively. If two currents have the different pattern it is interpreted as temporary fault. But in case of the same pattern, the occurred fault is interpreted as permanent. The proposed method was tested for the fault data which had been measured in KEPCO's distribution system, and the test results can demonstrate the effectiveness of the adaptive reclosing scheme.

• Journal of Intelligence and Information Systems
• /
• v.7 no.2
• /
• pp.35-49
• /
• 2001

Over the years, cluster analysis has become a popular tool for marketing and segmentation researchers. There are various methods for cluster analysis. Among them, K-means partitioning cluster analysis is the most popular segmentation method. However, because the cluster analysis is very sensitive to the initial configurations of the data set at hand, it becomes an important issue to select an appropriate starting configuration that is comparable with the clustering of the whole data so as to improve the reliability of the clustering results. Many programs for K-mean cluster analysis employ various methods to choose the initial seeds and compute the centroids of clusters. In this paper, we suggest a methodology to evaluate various clustering programs. Furthermore, to explore the usability of the methodology, we evaluate four clustering programs by using the methodology.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.16 no.3
• /
• pp.161-166
• /
• 2023

In recent years, new and variant hacking of binary codes has increased, and the limitations of techniques for detecting malicious codes in source programs and defending against attacks are often exposed. Advanced software security vulnerability detection technology using machine learning and deep learning technology for binary code and defense and response capabilities against attacks are required. In this paper, we propose a malware clustering method that groups malware based on the characteristics of the taint information after entering dynamic taint information by tracing the execution path of binary code. Malware vulnerability detection was applied to a three-layered Few-shot learning model, and F1-scores were calculated for each layer's CPU and GPU. We obtained 97~98% performance in the learning process and 80~81% detection performance in the test process.