• Journal of Korean Society on Water Environment
• /
• v.24 no.6
• /
• pp.725-740
• /
• 2008

In this study a multi-site daily precipitation generator which generates the precipitation with similar spatial correlation, and at the same time, with conserving statistical properties of the observed data is developed. The proposed generator is intended to be a tool for down-scaling the data obtained from GCMs or RCMs into local scales. The occurrences of precipitation are simultaneously modeled in multi-sites by 2-parameter first-order Markov chain using random variables of spatially correlated while temporally independent, and then, the amount of precipitation is simulated by 3-parameter mixed exponential probability density function that resolves the issue of maintaining intermittence of precipitation field. This approach is applied to the Nakdong river basin and the observed data are daily precipitation data of 19 locations. The results show that spatial correlations of precipitation series are relatively well simulated and statistical properties of observed precipitation series are simulated properly.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.3
• /
• pp.210-217
• /
• 2003

We introduced a scheme for finding an optimal data association matrix that represents the relationships between the measurements and tracks in multi-target tracking (MIT). We considered the relationships between targets and measurements as Markov Random Field and assumed a priori of the associations as a Gibbs distribution. Based on these assumptions, it was possible to reduce the MAP estimate of the association matrix to the energy minimization problem. After then, we defined an energy function over the measurement space that may incorporate most of the important natural constraints. To find the minimizer of the energy function, we derived a new equation in closed form. By introducing Lagrange multiplier, we derived a compact equation for parameters updating. In this manner, a pair of equations that consist of tracking and parameters updating can track the targets adaptively in a very variable environments. For measurements and targets, this algorithm needs only multiplications for each radar scan. Through the experiments, we analyzed and compared this algorithm with other representative algorithm. The result shows that the proposed method is stable, robust, fast enough for real time computation, as well as more accurate than other method.

• Journal of IKEEE
• /
• v.18 no.4
• /
• pp.523-531
• /
• 2014

In this paper, a fast single image blind denoising algorithm is presented, where noise parameters are estimated by local statistics of an observed degraded image without a prior information about the additive noise. The estimated noise parameters are used to define the constraints on the noise detection which is coupled with the 1st-order Markov Random Field. In addition, an adaptive modified weighted Gaussian filter is introduced, where variable window sizes and weighting coefficients defined by the constraints are used to control the degree of the smoothness of the reconstructed image. The experimental results demonstrate the capability of the proposed algorithm. Please put the abstract of paper here.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.520-524
• /
• 2009

In compressed color images, colors are usually represented by luminance and chrominance (YCbCr) components. Considering characteristics of human vision system, chrominance (CbCr) components are generally represented more coarsely than luminance component. Aiming at possible recovery of chrominance components, we propose a model-based chrominance estimation algorithm where color images are modeled by a Markov random field (MRF). A simple MRF model is here used whose local conditional probability density function (pdf) for a color vector of a pixel is a Gaussian pdf depending on color vectors of its neighboring pixels. Chrominance components of a pixel are estimated by maximizing the conditional pdf given its luminance component and its neighboring color vectors. Experimental results show that the proposed chrominance estimation algorithm is effective for quality improvement of compressed color images such as JPEG and JPEG2000.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.2
• /
• pp.7-12
• /
• 2001

In this paper, an estimation method of hybrid feature was proposed to detect linear feature such as the road network from SAR(synthetics aperture radar) images that include speckle noise. First we considered the mean intensity ratio or the statistical properties of locality neighboring regions to detect linear feature of road. The responses of both methods are combined to detect the entire road network. The purpose of this paper is to extract the segments of road and to mutually connect them according to the identical intensity road from the locally detected fusing images. The algorithm proposed in this paper is to define MRF(markov random field) model of the priori knowledge on the roads and applied it to energy function of interacting density points, and to detect the road networks by optimizing the energy function.

• Journal of Broadcast Engineering
• /
• v.21 no.2
• /
• pp.272-275
• /
• 2016

This paper presents a method of single image dehazing and surface-based feature detection for remote sensing images. In the conventional dark channel prior (DCP) algorithm, the resulting transmission map invariably includes some block artifacts because of patch-based processing. This also causes image blur. Therefore, a refined transmission map based on a hidden Markov random field and expectation-maximization algorithm can reduce the block artifacts and also increase the image clarity. Also, the proposed algorithm enhances the accuracy of image matching surface-based features in an remote sensing image. Experimental results confirm that the proposed algorithm is superior to conventional algorithms in image haze removal. Moreover, the proposed algorithm is suitable for the problem of image matching based on feature extraction.

