Expected affine: A registration method for damaged section in serial sections electron microscopy

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Registration is essential for the volume reconstruction of biological tissues using serial section electron microscope (ssEM) images. However, due to environmental disturbance in section preparation, damage in long serial sections is inevitable. It is difficult to register the damaged sections with the common serial section registration method, creating significant challenges in subsequent neuron tracking and reconstruction. This paper proposes a general registration method that can be used to register damaged sections. This method first extracts the key points and descriptors of the sections to be registered and matches them via a mutual nearest neighbor matcher. K-means and Random Sample Consensus (RANSAC) are used to cluster the key points and approximate the local affine matrices of those clusters. Then, K-nearest neighbor (KNN) is used to estimate the probability density of each cluster and calculate the expected affine matrix for each coordinate point. In clustering and probability density calculations, instead of the Euclidean distance, the path distance is used to measure the correlation between sampling points. The experimental results on real test images show that this method solves the problem of registering damaged sections and contributes to the 3D reconstruction of electronic microscopic images of biological tissues. The code of this paper is available at https://github.com/TongXin-CASIA/Excepted_Affine.

Cite

CITATION STYLE

APA

Xin, T., Shen, L., Li, L., Chen, X., & Han, H. (2022). Expected affine: A registration method for damaged section in serial sections electron microscopy. Frontiers in Neuroinformatics, 16. https://doi.org/10.3389/fninf.2022.944050

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