Efficient Mean-shift Clustering Using Gaussian KD-Tree

Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional and large data set clustering. In this paper, we propose an efficient method that allows mean shift clustering performed...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computer graphics forum Jg. 29; H. 7; S. 2065 - 2073
Hauptverfasser:	Xiao, Chunxia, Liu, Meng
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford, UK Blackwell Publishing Ltd 01.09.2010
Schlagworte:	Approximation Clustering Computational efficiency Computer graphics Datasets Gaussian I.4 [Computing methodologies]: Image Processing and Computer Vision-Applications Image coding Image processing systems Interactive Mathematical models Normal distribution Segmentation Studies
ISSN:	0167-7055, 1467-8659
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!