• Nuclear Engineering and Technology
• /
• v.51 no.3
• /
• pp.825-836
• /
• 2019

One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.2
• /
• pp.294-302
• /
• 2008

In this paper, we present a new image up-sampling method which registers low resolution images to the high resolution grid when Bayesian super-resolution image processing is performed. The proposed up-sampling method interpolates high-resolution pixels using high-frequency data lying in all the low resolution images, instead of up-sampling each low resolution image separately. The interpolation is based on B-spline non-uniform re-sampling, adjusted for the super-resolution image processing. The experimental results demonstrate the effects when different up-sampling methods generally used such as zero-padding or bilinear interpolation are applied to the super-resolution image reconstruction. Then, we show that the proposed hybird up-sampling method generates high-resolution images more accurately than conventional methods with quantitative and qualitative assess measures.

• Korean Journal of Remote Sensing
• /
• v.19 no.5
• /
• pp.363-370
• /
• 2003

This paper describes a rectification procedure that relies on a polynomial model derived from the imaging geometry without loss of accuracy. By using polynomial model, one can effectively eliminate the iterative process to find an image pixel corresponding to each output grid point. With the imaging geometry and ephemeris data, a geo-location polynomial can be constructed from grid points that are produced by solving three equations simultaneously. And, in order to correct the local distortions induced by the geometry and terrain height, a distortion model has been incorporated in the procedure, which is a function of incidence angle and height at each pixel position. With this function, it is straightforward to calculate the pixel displacement due to distortions and then pixels are assigned to the output grid by re-sampling the displaced pixels. Most of the necessary information for the construction of polynomial model is available in the leader file and some can be derived from others. For validation, sample images of ERS-l PRI and Radarsat-l SGF have been processed by the proposed method and evaluated against ground truth acquired from 1:25,000 topography maps.

• Journal of Aerospace System Engineering
• /
• v.3 no.2
• /
• pp.24-30
• /
• 2009

MI LV1B images, geometric corrected data of COMS MI, has no time information per each line, but field of weather prediction using the MI LV1B images needs time information on it. This paper explains two calculation methods for receiving time on lines of MI LV1B images and analyzes difference between two calculation methods using simulated data.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.50 no.3
• /
• pp.157-164
• /
• 2022

In this paper, we describe how to implement the mountainous terrain, radar, and air defense network for UAV path planning in a 3-D environment, and perform path planning and re-planning using the PRM algorithm, a sampling-based path planning algorithm. In the case of the original PRM algorithm, the calculation to check whether there is an obstacle between the nodes is performed 1:1 between nodes and is performed continuously, so the amount of calculation is greatly affected by the number of nodes or the linked distance between nodes. To improve this part, the proposed LineGridMask method simplifies the method of checking whether obstacles exist, and reduces the calculation time of the path planning through parallelization. Finally, comparing performance with existing PRM algorithms confirmed that computational time was reduced by up to 88% in path planning and up to 94% in re-planning.