133 search results - page 6 / 27 » Object Recognition by Matching Symbolic Edge Graphs |
DAM
2002
13 years 7 months ago
2002
In K(n, n) with edges colored either red or blue, we show that the problem of finding a solution matching, a perfect matching consisting of exactly r red edges, and (n - r) blue e...
CVPR
2007
IEEE
14 years 9 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...
IBPRIA
2005
Springer
14 years 1 months ago
2005
Springer
In this paper, we propose a new method to extract moving objects from a video stream without any motion estimation. The objective is to obtain a method robust to noise, large motio...
DAM
2002
13 years 7 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
GBRPR
2005
Springer
14 years 1 months ago
2005
Springer
Shock graphs have emerged as a powerful generic 2-D shape representation. However, most approaches typically assume that the silhouette has been correctly segmented. In this paper,...