Software





1. SRMP

An implementation of the "SRMP" algorithm described in

SRMP generalizes TRW-S to higher-order graphical models.

2. POTTS

An implementation of the algorithm described in


3. BLOSSOM V

An implementation of a minimum cost perfect matching algorithm described 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.


4. GRAPH MATCHING

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


5. MAXFLOW

An implementation of the maxflow algorithm described 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 websilte.


6. QPBO.

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


7. CONVEX-MRF.

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


8. MATCH.

An implementation of the three stereo algorithms described in the papers

and

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

(NEW: an option of truncated linear smoothness term instead of Potts has been added).



Back to Main Page