A novel approach for geometric clustering based on tensor voting framework

In this work we propose a novel geometric clustering algorithm based on the Tensor Voting Framework (TVF). More precisely, we propose the construction of a weighted graph by means of the information diffused by TVF during the vote casting step. This graph, which summarizes informations related to the manifold geometric structure, was used for clustering purposes. To this aim, we applied the well known Dijkstra and Ford Fulkerson algorithms to recursively separate weakly connected graph components. We performed preliminary tests, comparing our algorithm with that obtained by employing a weighted version of the -NN graph. The obtained results on both synthetic and real data show that the proposed technique is promising. To test our algorithm on real datasets, we preprocessed graylevel input images by extracting their edge pixel points.