A variant of adaptive mean shift-based clustering

This paper proposes a special adaptive mean shift clustering algorithm, especially for the case of highly overlapping clusters. Its application is demonstrated for simulated data, aiming at finding the 'old clusters'. The obtained clustering result is actually close to an estimated upper bound, derived for those simulated data elsewhere.