• Journal of the Korean Mathematical Society
• /
• v.35 no.2
• /
• pp.281-294
• /
• 1998

In this paper, we extend the G-sequence of a CW-pair to the G-sequence of a map and show the existence of a map with nonexact G-sequence. We also give an example of a finite CW-pair with nontrivial $\omega$-homology in high order.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.796-799
• /
• 1999

In this paper, we propose an inference method for understanding intention of obstacle for collision avoidance using the grid-type map. In order to represent the environment using ultrasonic sensors, the grid-type map is first constructed. Then we detect the obstacle and infer the intention for collision avoidance using the CLA(Centroid of Largest Area) point of the grid-type map. To verify the proposed method, some experiments are performed.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.1182-1186
• /
• 2003

Noise map is becoming an increasingly important tool supporting noise policy. In order to main am a quiet environment of urban areas, noise map was developed by using GIS technique which combines geographic and noise informations with a database management system. By evaluating various methods of the spatial anal: sis, it was concluded that the inverse distance weighted method gave the best results and was applied to develope the noise maps of road noise.

• Communications of the Korean Mathematical Society
• /
• v.37 no.2
• /
• pp.607-629
• /
• 2022

In this paper, we give the necessary and sufficient condition for the conformal mapping ϕ : (ℝⁿ, g₀) → (Nⁿ, h) (n ≥ 3) to be triharmonic where we prove that the gradient of its dilation is a solution of a fourth-order elliptic partial differential equation. We construct some examples of triharmonic maps which are not biharmonic and we calculate the trace of the stress-energy tensor associated with the triharmonic maps.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.2
• /
• pp.156-162
• /
• 2012

This paper presents differences of road traffic noise maps were generated by using the draft map and two digital maps with different versions. As a first step, the calculation of the areas of excessive noise exposure was made for the draft map and each digital map version. Subsequently, the areas of excessive noise exposure were compared so as to determine how different from each other. Then, comparison of the populations exposed to excessive noise was also conducted in the same way. It was found that the most accurate noise map was obtained when using the combination of the draft map containing all attribute information and the digital map Ver 2.0. This result indicates that more information on the height and the number of floors of the individual building is required in order to obtain more accurate population exposed to excessive noise, thus creating a more accurate noise map.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.5
• /
• pp.2189-2196
• /
• 2015

Stereo matching algorithm is usually used to obtain a disparity map from a pair of images. However, the disparity map obtained by using stereo matching contains lots of noise and error regions. In this paper, we propose a virtual-view synthesis algorithm using disparity refinement in order to improve the quality of the synthesized image. First, the error region is detected by examining the consistency of the disparity maps. Then, motion information is acquired by applying optical flow to texture component of the image in order to improve the performance. Then, the occlusion region is found using optical flow on the texture component of the image in order to improve the performance of the optical flow. The refined disparity map is finally used for the synthesis of the virtual view image. The experimental results show that the proposed algorithm improves the quality of the generated virtual-view.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.11
• /
• pp.1170-1174
• /
• 2014

This paper suggests using the ICP (Iterative Closet Point) algorithm to compensate a two-dimensional map. ICP algorithm is a typical algorithm method using matching distance data. When building a two-dimensional map, using data through the value of a laser scanner, it occurred warping and distortion of a two-dimensional map because of the difference of distance from the value of the sensor. It uses the ICP algorithm in order to reduce any error of line. It validated the proposed method through experiment involving matching a two-dimensional map based reference data and measured the two-dimensional map.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.129.3-129
• /
• 2001

In this paper, a novel navigation method is presented for the cleaning robot in the unknown workspace. In order to do this, we propose a new map representation method and a complete coverage navigation method. First, we discuss a triangular cell map representation which makes the cleaning robot navigate with shorter path and increased flexibility than a rectangular cell map representation. Then we proposed a complete coverage navigation and map construction method which the cleaning robot can navigate the complete workspace although it has perfectly no information about environment. Finally, we evaluate the performance of our proposed triangular cell map comparing to that of the rectangular cell map via the existing ...

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.433-436
• /
• 2008

A demand on the spatial data management has been rapidly increased with the introduction and diffusion process of ITS, Telematics, and Wireless Sensor Network, and many different people use the digital map that offers various thematic spatial data. Spatial data for digital map can manage to tile-based and feature-based data. The existing tile-based digital map management systems have difficult problems of data construction, history management, and updating based on a spatial object. In order to solve these problems, this paper proposed the data model for the feature-based digital map management system that is designed for feature-based seamless map, history management, real-time updating of spatial data, and analyzed the validity and utility of the proposed model.

• Proceedings of the KIEE Conference
• /
• 2001.07d
• /
• pp.2656-2659
• /
• 2001

본 논문은 교사 있는 학습기의 Kohonen Feature Map에 고차 뉴런을 도입, 고차 뉴런을 이용한 Kohonen의 자기 조직화 맵을 제안한다. 일반적인 Kohonen Feature Map의 특징은 입력신호를 받아 출력 면(Kohonen Feature Map) 내의 특정한 위치 주위에 집중하는 메커니즘으로 즉, 국소집중 반응을 구하는 구조이다. 본 논문에서는 종래형의 Kohonen Feature Map의 특징을 보유하며 교사 있는 학습기의 Kohonen Feature Map에 고차 뉴런을 도입하여 국소집중반응 및 특징 축출이 용이하도록 네트워크 구조를 개선한 것이다. 특히, 일차 뉴런의 문제점인 비선형 분리 문제에 대하여 교사 있는 학습기의 Kohonen Feature Map의 입력층에 고차 뉴런을 도입함으로 비선형 분리 가능한 형태의 네트워크 구조로 형성하였다. 그러나, 일반적인 고차 뉴런의 문제점을 보안하기 위해 본 논문에서는 오직 2차 뉴런만을 생성하였으며 중복되는 뉴런을 최대한 억제하였다. 본 제안 모델의 특성을 살펴보기 위해 XOR문제와 20개의 Alphabet을 식별하는 패턴인식 시뮬레이션을 했으며, 본 제안 모델의 범화능력을 알아보기 위하여 Mirror Symmetry를 사용하여 계산기 시뮬레이션을 했다. 그 결과, 본 제안 모델이 종래형의 네트워크 구조보다 뛰어난 인식률을 얻을 수 있었다.