1327 search results - page 50 / 266 » Path following algorithm for the graph matching problem |
113
click to vote
TCS
2008
15 years 1 months ago
2008
This paper deals with the existence and search of properly edgecolored paths/trails between two, not necessarily distinct, vertices s and t in an edge-colored graph from an algori...
111
click to vote
CVPR
2004
IEEE
16 years 3 months ago
2004
IEEE
In this paper, we present a new segment-based stereo matching algorithm using graph cuts. In our approach, the reference image is divided into non-overlapping homogeneous segments...
121
Voted
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
126
click to vote
ECCV
2004
Springer
16 years 3 months ago
2004
Springer
In recent work, we presented a framework for many-to-many matching of multi-scale feature hierarchies, in which features and their relations were captured in a vertex-labeled, edge...
99
Voted
MLG
2007
Springer
15 years 7 months ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...