BIOMEDICAL IMAGING GROUP (BIG)
Laboratoire d'imagerie biomédicale (LIB)

GRAPHIC: Graph-Based Hierarchical Clustering for Single-Molecule Localization Microscopy

M. Pourya, S. Aziznejad, M. Unser, D. Sage

Proceedings of the Eighteenth IEEE International Symposium on Biomedical Imaging (ISBI'21), Nice, French Republic, April 13-16, 2021, pp. 1892–1896.

We propose a novel method for the clustering of point-cloud data that originate from single-molecule localization microscopy (SMLM). Our scheme has the ability to infer a hierarchical structure from the data. It takes a particular relevance when quantitatively analyzing the biological particles of interest at different scales. It assumes a prior neither on the shape of particles nor on the background noise. Our multiscale clustering pipeline is built upon graph theory. At each scale, we first construct a weighted graph that represents the SMLM data. Next, we find clusters using spectral clustering. We then use the output of this clustering algorithm to build the graph in the next scale; in this way, we ensure consistency over different scales. We illustrate our method with examples that highlight some of its important properties. 

@INPROCEEDINGS(http://bigwww.epfl.ch/publications/pourya2101.html,
AUTHOR="Pourya, M. and Aziznejad, S. and Unser, M. and Sage, D.",
TITLE="{GRAPHIC}: {G}raph-Based Hierarchical Clustering for
	Single-Molecule Localization Microscopy",
BOOKTITLE="Proceedings of the Eighteenth IEEE International Symposium on
	Biomedical Imaging ({ISBI'21})",
YEAR="2021",
editor="",
volume="",
series="",
pages="1892--1896",
address="Nice, French Republic",
month="April 13-16,",
organization="",
publisher="",
note="")

© 2021 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from IEEE. This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.