论文标题
单调布尔功能，可行性/不可行性，LP型问题和MAXCON
Monotone Boolean Functions, Feasibility/Infeasibility, LP-type problems and MaxCon
论文作者
论文摘要
本文概述了单调布尔功能，LP型问题和最大共识问题之间的联系。后者是指在计算机视觉（MAXCON）中流行的特定类型的可靠拟合特征。的确，这是我们的主要动机，但我们认为这些联系的研究结果更广泛地适用于LP型问题（至少我们描述的是“阈值版本”），甚至更广泛。我们以计算机视觉的示例来说明产生的观点如何提出新算法。的确，我们将重点放在实验部分上，上面是影响（如果函数是单调的，则采用特殊形式的布尔函数的属性）如何指导搜索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.
