• 로봇학회논문지
• /
• 제19권2호
• /
• pp.188-195
• /
• 2024

This paper proposes a photorealistic real-time dense 3D mapping system that utilizes a neural network-based image enhancement method and mesh-based map representation. Due to the characteristics of the underwater environment, where problems such as hazing and low contrast occur, it is hard to apply conventional simultaneous localization and mapping (SLAM) methods. At the same time, the behavior of Autonomous Underwater Vehicle (AUV) is computationally constrained. In this paper, we utilize a neural network-based image enhancement method to improve pose estimation and mapping quality and apply a sliding window-based mesh expansion method to enable lightweight, fast, and photorealistic mapping. To validate our results, we utilize real-world and indoor synthetic datasets. We performed qualitative validation with the real-world dataset and quantitative validation by modeling images from the indoor synthetic dataset as underwater scenes.

• Kyungpook Mathematical Journal
• /
• 제55권4호
• /
• pp.933-951
• /
• 2015

In this paper, we consider the problem of convergence of an iterative algorithm for a general system of variational inequalities, a nonexpansive mapping and an ${\eta}$-strictly pseudo-contractive mapping. Strong convergence theorems are established in the framework of real Banach spaces.

• 전자공학회논문지A
• /
• 제29A권2호
• /
• pp.88-99
• /
• 1992

This paper presents an efficient method of mapping Boolean equations to a set of library gates. The proposed system performs technology mapping by graph covering. To select optimal area cover, a new cost function and local area optimization are proposed. Experimental results show that the proposed algorithm produces effective mapping using given library.

• 충청수학회지
• /
• 제19권3호
• /
• pp.263-274
• /
• 2006

In this paper, we prove the Hyers-Ulam-Rassias stability of the quadratic mapping in generalized quasi-Banach spaces, and of the quadratic mapping in generalized p-Banach spaces.

• 한국언어정보학회지:언어와정보
• /
• 제15권2호
• /
• pp.23-45
• /
• 2011

This paper proposes a statistical-based linguistic methodology for automatic mapping between large-scale heterogeneous languages resources for NLP applications in general. As a particular case, it treats automatic mapping between two large-scale heterogeneous Korean language resources: Sejong Semantic Classes (SJSC) in the Sejong Electronic Dictionary (SJD) and nouns in KorLex. KorLex is a large-scale Korean WordNet, but it lacks syntactic information. SJD contains refined semantic-syntactic information, with semantic labels depending on SJSC, but the list of its entry words is much smaller than that of KorLex. The goal of our study is to build a rich language resource by integrating useful information within SJD into KorLex. In this paper, we use both linguistic and statistical methods for constructing an automatic mapping methodology. The linguistic aspect of the methodology focuses on the following three linguistic clues: monosemy/polysemy of word forms, instances (example words), and semantically related words. The statistical aspect of the methodology uses the three statistical formulae ${\chi}^2$, Mutual Information and Information Gain to obtain candidate synsets. Compared with the performance of manual mapping, the automatic mapping based on our proposed statistical linguistic methods shows good performance rates in terms of correctness, specifically giving recall 0.838, precision 0.718, and F1 0.774.

• ETRI Journal
• /
• 제20권4호
• /
• pp.327-345
• /
• 1998

This paper deals with the problem of one-to-one mapping of 2$^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize the total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. First we show that the mapping problem in a hypercube multicomputer can be transformed into the problem of finding a set of maximum cutsets on a given task graph using a graph modification technique. Then we propose a repeated mapping scheme, using an existing graph bipartitioning algorithm, for the effective mapping of task modules onto the processors of a hypercube multicomputer. The repeated mapping scheme is shown to be highly effective on a number of test task graphs; it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increases. Our repeated mapping scheme is shown to be very effective for regular graphs, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mappings on almost all the regular task graphs considered.

• 한국측량학회:학술대회논문집
• /
• 한국측량학회 2003년도 추계학술발표회 논문집
• /
• pp.281-286
• /
• 2003

Since National Geographic Information System was started, paper maps have been made with computer aided editing of digital map, instead of etching map-size negative film. Automated paper mapping system's necessity is growing more and more, because digital map has changed into Ver.2.0 which include attributes of feature. Therefore, in this study we try to analyze correlation of the digital map feature code and the 1/5,000 topographic map specifications which is necessary for paper mapping automatization using digital map Ver.2.0, and try to develop fundamental modules which will play a core role in automated paper mapping system.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2012년도 추계학술대회
• /
• pp.447-449
• /
• 2012

사실적인 3D game을 만들기 위해 여러 가지 필수 요소가 있는데, 그 중 큰 비중을 차지하고 있는 것이 바로 mapping이다. Mapping은 모델링만으로 감당할 수 없는, 혹은 감당하기 힘든 디테일을 쉽게 추가할 수 있으며 파일의 용량을 줄여 게임 엔진 상에 구현하는데 부하를 줄여줄 수 있다. Mapping의 원리는 3D object에 2D 이미지를 정확히 투영시키는 것인데, 2D와 3D의 기본적 속성 차이 때문에 100% 1:1 매치가 되지 않는다는 문제가 있다. 이를 해결하기 위해 각종 mapping 방법이 개발되고 사용되고 있다. 본 논문에서는 이런 각종 Mapping 방법의 특징과 장단점에 대해 비교 분석하고 어떤 방법이 game개발에 있어서 가장 효율적인지 알아보도록 하겠다.

• 대한수학회지
• /
• 제52권6호
• /
• pp.1179-1194
• /
• 2015

In this paper, we introduce a new iterative algorithm for finding a common element of the set of solutions of a generalized mixed equilibrium problem related to a continuous monotone mapping, the set of solutions of a variational inequality problem for a continuous monotone mapping, and the set of fixed points of a continuous pseudocontractive mapping in Hilbert spaces. Weak convergence for the proposed iterative algorithm is proved. Our results improve and extend some recent results in the literature.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.359-362
• /
• 2003

In PDP(Plasma Display Panel), sub-field method is used to implement gray scale. Each sub-field has different periods. And Every gray level has information of which sub-field has to be displayed. This is called sub-field mapping. There are several sub-field mapping values in some gray levels. So, it is possible to select best choice in this paper, we propose new sub field mapping method using a fuzzy inference system to select best sub-field mapping values in accordance with input image and environment temperature. In order to implement fuzzy system, we used MATLAB fuzzy inference editor.