• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.1
• /
• pp.395-405
• /
• 2012

A joint template matching algorithm is proposed in this paper to reduce the high rate of miss-detection and false-alarm caused by the traditional template matching algorithm during the process of multi-object detection. The proposed algorithm can reduce the influence on each object by matching all objects together according to the correlation information among different objects. Moreover, the rate of miss-detection and false-alarm in the process of single-template matching is also reduced based on the algorithm. In this paper, firstly, joint template is created from the information of relative positions among different objects. Then, matching criterion according to normalized cross correlation is generated for multi-object matching. Finally, the proposed algorithm is applied to the detection of watermarks in bill. The experiments show that the proposed algorithm has lower miss-detection and false-alarm rate comparing to the traditional NCC algorithm during the process of multi-object detection.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.627-630
• /
• 2005

Novel unified criterion to optimize power coupling at optical directional couplers with discontinuous input/output interfaces is first defined and evaluated numerically. The numerical results reveal that maximum power transfer between guiding slabs without discontinuous interfaces is dominated by conventional phase-matching condition while the guiding structures with discontinuous interfaces has maximum power transfer at an equi-partition condition, which describes the power distribution condition between two rigorous modes propagating through optical couplers.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.3
• /
• pp.1-7
• /
• 1992

This paper discusses the self-adaptive equalization technique which has adaptibility to channel characteristics varation without training sequence. The criterion function used in this paper is based on the concept of cumulant matching. This function can be applied to nonminimum phase channel, and we can verify the fact that if the constrained condition is satisfied. this criterion has no local optimum. As the adaption algorithm, the normalized gradient-searching technique is used. Simulations verify the performance of our method in case of 8PAM, 8PSK(CCITT V.27), 16QAM(CCITT V.29) sources and three type nonminimum phase channels.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2009.05a
• /
• pp.107-113
• /
• 2009

This paper deals with noninformative priors for such as Jeffres' prior, reference prior and probability matching prior for scale parameter of exponential distribution when the data are collected in multiple step stress accelerated life tests. We find the noninformative priors for this model and show that the reference prior satisfies first order matching criterion. Using artificial data, we perform Bayesian analysis for proposed priors.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.835-844
• /
• 2002

For the one-way random model when the ratio of the variance components is of interest, Bayesian analysis is often appropriate. In this paper, we develop the noninformative priors for the ratio of the variance components under the balanced one-way random effect model. We reveal that the second order matching prior matches alternative coverage probabilities up to the second order (Mukerjee and Reid, 1999) and is a HPD(Highest Posterior Density) matching prior. It turns out that among all of the reference priors, the only one reference prior (one-at-a-time reference prior) satisfies a second order matching criterion. Finally we show that one-at-a-time reference prior produces confidence sets with expected length shorter than the other reference priors and Cox and Reid (1987) adjustment.

• Communications for Statistical Applications and Methods
• /
• v.15 no.3
• /
• pp.429-440
• /
• 2008

In this paper, we develop the noninformative priors when the parameter of interest is the common coefficient of variation in two inverse Gaussian distributions. We want to develop the first and second order probability matching priors. But we prove that the second order probability matching prior does not exist. It turns out that the one-at-a-time and two group reference priors satisfy the first order matching criterion but Jeffreys' prior does not. The Bayesian credible intervals based on the one-at-a-time reference prior meet the frequentist target coverage probabilities much better than that of Jeffreys' prior. Some simulations are given.

• Journal of Korean Society of Disaster and Security
• /
• v.12 no.3
• /
• pp.13-24
• /
• 2019

The concept of shape similarity has been applied to verify the accuracy of the SIND model, the real-time prediction model for disaster risk. However, the CRITIC method, one of the most widely used in geometric methodology, is definitely limited to apply to complex shape such as hazard map for coastal disaster. Therefore, we suggested the modified CRITIC method of which we added the shape factors such as RCCI and TF to consider complicated shapes. The matching pairs were manually divided into exact-matching pairs and mis-matching pairs to evaluate the applicability of the new method for shape similarity into hazard maps for storm surges. And the shape similarity of each matching pair was calculated by changing the weights of each shape factor and criteria. Newly proposed methodology and the calculated weights were applied to the objects of the existent hazard map and the results from SIND model. About 90% of exact-matching pairs had the shape similarity of 0.5 or higher, and about 70% of mis-matching pairs were it below 0.5. As future works, if we would calibrate narrowly and adjust carefully multi-objects corresponding to one object, it would be expected that the shape similarity of the exact-matching pairs will increase overall while it of the mis-matching pairs will decrease.

• Journal of the Korean Institute of Telematics and Electronics T
• /
• v.36T no.3
• /
• pp.32-40
• /
• 1999

In this paper, we present a fast block matching motion estimation algorithm based on successive elimination algorithm (SEA). Based on the characteristic of center-biased motion vector distribution in the search area, the proposed method improves the performance of the SEA with a reduced the number of the search positions in the search area, In addition, to reduce the computational load, this method is combined with both the reduced bits mean absolute difference (RBMAD) matching criterion which can be reduced the computation complexity of pixel comparison in the block matching and pixel decimation technique which reduce the number of pixels used in block matching. Simulation results show that the proposed method provides better performance than existing fast algorithms and similar to full-search block motion estimation algorithm.

• Journal of the Korean Society of Industry Convergence
• /
• v.14 no.3
• /
• pp.105-111
• /
• 2011

Landmark Spots in 2D gel electrophoresis are used in many methods of 2DEG spot matching. Landmark Spots are obtained manually and it is a bottle neck in the entire protein analysis process. Automated landmark spots detection is a very crucial topic in processing a massive amount of 2DGE data. In this paper, Automated landmark spot detection is proposed using point pattern matching and graph theory. Neighbor spots are defined by a graph theory to use and only a centered spot and its neighbor spots are considered for spot matching. Normalized Hausdorff distance is introduced as a criterion for measuring degree of similarity. In the conclusion, the method proposed in this paper can get about 50% of the total spot pairs and the accuracy rate is almost 100%, which the requirements of landmark spots are fully satisfied.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10B
• /
• pp.1210-1215
• /
• 2011

In this paper, a supervised adaptive equalization algorithm based on probability density function (PDF) matching method is introduced and its decision-feedback version is proposed for underwater communication channels with strong impulsive noise and severe multipath characteristics. The conventional least mean square (LMS) algorithm based on mean squared error (MSE) criterion has shown to be incapable of coping with impulsive noise and multipath effects commonly shown in underwater communications. The linear PDF matching algorithm, which shows immunity to impulsive noise, however, has revealed to yield unsatisfying performance under severe multipath environments with impulsive noise. On the other hand, the proposed nonlinear PDF matching algorithm with decision feedback proves in the simulation to possess superior robustness against impulsive noise and multipath characteristics of underwater communication channels.