• Journal of the Korean Data and Information Science Society
• /
• v.14 no.1
• /
• pp.83-92
• /
• 2003

In this paper, we derive noninformative priors for the ratio of parameters in the Burr model. We obtain Jeffreys' prior, reference prior and second order probability matching prior. Also we prove that the noninformative prior matches the alternative coverage probabilities and a HPD matching prior up to the second order, respectively. Finally, we provide simulated frequentist coverage probabilities under the derived noninformative priors for small and moderate size of samples.

• Communications for Statistical Applications and Methods
• /
• v.8 no.1
• /
• pp.29-37
• /
• 2001

In this paper, we consider the second order probability matching criterion for the ratio of the variance components under the one-way random effect model. It turns out that among all of the reference priors given in Ye(1994), the only one reference prior satisfies the second order matching criterion. Similar results are also obtained for the intraclass correlation as well.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.31 no.6
• /
• pp.408-411
• /
• 2018

We fabricated highly flexible Mn-doped $SnO_2$ (MTO)/Ag/MTO/polydimethylsiloxane (PDMS)/MTO multilayer transparent conducting films. To reduce refractive-index mismatching of the MTO/Ag/MTO/polyethylene terephthalate (PET), index-matching layers were inserted between the oxide-metal-oxide-structured films and the PET substrate. The PDMS layer was deposited by spin-coating after adjusting the mixing ratio of PDMS and hexane. We investigated the effects of the index-matching layer on the color and reflectance differences with different PDMS dilution ratios. As the dilution ratio increased from 1:100 to 1:130, the color difference increased slightly, while the reflectance difference decreased from 0.62 to 0.32. The MTO/Ag/MTO/PDMS/MTO film showed a transmittance of 87.18~87.68% at 550 nm. The highest value of the Haacke figure of merit was $47.54{\times}10^{-3}{\Omega}^{-1}$ for the dilution ratio of 1:130.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.124-130
• /
• 2012

In this paper, we propose a feature point selection method for MPEG CDVS CE-7 which is processing on International Standard task. Among a large number of extracted feature points, more important feature points which is used in image matching should be selected for the compactness of image descriptor. The proposed method is that remove the feature point in the extraction phase which is filtered by nearest neighbor distance ratio matching in the matching phase. We can avoid the waste of the feature point and employ additional feature points by the proposed method. The experimental results show that our proposed method can obtain true positive rate improvement about 2.3% in pair-wise matching test compared with Test Model.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.4
• /
• pp.667-674
• /
• 1987

In this paper an effective block matching algorithm is proposed to find the motion vector. There are two approaches to the estimation of the motion vector in MCC (motion compensated coding), i.e., pel(pixel element) recursive algorithm and block matching algorithm. The search algorithm in this paper is based on the block matching method. The advantage of a proposed algorithm using integral projections is the reduction of the computation time. While the conventional block matching methods have to be computed in 2-dimensional arrays, the proposed algorithm using integral projections can be computed in 1-dimensional arrays. In comparison with conventional block matching methods, a computer simulation shows that though the prediction error increases 0.23 db, it is not detectable for human eyes and the average reduction ratio of computation time obtained from the proposed algorithm is about 3-4.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.7
• /
• pp.1437-1446
• /
• 2012

In this paper we propose a new stereo matching algorithm which is suitable for application to obtain depth information with high-speed in stereoscopic camera environment. For satisfying these condition we propose a new adaptive stereo matching technique using frequency information in discrete wavelet (DWT) domain and variable matching window. The size of the matching window is selected by analysis of the local property of the image in spatial domain and the feature and scaling factor of the matching window is selected by the frequency property in the frequency domain. For using frequency information we use local DWT and global DWT. We identified that the proposed technique has better peak noise to signal ratio (PSNR) than the fixed matching techniques with similar complexity.

• Journal of the Economic Geographical Society of Korea
• /
• v.15 no.4
• /
• pp.752-765
• /
• 2012

We analyze the relation empirically between regional labor market characteristics and job matching efficiency with the adaption of stochastic frontier production function. Our empirical results suggest that, as both the ratio of 50 years-old-job seekers and the level of spatial density increase, job matching efficiencies also rise. In contrast, an increase in the ratio of firms which offer permanent contracts lowers job matching efficiencies. And the job matching efficiency is relatively higher in metropolitan areas. Finally, We find a negative relation between total industrial production and job matching efficiency, which implies that job seekers tend to accept uncongenial jobs in the recessions.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.7-15
• /
• 2014

This paper proposed a recognition algorithm of human facial expressions using the PCA and the template matching. Firstly, face image is acquired using the Haar-like feature mask from an input image. The face image is divided into two images. One is the upper image including eye and eyebrow. The other is the lower image including mouth and jaw. The extraction of facial components, such as eye and mouth, begins getting eye image and mouth image. Then an eigenface is produced by the PCA training process with learning images. An eigeneye and an eigenmouth are produced from the eigenface. The eye image is obtained by the template matching the upper image with the eigeneye, and the mouth image is obtained by the template matching the lower image with the eigenmouth. The face recognition uses geometrical properties of the eye and mouth. The simulation results show that the proposed method has superior extraction ratio rather than previous results; the extraction ratio of mouth image is particularly reached to 99%. The face recognition system using the proposed method shows that recognition ratio is greater than 80% about three facial expressions, which are fright, being angered, happiness.

• ETRI Journal
• /
• v.33 no.3
• /
• pp.401-406
• /
• 2011

This paper presents a fast block-matching algorithm based on the normalized cross-correlation, where the elimination order is determined based on the gradient magnitudes of subblocks in the current macroblock. Multilevel Cauchy-Schwartz inequality is derived to skip unnecessary block-matching calculations in the proposed algorithm. Also, additional complexity reduction is achieved re-using the normalized cross correlation values for the spatially neighboring macroblock because the search areas of adjacent macroblocks are overlapped. Simulation results show that the proposed algorithm can improve the speed-up ratio up to about 3 times in comparison with the existing algorithm.

• Journal of Korea Multimedia Society
• /
• v.18 no.8
• /
• pp.901-908
• /
• 2015

Methods of detecting, describing, matching image features, like corners and blobs, have been actively studied as a fundamental step for image processing and computer vision applications. As one of feature description/matching methods, LLAH(Locally Likely Arrangement Hashing) describes image features based on the geometric relationship between their neighbors, and thus is suitable for scenes with poor texture. This paper presents a modified LLAH algorithm, which includes the image features themselves for robustly describing the geometric relationship unlike the original LLAH, and employes a voting-based feature matching scheme that makes feature description much simpler. Then, this paper quantitatively analyzes its performance with synthetic images in the presence of Gaussian noise.