513 search results - page 82 / 103 » Soft Edge Coloring |
119
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
117
Voted
ICCV
2009
IEEE
16 years 5 months ago
2009
IEEE
We propose a polynomial-time algorithm for segmentation
and (open) boundary estimation which takes into account
a series of user-specified attraction points. In contrast
to exis...
107
click to vote
CVPR
2007
IEEE
16 years 2 months ago
2007
IEEE
We propose a family of kernels between images, defined as kernels between their respective segmentation graphs. The kernels are based on soft matching of subtree-patterns of the r...
82
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Optical flow estimation requires spatial integration, which essentially poses a grouping question: what points belong to the same motion and what do not. Classical local approache...
91
Voted
SIGGRAPH
1999
ACM
15 years 4 months ago
1999
ACM
In this paper, we develop methods to rapidly remove rough features from irregularly triangulated data intended to portray a smooth surface. The main task is to remove undesirable ...