• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.283-291
• /
• 2007

A simple graph G is said to be fractional n-factor-critical if after deleting any n vertices the remaining subgraph still has a fractional perfect matching. For fractional n-factor-criticality, in this paper, one necessary and sufficient condition, and three sufficient conditions related to maximum matching, complete closure are given.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.9 no.2
• /
• pp.171-178
• /
• 1998

Generally, the output matching circuit has the most influence to the output power of oscillator and existing method for output matching has difficulty for making the optimum output matching circuit because the matching has to be done nearby the infinite impedance area of the Smith Chart. In this paper, it is studied for the output matching circuit of the microwave oscillator to get the maximum output power. The maximum output point can be found by adjusting the position of moving short in the Tuner while the oscillator is operating after connect the 3-dB coupler Tuner to the oscillator without output matching circuit. To design the oscillator for the maximum output power can be done easily with the microstrip line which is realized from the measured S-parameters of Tuner. In compare the oscillator by the existing method with another one by the suggested method in this paper, the first one has 6.45 dBm output power and second one has 9.71 dBm which is 3.26 dBm higher than the first one at the oscillation frequency 1.0338 GHz.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04a
• /
• pp.952-954
• /
• 2004

We've developed a Boolean circuit that finds a maximum matching in a convex bipartite graph. This circuit is designed in BC language that was created by K. Park and H. Park(1). The depth of the circuit is O(log$^2$nㆍlog b) and the size is O(bn$^3$). Our circuit gets a triple representation of a convex bipartite graph as its input and produces the maximum matching for its output. We developed some Boolean circuit design techniques that can be used for building other Boolean circuits.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.3
• /
• pp.116-123
• /
• 1990

Most algorithms utilized the horizontal epipolar lines for solving the correspondence problem in 3-D computer vision. However, the requirement is very difficult to be satisfied in real situations. In this paper, we propose a binocular-stereo matching algorithm, based on line matching method, which does not require the horizontal epipolar lines of the extreme pixels of a given line segment and two circles whose radius is equal to the maximum disparity. And we use the features including the direction of line segments, edge strength and cross-correlation for line matching. The experimental results show that the proposed algorithm can be a useful tool for solving the correspondence problem in 3-D computer vision.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.772-775
• /
• 2006

Muilti-dimensional feature vector matching algorithm uses multiple features such as intensity, gradient, variance, first or second derivative of a pixel to find correspondence pixels in stereo images. In this paper, we proposed a new method for adjusting automatically the weight of feature in multi-dimensional feature vector matching considering sharpeness of a pixel in feature vector distance curve. The sharpeness consists of minimum and maximum vector distances of a small window mask. In the experiment we used IKONOS satellite stereo imagery and obtained accurate matching results comparable to the manual weight-adjusting method.

• Journal of Applied and Pure Mathematics
• /
• v.4 no.5_6
• /
• pp.249-262
• /
• 2022

Nowadays, it is an important task to find extremal values on any molecular descriptor with respect to different graph parameters. The Sombor index is a novel topological molecular descriptor introduced by Gutman in 2021. The research on determining extremal values for the Sombor index of a graph is very popular recently. In this paper, we present the maximum Sombor index of bicyclic graphs with given matching number. Furthermore, we identify the corresponding extremal bicyclic graphs.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.1-10
• /
• 2005

In this Paper, we propose a new block matching a1gorithm that extracts motion vectors from consecutive range data. The proposed method defines a matching metric that integrates intensity, hue, and range. Our algorithm begins matching with a small matching template. If the matching degree is not good enough, we slightly expand the size of a matching template and then repeat the matching process until our matching criterion is satisfied or the predetermined maximum size has been reached. As the iteration proceeds, we adaptively adjust weights of the matching metric by considering the importance of each feature. In the experiments, we show that our block matching approach can work as a promising solution by comparing the proposed method with previously known method in terms of performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.2
• /
• pp.105-110
• /
• 2015

This paper relates with the eualization performance of Constellation Matching-MMA (CM-MMA) in order to the consists of optimum receiver for the minimization of intersymbol interference and additive noise effects that is occurs in the nonlinear communication channel. The error signal were obtained that combines the Constellation Matching technique that inserts the zero point between the signal point of equalizer for improving the residual isi and convergence speed compared to the currently used MMA algorithm. In the initial state of adaptive equalization, it depends on the MMA characteristics mainly. And in the steady state, it depends on the CM characteristics mainly. In order to analyzing the equalization performance, the output signal constellation, residual isi, maximum distortion, MSE and SER were applied, then it were compared with the present MMA algorithm. As a result of computer simulation, the CM-MMA has more better performance in the every performance index, and it was also confirmed that the constellation matching effect can be obtained in the greater than 20dB signal to noise ratio.

• Journal of Korea Multimedia Society
• /
• v.20 no.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.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.3
• /
• pp.177-183
• /
• 2022

There is no known polynomial time algorithm for QAP that is a NP-complete problem. This paper suggests O(n²) polynomial time algorithm for random type quadratic assignment problem (QAP). The proposed algorithm suggests incremental augmenting matching strategy that is to set the matching set M={(l_i,f_j)} from l_i with minimum sum of distance in location matrix L and f_j with maximum sum of quantity in facility matrix F, and incremental augmenting of matching set M from M to l_i with minimum sum of distance and to f_j with maximum sum of quantity. Finally, this algorithm performs swap strategy that is to reflect the complex correlations of distances in locations and quantities in facilities. For the experimental data, this algorithm, in spite of O(n²) polynomial time algorithm, can be improve the solution than genetic algorithm a kind of metaheuristic method.