396 search results - page 22 / 80 » A Graph Cut Algorithm for Generalized Image Deconvolution |
105
Voted
JMLR
2010
14 years 9 months ago
2010
This paper proposes a novel algorithm for semisupervised learning. This algorithm learns graph cuts that maximize the margin with respect to the labels induced by the harmonic fun...
253
Voted
SCIA
2011
Springer
14 years 5 months ago
2011
Springer
Abstract. Variational frameworks based on level set methods are popular for the general problem of image segmentation. They combine different feature channels in an energy minimiz...
133
click to vote
PAMI
2007
15 years 1 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
152
Voted
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
103
Voted
PAMI
2010
15 years 18 days ago
2010
—In partitioning, clustering, and grouping problems, a typical goal is to group together similar objects, or pixels in the case of image processing. At the same time, another goa...