6358 search results - page 330 / 1272 » Computing spectral sequences |
175
click to vote
RAS
2007
15 years 6 months ago
2007
The purpose of this study is to investigate a variational formulation of the problem of three-dimensional (3D) interpretation of temporal image sequences based on the 3D brightnes...
247
Voted
CVPR
2009
IEEE
17 years 2 months ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
174
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
149
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We consider the problem of segmenting an image into foreground and background, with foreground containing solely objects of interest known a priori. We propose an integration mode...
178
click to vote
CVPR
2005
IEEE
16 years 8 months ago
2005
IEEE
We present a quantitative evaluation of SE-MinCut, a novel segmentation algorithm based on spectral embedding and minimum cut. We use human segmentations from the Berkeley Segment...