FOCAL3D: A 3-dimensional clustering package for single-molecule localization microscopy
Bibliographic record
Abstract
Single-molecule localization microscopy (SMLM) yields an image resolution 1-2 orders of magnitude below that of conventional light microscopy, resolving fine details on intracellular structure and macromolecular organization. The massive pointillistic data sets generated by SMLM require the development of new and highly efficient quantification tools. Density based clustering algorithms, such as DBSCAN, can provide spatial statistics on protein/nucleic acid aggregation or dispersion while explicitly identifying macromolecular clusters. The performance of DBSCAN, however, is typically dependent upon an arbitrary, or at least highly subjective, parametric tuning of the algorithm. Moreover, DBSCAN can be computationally expensive, which makes it arduous to evaluate on large image stacks. This is all the more important in 3-dimensions where there exist limited alternatives for quantifying clustering in SMLM data, and where a 2-dimensional analysis of true 3-dimensional data may give rise to image artefacts. We have developed an open-source software package in Python for both identifying and quantifying spatial clustering in 3-dimensional SMLM datasets. FOCAL3D is an extension of our previously developed, 2-dimensional, grid based clustering algorithm FOCAL. FOCAL3D provides a highly efficient way to spatially cluster SMLM datasets, scaling linearly with the number of localizations, and the algorithmic parameters may be systematically optimized so that the resulting analysis is insensitive to variation over a range of parameter choices. We initially validate the performance and parametric insensitivity of FOCAL3D on simulated datasets, then apply the algorithm to 3-dimensional, astigmatic dSTORM images of the nuclear pore complex in human osteosarcoma cells. The data and software package are available at: http://www.utm.utoronto.ca/milsteinlab/software/
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.003 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.005 | 0.003 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.031 | 0.017 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".