20,214 Hits in 6.7 sec

CAD-guided inspection of aeronautical mechanical parts using monocular vision

I. Viana, F. Bugarin, N. Cornille, J.-J. Orteu, Fabrice Meriaudeau, Olivier Aubreton
2015 Twelfth International Conference on Quality Control by Artificial Vision 2015  
In our approach two attributed graphs are matched using a similarity function. The similarity scores are injected in the edges of a bipartite graph.  ...  A best-match-search procedure in bipartite graph guarantees the uniqueness of the match solution.  ...  measurement of models. 13, 20, 21 Our approach is inspired by Fishkel method 20 which is a 3D application of graph matching using a bipartite graph and tree search.  ... 
doi:10.1117/12.2182922 fatcat:2oifitw3j5ggrjrnmetmrl4baq

Fast Graph Construction Using Auction Algorithm [article]

Jun Wang, Yinglong Xia
2012 arXiv   pre-print
Besides those applications with natural graph or network structure data, such as social network analysis and relational learning, many other applications often involve a critical step in converting data  ...  However, the existing graph construction methods are either computationally expensive or with unsatisfactory performance.  ...  Watson Research Center for the discussion on parallelization of the auction algorithm.  ... 
arXiv:1210.4917v1 fatcat:f2pdpvhsejagzcnjmrjpmfnpia

Dynamic Summarization of Video Using Minimum Edge Weight Matching in Bipartite Graphs

Shanmukhappa Angadi, Vilas Naik
2016 International Journal of Image Graphics and Signal Processing  
Then the minimum edge weight maximal matching in every bipartite graph (a set of pair wise non-adjacent edges) is found using Hungarian method.  ...  This paper describes an algorithm for constructing the dynamic summary of a video by modeling every 40 consecutive frames of video as a bipartite graph.  ...  The work reported in [14] is an approach for video summarization based on the analysis of the video structure. The method uses FCM algorithm and a minimum spanning tree to cluster shots.  ... 
doi:10.5815/ijigsp.2016.03.02 fatcat:tmxlcpducfcmpfmbzxkojucnae

An efficient parallel approach for identifying protein families in large-scale metagenomic data sets

Changjun Wu, Ananth Kalyanaraman
2008 2008 SC - International Conference for High Performance Computing, Networking, Storage and Analysis  
Given a set of peptide sequences we reduce the problem to one of detecting arbitrarily-sized dense subgraphs from bipartite graphs.  ...  A primary bottleneck, however, is in the lack of scalable algorithms and open source software for largescale data processing.  ...  We also wish to thank the anonymous reviewers for their detailed and insightful comments on a preliminary version of this manuscript.  ... 
doi:10.1109/sc.2008.5214891 dblp:conf/sc/WuK08 fatcat:sd36yxmyu5bdbahpngk5xy5d3m

Graph matching between bipartite and unipartite networks: to collapse, or not to collapse, that is the question [article]

Jesús Arroyo, Carey E. Priebe, Vince Lyzinski
2021 arXiv   pre-print
We formulate the graph matching problem between a bipartite and a unipartite graph using an undirected graphical model, and introduce methods to find the alignment with this model without collapsing.  ...  Commonly, the bipartite networks are collapsed or projected into a unipartite graph, and graph matching proceeds as in the classical setting.  ...  Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright notation thereon.  ... 
arXiv:2002.01648v3 fatcat:nxjxtxzotzgcnm3xoffktyx77y

Improving the Performance of Semantic Web Services Discovery: Shortest Path based Approach

Maamar Khater, Mimoun Malki
2014 International Journal of Information Technology and Computer Science  
This approach is validated within a framework proposed at the end of this paper and compared with the greedy approach and the bipartite graph based matching.  ...  In this paper we present an algorithm of matchmaking that resolves the problems of Paolucci algorithm by using the shortest path algorithm which determines the optimal matching between user query and provider  ...  We concluded that our approach had better results than the greedy approach and presents the same performance as the bipartite graph based matching.  ... 
doi:10.5815/ijitcs.2014.07.05 fatcat:x5zxku5tvvghbnzlv5r2ldzbyy

Multi-Targets Tracking Based On Bipartite Graph Matching

Jinqin Zhong, Jieqing Tan, Yingying Li, Lichuan Gu, Guolong Chen
2014 Cybernetics and Information Technologies  
Unlike previous approaches, the method proposed considers the target tracking as a bipartite graph matching problem where the nodes of the bipartite graph correspond to the targets in two neighboring frames  ...  This paper presents a multi-target tracking algorithm based on bipartite graph matching.  ...  The graph-model based approach is qualitatively different from most previous approaches, formulating the correspondence task as a maximal graph matching problem.  ... 
doi:10.2478/cait-2014-0045 fatcat:vtcugr5renhn5ivya23d37iq6q

Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching

Umesh Bellur, Roshan Kulkarni
2007 IEEE International Conference on Web Services (ICWS 2007)  
We propose a more exhaustive matchmaking algorithm, based on the concept of matching bipartite graphs, to overcome the problems faced with the original algorithm.  ...  An important component of the discovery process is the matchmaking algorithm itself.  ...  The algorithm adopts a greedy approach for matching the concept-lists.  ... 
doi:10.1109/icws.2007.105 dblp:conf/icws/BellurK07 fatcat:k7ij3a45s5hcti6kkpvlllfdu4

