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

• Journal of Electrical Engineering and information Science
• /
• v.2 no.5
• /
• pp.60-64
• /
• 1997

The design process and construction method of a strip line is described for measuring radiated susceptibility of vehicular components having electrical cables more than 2 min length. he characteristic impedance of the trip line was determined 90$\Omega$ to obtain the field uniformity of $\leq$${\pm}$3 dB in the frequency range from 100 kHz to 500 MHz. Tapered coaxial lines were used instead of the traditional lumped circuit element for the impedence matching units, therefore, the strip line has high power capability. Using these techniques, the field uniformity and power capability of a strip line could be considerably improved.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.3
• /
• pp.129-137
• /
• 2004

This paper presents a signature verification method that uses Gabor filter in computing similarity between signatures. In computing similarity to compare two on-line signatures, the temporal relationship between two signatures should be computed in advance. However, conventional point matching method using DP(dynamic programming) matching consumes much computation. In this paper, we propose a fast method for computing the temporal relationship between two on-line signatures by using the phase output of Gabor Inter applied on the on-line signature signals. Two similarity measures are defined in the method: Temporal Similarity and Temporally Arranged Feature Profile Similarity. With the proposed method, Ive could compare signatures 30 times faster than conventional method using DP matching.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.10
• /
• pp.1787-1793
• /
• 2008

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In this paper, we propose a new data structure, called Union and Division, for processing binarized digital fingerprint image efficiently. We present a minutiae extraction algorithm that is using Union and Division and consists of binarization, noise removal, minutiae extraction stages.

• 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 Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.419-423
• /
• 2005

This paper is a research on feature extraction and comparison method of dynamic (on-line) signature verification. We suggest desirable feature information and modified DTW(Dynamic Time Warping) and describe the performance results of our enhanced dynamic signature verification system.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.800-808
• /
• 2008

A fingerprint verification system based on a set of invariant moment features and a nonlinear Back Propagation Neural Network(BPNN) verifier is proposed. An image-based method with invariant moment features for fingerprint verification is used to overcome the demerits of traditional minutiae-based methods and other image-based methods. The proposed system contains two stages: an off-line stage for template processing and an on-line stage for testing with input fingerprints. The system preprocesses fingerprints and reliably detects a unique reference point to determine a Region-of-Interest(ROI). A total of four sets of seven invariant moment features are extracted from four partitioned sub-images of an ROI. Matching between the feature vectors of a test fingerprint and those of a template fingerprint in the database is evaluated by a nonlinear BPNN and its performance is compared with other methods in terms of absolute distance as a similarity measure. The experimental results show that the proposed method with BPNN matching has a higher matching accuracy, while the method with absolute distance has a faster matching speed. Comparison results with other famous methods also show that the proposed method outperforms them in verification accuracy.

• Journal of KIBIM
• /
• v.5 no.2
• /
• pp.46-54
• /
• 2015

Vision-based tracking has been proposed as a means to efficiently track a large number of construction resources operating in a congested site. In order to obtain 3D coordinates of an object, it is necessary to employ stereo-vision theories. Detecting and tracking of multiple objects require an entity matching process that finds corresponding pairs of detected entities across the two camera views. This paper proposes an efficient way of entity matching for tracking of construction workers. The proposed method basically uses epipolar geometry which represents the relationship between the two fixed cameras. Each pixel coordinate in a camera view is projected onto the other camera view as an epipolar line. The proposed method finds the matching pair of a worker entity by comparing the proximity of the all detected entities in the other view to the epipolar line. Experimental results demonstrate its suitability for automated entity matching for 3D vision-based tracking of construction workers.

• Journal of Internet Computing and Services
• /
• v.12 no.3
• /
• pp.69-76
• /
• 2011

Matching customers becomes the key function in on-line mediate services. There are two matching methods: one-directional matching that requires requests from one side(e,g., information searching), bi-directional matching that considers requests from both sides. Previous bi-directional matching has difficulties of getting the interests explicitly and service collapse problems when the opposite side do not put responding interests. This paper attempts to automate the inputs of interests for bi-directional matching by calculating the interests with fuzzy matching algorithm for optimization. The results of the proposed Bi-directional Fuzzy Matching(BDFM) algorithm told that the job placement accuracy of employment information matching results is over 95%. And, BDFM gives statically significant positive effect for motivating the employment activities when analyzed the effect after completing the implementation.