Parallel nearest neighbour clustering algorithm (PNNCA) for segmenting retinal blood vessels

Authors:
Sameh A. Salem;Asoke K. Nandi
Affiliations:
Signal Processing and Communications Group, Department of Electrical Engineering and Electronics, The University of Liverpool, Brownlow Hill, Liverpool, UK;Signal Processing and Communications Group, Department of Electrical Engineering and Electronics, The University of Liverpool, Brownlow Hill, Liverpool, UK
Venue:
PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Year:
2007

Citing 6
Cited 1

Parallel algorithms for hierarchical clustering

Parallel Computing
Large-Scale Parallel Data Clustering

IEEE Transactions on Pattern Analysis and Machine Intelligence
MPI-The Complete Reference, Volume 1: The MPI Core

MPI-The Complete Reference, Volume 1: The MPI Core
Performance Evaluation of Some Clustering Algorithms and Validity Indices

IEEE Transactions on Pattern Analysis and Machine Intelligence
P-AutoClass: Scalable Parallel Clustering for Mining Large Data Sets

IEEE Transactions on Knowledge and Data Engineering
Pattern Recognition, Third Edition

Pattern Recognition, Third Edition

A new scalable and efficient parallel algorithm (PRACAL) for clustering large datasets

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.