• ETRI Journal
• /
• v.37 no.3
• /
• pp.606-616
• /
• 2015

In this paper, we propose a novel method for road recognition using 3D point clouds based on a Markov random field (MRF) framework in unstructured and complex road environments. The proposed method is focused on finding a solution for an analysis of traversable regions in challenging environments without considering an assumption that has been applied in many past studies; that is, that the surface of a road is ideally flat. The main contributions of this research are as follows: (a) guidelines for the best selection of the gradient value, the average height, the normal vectors, and the intensity value and (b) how to mathematically transform a road recognition problem into a classification problem that is based on MRF modeling in spatial and visual contexts. In our experiments, we used numerous scans acquired by an HDL-64E sensor mounted on an experimental vehicle. The results show that the proposed method is more robust and reliable than a conventional approach based on a quantity evaluation with ground truth data for a variety of challenging environments.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.142-145
• /
• 2014

동영상에서의 객체 추적 알고리즘에 대한 활발한 연구가 진행되고 있음에도 불구하고 실시간 객체추적을 위해서는 여전히 정확도, 복잡도 등에서의 성능향상이 필요하다. 압축영역 기반 방식에서는 전역 움직임 보상(GMC : Global Motion Compensation)과정을 거쳐 추적하려는 객체와 배경을 구분한다. 전역 움직임 보상방법은 프레임 전 영역을 대상으로 하는 연산으로 전체 추적 시스템에서 차지하는 복잡도가 높다. 본 논문은 관심영역(ROI : Region Of Interest) 기반 전역 움직임 보상방법을 이용한 ST-MRF(Spatio-Temporal Markov Random Field)기반 추적기 고속화 방법을 제안한다. 관심영역을 기반으로 전역 움직임 보상을 적용함으로써 객체와 배경을 분리할 뿐만 아니라 알고리즘의 복잡도를 효과적으로 줄일 수 있다. 제안하는 방법의 추적성능은 평균 precision 87.29%, recall 82.58%, F-measure 83.78%로 기존방법과 비교하여 약 1%의 차이를 유지하였으며 전체 시스템의 수행시간은 평균 29.95ms로 기존방법과 비교하여 1.74배의 속도향상을 보였다.

• The Journal of Korea Robotics Society
• /
• v.17 no.1
• /
• pp.76-85
• /
• 2022

One of the most fundamental challenges when designing controllers for dynamic systems is the adjustment of controller parameters. Usually the system model is used to get the initial controller, but eventually the controller parameters must be manually adjusted in the real system to achieve the best performance. To avoid this manual tuning step, data-driven methods such as machine learning were used. Recently, reinforcement learning became one alternative of this problem to be considered as an agent learns policies in large state space with trial-and-error Markov Decision Process (MDP) which is widely used in the field of robotics. However, on initial training step, as an agent tries to explore to the new state space with random action and acts directly on the controller parameters in real systems, MDP can lead the system safety-critical system failures. Therefore, the issue of 'safe exploration' became important. In this paper we meet 'safe exploration' condition with Control Barrier Function (CBF) which converts direct constraints on the state space to the implicit constraint of the control inputs. Given an initial low-performance controller, it automatically optimizes the parameters of the control law while ensuring safety by the CBF so that the agent can learn how to predict and control unknown and often stochastic environments. Simulation results on a quadrotor UAV indicate that the proposed method can safely optimize controller parameters quickly and automatically.

• Journal of Korean Society for Geospatial Information Science
• /
• v.4 no.1 s.6
• /
• pp.93-102
• /
• 1996

For an atomatic generation of DEM(Digital Elevation Model) by computer, it is a time-consumed work to determine adquate matches from stereo images. Correlation and evenly distributed area-based method is generally used for matching operation. In this paper, we propose a new approach that computes matches efficiantly by changing the size of mask window and search area according to the given terrain information. For image segmentation, at first edge-preserving smoothing filter is used for preprocessing, and then region growing algorithm is applied for the filterd images. The segmented regions are classifed into mountain, plain and water area by using MRF(Markov Random Filed) model. Maching is composed of predicting parallex and fine matching. Predicted parallex determines the location of search area in fine matching stage. The size of search area and mask window is determined by terrain information for each pixel. The execution time of matching is reduced by lessening the size of search area in the case of plain and water. For the experiments, four images which are covered $10km{\times}10km(1024{\times}1024\;pixel)$ of Taejeon-Kumsan in each are studied. The result of this study shows that the computing time of the proposed method using terrain information for matching operation can be reduced from 25% to 35%.