(Hyper)-Graphs Inference through Convex Relaxations and Move Making Algorithms: Contributions and Applications in Artificial Vision

摘要

Computational visual perception seeks to reproduce human vision through the combination of visual sensors, artificial intelligence and computing. To this end, computer vision tasks are often reformulated as mathematical inference problems where the objective is to determine the set of parameters corresponding to the lowest potential of a task-specific objective function. Graphical models have been the most popu­lar formulation in the field over the past two decades where the problem is viewed as a discrete assignment labeling one. Modularity, scalability and portability are the main strengths of these methods which once combined with efficient inference algorithms they could lead to state of the art results. In this tutorial we focus on the inference component of the problem and in particular we discuss in a systematic manner the most commonly used optimization principles in the context of graphical models. Our study concerns inference over low rank models (interac­tions between variables are constrained to pairs) as well as higher order ones (arbitrary set of variables determine hyper-cliques on which con­straints are introduced) and seeks a concise, self-contained presentation of prior art as well as the presentation of the current state of the art methods in the field.