666 search results - page 69 / 134 » Unbalanced Graph Cuts |
127
Voted
Publication
Tracking heart motion plays an essential role in the diagnosis of cardiovascular diseases. As such, accurate characterization of dynamic behavior of the left ventricle (LV) is esse...
112
Voted
EVOW
2006
Springer
15 years 6 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
133
click to vote
TOC
2008
15 years 2 months ago
2008
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
130
Voted
DAM
2008
15 years 2 months ago
2008
In this paper, we address the following problem: given a synchronous digital circuit, is it possible to construct a new circuit computing the same function as the original one but...
117
Voted
SCALESPACE
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. In this paper, we suggest an algorithm to recover an image whose wavelet coefficients are partially lost. We propose a wavelet inpainting model by using L0-norm and the t...