Quadratic pseudo-Boolean optimization

Quadratic pseudo-Boolean optimisation (QPBO) is a combinatorial optimization method for quadratic pseudo-Boolean functions in the form

${\displaystyle f(\mathbf {x} )=w_{0}+\sum _{p\in V}w_{p}(x_{p})+\sum _{(p,q)\in E}w_{pq}(x_{p},x_{q})}$

in the binary variables ${\displaystyle x_{p}\in \{0,1\}\;\forall p\in V=\{1,\dots ,n\}}$, with ${\displaystyle E\subseteq V\times V}$. If ${\displaystyle f}$ is submodular then QPBO produces a global optimum equivalently to graph cut optimization, while if ${\displaystyle f}$ contains non-submodular terms then the algorithm produces a partial solution with specific optimality properties, in both cases in polynomial time. ^[1]

QPBO is a useful tool for inference on Markov random fields and conditional random fields, and has applications in computer vision problems such as image segmentation and stereo matching. ^[2]

Optimization of non-submodular functions

If the coefficients ${\displaystyle w_{pq}}$ of the quadratic terms satisfy the submodularity condition

${\displaystyle w_{pq}(0,0)+w_{pq}(1,1)\leq w_{pq}(0,1)+w_{pq}(1,0)}$

then the function can be efficiently optimised with graph cut optimization. It is indeed possible to represent it with a non-negative weighted graph, and the global minimum can be found in polynomial time by computing a minimum cut of the graph, which can be computed with algorithms such as Ford–Fulkerson, Edmonds–Karp, and Boykov–Kolmogorov's.

If the function is not submodular, then the problem is NP-hard in the general case and it is not always possible to solve it exactly in polynomial time. It is possible to replace the target function with a similar but submodular approximation, e.g. by removing all non-submodular terms or replacing them with submodular approximations, but such approach is generally sub-optimal and it produces satisfying results only if the number of non-submodular terms is relatively small. ^[1]

QPBO builds an extended graph, introducing a set of auxiliary variables ideally equivalent to the negation of the variables in the problem. If the nodes in the graph associated to a variable (representing the variable itself and its negation) are separated by the minimum cut of the graph in two different connected components, then the optimal value for such variable is well defined, otherwise it is not possible to infer it. Such method produces results generally superior to submodular approximations of the target function. ^[1]

Properties

QPBO produces a solution where each variable assumes one of three possible values: true, false, and undefined, noted in the following as 1, 0, and ${\displaystyle \emptyset }$ respectively. The solution has the following two properties.

• Partial optimality: if ${\displaystyle f}$ is submodular, then QPBO produces a global minimum exactly, equivalent to graph cut, and all variables have a non-undefined value; if submodularity is not satisfied, the result will be a partial solution ${\displaystyle \mathbf {x} }$ where a subset ${\displaystyle {\hat {V}}\subseteq V}$ of the variables have a non-undefined value. A partial solution is always part of a global solution, i.e. there exists a global minimum point ${\displaystyle \mathbf {x^{*}} }$ for ${\displaystyle f}$ such that ${\displaystyle x_{i}=x_{i}^{*}}$ for each ${\displaystyle i\in {\hat {V}}}$.
• Persistence: given a solution ${\displaystyle \mathbf {x} }$ generated by QPBO and an arbitrary assignment of values ${\displaystyle \mathbf {y} }$ to the variables, if a new solution ${\displaystyle {\hat {\mathbf {y} }}}$ is constructed by replacing ${\displaystyle y_{i}}$ with ${\displaystyle x_{i}}$ for each ${\displaystyle i\in {\hat {V}}}$, then ${\displaystyle f({\hat {\mathbf {y} }})\leq f(\mathbf {y} )}$. ^[1]

Algorithm

Graph representing a function of two variables ${\displaystyle x_{p}}$ and ${\displaystyle x_{q}}$.

The algorithm can be divided in three steps: graph construction, max-flow computation, and assignment of values to the variables.

