An implementation of the "MP-BCFW" algorithm described in

Neel Shah, Vladimir Kolmogorov and Christoph H. Lampert.

In

An implementation of the "SRMP" algorithm described in

Vladimir Kolmogorov.

In

An implementation of the algorithm described in

Igor Gridchyn and Vladimir Kolmogorov.

An implementation of a minimum cost perfect matching algorithm described in

Vladimir Kolmogorov.

In

(The experiments in the paper were performed using version 1.0. A description of changes is here.)

The code can also be used for computing a maximum (non-perfect) matching: the latter problem can be reduced to a perfect matching problem via a reduction described in section 1.5.1 of Guido Schäfer's Master's thesis. This reduction doubles the size of the graph.

The code above is licensed for research purposes only. Commercial licensing of Blossom V is available through the UCL Business e-licensing website.

An implementation of a dual decomposition technique for the graph matching optimization problem described in

Lorenzo Torresani, Vladimir Kolmogorov and Carsten Rother.

An implementation of the maxflow algorithm described in

Yuri Boykov and Vladimir Kolmogorov.

In

Note that all experimental results reported in the paper are based on original implementation of our algorithm that we developed while at Siemens Corp. Research (Princeton, NJ). We are not allowed to distribute that version. Below is a comparable version that I later independently re-implemented based on published materials.

Old version 2.22 is still available. Commercial licensing of MaxFlow (vsn 2.22) is available through the UCL Business e-licensing website.

Implements algorithms for minimizing functions of binary variables
with unary and pairwise terms based on *roof duality* described in the following papers:

P. L. Hammer, P. Hansen, and B. Simeone.

E. Boros, P. L. Hammer, and X. Sun.

E. Boros, P. L. Hammer, and G. Tavares.

C. Rother, V. Kolmogorov, V. Lempitsky, and M. Szummer.

An implementation of the primal-dual method for the dual of the convex network flow problem ("Convex Markov Random Fields") described in

Vladimir Kolmogorov and Akiyoshi Shioura.

An implementation of the three stereo algorithms described in the papers

VLadimir Kolmogorov, Ramin Zabih and Steven Gortler.

In

Vladimir Kolmogorov and Ramin Zabih.

In

Yuri Boykov, Olga Veksler and Ramin Zabih.

In

Tested under windows, Visual C++ 6.0 compiler and unix (SunOS 5.8 and RedHat Linux 7.0, GNU c++ compiler).

- match-v3.4.src.tar.gz (628 Kb)

Back to Main Page |
---|