• Title/Summary/Keyword: a mapping

Search Result 6,701, Processing Time 0.04 seconds

Improvement of Efficient Tone-Mapping Curve using Adaptive Depth Range Coefficient (적응적 깊이 영역 변수를 활용한 효율적인 톤 매핑 커브 개선)

  • Lee, Yong-Hwan;Kim, Youngseop;Ahn, Byoung-Man
    • Journal of the Semiconductor & Display Technology
    • /
    • v.14 no.4
    • /
    • pp.92-97
    • /
    • 2015
  • The purpose of this work is to support a solution of optimizing TMO (tone mapping operator). JPEG XT Profile A and C utilize Erik Reinhard TMO that works well in most cases, however, detailed information of a scene is lost in some cases. Reinhard TMO only calculates its coefficient to have tone-mapping curve from log-average luminance, and this lead to lose details of bright and dark area of scenes in turn. Thus, this paper proposes an enhancement of the default TMO for JPEG XT Profile C to optimize tone-mapping curve. Main idea is that we divide tone mapping curve into several ranges, and set reasonable parameters for each range. By the experimental results, the proposed scheme shows and obtains better performance within a dark scene, compared to the default Reinhard TMO.

Photorealistic Real-Time Dense 3D Mesh Mapping for AUV (자율 수중 로봇을 위한 사실적인 실시간 고밀도 3차원 Mesh 지도 작성)

  • Jungwoo Lee;Younggun Cho
    • The Journal of Korea Robotics Society
    • /
    • v.19 no.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.

Design of an Effective Bump Mapping Hardware Architecture Using Angular Operation (각 연산을 이용한 효과적인 범프 매핑 하드웨어 구조 설계)

  • 이승기;박우찬;김상덕;한탁돈
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.11
    • /
    • pp.663-674
    • /
    • 2003
  • Bump mapping is a technique that represents the detailed parts of the object surface, such as a perturberance of the skin of a peanut, using the geometry mapping without complex modeling. However, the hardware implementation for bump mapping is considerable, because a large amount of per pixel computation, including the normal vector shading, is required. In this paper, we propose a new bump mapping algorithm using the polar coordinate system and its hardware architecture. Compared with other existing architectures, our approach performs bump mapping effectively by using a new vector rotation method for transformation into the reference space and minimizing illumination calculation. Consequently, our proposed architecture reduces a large amount of computation and hardware requirements.

Path Space Approach for Planning 2D Shortest Path Based on Elliptic Workspace Geometry Mapping

  • Namgung, Ihn
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.1
    • /
    • pp.92-105
    • /
    • 2004
  • A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

Multi-robot Mapping Using Omnidirectional-Vision SLAM Based on Fisheye Images

  • Choi, Yun-Won;Kwon, Kee-Koo;Lee, Soo-In;Choi, Jeong-Won;Lee, Suk-Gyu
    • ETRI Journal
    • /
    • v.36 no.6
    • /
    • pp.913-923
    • /
    • 2014
  • This paper proposes a global mapping algorithm for multiple robots from an omnidirectional-vision simultaneous localization and mapping (SLAM) approach based on an object extraction method using Lucas-Kanade optical flow motion detection and images obtained through fisheye lenses mounted on robots. The multi-robot mapping algorithm draws a global map by using map data obtained from all of the individual robots. Global mapping takes a long time to process because it exchanges map data from individual robots while searching all areas. An omnidirectional image sensor has many advantages for object detection and mapping because it can measure all information around a robot simultaneously. The process calculations of the correction algorithm are improved over existing methods by correcting only the object's feature points. The proposed algorithm has two steps: first, a local map is created based on an omnidirectional-vision SLAM approach for individual robots. Second, a global map is generated by merging individual maps from multiple robots. The reliability of the proposed mapping algorithm is verified through a comparison of maps based on the proposed algorithm and real maps.

A Study on Effects of the Concept Mapping for Biology Learning (생물학습에 개념도를 이용한 효과에 관한 연구)

  • Song, Whan-Sung;Kim, Jin-Tae;Hur, Chin-Hyu
    • Journal of The Korean Association For Science Education
    • /
    • v.19 no.3
    • /
    • pp.479-486
    • /
    • 1999
  • This study was to inquire the effectiveness of concept mapping on the learning of biology concept. In this study the achivement acquired by the students in the classes of individual concept mapping and cooperative concept mapping were compared with those of traditional lecture on "photosynthesis and plant respiration". The concept mapping teaching methods, by individuals and groups. were more effective than traditional one. The results of analysis of covariance (ANCOVA) showed that these difference were statistically significant; individual concept mapping was more effective than traditional class result(p<.008). Also the cooperative concept mapping was effective than traditional class result(p<.0001). And the cooperative concept mapping was more effective than the individual one(p<.04). So that cooperative concept mapping is the most effective method in biology class.

  • PDF

