1162 search results - page 76 / 233 » Minimum Cycle Bases in Graphs Algorithms and Applications |
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
INFOCOM
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Many sensor network applications are tightly coupled with the geometric environment where the sensor nodes are deployed. The topological skeleton extraction has shown gr...
IJFCS
1998
13 years 8 months ago
1998
Directed acyclic graphs (dags) are often used to model circuits. Path lengths in such dags represent circuit delays. In the vertex splitting problem, the objective is to determine...
CVPR
2009
IEEE
2009
IEEE
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
15 years 3 months ago
This paper studies a framework for matching an unknown
number of corresponding structures in two images
(shapes), motivated by detecting objects in cluttered background
and lear...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
— Max-product belief propagation is a local, iterative algorithm to find the mode/MAP estimate of a probability distribution. While it has been successfully employed in a wide v...