When constructing the graph, the set of vertices ${\displaystyle V}$ contains the source and sink nodes ${\displaystyle s}$ and ${\displaystyle t}$, and a pair of nodes ${\displaystyle p}$ and ${\displaystyle p'}$ for each variable. After re-parametrising the function to normal form, ^{[note 1]} a pair of edges is added to the graph for each term ${\displaystyle w}$:

• for each term ${\displaystyle w_{p}(0)}$ the edges ${\displaystyle p\rightarrow t}$ and ${\displaystyle s\rightarrow p'}$, with weight ${\displaystyle {\frac {1}{2}}w_{p}(0)}$;
• for each term ${\displaystyle w_{p}(1)}$ the edges ${\displaystyle s\rightarrow p}$ and ${\displaystyle p'\rightarrow t}$, with weight ${\displaystyle {\frac {1}{2}}w_{p}(1)}$;
• for each term ${\displaystyle w_{pq}(0,1)}$ the edges ${\displaystyle p\rightarrow q}$ and ${\displaystyle q'\rightarrow p'}$, with weight ${\displaystyle {\frac {1}{2}}w_{pq}(0,1)}$;
• for each term ${\displaystyle w_{pq}(1,0)}$ the edges ${\displaystyle q\rightarrow p}$ and ${\displaystyle p'\rightarrow q'}$, with weight ${\displaystyle {\frac {1}{2}}w_{pq}(1,0)}$;
• for each term ${\displaystyle w_{pq}(0,0)}$ the edges ${\displaystyle p\rightarrow q'}$ and ${\displaystyle q\rightarrow p'}$, with weight ${\displaystyle {\frac {1}{2}}w_{pq}(0,0)}$;
• for each term ${\displaystyle w_{pq}(1,1)}$ the edges ${\displaystyle q'\rightarrow p}$ and ${\displaystyle p'\rightarrow q}$, with weight ${\displaystyle {\frac {1}{2}}w_{pq}(1,1)}$.

The minimum cut of the graph can be computed with a max-flow algorithm. In the general case, the minimum cut is not unique, and each minimum cut correspond to a different partial solution, however it is possible to build a minimum cut such that the number of undefined variables is minimal.

Once the minimum cut is known, each variable receives a value depending upon the position of its corresponding nodes ${\displaystyle p}$ and ${\displaystyle p'}$: if ${\displaystyle p}$ belongs to the connected component containing the source and ${\displaystyle p'}$ belongs to the connected component containing the sink then the variable will have value of 0. Vice versa, if ${\displaystyle p}$ belongs to the connected component containing the sink and ${\displaystyle p'}$ to the one containing the source, then the variable will have value of 1. If both nodes ${\displaystyle p}$ and ${\displaystyle p'}$ belong to the same connected component, then the value of the variable will be undefined. ^[2]

The way undefined variables can be handled is dependent upon the context of the problem. In the general case, given a partition of the graph in two sub-graphs and two solutions, each one optimal for one of the sub-graphs, then it is possible to combine the two solutions into one solution optimal for the whole graph in polynomial time. ^[3] However, computing an optimal solution for the subset of undefined variables is still a NP-hard problem. In the context of iterative algorithms such as ${\displaystyle \alpha }$-expansion, a reasonable approach is to leave the value of undefined variables unchanged, since the persistence property guarantees that the target function will have non-increasing value. ^[1] Different exact and approximate strategies to minimise the number of undefined variables exist. ^[2]

Higher order terms

It is always possible to reduce a higher-order function to a quadratic function which is equivalent with respect to the optimisation, problem known as "higher-order clique reduction" (HOCR), and the result of such reduction can be optimized with QPBO. Generic methods for reduction of arbitrary functions rely on specific substitution rules and in the general case they require the introduction of auxiliary variables. ^[4] In practice most terms can be reduced without introducing additional variables, resulting in a simpler optimization problem, and the remaining terms can be reduced exactly, with addition of auxiliary variables, or approximately, without addition of any new variable. ^[5]

Notes

1. Kolmogorov and Rother (2007).
2. Rother et al. (2007).
3. Billionnet and Jaumard (1989).
4. Fix et al. (2011).
5. Ishikawa (2014).

References

• Billionnet, Alain; Jaumard, Brigitte (1989). "A decomposition method for minimizing quadratic pseudo-boolean functions". Operations Research Letters . 8 (3): 161–163. doi:10.1016/0167-6377(89)90043-6.
• Fix, Alexander; Gruber, Aritanan; Boros, Endre; Zabih, Ramin (2011). A graph cut algorithm for higher-order Markov random fields (PDF). International Conference on Computer Vision. pp. 1020–1027.
• Ishikawa, Hiroshi (2014). Higher-Order Clique Reduction Without Auxiliary Variables (PDF). Conference on Computer Vision and Pattern Recognition. IEEE. pp. 1362–1269.
• Kolmogorov, Vladimir; Rother, Carsten (2007). "Minimizing Nonsubmodular Functions: A Review". IEEE Transactions on Pattern Analysis and Machine Intelligence . IEEE. 29 (7): 1274–1279. doi:10.1109/tpami.2007.1031. PMID   17496384.
• Rother, Carsten; Kolmogorov, Vladimir; Lempitsky, Victor; Szummer, Martin (2007). Optimizing binary MRFs via extended roof duality (PDF). Conference on Computer Vision and Pattern Recognition. pp. 1–8.

Notes

1. The representation of a pseudo-Boolean function with coefficients ${\displaystyle \mathbf {w} =(w_{0},w_{1},\dots ,w_{nn})}$ is not unique, and if two coefficient vectors ${\displaystyle \mathbf {w} }$ and ${\displaystyle \mathbf {w} '}$ represent the same function then ${\displaystyle \mathbf {w} '}$ is said to be a reparametrisation of ${\displaystyle \mathbf {w} }$ and vice versa. In some constructions it is useful to ensure that the function has a specific form, called normal form, which is always defined for any function, and it is not unique. A function ${\displaystyle f}$ is in normal form if the two following conditions hold (Kolmogorov and Rother (2007)):
   1. ${\displaystyle \min\{w_{p}^{0},w_{p}^{1}\}=0}$ for each ${\displaystyle p\in V}$;
   2. ${\displaystyle \min\{w_{pq}^{0j},w_{pq}^{1j}\}=0}$ for each ${\displaystyle (p,q)\in E}$ and for each ${\displaystyle j\in \{0,1\}}$.
   Given an arbitrary function ${\displaystyle f}$, it is always possible to find a reparametrisation to normal form with the following algorithm in two steps (Kolmogorov and Rother (2007)):
   1. as long as there exist indices ${\displaystyle (p,q)\in E}$ and ${\displaystyle j\in \{0,1\}}$ such that the second condition of normality is not satisfied, substitute:
      • ${\displaystyle w_{pq}^{0j}}$ with ${\displaystyle w_{pq}^{0j}-a}$
      • ${\displaystyle w_{pq}^{1j}}$ with ${\displaystyle w_{pq}^{1j}-a}$
      • ${\displaystyle w_{q}^{j}}$ with ${\displaystyle w_{q}^{j}+a}$

      where ${\displaystyle a=\min\{w_{pq}^{0j},w_{pq}^{1j}\}}$;

   2. for ${\displaystyle p=1,\dots ,n}$, substitute:
      • ${\displaystyle w_{0}}$ with ${\displaystyle w_{0}+a}$
      • ${\displaystyle w_{p}^{0}}$ with ${\displaystyle w_{p}^{0}-a}$
      • ${\displaystyle w_{p}^{1}}$ with ${\displaystyle w_{p}^{1}-a}$

      where ${\displaystyle a=\min\{w_{p}^{0},w_{p}^{1}\}}$.

External links

• Implementation of QPBO (C++), available under the GNU General Public License, by Vladimir Kolmogorov.
• Implementation of HOCR (C++), available under the MIT license, by Hiroshi Ishikawa.