666 search results - page 61 / 134 » Unbalanced Graph Cuts |
110
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
178
Voted
TOG
2008
15 years 2 months ago
2008
Video, like images, should support content aware resizing. We present video retargeting using an improved seam carving operator. Instead of removing 1D seams from 2D images we rem...
302
Voted
PAMI
2010
15 years 1 months ago
2010
—The efficient application of graph cuts to Markov Random Fields (MRFs) with multiple discrete or continuous labels remains an open question. In this paper, we demonstrate one p...
133
Voted
UAI
2004
15 years 4 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
129
Voted
ATMOS
2010
15 years 1 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...