2023
DOI: 10.1038/s41592-022-01750-6
|View full text |Cite
|
Sign up to set email alerts
|

A framework for evaluating the performance of SMLM cluster analysis algorithms

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
38
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 32 publications
(40 citation statements)
references
References 41 publications
2
38
0
Order By: Relevance
“…We first compared the performance of Diinamic-R and Diinamic-V on various sets of simulations of SMLM data. In a recent article, Nieves et al ( 23 ) proposed a framework to evaluate SMLM cluster analysis algorithms, with simulated scenarios representing diverse situations of density of detections and size of clusters in a squared area of 2 μm × 2 μm. They also proposed two metrics, ARI, which analyzes the classification of detections into the same clusters as the ground truth; and IoU, which analyzes the overlap between the cluster areas in the output and the ground truth (here, the correct result).…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations
“…We first compared the performance of Diinamic-R and Diinamic-V on various sets of simulations of SMLM data. In a recent article, Nieves et al ( 23 ) proposed a framework to evaluate SMLM cluster analysis algorithms, with simulated scenarios representing diverse situations of density of detections and size of clusters in a squared area of 2 μm × 2 μm. They also proposed two metrics, ARI, which analyzes the classification of detections into the same clusters as the ground truth; and IoU, which analyzes the overlap between the cluster areas in the output and the ground truth (here, the correct result).…”
Section: Resultsmentioning
confidence: 99%
“…The DBSCAN program was sourced from Pageon et al ( 16 ) and adapted to be run on MATLAB. The calculation of the adjusted rand index (ARI) and intersection over union (IoU) scores was implemented in MATLAB following the algorithms described in Nieves et al ( 23 ) . Clustering detection was carried out on regions of interest (ROIs) drawn on top of pointillistic images constructed from the coordinates of detections.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In our nanoparticle size analysis, we used FWHM to extract size information after correction of localization error. Several other clustering algorithms have been used for sizing nanostructures, including density-based spatial clustering of applications with noise (DBSCAN), fast optimized clustering algorithm for localization (FOCAL), cluster analysis by machine learning (CAML), tessellation-based methods such as clusterVisu and SR-Tesseler, and pairwise nearest distance measurement . All of these methods are focused on finding the boundary of clusters to estimate size.…”
Section: Discussionmentioning
confidence: 99%