• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2019년도 추계학술대회
• /
• 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.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송공학회 2009년도 IWAIT
• /
• 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.

• 한국철도학회논문집
• /
• 제9권1호
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 하계학술대회 논문집 D
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 추계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• 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
• /
• 제12권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.

• 한국지능시스템학회논문지
• /
• 제16권5호
• /
• pp.594-600
• /
• 2006

본 논문은 전기철도차량의 운행시간 여유분을 고려하여 에너지 소비를 최소화하는 경제운전 패턴을 찾는 방안을 제시하였다. 경제최고속도와 타행끝점속도를 주행패턴의 변수로 사용하여 퍼지모델을 구축하고 이를 대상으로 진화 탐색을 적용하여 최적의 경제운전 패턴을 찾아낼 수 있으며, 사례연구를 통해 이를 입증하였다.

• Journal of Information Processing Systems
• /
• 제15권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
• /
• 제44권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.

• 한국컴퓨터정보학회논문지
• /
• 제18권9호
• /
• pp.177-187
• /
• 2013

연관 규칙 탐사는 다양한 분야에서 널리 쓰이는 데이터 마이닝 기법으로 트랜잭션 데이터에 포함된 이산적인 항목들 간의 인과관계를 추출하는데 목적을 둔다. 하지만 분석자들은 때로 방대한 양의 데이터에서 추출된 많은 연관규칙들을 해석하고 활용하는데 곤란을 겪기도 한다. 이러한 문제점을 해결하기 위하여 본 논문에서는 주어진 트랜잭션 데이터에서 유용한연관 규칙을 탐색하기 위한 새로운 방법인 HTM 접근법을 제안하고자 한다. HTM 접근법은 크게 계층 군집, 테이블 뷰 및 모자이크 플롯의 세 가지 단계로 구성되며, 각 단계는 분석자들에게 적절한 시각적 표현을 제공한다. 예시를 위해 본 논문에서는 상기 접근법을 건강 검진 결과 데이터 분석에 적용하였으며, 실험결과 HTM 접근법을 통해 분석자들은 유용한 규칙들을 보다 효과적으로 탐색할 수 있을 것으로 기대된다.