2314 search results - page 227 / 463 » Minimal Partitions of a Graph |
134
click to vote
CVPR
2004
IEEE
16 years 6 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...
136
click to vote
ICCV
2007
IEEE
16 years 6 months ago
2007
IEEE
In this work, we present a common framework for seeded image segmentation algorithms that yields two of the leading methods as special cases - The Graph Cuts and the Random Walker...
126
click to vote
ICIAR
2007
Springer
15 years 10 months ago
2007
Springer
A discrete regularization framework on graphs is proposed and studied for color image filtering purposes when images are represented by grid graphs. Image filtering is considered...
145
click to vote
SCALESPACE
2007
Springer
15 years 10 months ago
2007
Springer
We propose a discrete regularization framework on weighted graphs of arbitrary topology, which unifies image and mesh filtering. The approach considers the problem as a variation...
GECCO
2003
Springer
15 years 9 months ago
2003
Springer
This paper suggests dense and switched modular primitives for a bond-graph-based GP design framework that automatically synthesizes designs for multi-domain, lumped parameter dynam...