• Journal of the Korean Institute of Intelligent Systems
• /
• v.13 no.4
• /
• pp.455-460
• /
• 2003

A new cluster validity index is proposed that determines the optimal partition and optimal number of clusters for fuzzy partitions obtained from the fuzzy c-means algorithm. The proposed validity index exploits an overlap measure and a separation measure between clusters. The overlap measure is obtained by computing an inter-cluster overlap. The separation measure is obtained by computing a distance between fuzzy clusters. A good fuzzy partition is expected to have a low degree of overlap and a larger separation distance. Testing of the proposed index and nine previously formulated indexes on well-known data sets showed the superior effectiveness and reliability of the proposed index in comparison to other indexes.

• The KIPS Transactions:PartD
• /
• v.12D no.2 s.98
• /
• pp.233-246
• /
• 2005

To enhance the user response time of content-based retrieval service for multimedia information, several multi-dimensional index schemes have been proposed. M-tree, a well-known multidimensional index scheme is of metric space access method, and is based on the distance between objects in the metric space. However, since the overlap between index spaces of nodes might enlarge the number of nodes of M-tree accessed for query processing, the user response time for content-based multimedia information retrieval grows longer. In this paper, we propose a node split algorithm which is able to reduce the sire of overlap between index spaces of nodes in M-tree. In the proposed scheme, we choose a virtual center point as the routing object and entry redistribution as the postprocessing after node split in order to reduce the radius of index space of a node, and finally in order to reduce the overlap between the index spaces of routing nodes. From the experimental results, we can see the proposed split algorithm reduce the overlap between index space of nodes and finally enhance the user response time for similarity-based query processing.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.1053-1056
• /
• 2010

현재 센서 네트워크 시스템을 이용한 다양한 지능형 응용들에 대한 연구가 진행되고 있다. 일반적으로 센서 네트워크는 환경정보를 수집하기 위해 많이 활용된다. 최근 더욱 상세한 환경 모니터링이나 고품질 데이터에 대한 요구로 인해 멀티미디어 데이터의 요구가 증가하고 있다. 본 논문에서는 Zigbee 기반 센서 네트워크의 낮은 대역폭의 한계를 극복하고, 실시간 멀티미디어 데이터 전송을 위한 라우팅 기법에 대한 연구를 수행한다. 기존에 제안된 멀티미디어 데이터 전송 기법의 경우 비효율적인 다중경로 설정단계로 인해 경로설정 시간의 지연이 발생하고, Zigbee 의 대역폭 한계로 인해 낮은 데이터 전송속도를 보인다. 본 논문은 기존 기법의 대역폭 문제를 해결하는 블루투스와 Zigbee 하이브리드 라우팅 구조를 제안한다. 또한 경로설정 시간 지연 문제를 해결하는 경쟁기반 비-중첩 다중 경로 설정 기법을 제안한다. 제안하는 기법의 우수성을 비교평가하기 위해 시뮬레이션을 수행하였다. 그 결과 약 78% 지연시간이 감소되었으며, 통신 속도가 약 6.9 배 증가하였다.

• Journal of KIISE:Information Networking
• /
• v.34 no.4
• /
• pp.239-245
• /
• 2007

New multimedia services over the cellular/WLAN overlay networks require different Quality of Service (QoS). In the cellular/WLAN overlay structure, the main issue of load balancing is to balance the available bandwidth among different networks. In this paper, we propose a new online network management scheme. Our proposed scheme is designed to improve bandwidth utilization by balancing the traffic load between the cellular network and WLANs. Simulation results indicate the superior performance of our proposed framework to strike the appropriate performance balance between contradictory QoS requirements under widely varying diverse traffic loads.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.2B
• /
• pp.82-89
• /
• 2008

Mobile IP is the basic solution to provide host mobility, whereas network mobility refers to the concept of collective mobility of a set of nodes. In a network mobility scenario, mobile networks can be nested in a hierarchical form. That situation is referred to a nested mobile network Nested mobile networks exhibit the pinball routing problem, which becomes worse in proportion to the number of nested levels in the hierarchy. In this paper, we propose a routing optimization scheme having backward compatibility to the basic network mobility protocol and concerning heterogeneity of nested mobile network, also we perform comparison and analysis of proposed schemes.

• Proceedings of the Optical Society of Korea Conference
• /
• 2002.07a
• /
• pp.138-141
• /
• 2002

광굴절 결정체가 홀로그래픽 저장 매개체로 이용될 수 있음이 Chen에 의해 제시된 이후, 광굴절 결정체는 대용량 광메모리로서 관심의 초점이 되었다. 그리하여 홀로그래픽 기법을 이용하여 이미지를 광굴절 결정체에 저장시키는 방법에 대한 연구가 광범위하게 이루어져 왔다. 보통 여러개의 홀로그램을 저장 매체인 광굴절 결정체에 중첩하여 저장하는 경우, 먼저 기록된 홀로그램이 뒤이어 기록되는 홀로그램들에 의해서 지워지기 때문에 먼저 기록된 홀로그램의 복원이 어려워진다. (중략)

• Journal of computational fluids engineering
• /
• v.11 no.2 s.33
• /
• pp.62-66
• /
• 2006

In this paper an automated hole-finding method for overset grids is introduced which uses recursive octree-cell division. A graphic program which enables the user to do the hole-cutting with ease is also introduced. Using this program it is found that there is an optimum combination of the level of octree division and vector calculation for the efficient and fast hole finding.

• 한국전산유체공학회:학술대회논문집
• /
• 2004.10a
• /
• pp.83-86
• /
• 2004

In this paper an automated hole-finding method for overset grids is introduced which uses recursive octree-cell division. A graphic program which enables the user to do the hole-cutting with ease is also introduced. Using this program it was found that a proper combination of the level of octree division and vector calculation should be used for efficient and fast hole finding.

• 한국방재학회:학술대회논문집
• /
• 2008.02a
• /
• pp.353-356
• /
• 2008

최근 대규모 산림재해로 인한 산림환경 훼손 및 산림 농가의 피해는 물론 산림생태계에도 나쁜 영향을 미치고 있으며 이는 사회적으로 매우 민감한 환경문제로서 국민의 주요 관심사가 되고 있다. 본 연구에서는 울진군 전체를 대상으로 GIS 및 RS 기법을 이용하여 다양한 산사태 관련 인자들을 추출 하여 이를 기반으로 GIS 중첩 및 가중치 분석을 통하여 울진군의 산사태 발생 가능 위험지역의 분포도를 작성하고자 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.2 no.1
• /
• pp.3-10
• /
• 1998

In this paper, a new superimposition scheme using a computer vision system was proposed with 7 pairs of skull and ante-mortem photographs, which were already identified through other tests and DNA fingerprints at the Korea National Institute of Scientific Investigation. At this computer vision system, an unidentified skull was caught by video-camcoder with the MPEG and a ante-mortem photograph was scanned by scanner. These two images were processed and superimposed using pixel processing. Recognition of the individual identification by anatomical references was performed on the two superimposed images. This image processing techniques for the superimposition of skull and ante-morterm photographs simplify used the previous approach taking skull photographs and developing it to the same size as the ante-mortem Photographs. This system using various image Processing techniques on computer screen, a more precise and time-saving superimposition technique could be able to be applied in the area of computer individual identification.