1133 search results - page 22 / 227 » Basics of Graph Cuts |
JCT
2006
13 years 7 months ago
2006
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-conne...
DAC
1997
ACM
13 years 12 months ago
1997
ACM
This paper presents a verification technique which is specifically targeted to formally comparing large combinational circuits with some structural similarities. The approach co...
DATE
2005
IEEE
13 years 9 months ago
2005
IEEE
Memory space limitation is a serious problem for many embedded systems from diverse application domains. While circuit/packaging techniques are definitely important to squeeze la...
ICCV
2009
IEEE
15 years 19 days ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...
CVPR
2004
IEEE
14 years 9 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...