A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
This paper presents a fast disparity analysis approach based on a hybrid block- and pixel-recursive matching scheme. The key idea is to choose efficiently a small number of candid...
Peter Kauff, Nicole Brandenburg, Michael Karl, Oli...
We describe techniques to optimally select landmarks for performing mobile robot localization by matching terrain maps. The method is based upon a maximum-likelihood robot localiza...
Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
This paper presents an object recognition method that exploits the representation of the images obtained by means of a Binary Partition Tree (BPT). The shape matching technique in...