• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.12
• /
• pp.70-80
• /
• 1997

This paper proposes a hierarchical Hausdorff distance (HD) matching algorithm baased on coarse-to-fine approach. It reduces the computational complexity greatly by using the pyramidal structures consisting of distance transform (DT) and edge pyramids. Also, inthe proposed hierarchical HD matching, a thresholding method is presented to find an optimal matching position with small error, in which the threshold values are determined by using the property between adjacent level of a DT map pyramid. By computer simulation, the performance of the conventional and proposed hierarchical HD matching algorithms is compared in therms of the matching position for binary images containing uniform noise.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.6
• /
• pp.1213-1223
• /
• 2009

In this paper, we develop noninformative priors for two parameter Pareto distribution. Specially, we derive Jereys' prior, probability matching prior and reference prior for the parameter of interest. In our case, the probability matching prior is only a first order matching prior and there does not exist a second order matching prior. Some simulation reveals that the matching prior performs better to achieve the coverage probability. A real example is also considered.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.589-592
• /
• 1999

Matching is a key problem in computer vision, image analysis and pattern recognition. In this paper a multiscale image matching algorithm by wavelet local extrema is proposed. This algorithm is based on the multiscale wavelet transform of the curvature which can utilize both the information of local extrema positions and magnitudes of transform results. This method has advantages in computational cost to a single scale image matching. It is also rotation-, translation-, and scale-independent image matching method. This matching can be used for the recognition of occluded objects.

• Journal of the Korean Data and Information Science Society
• /
• v.15 no.4
• /
• pp.981-992
• /
• 2004

In this paper, we develop the noninformative priors for the common scale parameter in the inverse gaussian distributions. We developed the first and second order matching priors. Next we revealed that the second order matching prior satisfies a HPD matching criterion. Also we showed that the second order matching prior matches alternative coverage probabilities up to the second order. It turns out that the one-at-a-time reference prior satisfies a second order matching criterion. Some simulation study is performed.

• Proceedings of the KSRS Conference
• /
• 2004.10a
• /
• pp.208-211
• /
• 2004

Landmark matching is one of an important algorithm for navigation of satellite images. This paper proposes a fast landmark matching algorithm using a MGLI (Moving Guide-Line Image). For searching the matched point between the landmark chip and a part of image, correlation matrix is used generally, but the full-sized correlation matrix has a drawback requiring plenty of time for matching point calculation. MGLI includes thick lines for fast calculation of correlation matrix. In the MGLI, width of the thick lines should be determined by satellite position changes and navigation error range. For the fast landmark matching, the MGLI provides guided line for a landmark chip we want to match, so that the proposed method should reduce candidate areas for correlation matrix calculation. This paper will show how much time is reduced in the proposed fast landmark matching algorithm compared to general ones.

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.5
• /
• pp.493-498
• /
• 2007

In this paper, a 2-dimensional accurate edge-based matching algorithm using subpixel edges is proposed that combines the Generalized Hough Transform(GHT) and the Chamfer matching to complement the weakness of either method. First, the GHT is used to find the approximate object positions and orientations, and then these positions and orientations are used as starting parameter values to find more accurate position and orientation using the Chamfer matching with distance interpolation. Finally, matching accuracy is further refined by using a subpixel algorithm. Testing results demonstrate that greater matching accuracy is achieved using subpixel edges rather than edge pixels.

• International Journal of Advanced Culture Technology
• /
• v.8 no.3
• /
• pp.241-246
• /
• 2020

In this paper, we propose a user matching app based on hybrid app and a utilization plan to promote sports tourism in line with the growing trend of sports industry scale. The proposed app categorizes sports facilities across the country into regional, sports, private and public sports facilities to support reservations and matching. The proposed app applied a matching system in which matching scores were given according to the preference of events, places, and users by user net matching algorithm. Users can enjoy sports as a team or individual through the suggestion app even if they do not have any clubs or friends to which they belong. It can be used to improve tourism content services and establish tourism industry policies by analyzing data generated while using a user matching system.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.1-8
• /
• 1994

In this paper, we propose an efficient two-step pattern matching method which promises shape distortion-tolerant recognition of handwritten of handwritten Hangul syllables. In the first step, nonlinear shape normalization is carried out to compensate for global shape distortions in handwritten characters, then a preliminary classification based on simple pattern matching is performed. In the next step, nonlinear pattern matching which achieves best matching between input and reference pattern is carried out to compensate for local shape distortions, then detailed classification which determines the final result of classification is performed. As the performance of recognition systems based on pattern matching methods is greatly effected by the quality of reference patterns. we construct reference patterns by combining the proposed nonlinear pattern matching method with a well-known averaging techniques. Experimental results reveal that recognition performance is greatly improved by the proposed two-step pattern matching method and the reference pattern construction scheme.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2011.01a
• /
• pp.55-58
• /
• 2011

This paper proposes a method of occluded number recognition by matching interest points. Interest points of input pattern are found via SURF features extracting and matched to interest points of clusters in database following three steps: SURF matching, coordinate matching and SURF matching on coordinate matched points. Then the satisfied interest points are counted to compute matching rate of each cluster. The input pattern will be assigned to cluster having highest matching rate. We have experimented our method to different numerical fonts and got encouraging results.

• Journal of the Semiconductor & Display Technology
• /
• v.6 no.2 s.19
• /
• pp.29-33
• /
• 2007

Low frequency (400 kHz) Ferrite ICP has been proposed for large area processing. Because the coupling coefficient is close to 1, the transformer matching can be adapted to Ferrite ICP. The transformer matching system is simple. In this paper the new matching system by controlling the turns of transformer using relays is proposed for impedance matching. We developed a simple matching system and characterized it when the turns were changed. It was observed that the 2-channel relay is available for transformer matching.