PARALLEL NEAREST NEIGHBOUR CLUSTERING ALGORITHM (PNNCA) FOR SEGMENTING RETINAL BLOOD VESSELS

摘要

In this paper, the design and implementation of a recently developed clustering algorithm NNCA [1], Nearest Neighbour Clustering Algorithm, is proposed in conjunction with a Fast K Nearest Neighbour (FKNN) strategy for further reduction in processing time. The parallel algorithm (PNNCA) has the ability to cluster pixels of retinal images into those belonging to blood vessels and others not belonging to blood vessels in a reasonable time.