Complexity of Discrete Energy Minimization Problems

Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is known to be NP-hard. However, is it possible to approximate this problem with a reasonable ratio bound on the solution quality in polynomial time? We show in this paper that the answer is no. Specifically, we show that general energy minimization, even in the 2-label pairwise case, and planar energy minimization with three or more labels are exp-APX-complete. This finding rules out the existence of any approximation algorithm with a sub-exponential approximation ratio in the input size for these two problems, including constant factor approximations. Moreover, we collect and review the computational complexity of several subclass problems and arrange them on a complexity scale consisting of three major complexity classes -- PO, APX, and exp-APX, corresponding to problems that are solvable, approximable, and inapproximable in polynomial time. Problems in the first two complexity classes can serve as alternative tractable formulations to the inapproximable ones. This paper can help vision researchers to select an appropriate model for an application or guide them in designing new algorithms.Comment: ECCV'16 accepte

Vortex Rings in Fast Rotating Bose-Einstein Condensates

When Bose-Eintein condensates are rotated sufficiently fast, a giant vortex phase appears, that is the condensate becomes annular with no vortices in the bulk but a macroscopic phase circulation around the central hole. In a former paper [M. Correggi, N. Rougerie, J. Yngvason, {\it arXiv:1005.0686}] we have studied this phenomenon by minimizing the two dimensional Gross-Pitaevskii energy on the unit disc. In particular we computed an upper bound to the critical speed for the transition to the giant vortex phase. In this paper we confirm that this upper bound is optimal by proving that if the rotation speed is taken slightly below the threshold there are vortices in the condensate. We prove that they gather along a particular circle on which they are evenly distributed. This is done by providing new upper and lower bounds to the GP energy.Comment: to appear in Archive of Rational Mechanics and Analysi

Template Generation - A Graph Profiling Algorithm

The availability of high-level design entry tooling is crucial for the viability of any reconfigurable SoC architecture. This paper presents a template generation algorithm. The objective of template generation step is to extract functional equivalent structures, i.e. templates, from a control data flow graph. By profiling the graph, the algorithm generates all the possible templates and the corresponding matches. Using unique serial numbers and circle numbers, the algorithm can find all distinct templates with multiple outputs. A new type of graph (hydragraph) that can cope with multiple outputs is introduced. The generated templates pepresented by the hydragraph are not limited in shapes, i.e., we can find templates with multiple outputs or multiple sinks

Fixed parameter tractability of crossing minimization of almost-trees

We investigate exact crossing minimization for graphs that differ from trees by a small number of additional edges, for several variants of the crossing minimization problem. In particular, we provide fixed parameter tractable algorithms for the 1-page book crossing number, the 2-page book crossing number, and the minimum number of crossed edges in 1-page and 2-page book drawings.Comment: Graph Drawing 201