A Variant of Adaptive Mean Shift-Based Clustering

Author: Li, Fajie; Klette, Reinhard

Date: 2008

Type: Conference poster

Link to this item using this URL: http://hdl.handle.net/2292/3274

The University of Auckland Library

Abstract

Conference Details: ICONIP 2008 - 15th International Conference on Neural Information. Processing of the Asia-Pacific Neural Network Assembly November 25-28, 2008, Auckland, New Zealand We are interested in clustering sets of highly overlapping clusters. For example, given is an observed set of stars (considered to be a set of points); how to find (recover) clusters which are the contributing galaxies of the observed union of those clusters? Below we propose a modification of an adaptive mean shift-based clustering algorithm (called Algorithm 1) proposed in 2003 by B. Geogescu, I. Shimsoni and P. Meer

Citation: ["ICONIP 2008 - 15th International Conference on Neural Information Processing of the Asia-Pacific Neural Network Assembly - Poster Session 5 - (128), (2008)"]

Copyright: https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm