Abstract. PatchMatch is a fast algorithm for computing dense approximate nearest neighbor correspondences between patches of two image regions [1]. This paper generalizes PatchMatc...
This article presents a new system for automatically constructing and training radial basis function networks based on original evolutionary computing methods. This system, called...
Foreground segmentation is one of the most challenging problems in computer vision. In this paper, we propose a new algorithm for static camera foreground segmentation. It combine...
To navigate reliably in indoor environments, a mobile robot must know where it is. This includes both the ability of globally localizing the robot from scratch, as well as trackin...
Frank Dellaert, Wolfram Burgard, Dieter Fox, Sebas...
We introduce a new dissimilarity function for ranked lists, the expected weighted Hoeffding distance, that has several advantages over current dissimilarity measures for ranked s...