Searching for authors named "Nikos Komodakis" – sorted by Relevance.
3 documents found, showing 1 through 3.
-
approximately optimal solutions for single and dynamic mrfs
- …A new efficient MRF optimization algorithm, called Fast-PD, is proposed, which generalizes α-expansion. One of its main advantages is that it offers a substantial speedup over that method, e.g. it can be at least 3-9 times faster than α-expansion. Its efficiency is a result of the fact that Fast-PD …
- Cited by 3 (1 self) – Add To MetaCart
-
Approximate labeling via graph-cuts based on linear programming
- …A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs that are frequently encountered in computer vision. The proposed framework utilizes tools from the duality theory of line…
- Cited by 5 (0 self) – Add To MetaCart
-
Clustering via LP-based Stabilities ∗
- …A novel center-based clustering algorithm is proposed in this paper. We first formulate clustering as an NP-hard linear integer program and we then use linear programming and the duality theory to derive the solution of this optimization problem. This leads to an efficient and very general algorithm…
- Add To MetaCart
Showing 1 through 3.