Projection mapping onto multiple objects using a projector robot

  • Yamazoe, Hirotake;Kasetani, Misaki;Noguchi, Tomonobu;Lee, Joo-Ho
    • Advances in robotics research
    • /
    • v.2 no.1
    • /
    • pp.45-57
    • /
    • 2018
  • Even though the popularity of projection mapping continues to increase and it is being implemented in more and more settings, most current projection mapping systems are limited to special purposes, such as outdoor events, live theater and musical performances. This lack of versatility arises from the large number of projectors needed and their proper calibration. Furthermore, we cannot change the positions and poses of projectors, or their projection targets, after the projectors have been calibrated. To overcome these problems, we propose a projection mapping method using a projector robot that can perform projection mapping in more general or ubiquitous situations, such as shopping malls. We can estimate a projector's position and pose with the robot's self-localization sensors, but the accuracy of this approach remains inadequate for projection mapping. Consequently, the proposed method solves this problem by combining self-localization by robot sensors with position and pose estimation of projection targets based on a 3D model. We first obtain the projection target's 3D model and then use it to accurately estimate the target's position and pose and thus achieve accurate projection mapping with a projector robot. In addition, our proposed method performs accurate projection mapping even after a projection target has been moved, which often occur in shopping malls. In this paper, we employ Ubiquitous Display (UD), which we are researching as a projector robot, to experimentally evaluate the effectiveness of the proposed method.

CONTINUITY OF AN APPROXIMATE JORDAN MAPPING

  • Lee, Young-Whan
    • Communications of the Korean Mathematical Society
    • /
    • v.20 no.3
    • /
    • pp.505-509
    • /
    • 2005
  • We show that every $\varepsilon-approximate$ Jordan functional on a Banach algebra A is continuous. From this result we obtain that every $\varepsilon-approximate$ Jordan mapping from A into a continuous function space C(S) is continuous and it's norm less than or equal $1+\varepsilon$ where S is a compact Hausdorff space. This is a generalization of Jarosz's result [3, Proposition 5.5].

A Study on the Use of Drones for Disaster Damage Investigation in Mountainous Terrain (산악지형에서의 재난피해조사를 위한 드론 맵핑 활용방안 연구)

  • Shin, Dongyoon;Kim, Dajinsol;Kim, Seongsam;Han, Youkyung;Nho, Hyunju
    • Korean Journal of Remote Sensing
    • /
    • v.36 no.5_4
    • /
    • pp.1209-1220
    • /
    • 2020
  • In the case of forest areas, the installation of ground control points (GCPs) and the selection of terrain features, which are one of the unmanned aerial photogrammetry work process, are limited compared to urban areas, and safety problems arise due to non-visible flight due to high forest. To compensate for this problem, the drone equipped with a real time kinematic (RTK) sensor that corrects the position of the drone in real time, and a 3D flight method that fly based on terrain information are being developed. This study suggests to present a method for investigating damage using drones in forest areas. Position accuracy evaluation was performed for three methods: 1) drone mapping through GCP measurement (normal mapping), 2) drone mapping based on topographic data (3D flight mapping), 3) drone mapping using RTK drone (RTK mapping), and all showed an accuracy within 2 cm in the horizontal and within 13 cm in the vertical position. After evaluating the position accuracy, the volume of the landslide area was calculated and the volume values were compared, and all showed similar values. Through this study, the possibility of utilizing 3D flight mapping and RTK mapping in forest areas was confirmed. In the future, it is expected that more effective damage investigations can be conducted if the three methods are appropriately used according to the conditions of area of the disaster.

AN EXTENSION OF THE CONTRACTION MAPPING THEOREM

  • Argyros, Ioannis K.
    • The Pure and Applied Mathematics
    • /
    • v.14 no.4
    • /
    • pp.283-287
    • /
    • 2007
  • An extension of the contraction mapping theorem is provided in a Banach space setting to approximate fixed points of operator equations. Our approach is justified by numerical examples where our results apply whereas the classical contraction mapping principle cannot.

  • PDF