• Journal of the Korean Data and Information Science Society
• /
• v.27 no.4
• /
• pp.1091-1100
• /
• 2016

This paper considers the noninformative priors for the linear function of parameters in the lognormal distribution. The lognormal distribution is applied in the various areas, such as occupational health research, environmental science, monetary units, etc. The linear function of parameters in the lognormal distribution includes the expectation, median and mode of the lognormal distribution. Thus we derive the probability matching priors and the reference priors for the linear function of parameters. Then we reveal that the derived reference priors do not satisfy a first order matching criterion. Under the general priors including the derived noninformative priors, we check the proper condition of the posterior distribution. Some numerical study under the developed priors is performed and real examples are illustrated.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.5
• /
• pp.451-459
• /
• 2011

Fundamentally, there are 5 systems are needed for autonomous navigation of unmanned ground vehicle: Localization, environment perception, path planning, motion planning and vehicle control. Path planning and motion planning are accomplished based on result of the environment perception process. Thus, high reliability of localization and the environment perception will be a criterion that makes a judgment overall autonomous navigation. In this paper, via map matching using vehicle dynamic model and LIDAR sensors, replace high price localization system to new one, and have researched an algorithm that lead to robust autonomous navigation. Finally, all results are verified via actual unmanned ground vehicle tests.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.3
• /
• pp.601-614
• /
• 2009

This paper derives noninformative priors for scale parameter of exponential distribution when the data are collected in multiple step stress accelerated life tests. We nd the objective priors for this model and show that the reference prior satisfies first order matching criterion. Also, we show that there exists no second order matching prior. Some simulation results are given and using artificial data, we perform Bayesian analysis for proposed priors.

• Journal of Broadcast Engineering
• /
• v.3 no.1
• /
• pp.100-109
• /
• 1998

The coding of video sequences has been the focus of research in recent years. High Definition TV(HDTV), video conferencing and video on demand(VOD) are some of the well known applications. In the moving picture compression, motion estimation algorithm plays a very important role, but due to its high computational complexity, there has been many approaches to overcome this difficulty. We propose a new block matching criterion that uses modified cost functions. This new block matching criterion classifies pixels into 2-levels, 4-levels and 8-levels with a suitable thresholding method. We also show that our new proposed algorithms can easily be combined with many other fast motion estimation algorithms with good performance.

• Journal of Broadcast Engineering
• /
• v.20 no.2
• /
• pp.257-264
• /
• 2015

In this paper, Enhanced binary block matching method for Constrained one-bit transform (C1BT) based motion estimation is proposed. Binary motion estimation exploits the Number of non-matched points (NNMP) as a block matching criterion instead of the Sum of Absolute Differences (SAD) for low complex motion estimation. The motion estimation using SAD could use the smaller block for more accurate motion estimation. In this paper the enhanced binary block matching method using smaller motion estimation block for C1BT is proposed to the more accurate binary matching. Experimental results shows that the proposed algorithm has better Peak Signal to Noise Ration (PSNR) results compared with conventional binary transform algorithms.

• Journal of the Institute of Convergence Signal Processing
• /
• v.16 no.4
• /
• pp.129-133
• /
• 2015

In this paper, we propose a fast motion estimation algorithm which is important in the performance of video encoding. Conventional fast motion estimation algorithms have serious problems of low prediction quality in some frames and still much computation. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution of probability of motion vectors, divides search range into several groups according to its importance, and applies adaptive block matching criteria for each group of search range. The proposed algorithm takes only 3~5% in computational amount and has decreased prediction quality about 0~0.01dB compared with the fast full search algorithm.

• The Korean Journal of Applied Statistics
• /
• v.17 no.1
• /
• pp.49-60
• /
• 2004

In this paper, when the observations are distributed as inverse gaussian, we developed the noninformative priors for ratio of the parameters of inverse gaussian distribution. We developed the first order matching prior and proved that the second order matching prior does not exist. It turns out that one-at-a-time reference prior satisfies a first order matching criterion. Some simulation study is performed.

• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

• Proceedings of the Korea Concrete Institute Conference
• /
• 2001.05a
• /
• pp.859-864
• /
• 2001

For earthquake resistance design, a response modification factor is used to reduce the design strength and it reflects ductility, reserve strength, redundancy and damping effect. But this factor has not theoretical basis. In this study, two response modification factors are compared and analyzed for shear wall apartment building.; the one is introduced by ATC-19 Procedures, the other is suggested FEMA-273 and ATC-40 through nonlinear static analysis. For the results, ATC-19 procedure gives a reasonable estimation to R factor. But $R_{u}$ by using FEAM-273 and ATC-40 methods is estimated so small in case of a minor or moderate earthquake region. Due to this fact, response modification factor is smaller than suggested load criterion 3.0. So, it needs to decrease wall volume and reduce the global strength and system stiffness for proper ductile behavior matching to domestic load criterion.

• Proceedings of the KOSOMBE Conference
• /
• v.1990 no.05
• /
• pp.21-24
• /
• 1990

This paper presents a new algorithm for P-wave detection in the ECG signal, we get the peak, onset and offset point by using significant point extraction algorithm with 5-point derivative. To these set of extracted significant points, we apply amplitude and duration threshold criterion. we define the set of significant point meeting the criterion as P-wave candidate. Then P-wave candidate is classified through match-process with template. The template with maximum number or P-wave candidate is selected to be the P-wave.