• Journal of Broadcast Engineering
• /
• v.7 no.2
• /
• pp.136-144
• /
• 2002

In this paper, a novel approach that makes use of both shape and color information to retrieve character images in terms of similarity distance from a large-capacity image database or from a streaming image database, in particular, character image logo or trademark. In order to combine both features of completely different characteristics bipartite matching has been employed in computing similarity distance, The proposed method turned out to bealso very effective in matching natural object or human-drawn images whose shape varies substantially.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.8
• /
• pp.1913-1925
• /
• 2012

In order to efficiently utilize limited radio resources, resource allocation schemes in OFDMA-based wireless networks have gained intensive attention recently. Instead of improving the throughput performance, the utility is adopted as the metric for resource allocation, which provides reasonable methods to build up the relationship between user experience and various quality-of-service (QoS) metrics. After formulating the optimization problem by using a weighted bipartite graph, a modified bipartite matching method is proposed to find a suboptimal solution for the resource allocation problem in OFDMA-based wireless systems with feasible computational complexity. Finally, simulation results are presented to validate the effectiveness of the proposed method.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.153-160
• /
• 2008

This paper shows the maximum data flow utilizing the Weight Bipartite Graph Matching system. The Weight Bipartite Graph Matching system sets the data transmission as edges and guides the maximum data flow on the set server and the client. The proposed Weight Bipartite Graph Matching system implements the multi-user interface video conference system. By sending max data to the server and having the client receive the max data, the non-continuance of the motion image frame, the bottleneck phenomenon, and the broken images are prevented due to the excellent capacity. The experiment shows a two-times better excellency than that of the previous flow control.

• 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 Information Processing Systems
• /
• v.14 no.4
• /
• pp.961-979
• /
• 2018

For many years, matching in a bipartite graph has been widely used in various assignment problems, such as stable marriage problem (SMP). As an application of bipartite matching, the problem of stable marriage is defined over equally sized sets of men and women to identify a stable matching in which each person is assigned a partner of opposite gender according to their preferences. The classical SMP proposed by Gale and Shapley uses preference lists for each individual (men and women) which are infeasible in real world applications for a large populace of men and women such as matrimonial websites. In this paper, we have proposed an enhancement to the SMP by computing a weighted score for the users registered at matrimonial websites. The proposed enhancement has been formulated into profit maximization of matrimonial websites in terms of their ability to provide a suitable match for the users. The proposed formulation to maximize the profits of matrimonial websites leads to a combinatorial optimization problem. We have proposed greedy and genetic algorithm based approaches to solve the proposed optimization problem. We have shown that the proposed genetic algorithm based approaches outperform the existing Gale-Shapley algorithm on the dataset crawled from matrimonial websites.

• Communications of the Korean Mathematical Society
• /
• v.17 no.2
• /
• pp.321-330
• /
• 2002

Consider the random assignment (or bipartite matching) problem with iid uniform edge costs t(i, j). Let $A_{n}$ be the optimal assignment cost. Just recently does Aldous [2] give a rigorous proof that E $A_{n}$ longrightarrowζ(2). In this paper we establish the upper and lower bounds for Var $A_{n}$ , i.e., there exist two strictly positive but finite constants $C_1$ and $C_2$ such athat $C_1$ $n^{(-5}$2)/ (log n)$^{(-3}$2)/ $\leq$ Var $A_{n}$ $\leq$ $C_2$ $n^{-1}$ (log n)$^2$.EX>.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.391-399
• /
• 2005

In this paper we present an algorithm based on network flow techniques which provides a solution for a combinatorial problem. Then, in order to provide all the solutions of this problem, we make use of an algorithm that given the bipartite graph $G=(V_1 {\cup}{V_2},\;E,\;{\omega})$ outputs the enumeration of all bipartite matchings of given cardinality v and cost c.

• Journal of Korea Game Society
• /
• v.12 no.1
• /
• pp.123-132
• /
• 2012

There are many of games using smart devices. Voice recognition is can be useful way for input. In the game, voice have to be quickly recognized, at the same time it have to be manipulated promptly as well. In this study, we developed the optimized real-time phoneme recognition using max flow matching that it can be efficiently used in the game field. Firstly, voice wavelength is transformed to FFT, secondly, transformed value is made by a graph in Z plane, thirdly, data is extracted in specific area, and then data is saved in database. After all the value is recognized using weighted bipartite max flow matching. This way would be useful method in game or robot field when researchers hope to recognize the fast voice recognition.

• Korean Journal of Remote Sensing
• /
• v.38 no.3
• /
• pp.283-298
• /
• 2022

As Synthetic Aperture Radar (SAR) image can be acquired regardless of the weather and day or night, it is highly recommended to be used for Automatic Target Recognition (ATR) in the fields of surveillance, reconnaissance, and national security. However, there are some limitations in terms of cost and operation to build various and vast amounts of target images for the SAR-ATR system. Recently, interest in the development of an ATR system based on simulated SAR images using a target model is increasing. Attributed Scattering Center (ASC) matching and template matching mainly used in SAR-ATR are applied to target classification. The method based on ASC matching was developed by World View Vector (WVV) feature reconstruction and Weighted Bipartite Graph Matching (WBGM). The template matching was carried out by calculating the correlation coefficient between two simulated images reconstructed with adjacent points to each other. For the performance analysis of the two proposed methods, the Synthetic and Measured Paired Labeled Experiment (SAMPLE) dataset was used, which has been recently published by the U.S. Defense Advanced Research Projects Agency (DARPA). We conducted experiments under standard operating conditions, partial target occlusion, and random occlusion. The performance of the ASC matching is generally superior to that of the template matching. Under the standard operating condition, the average recognition rate of the ASC matching is 85.1%, and the rate of the template matching is 74.4%. Also, the ASC matching has less performance variation across 10 targets. The ASC matching performed about 10% higher than the template matching according to the amount of target partial occlusion, and even with 60% random occlusion, the recognition rate was 73.4%.

• Journal of Advanced Navigation Technology
• /
• v.12 no.5
• /
• pp.494-501
• /
• 2008

In this paper, to merge whole 3D information of an occluded body from view point, the new image merging algorithm is introduced after obtaining images of body on the turn table from 4 directions. The two images represented by polygon meshes are merged using weight bipartite matching method with different weights according to coordinates and axes based on minimum distance since two images merged don't present abrupt variation of 3D coordinates and scan direction is one direction. To obtain entire 3D information of body, these steps are repeated 3 times since the obtained images are 4. This proposed method has advantage 200 - 300% searching time reduction rather than conventional branch and bound, dynamic programming, and hungarian method though the matching accuracy rate is a little bit less than these methods.