• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2821-2823
• /
• 1999

In this paper we proposed an algorithm for rotation-invariant pattern recognition and rotated angle estimation between two patterns by employing selective template matching. Generally template matching has been used in determining the location of pattern but template matching requires a number of calculating correlation. To reduce the number of correlation we used steady-state genetic algorithm which is effective in optimization problem. We apply this method to distinguish specific pattern from similar coin patterns and estimate rotated angle between patterns. Our result leads us to the conclusion that proposed method performed faster than classical template matching

• Journal of Intelligence and Information Systems
• /
• v.18 no.2
• /
• pp.177-192
• /
• 2012

This is a study of match-making systems that considers the mutual satisfaction of matching partners. Recently, recommendation systems have been applied to people recommendation, such as recommending new friends, employees, or dating partners. One of the prominent domain areas is match-making systems that recommend suitable dating partners to customers. A match-making system, however, is different from a product recommender system. First, a match-making system needs to satisfy the recommended partners as well as the customer, whereas a product recommender system only needs to satisfy the customer. Second, match-making systems need to include as many participants in a matching pool as possible for their recommendation results, even with unpopular customers. In other words, recommendations should not be focused only on a limited number of popular people; unpopular people should also be listed on someone else's matching results. In product recommender systems, it is acceptable to recommend the same popular items to many customers, since these items can easily be additionally supplied. However, in match-making systems, there are only a few popular people, and they may become overburdened with too many recommendations. Also, a successful match could cause a customer to drop out of the matching pool. Thus, match-making systems should provide recommendation services equally to all customers without favoring popular customers. The suggested match-making system, called Mutually Beneficial Matching (MBM), considers the reciprocal satisfaction of both the customer and the matched partner and also considers the number of customers who are excluded in the matching. A brief outline of the MBM method is as follows: First, it collects a customer's profile information, his/her preferable dating partner's profile information and the weights that he/she considers important when selecting dating partners. Then, it calculates the preference score of a customer to certain potential dating partners on the basis of the difference between them. The preference score of a certain partner to a customer is also calculated in this way. After that, the mutual preference score is produced by the two preference values calculated in the previous step using the proposed formula in this study. The proposed formula reflects the symmetry of preferences as well as their quantities. Finally, the MBM method recommends the top N partners having high mutual preference scores to a customer. The prototype of the suggested MBM system is implemented by JAVA and applied to an artificial dataset that is based on real survey results from major match-making companies in Korea. The results of the MBM method are compared with those of the other two conventional methods: Preference-Based Matching (PBM), which only considers a customer's preferences, and Arithmetic Mean-Based Matching (AMM), which considers the preferences of both the customer and the partner (although it does not reflect their symmetry in the matching results). We perform the comparisons in terms of criteria such as average preference of the matching partners, average symmetry, and the number of people who are excluded from the matching results by changing the number of recommendations to 5, 10, 15, 20, and 25. The results show that in many cases, the suggested MBM method produces average preferences and symmetries that are significantly higher than those of the PBM and AMM methods. Moreover, in every case, MBM produces a smaller pool of excluded people than those of the PBM method.

• 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.14 no.4
• /
• pp.217-221
• /
• 2013

Recently, researches for methods of generating binary feature descriptors have been actively done. Since matching of binary feature descriptors uses Hamming distance which is based on bit operations, it is much more efficient than that of previous general feature descriptors which uses Euclidean distance based on real number operations. However, since increase in the number of features linearly drops matching speed, in applications such as object tracking where real-time applicability is a must, there has been an increasing demand for methods of further improving the matching speed of binary feature descriptors. In this regard, this paper proposes a method that improves the matching speed greatly while maintaining the matching accuracy by splitting high dimensional binary feature descriptors to several low dimensional ones and sequentially analyzing their partial Hamming distances. To evaluate the efficiency of the proposed method, experiments of comparison with previous matching methods are conducted. In addition, this paper discusses schemes of generating binary feature descriptors for maximizing the performance of the proposed method. Based on the analysis on the performance of several generation schemes, we try to find out the most effective scheme.

• 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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3C
• /
• pp.112-118
• /
• 2005

In this paper, we propose a new nonlinear matching measure for automatic analysis of the on-off type DNA microarray images in which the hybridized spots are detected by the template matching method. The proposed measure is obtained by binary-thresholding over the whole template region and taking the number of white pixels inside the spotted area. This measure is compared with the normalized covariance in terms of the classification ability of the successfulness of the locating markers. The proposed measure is evaluated for the scanned images of HPV DNA microarrays where the marker locating is a critical issue because of the small number of spots. The targeting spots of HPV DNA chips are designed for genotyping 22 types of the human papilloma virus(HPV). The proposed measure is proven to give more discriminative response reducing the miss cases of the successful marker locating.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2001.11a
• /
• pp.155-160
• /
• 2001

Actual engineering structure is frequently very complex, and parts of structure are designed independently by different engineers. Also each structure contains so many degree of freedom. For these reason, methods have been developed which permits the structure to be divided into components or substructures, with analysis being done on a small substructure in order to obtain a full structural system. In such case, because of different mesh size among finite element model (FEM) or different matching points among FEM models and experimentally obtained models, their interfacing points may be non-matching. Solving this non-matching problem is useful to other application such as structural dynamic modification or model updating. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint, and interface displacement is approximated by polynomial presentation. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalue of whole structure are calculated using the determinant search method. The number of degree of freedom in the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Some numerical simulation is performed to show usefulness of synthesis method.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.666-671
• /
• 2002

For a large structure, substructure based SDM(structural dynamics modification) method is very effective to raise its dynamic characteristics. Dividing into smaller substructures has a major advantage in the aspect of computation especially for getting sensitivities, which are in the core of SDM process. But quite often, non-matching nodes problem occurs in the process of synthesizing substructures. The reason is that, in general, each substructure is modelled separately, then later combined together to form a entire structure model under interface constraint conditions. Without solving the non-matching nodes problem, the substructure based SDM can not be processed. In this work, virtual node concept is introduced. Lagrange multipliers are used to enforce the interface compatibility constraint. The governing equation of whole structure is derived using hybrid variational principle. The eigenvalues of whole structure are calculated using determinant search method. The number of degrees of freedom of the eigenvalue problem can be drastically reduced to just the number of interface degree of freedom. Thus, the eigenvalue sensitivities can be easily calculated, and further SDM can be efficiently performed. Some numerical problems are tested to show the effectiveness of handling non-matching nodes.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.5
• /
• pp.1423-1431
• /
• 2015

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number is the minimum cardinality of a clique-transversal set in G. For every cubic graph with at most two bridges, we first show that it has a perfect matching which contains exactly one edge of each triangle of it; by the result, we determine the exact value of the clique-transversal number of line graph of it. Also, we present a sharp upper bound on the clique-transversal number of line graph of a cubic graph. Furthermore, we prove that the clique-transversal number of line graph of a triangle-free graph is at most the chromatic number of complement of the triangle-free graph.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.201-217
• /
• 2019

Ricci curvature for locally finite graphs, as proposed by Lin, Lu and Yau, provides a useful isomorphism invariant. A Matching Condition was introduced as a key tool for computation of this Ricci curvature. The scope of the Matching Condition is quite broad, but it does not cover all cases. Thus the current paper introduces extended versions of the Matching Condition, and applies them to the computation of the Ricci curvature of a class of circulants determined by certain number-theoretic data. The classical Matching Condition is also applied to determine the Ricci curvature for other families of circulants, along with Cayley graphs of abelian groups that are generated by the complements of (unions of) subgroups.