272 search results - page 20 / 55 » Minimal Function Graphs are not Instrumented |
PAMI
2010
13 years 9 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
ICCV
2001
IEEE
15 years 26 days ago
2001
IEEE
We introduce a new graph-theoretic approach to image segmentation based on minimizing a novel class of `mean cut' cost functions. Minimizing these cost functions corresponds ...
ICIAR
2007
Springer
14 years 5 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...
SCALESPACE
2007
Springer
14 years 5 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
14 years 4 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...