Sciweavers

1056 search results - page 39 / 212
» Constraint-Based Graph Matching
Sort
View
ICB
2007
Springer
163views Biometrics» more  ICB 2007»
14 years 3 months ago
Palmprint Recognition Based on Directional Features and Graph Matching
Palmprint recognition, as a reliable personal identity check method, has been receiving increasing attention during recent years. According to previous work, local texture analysis...
Yufei Han, Tieniu Tan, Zhenan Sun
IPPS
1999
IEEE
14 years 1 months ago
Coarse Grained Parallel Maximum Matching In Convex Bipartite Graphs
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
Prosenjit Bose, Albert Chan, Frank K. H. A. Dehne,...
ICWS
2007
IEEE
13 years 10 months ago
Improved Matchmaking Algorithm for Semantic Web Services Based on Bipartite Graph Matching
The ability to dynamically discover and invoke a Web Service is a critical aspect of Service Oriented Architectures. An important component of the discovery process is the matchma...
Umesh Bellur, Roshan Kulkarni
ACCV
2006
Springer
14 years 3 months ago
Stereo Matching Using Iterated Graph Cuts and Mean Shift Filtering
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...
Ju Yong Chang, Kyoung Mu Lee, Sang Uk Lee
EMMCVPR
2007
Springer
14 years 29 days ago
Efficient Shape Matching Via Graph Cuts
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
Frank R. Schmidt, Eno Töppe, Daniel Cremers, ...