We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
We propose a novel clustering scheme for spatio-temporal segmentation of sparse motion fields obtained from feature tracking. The approach allows for the segmentation of meaningfu...
Abstract. This article describes an algorithm for pose or motion estimation based on clustering of parameters in the six-dimensional pose space. The parameter samples are computed ...
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...