A Similarity-Oriented RDF Graph Matching Algorithm for Ranking Linked Data

2012 ◽  
Author(s):  
Dehai Zhang ◽  
Tianlong Song ◽  
Jun He ◽  
Xingwei Shi ◽  
Yan Dong
Keyword(s):  
Linked Data ◽  
Graph Matching ◽  
Matching Algorithm ◽  
Rdf Graph

Analysis of Cluttered Scenes Using an Elastic Matching Approach for Stereo Images

2006 ◽  
Vol 18 (6) ◽  
pp. 1441-1471 ◽  
Author(s):  
Christian Eckes ◽  
Jochen Triesch ◽  
Christoph von der Malsburg
Keyword(s):  
Graph Matching ◽  
Recognition Performance ◽  
Stereo Image ◽  
Matching Algorithm ◽  
Automatic Interpretation ◽  
Color Features ◽  
Occluded Objects ◽  
Elastic Graph Matching ◽  
Image Pairs ◽  
Object Models

We present a system for the automatic interpretation of cluttered scenes containing multiple partly occluded objects in front of unknown, complex backgrounds. The system is based on an extended elastic graph matching algorithm that allows the explicit modeling of partial occlusions. Our approach extends an earlier system in two ways. First, we use elastic graph matching in stereo image pairs to increase matching robustness and disambiguate occlusion relations. Second, we use richer feature descriptions in the object models by integrating shape and texture with color features. We demonstrate that the combination of both extensions substantially increases recognition performance. The system learns about new objects in a simple one-shot learning approach. Despite the lack of statistical information in the object models and the lack of an explicit background model, our system performs surprisingly well for this very difficult task. Our results underscore the advantages of view-based feature constellation representations for difficult object recognition problems.

scholarly journals Matching-based cache placement decision for 5G network caching

2021 ◽  
Author(s):  
Shadi Sadeghpour Kharkan
Keyword(s):  
Graph Matching ◽  
Placement Problem ◽  
Matching Problem ◽  
Matching Algorithm ◽  
Cell Network ◽  
5G Network ◽  
Backhaul Link ◽  
Random Placement ◽  
Cache Placement ◽  
Bottleneck Link

In this thesis, we present a cache placement scheme to deal with backhaul link constraint in Small Cell Network for 5G wireless network. We formulated the cache placement problem as a graph matching problem and presented an optimal file-helper matching algorithm. We defined stability criterion for the matching and found that our matching solution is stable in the sense that every helper finds at least one file to cache given that no file exceed minimum cache size. We achieved a unique placement of a file within a cluster of helpers to increase the number of files cached within a cluster. Further, our experimental evaluation demonstrates that our algorithm increases local and neighbor hit ratios as compared to a random placement, which in turn significantly decreases the traffic that goes over the backhaul bottleneck link.

A POCS-based graph matching algorithm

2004 ◽  
Vol 26 (11) ◽  
pp. 1526-1530 ◽  
Author(s):  
B.J. van Wyk ◽  
M.A. van Wyk
Keyword(s):  
Graph Matching ◽  
Matching Algorithm
Sign in / Sign up

Export Citation Format

Share Document