• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.259-260
• /
• 2019

MPEG-I Visual group is actively working on enhancing immersive experiences with up to six degree of freedom (6DoF). In virtual space of 3DoF+, which is defined as an extension of 360 video with limited changes of the view position in a sitting position, looking at the scene from another viewpoint (another position in space) requires rendering additional viewpoints using multiple videos taken at the different locations at the same time. In the MPEG-I Visual workgroup, methods of efficient coding and transmission of 3DoF+ video are being studied, and they released Test Model for Immersive Media (TMIV) recently. This paper presents the enhanced clustering method which can pack the patches into atlas efficiently in TMIV. The experimental results show that the proposed method achieves significant BD-rate reduction in terms of various end-to-end evaluation methods.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.164-169
• /
• 2009

As one of the most interesting scenes, landmarks constitute a large percentage of the vast amount of scene images available on the web. On the other hand, a specific "landmark" usually has some characteristics that distinguish it from surrounding scenes and other landmarks. These two observations make the task of accurately estimating geographic information from a landmark image necessary and feasible. In this paper, we propose a method to identify landmark location by means of landmark recognition in view of significant viewpoint, illumination and temporal variations. We use GPS-based clustering to form groups for different landmarks in the image dataset. The images in each group rather fully express the possible views of the corresponding landmark. We then use a combination of edge and color histogram to match query to database images. Initial experiments with Zubud database and our collected landmark images show that is feasible.

• Journal of the Korean Society for Railway
• /
• v.9 no.1 s.32
• /
• pp.76-80
• /
• 2006

The Optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model have been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme are utilized, respectively. As a result, two meta-models for trip time and energy consumption were constructed. The optimization to search an economical running pattern was achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2453-2455
• /
• 2003

We propose a path planning method to reduce the inspection time of AOI (automatic optical inspection) machines in SMT (surface mount technology) in-line system. Inspection windows of board should be clustered to consider the FOV (field-of-view) of camera. The number of clusters is desirable to be minimized in order to reduce the overall inspection time. We newly propose a genetic algorithm to minimize the number of clusters for a given board. Comparative simulation results are presented to verify the usefulness of proposed algorithm.

• Proceedings of the KIEE Conference
• /
• 2005.10c
• /
• pp.238-240
• /
• 2005

The Optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model have been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme are utilized, respectively. As a result, two meta-models for trip time and energy consumption were constructed. The optimization to search an economical running pattern was achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.305-312
• /
• 2005

In the cluster analysis, Hotelling's $T^2$ can be used to estimate the unknown number of clusters based on the idea of multiple comparison procedure. Especially, its threshold is obtained according to the probability of committing the type one error. Examples are used to compare Hotelling's $T^2$ with other classical location test statistics such as Sum-of-Squared Error and Wilks' $\Lambda$ The hierarchical clustering is used to reveal the underlying structure of the data. Also related criteria are reviewed in view of both the between variance and the within variance.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.594-600
• /
• 2006

The optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model has been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme ate utilized, respectively. As a result, two meta-models for trip time and energy consumption are constructed. The optimization to search an economical running pattern is achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

• Journal of Information Processing Systems
• /
• v.15 no.5
• /
• pp.1055-1067
• /
• 2019

In view of the deficiencies of existing weighted similarity indexes, a hierarchical clustering method initialize-expand-merge (IEM) is proposed based on the similarity of common neighbors for community discovery in weighted networks. Firstly, the similarity of the node pair is defined based on the attributes of their common neighbors. Secondly, the most closely related nodes are fast clustered according to their similarity to form initial communities and expand the communities. Finally, communities are merged through maximizing the modularity so as to optimize division results. Experiments are carried out on many weighted networks, which have verified the effectiveness of the proposed algorithm. And results show that IEM is superior to weighted common neighbor (CN), weighted Adamic-Adar (AA) and weighted resources allocation (RA) when using the weighted modularity as evaluation index. Moreover, the proposed algorithm can achieve more reasonable community division for weighted networks compared with cluster-recluster-merge-algorithm (CRMA) algorithm.

• Molecules and Cells
• /
• v.44 no.7
• /
• pp.433-443
• /
• 2021

Multi-omics approaches are novel frameworks that integrate multiple omics datasets generated from the same patients to better understand the molecular and clinical features of cancers. A wide range of emerging omics and multi-view clustering algorithms now provide unprecedented opportunities to further classify cancers into subtypes, improve the survival prediction and therapeutic outcome of these subtypes, and understand key pathophysiological processes through different molecular layers. In this review, we overview the concept and rationale of multi-omics approaches in cancer research. We also introduce recent advances in the development of multi-omics algorithms and integration methods for multiple-layered datasets from cancer patients. Finally, we summarize the latest findings from large-scale multi-omics studies of various cancers and their implications for patient subtyping and drug development.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.9
• /
• pp.177-187
• /
• 2013

Association rule mining is a popular data mining technique with a wide range of application domains, and aims to extract the cause-and-effect relations between the discrete items included in transaction data. However, analysts sometimes have trouble in interpreting and using the plethora of association rules extracted from a large amount of data. To address this problem, this paper aims to propose a novel approach called HTM for extracting the interesting association rules from given transaction data. The HTM approach consists of three main steps, hierarchical clustering, table-view, and mosaic plot, and each step provides the analysts with appropriate visual representation. For illustration, we applied our approach for analyzing the mass health examination data, and the result of this experiment reveals that the HTM approach help the analysts to find the interesting association rules in more effective way.