42 search results - page 2 / 9 » Classes of Submodular Constraints Expressible by Graph Cuts |
CVPR
2012
IEEE
11 years 7 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
This paper addresses the problem of exactly inferring the maximum a posteriori solutions of discrete multi-label MRFs or CRFs with higher order cliques. We present a framework to ...
FSTTCS
2009
Springer
13 years 10 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...
CVPR
2008
IEEE
14 years 7 months ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...
EMMCVPR
2003
Springer
13 years 10 months ago
2003
Springer
Reconstructing a 3-D scene from more than one camera is a classical problem in computer vision. One of the major sources of difficulty is the fact that not all scene elements are v...