Inspection of aeronautical mechanical parts with a pan-tilt-zoom camera: an approach guided by the computer-aided design model

Ilisio Viana, Jean-José Orteu, Nicolas Cornille, Florian Bugarin
2015 Journal of Electronic Imaging (JEI)  
In the second stage, the graphs are matched using a similarity function built from the primitive parameters. The similarity scores of the matching are injected in the edges of a bipartite graph.  ...  We use the CAD model to create a theoretical image of the element to be checked, which is further matched with the sensed image of the element to be inspected, using a graph theory-based approach.  ...  In the next section, we explain how the best match search is performed, using a bipartite graph.  ... 
doi:10.1117/1.jei.24.6.061118 fatcat:zukxqhkjqfh2vfqpigfm4u3isa

Greedy Online Bipartite Matching on Random Graphs [article]

Andrew Mastin, Patrick Jaillet
2013 arXiv   pre-print
We finally consider vertex-weighted bipartite matching. Our proofs are based on simple differential equations that describe the evolution of the matching process.  ...  We study the average performance of online greedy matching algorithms on G(n,n,p), the random bipartite graph with n vertices on each side and edges occurring independently with probability p=p(n).  ...  The following is the general theorem of Wormald for justifying the use of differential equations on random graph processes [21] .  ... 
arXiv:1307.2536v1 fatcat:ymiobeze7rbd5gnkf5r5nsnica

Deep Policies for Online Bipartite Matching: A Reinforcement Learning Approach [article]

Mohammad Ali Alomrani, Reza Moravej, Elias B. Khalil
2021 arXiv   pre-print
In real-world applications where the matching process is repeated on a regular basis, the underlying data distribution can be leveraged for better decision-making.  ...  Bipartite Matching.  ...  vertex in A C Dataset Generation Details C.1 Synthetic Graphs: Erdos-Renyi (ER): We generate bipartite graph instances for the E-OBM problem using the Erdos-Renyi (ER) scheme [13] .  ... 
arXiv:2109.10380v1 fatcat:jchtp7uuuzabllntvvgp7hucqm

Proteomic Parsimony through Bipartite Graph Analysis Improves Accuracy and Transparency

Bing Zhang, Matthew C. Chambers, David L. Tabb
2007 Journal of Proteome Research  
We use bipartite graphs for the visualization of the protein assembly results to render the parsimony analysis process transparent to users.  ...  We test the effects of this parsimony analysis approach using MS/MS data sets generated from a defined human protein mixture, a yeast whole cell extract, and a human serum proteome after MARS column depletion  ...  The transparency offered by the bipartite graph provides the users the possibility to use their judgment to modify the list generated by the computer, which is not possible if the parsimony analysis process  ... 
doi:10.1021/pr070230d pmid:17676885 pmcid:PMC2810678 fatcat:kqdjuboqpbby7ejgloqkdthcfi

Interconnect routing and scheduling---A near-optimal real-time hardware scheduler for large cardinality crossbar switches

Raymond R. Hoare, Zhu Ding, Alex K. Jones
2006 Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06  
The maximum matching algorithm for bipartite graphs can be used to provide optimal scheduling for crossbar based interconnection networks.  ...  By taking advantage of the inherent parallelism available in custom hardware design, we introduce three Maximum Matching implementations in hardware and show how we can trade design complexity for performance  ...  YMask [2] is used to filter F [2] and generate B [2] . Following the same approach, B[1] is generated.  ... 
doi:10.1145/1188455.1188554 dblp:conf/sc/HoareDJ06 fatcat:7m6fkbnyozdz7mfxme6flovkly

A New Community Definition For MultiLayer Networks And A Novel Approach For Its Efficient Computation [article]

Abhishek Santra, Kanthi Sannappa Komar, Sanjukta Bhowmick, Sharma Chakravarthy
2020 arXiv   pre-print
Then we propose a family of algorithms for its computation using the concept of bipartite graph pairings.  ...  We also present a framework for its efficient computation using a newly proposed decoupling approach. First, we define a k-community for connected k layers of a HeMLN.  ...  Finally, we used the proposed approach for demonstrating its analysis versatility using both bipartite graph match algorithms and ω over the IMDb and DBLP data sets.  ... 
arXiv:2004.09625v1 fatcat:mxadudeyafhmrcpo6gancwcx5m

Socially enabled wireless networks: resource allocation via bipartite graph matching

Li Wang, Huaqing Wu, Wei Wang, Kwang-Cheng Chen
2015 IEEE Communications Magazine  
In this article, we present a systematic approach of generalizing social networks and also apply graph theory for appropriate resource allocation in wireless networks, particularly by leveraging bipartite  ...  As an illustration, device-to-device communications is utilized to form pairs and clusters of mobile devices regarding optimal resource matching via a bipartite graph.  ...  Starting from a straightforward extension using bipartite graph matching, we discuss multiobjective generalization of graph matching to fully utilize social networking.  ... 
doi:10.1109/mcom.2015.7295474 fatcat:6i6yn7ed5bbwdfvd2zue6qli2y
« Previous Showing results 1 — 15 out of 20,214 results