TY - GEN
T1 - Combining the self-adaptive neural network and support vector machine for online clustering and image segmentation
AU - Li, Kan
AU - Liu, Ruipeng
PY - 2011
Y1 - 2011
N2 - The difficulties of online clustering are how to handle variation of cluster number in the same framework, how to be computationally efficient for real time applications, and how to ensure the error convergence of the algorithm. This paper presents a new online clustering algorithm that combines the self-adaptive neural network and support vector machine, which is used to learn continuously evolving clusters from non-stationary data. The online clustering algorithm uses a fast adaptive learning procedure to take into account variations over time. In non-stationary and multi-class environment, the algorithm learning procedure consists of five main stages: creation, adaptation, mergence, split and elimination. One of limitations of existing segmentation algorithms is that these algorithms cannot adapt to real-world changes. The proposed algorithm may solve the problem, and uses the proposed algorithm to do image segmentation. Experiments are carried out to illustrate the performance of the proposed algorithm. Compared with SAKM algorithm, our algorithm shows better performance in accuracy of clustering. On Berkeley image data set, we do image segmentation to compare our algorithm with Nyström method, and results show our algorithm had better performance. On the timevarying meteorological satellite FY-2 water vapor images, we further test our algorithm for image segmentation.
AB - The difficulties of online clustering are how to handle variation of cluster number in the same framework, how to be computationally efficient for real time applications, and how to ensure the error convergence of the algorithm. This paper presents a new online clustering algorithm that combines the self-adaptive neural network and support vector machine, which is used to learn continuously evolving clusters from non-stationary data. The online clustering algorithm uses a fast adaptive learning procedure to take into account variations over time. In non-stationary and multi-class environment, the algorithm learning procedure consists of five main stages: creation, adaptation, mergence, split and elimination. One of limitations of existing segmentation algorithms is that these algorithms cannot adapt to real-world changes. The proposed algorithm may solve the problem, and uses the proposed algorithm to do image segmentation. Experiments are carried out to illustrate the performance of the proposed algorithm. Compared with SAKM algorithm, our algorithm shows better performance in accuracy of clustering. On Berkeley image data set, we do image segmentation to compare our algorithm with Nyström method, and results show our algorithm had better performance. On the timevarying meteorological satellite FY-2 water vapor images, we further test our algorithm for image segmentation.
UR - http://www.scopus.com/inward/record.url?scp=84858784728&partnerID=8YFLogxK
U2 - 10.1109/IWACI.2011.6160074
DO - 10.1109/IWACI.2011.6160074
M3 - Conference contribution
AN - SCOPUS:84858784728
SN - 9781612843735
T3 - Proceedings of 4th International Workshop on Advanced Computational Intelligence, IWACI 2011
SP - 576
EP - 581
BT - Proceedings of 4th International Workshop on Advanced Computational Intelligence, IWACI 2011
T2 - 4th International Workshop on Advanced Computational Intelligence, IWACI 2011
Y2 - 19 October 2011 through 21 October 2011
ER -