Fast Optimized Cluster Algorithm for Localizations (FOCAL): A spatial cluster analysis for super-resolved microscopy

41Citations
Citations of this article
74Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Motivation: Single-molecule localization microscopy (SMLM) microscopy provides images of cellular structure at a resolution an order of magnitude below what can be achieved by conventional diffraction limited techniques. The concomitantly larger data sets generated by SMLM require increasingly efficient image analysis software. Density based clustering algorithms, with the most ubiquitous being DBSCAN, are commonly used to quantitatively assess sub-cellular assemblies. DBSCAN, however, is slow, scaling with the number of localizations like O(n log (n)) at best, and it's performance is highly dependent upon a subjectively selected choice of parameters. Results: We have developed a grid-based clustering algorithm FOCAL, which explicitly accounts for several dominant artifacts arising in SMLM image reconstructions. FOCAL is fast and efficient, scaling like O(n), and only has one set parameter. We assess DBSCAN and FOCAL on experimental dSTORM data of clusters of eukaryotic RNAP II and PALM data of the bacterial protein H-NS, then provide a detailed comparison via simulation. FOCAL performs comparable and often superior to DBSCAN while yielding a significantly faster analysis. Additionally, FOCAL provides a novel method for filtering out of focus clusters from complex SMLM images.

Cite

CITATION STYLE

APA

Mazouchi, A., & Milstein, J. N. (2016). Fast Optimized Cluster Algorithm for Localizations (FOCAL): A spatial cluster analysis for super-resolved microscopy. Bioinformatics, 32(5), 747–754. https://doi.org/10.1093/bioinformatics/btv630

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free