• Title/Summary/Keyword: mapping algorithm

Search Result 1,089, Processing Time 0.03 seconds

Gamma Correction for Local Brightness and Detail Enhancement of HDR Images (HDR 영상의 지역적 밝기 및 디테일 향상을 위한 감마 보정 기법)

  • Lee, Seung-Yun;Ha, Ho-Gun;Song, Kun-Woen;Ha, Yeong-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.5
    • /
    • pp.837-847
    • /
    • 2016
  • Tone mapping for High Dynamic Range(HDR) image provides matching human visual perception between real world scene and displayable devices. Recently, a tone mapping algorithm based on localized gamma correction is proposed. This algorithm is using human visual properties of contrast and colorfulness with background intensity, generating a weight map for gamma correction. However, this method have limitations of controlling enhancement region as well as generating halo artifacts caused by the weight map construction. To overcome aforementioned limitations, proposed algorithm in this paper modifies previous weight map, considering base layer intensity of input luminance channel. By determining enhancement region locally and globally based on base layer intensity, gamma values are corrected accordingly. Therefore, proposed algorithm selectively enhances local brightness and controls strength of edges. Subjective evaluation using z-score shows that our proposed algorithm outperforms the conventional methods.

Unmanned Aerial Vehicle Recovery Using a Simultaneous Localization and Mapping Algorithm without the Aid of Global Positioning System

  • Lee, Chang-Hun;Tahk, Min-Jea
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.11 no.2
    • /
    • pp.98-109
    • /
    • 2010
  • This paper deals with a new method of unmanned aerial vehicle (UAV) recovery when a UAV fails to get a global positioning system (GPS) signal at an unprepared site. The proposed method is based on the simultaneous localization and mapping (SLAM) algorithm. It is a process by which a vehicle can build a map of an unknown environment and simultaneously use this map to determine its position. Extensive research on SLAM algorithms proves that the error in the map reaches a lower limit, which is a function of the error that existed when the first observation was made. For this reason, the proposed method can help an inertial navigation system to prevent its error of divergence with regard to the vehicle position. In other words, it is possible that a UAV can navigate with reasonable positional accuracy in an unknown environment without the aid of GPS. This is the main idea of the present paper. Especially, this paper focuses on path planning that maximizes the discussed ability of a SLAM algorithm. In this work, a SLAM algorithm based on extended Kalman filter is used. For simplicity's sake, a blimp-type of UAV model is discussed and three-dimensional pointed-shape landmarks are considered. Finally, the proposed method is evaluated by a number of simulations.

Development of Technology Mapping Algorithm for CPLD by Considering Time Constraint (시간제약 조건을 고려한 CPLD 기술 매핑 알고리즘 개발)

  • Kim, Hi-Seok;Byun, Sang-Zoon
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.6
    • /
    • pp.9-17
    • /
    • 1999
  • In this paper, we propose a new technology mapping algorithm for CPLD under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces delay time and the number of CLBs much more than the existing tools of technology mapping algoritm.

  • PDF

Static Aeroelastic Analysis for Aircraft Wings using CFD/CST Coupling Methodology (전산유체/전산구조 연계 방법을 사용한 항공기날개의 정적 공탄성 해석)

  • Choi, Dong-Soo;Jun, Sang-Ook;Kim, Byung-Kon;Park, Soo-Hyun;Lee, Dong-Ho;Lee, Kyung-Tae;Jun, Seung-Moon;Cho, Maeng-Hyo
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.35 no.4
    • /
    • pp.287-294
    • /
    • 2007
  • A static aeroelastic analysis for supersonic aircraft wing equipped with external store under the wing lower surface is performed using computational fluid dynamics (CFD) and computational structural technology(CST) coupling methodology. Two mapping algorithms, which are the pressure mapping algorithm and the displacement mapping algorithm, are used for CFD/CST coupling. A three-dimensional unstructured Euler code and finite element analysis program are used to calculate the flow properties and the structural displacements, respectively. The coupling procedure is repeated in an iterative manner until a specified convergence criterion is satisfied. Static aeroelastic analysis for a typical supersonic flight wing is performed and final converged wing configuration is obtained after several iterations.

Image Filtering Method for an Effective Inverse Tone-mapping (효과적인 역 톤 매핑을 위한 필터링 기법)

  • Kang, Rahoon;Park, Bumjun;Jeong, Jechang
    • Journal of Broadcast Engineering
    • /
    • v.24 no.2
    • /
    • pp.217-226
    • /
    • 2019
  • In this paper, we propose a filtering method that can improve the results of inverse tone-mapping using guided image filter. Inverse tone-mapping techniques have been proposed that convert LDR images to HDR. Recently, many algorithms have been studied to convert single LDR images into HDR images using CNN. Among them, there exists an algorithm for restoring pixel information using CNN which learned to restore saturated region. The algorithm does not suppress the noise in the non-saturation region and cannot restore the detail in the saturated region. The proposed algorithm suppresses the noise in the non-saturated region and restores the detail of the saturated region using a WGIF in the input image, and then applies it to the CNN to improve the quality of the final image. The proposed algorithm shows a higher quantitative image quality index than the existing algorithms when the HDR quantitative image quality index was measured.

