Share Email Print

Proceedings Paper

Competitive learning based on kernel functions and quadtree for image segmentation
Author(s): Tao Guan; Ling-Ling Li; Yan-Jun Zhang
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper proposes an online competitive learning algorithm, briefly denoted as KACL (Kernel Averaging Competitive Learning), using kernel functions and quadtree structure for clustering analysis and remotely sensed image segmentation. Initially, KACL constructs a quadtree with a pre-specified scale from online input data and then locates all clusters by moving or self-splitting the nodes of the quadtree. The complexity of the quadtree is decided by the distribution of data. In the learning rule of KACL, we use the local means of vectors but not single vector so as to avoid the movement of learning prototypes among different clusters. We give the mathematical properties of KACL and present the proof of its convergence. KACL avoids the dead node problem and presetting of the number of clusters. Two experiments are separately carried out on Gaussian mixture data sets and remote sensing images and the results have shown good performance.

Paper Details

Date Published: 30 September 2011
PDF: 8 pages
Proc. SPIE 8285, International Conference on Graphic and Image Processing (ICGIP 2011), 82850Y (30 September 2011); doi: 10.1117/12.913379
Show Author Affiliations
Tao Guan, Zhengzhou Institute of Aeronautic Industry Management (China)
Ling-Ling Li, Zhengzhou Institute of Aeronautic Industry Management (China)
Yan-Jun Zhang, China Mobile Ltd. (China)

Published in SPIE Proceedings Vol. 8285:
International Conference on Graphic and Image Processing (ICGIP 2011)
Yi Xie; Yanjun Zheng, Editor(s)

© SPIE. Terms of Use
Back to Top