We propose a network flow based optimization method for data association needed for multiple object tracking. The maximum-a-posteriori (MAP) data association problem is mapped in...
In this paper we present a methodology for finding tight convex relaxations for a special set of quadratic constraints given by bilinear and linear terms that frequently arise in ...
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
We address the problem of recovering 3D models from uncalibrated images of architectural scenes. We propose a simple, geometrically intuitive method which exploits the strong rigi...
Roberto Cipolla, Duncan P. Robertson, Edmond Boyer
Several constraint handling techniques have been proposed to be used with the evolutionary algorithms (EAs). According to the no free lunch theorem, it is impossible for a single c...