• 제어로봇시스템학회논문지
• /
• 제6권12호
• /
• pp.1126-1132
• /
• 2000

In this paper we propose an angular rate and acceleration matching method for initial transfer alignment in aircraft. The conventional angular rate and acceleration matching method performs compensation for the lever arm effects between the master and slave INS before initial alignment. However, the conventional method does not take the flexure angular acceleration into account and thus is not effective when the flexure angular acceleration is large. We propose a new angular rate and acceleration matching method to cope with the flexure acceleration between the master and slave INS and compare the results with those of the conventional method by simulation. The simulation results show that the proposed matching method is better than the conventional matching method in case of large flexure acceleration.

• Communications for Statistical Applications and Methods
• /
• 제18권4호
• /
• pp.467-475
• /
• 2011

This paper develops the noninformative priors for the stress-strength reliability from one parameter generalized exponential distributions. When this reliability is a parameter of interest, we develop the first, second order matching priors, reference priors in its order of importance in parameters and Jeffreys' prior. We reveal that these probability matching priors are not the alternative coverage probability matching prior or a highest posterior density matching prior, a cumulative distribution function matching prior. In addition, we reveal that the one-at-a-time reference prior and Jeffreys' prior are actually a second order matching prior. We show that the proposed reference prior matches the target coverage probabilities in a frequentist sense through a simulation study and a provided example.

• 한국멀티미디어학회논문지
• /
• 제10권12호
• /
• pp.1577-1584
• /
• 2007

Fingerprint verification is being adopted widely to provide positive identification with a high degree of confidence in all practical areas. This popular usage requires reliable methods for matching of these patterns. To meet the latest expectations, the paper presents a pair wise distance histogram method for fingerprint matching. Here, we introduced a randomized algorithm which exploits pair wise distances between the pairs of minutiae, as a basic feature for match. The method undergoes two steps for completion i.e. first it performs the matching locally then global matching parameters are calculated in second step. The proposed method is robust to common problems that fingerprint matching faces, such as scaling, rotation, translational changes and missing points etc. The paper includes the test of algorithm on various randomly generated minutiae and real fingerprints as well. The results of the tests resemble qualities and utility of method in related field.

• 한국멀티미디어학회논문지
• /
• 제13권6호
• /
• pp.825-832
• /
• 2010

This paper presents only a matching algorithm based on Delaunay triangulation and Parametrization from the extracted minutiae points. This method maps local neighborhood of points of two different point sets to unit-circle using topology information by Delaunay triangulation method from feature points of real fingerprint. Then, a linked convex polygon that includes an interior point is constructed as one-ring which is mapped to unit-circle using Parametrization that keep shape preserve. In local matching, each area of polygon in unit-circle is compared. If the difference of two areas are within tolerance, two polygons are consider to be matched and then translation, rotation and scaling factors for global matching are calculated.

• 전기학회논문지
• /
• 제59권8호
• /
• pp.1471-1476
• /
• 2010

This paper proposes the robust matching algorithm of the optical images. To do this, we propose two algorithms, that is, matching algorithms when the silhouette of images is detected and when it is not detected. Also, we propose the method for detecting the matching template and non-matching template from each optical image. And then, optical images are matched according to the coefficient of correlation represented by the similar degree between optical images. Finally, we show the effectiveness and feasibility of the proposed method through some experiments.

• 한국가구학회지
• /
• 제20권6호
• /
• pp.605-611
• /
• 2009

This paper reports the application of radiocarbon wiggle matching for Korean wooden artifacts such as furniture and Buddhist statues for precise dating. Ten biannual samples of 20 years (AD 1249-1268) for AMS (accelerator mass spectrometry) radiocarbon measurements were prepared from a board of the pedestal for Buddhist statue at Jeongsusa (temple) in Kangwhado, Korea, which was dendrochronologically dated. The average 95.4% confidence interval of radiocarbon dating without wiggle matching was 123 year. When wiggle matching technique was applied, it became 37 year, 3.3 times smaller than that without wiggle matching. The results indicated that wiggle matching technique using the calibration curve for northern hemisphere (IntCal04: International radiocarbon calibration curve announced in 2004) can produce precise dates for Korean wooden artifacts which possess as much as 20 tree rings.

• 한국멀티미디어학회논문지
• /
• 제20권10호
• /
• pp.1619-1627
• /
• 2017

Image hashing has been successfully applied for the problems associated with the protection of intellectual property, management of large database and indexation of content. For a reliable hashing system, improving hash matching accuracy is crucial. In order to improve the hash matching performance, we propose an asymmetric hash matching method using the psychovisual threshold, which is the maximum amount of distortion that still allows the human visual system to identity an image. A performance evaluation over sets of image distortions shows that the proposed asymmetric matching method effectively improves the hash matching performance as compared with the conventional Hamming distance.

• 제어로봇시스템학회논문지
• /
• 제18권11호
• /
• pp.1027-1033
• /
• 2012

Semantic-based information retrieval techniques understand the meanings of the concepts that users specify in their queries, but the traditional semantic matching methods based on the ontology tree have three weaknesses which may lead to many false matches, causing the falling precision. In order to improve the matching precision and the recall of the information retrieval, this paper proposes a multi-agent improved semantic similarity matching algorithm based on the ontology tree, which can avoid the considerable computation redundancies and mismatching during the entire matching process. The results of the experiments performed on our algorithm show improvements in precision and recall compared with the information retrieval techniques based on the traditional semantic similarity matching methods.

• Journal of the Korean Data and Information Science Society
• /
• 제18권2호
• /
• pp.279-287
• /
• 2007

Data fusion is the process of combining multiple data in order to produce information of tactical value to the user. Data fusion is generally defined as the use of techniques that combine data from multiple sources and gather that information in order to achieve inferences. Data fusion is also called data combination or data matching. Data fusion is divided in five branch types which are exact matching, judgemental matching, probability matching, statistical matching, and data linking. In this paper, we develop was macro program for statistical matching which is one of five branch types for data fusion. And then we apply data fusion and association rule techniques to environmental data.

• 대한전자공학회논문지
• /
• 제24권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.