Abstract
We are transforming Radial Threshold Clustering (RTC), an O(N(2)) algorithm, into Extended Quality Clustering (eQual), an O(N) algorithm with several novel features. Daura et al.'s RTC algorithm is a partitioning clustering algorithm that groups similar frames together based on their similarity to the seed configuration. RTC has two main issues: it scales as O(N(2)), making it inefficient for large frame counts, and its clustering results depend on the order of input frames whenever there is a tie in the most populated cluster. To address the first issue, we have increased the speed of the seed selection by using k-means++ to select the seeds of the available frames. To address the second issue and make the results invariant with respect to frame order, the densest and most compact cluster is chosen using the extended similarity indices. The new algorithm is able to cluster in linear time and produce more compact and separate clusters.