• Title, Summary, Keyword: bipartite matching

Search Result 29, Processing Time 0.054 seconds

Robust Character Image Retrieval Method Using Bipartite Matching (Bipartite Matching을 이용한 강인한 캐릭터 영상 검색 방법)

  • 이상엽;김회율
    • 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.

Utility-based Resource Allocation with Bipartite Matching in OFDMA-based Wireless Systems

  • Zheng, Kan;Li, Wei;Liu, Fei;Xiang, Wei
    • 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.

Design and Implementation for Multi-User Interface Video Conference System (다자간 화상회의 시스템의 설계 및 구현)

  • Joo, Heon-Sik;Lee, Sang-Yeob
    • 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.

  • PDF

A Boolean Circuit For Finding Maximum Matching In A Convex Bipartite Graph. (볼록 이분할 그래프에서 최대 매칭을 찾기 위한 불리안 회로)

  • Lee, Sunghee;Yoojin Chung
    • Proceedings of the Korean Information Science Society Conference
    • /
    • /
    • 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.

  • PDF

A New Perspective to Stable Marriage Problem in Profit Maximization of Matrimonial Websites

  • Bhatnagar, Aniket;Gambhir, Varun;Thakur, Manish Kumar
    • 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.

2D/3D Retrieval System Using Bipartite Matching (Bipartite 매칭을 이용한 2D/3D 검색 시스템)

  • Lim, Sam;Choo, Hyon-Gon;Kim, Whoi-Yul
    • Proceedings of the IEEK Conference
    • /
    • /
    • pp.3-6
    • /
    • 2001
  • 본 논문에서는 Bipartite 매칭을 이용한 2D/3D 검색 시스템을 제안한다. 2D/3D 검색 시스템에서 3D 물체 사이의 유사도는 각각의 2D 실루엣 이미지들간의 매칭을 통해 얻어진다. 그러나 기존의 매칭 방법은 전체 매칭(Fuii MatchinE) 방법으로 연산량이 많기 때문에 Bipartite 매칭 방법을 사용하여 연산량을 줄이고 검색 속도의 성능을 향상시킨다. 기존의 방법과 제안된 방법의 검색 속도 비교를 통해 Bipartite 매칭을 이용한 2D/3D 검색 시스템의 효율성을 나타낸다.

  • PDF

ON THE FLUCTUATION IN THE RANDOM ASSIGNMENT PROBLEM

  • Lee, Sung-Chul;Su, Zhong-Gen
    • 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>.

3D Image Mergence using Weighted Bipartite Matching Method based on Minimum Distance (최소 거리 기반 가중치 이분 분할 매칭 방법을 이용한 3차원 영상 정합)

  • Jang, Taek-Jun;Joo, Ki-See;Jang, Bog-Ju;Kang, Kyeang-Yeong
    • 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.

  • PDF

Real-time Phoneme Recognition System Using Max Flow Matching (최대 흐름 정합을 이용한 실시간 음소인식 시스템 구현)

  • Lee, Sang-Yeob;Park, Seong-Won
    • 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.

Cross-Talk: D2D Potentiality Based Resource Borrowing Schema for Ultra-Low Latency Transmission in Cellular Network

  • Sun, Guolin;Dingana, Timothy;Adolphe, Sebakara Samuel Rene;Boateng, Gordon Owusu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.5
    • /
    • pp.2258-2276
    • /
    • 2019
  • Resource sharing is one of the main goals achieved by network virtualization technology to enhance network resource utilization and enable resource customization. Though resource sharing can improve network efficiency by accommodating various users in a network, limited infrastructure capacity is still a challenge to ultra-low latency service operators. In this paper, we propose an inter-slice resource borrowing schema based on the device-to-device (D2D) potentiality especially for ultra-low latency transmission in cellular networks. An extended and modified Kuhn-Munkres bipartite matching algorithm is developed to optimally achieve inter-slice resource borrowing. Simulation results show that, proper D2D user matching can be achieved, satisfying ultra-low latency (ULL) users' quality of service (QoS) requirements and resource utilization in various scenarios.