Monotone Boolean Functions, Feasibility/Infeasibility, LP-type problems and MaxCon

This paper outlines connections between Monotone Boolean Functions, LP-Type problems and the Maximum Consensus Problem. The latter refers to a particular type of robust fitting characterisation, popular in Computer Vision (MaxCon). Indeed, this is our main motivation but we believe the results of the study of these connections are more widely applicable to LP-type problems (at least 'thresholded versions', as we describe), and perhaps even more widely. We illustrate, with examples from Computer Vision, how the resulting perspectives suggest new algorithms. Indeed, we focus, in the experimental part, on how the Influence (a property of Boolean Functions that takes on a special form if the function is Monotone) can guide a search for the MaxCon solution.

[1]  Bernhard P. Wrobel,et al.  Multiple View Geometry in Computer Vision , 2001 .

[2]  David G. Lowe,et al.  Object recognition from local scale-invariant features , 1999, Proceedings of the Seventh IEEE International Conference on Computer Vision.

[3]  Philip H. S. Torr,et al.  Efficient Minimization of Higher Order Submodular Functions using Monotonic Boolean Functions , 2011, Discret. Appl. Math..

[4]  Tat-Jun Chin,et al.  Dynamic and hierarchical multi-structure geometric model fitting , 2011, 2011 International Conference on Computer Vision.

[5]  Gil Kalai,et al.  Boolean Functions : Influence , threshold and noise , 2017 .

[6]  Andrea Vedaldi,et al.  Vlfeat: an open and portable library of computer vision algorithms , 2010, ACM Multimedia.

[7]  Jiri Matas,et al.  Fixing the Locally Optimized RANSAC , 2012, BMVC.

[8]  A. D. Korshunov,et al.  Monotone Boolean functions , 2003 .

[9]  Robert C. Bolles,et al.  Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.

[10]  Tat-Jun Chin,et al.  Consensus Maximization Tree Search Revisited , 2019, 2019 IEEE/CVF International Conference on Computer Vision (ICCV).

[11]  E. G. Kul'yanov.  An algorithm for finding the maximal upper zero of an arbitrary monotonic function of the algebra of logic , 1975 .

[12]  Tat-Jun Chin,et al.  The Maximum Consensus Problem: Recent Algorithmic Advances , 2017, Synthesis Lectures on Computer Vision.

[13]  Philip H. S. Torr,et al.  The Development and Comparison of Robust Methods for Estimating the Fundamental Matrix , 1997, International Journal of Computer Vision.

[14]  Anders P. Eriksson,et al.  Efficient Globally Optimal Consensus Maximisation with Tree Search , 2015, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Alexey Oblaukhov.  A lower bound on the size of the largest metrically regular subset of the Boolean cube , 2018, Cryptography and Communications.

[16]  Andreas Geiger,et al.  Are we ready for autonomous driving? The KITTI vision benchmark suite , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.

[17]  Nir Halman,et al.  Simple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems , 2007, Algorithmica.

[18]  T. Sanders,et al.  Analysis of Boolean Functions , 2012, ArXiv.

[19]  Mohit Singh,et al.  Symmetric sums of squares over k-subset hypercubes , 2016, Math. Program..