A Structure of Spiking Neural Networks(SNN) Compiler and a performance analysis of mapping algorithm (Spiking Neural Networks(SNN)를 위한 컴파일러 구조와 매핑 알고리즘 성능 분석)

  • Kim, Yongjoo;Kim, Taeho
    • The Journal of the Convergence on Culture Technology
    • /
    • v.8 no.5
    • /
    • pp.613-618
    • /
    • 2022
  • Research on artificial intelligence based on SNN (Spiking Neural Networks) is drawing attention as a next-generation artificial intelligence that can overcome the limitations of artificial intelligence based on DNN (Deep Neural Networks) that is currently popular. In this paper, we describe the structure of the SNN compiler, a system SW that generate code from SNN description for neuromorphic computing systems. We also introduce the algorithms used for compiler implementation and present experimental results on how the execution time varies in neuromorphic computing systems depending on the the mapping algorithm. The mapping algorithm proposed in the text showed a performance improvement of up to 3.96 times over a random mapping. The results of this study will allow SNNs to be applied in various neuromorphic hardware.

Cleaning Robot Algorithm through Human-Robot Interaction (사람과 로봇의 상호작용을 통한 청소 로봇 알고리즘)

  • Kim, Seung-Yong;Kim, Tae-Hyung
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.5
    • /
    • pp.297-305
    • /
    • 2008
  • We present a cleaning robot algorithm that can be implemented on low-cost robot architecture while the cleaning performance far exceeds the conventional random style cleaning through human-robot interaction. We clarify the advantages and disadvantages of the two notable cleaning robot styles: the random and the mapping styles, and show the possibility how we can achieve the performance of the complicated mapping style under the random style-like robot architecture using the idea of human-aided cleaning algorithm. Experimental results are presented to show the performance.

Topological Mapping and Navigation in Indoor Environment with Invisible Barcode (바코드가 있는 가정환경에서의 위상학적 지도형성 및 자율주행)

  • Huh, Jin-Wook;Chung, Woong-Sik;Chung, Wan-Kyun
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.30 no.9 s.252
    • /
    • pp.1124-1133
    • /
    • 2006
  • This paper addresses the localization and navigation problem using invisible two dimensional barcodes on the floor. Compared with other methods using natural/artificial landmark, the proposed localization method has great advantages in cost and appearance, since the location of the robot is perfectly known using the barcode information after the mapping is finished. We also propose a navigation algorithm which uses the topological structure. For the topological information, we define nodes and edges which are suitable for indoor navigation, especially for large area having multiple rooms, many walls and many static obstacles. The proposed algorithm also has an advantage that errors occurred in each node are mutually independent and can be compensated exactly after some navigation using barcode. Simulation and experimental results. were performed to verify the algorithm in the barcode environment, and the result showed an excellent performance. After mapping, it is also possible to solve the kidnapped case and generate paths using topological information.

Development of 3D Point Cloud Mapping System Using 2D LiDAR and Commercial Visual-inertial Odometry Sensor (2차원 라이다와 상업용 영상-관성 기반 주행 거리 기록계를 이용한 3차원 점 구름 지도 작성 시스템 개발)

  • Moon, Jongsik;Lee, Byung-Yoon
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.16 no.3
    • /
    • pp.107-111
    • /
    • 2021
  • A 3D point cloud map is an essential elements in various fields, including precise autonomous navigation system. However, generating a 3D point cloud map using a single sensor has limitations due to the price of expensive sensor. In order to solve this problem, we propose a precise 3D mapping system using low-cost sensor fusion. Generating a point cloud map requires the process of estimating the current position and attitude, and describing the surrounding environment. In this paper, we utilized a commercial visual-inertial odometry sensor to estimate the current position and attitude states. Based on the state value, the 2D LiDAR measurement values describe the surrounding environment to create a point cloud map. To analyze the performance of the proposed algorithm, we compared the performance of the proposed algorithm and the 3D LiDAR-based SLAM (simultaneous localization and mapping) algorithm. As a result, it was confirmed that a precise 3D point cloud map can be generated with the low-cost sensor fusion system proposed in this paper.

SYSTEM OF GENERALIZED MULTI-VALUED RESOLVENT EQUATIONS: ALGORITHMIC AND ANALYTICAL APPROACH

  • Javad Balooee;Shih-sen Chang;Jinfang Tang
    • Bulletin of the Korean Mathematical Society
    • /
    • v.60 no.3
    • /
    • pp.785-827
    • /
    • 2023
  • In this paper, under some new appropriate conditions imposed on the parameter and mappings involved in the resolvent operator associated with a P-accretive mapping, its Lipschitz continuity is proved and an estimate of its Lipschitz constant is computed. This paper is also concerned with the construction of a new iterative algorithm using the resolvent operator technique and Nadler's technique for solving a new system of generalized multi-valued resolvent equations in a Banach space setting. The convergence analysis of the sequences generated by our proposed iterative algorithm under some appropriate conditions is studied. The final section deals with the investigation and analysis of the notion of H(·, ·)-co-accretive mapping which has been recently introduced and studied in the literature. We verify that under the conditions considered in the literature, every H(·, ·)-co-accretive mapping is actually P-accretive and is not a new one. In the meanwhile, some important comments on H(·, ·)-co-accretive mappings and the results related to them appeared in the literature are pointed out.