Abstract
A major challenge in automatic registration, alignment and 3-D reconstruction of conventionally processed mouse brain slice images is the presence of histological artifacts, like tissue tears and losses. These artifacts are often produced from manual sample preparation processes, which are ubiquitous in most neuroanatomical laboratories. We present a novel geometric algorithm to automatically detect these artifacts (damage regions) in mouse brain slice images. Our algorithm is guided by our observation that the tears and tissue loss in brain slice images result in external geometric medial axis of the outer contours to go deep inside the tissue. We tested our algorithm on 52 mouse brain slice images with major histological artifacts and successfully detected all the damage regions in the dataset. Our algorithm also demonstrated much lower errors when quantitatively evaluated by performing feature based registration between all 52 slices and their corresponding Allen Reference Atlas (ARA) images.
Access provided by CONRICYT-eBooks. Download conference paper PDF
Similar content being viewed by others
1 Introduction
An annotated virtual 3D mouse brain populated with accurate neuronal reconstruction from In-Situ Hybridization (ISH) images is important for brain circuit mapping research [8, 14, 19]. The ability to reconstruct such virtual brain models and perform quantitative analysis on them requires automatic registration of thin, high-resolution, artifact-free mouse brain slice images [14]. However, brain slice images produced from conventional processing techniques are often present with severe histological artifacts, making it extremely difficult for further processing such as automatic alignment of adjacent slices and annotation of regions of the slices [20].
For common analyses of brain section images, we register these sections with a standardized reference atlas like the Allen Reference Atlas (ARA) maps. Such registration will also become difficult in the presence of histological artifacts introduced during manual sectioning of mouse brain tissues. All these artifacts can be broadly categorized either as global 3D deformations, which may happen during extraction of the brain from the skull, physical effects like gravity during mounting, etc. or as slice specific 2D deformations, which are very common tissue artifacts introduced during sample preparations including serial sectioning of the brain (shearing and tearing) and mounting slices on glass slides (tearing, folding, absence or displacement of small parts from some sections). Though most of the above artifacts have been addressed by complex non-linear registration techniques [18], slice-specific 2D artifacts such as tissue tears and tissue loss are extremely difficult to automatically detect and resolve [13]. Hence, slices with such artifacts are typically discarded, thereby, losing precious data.
There have been previous works on detection and correction of these slice-specific 2D artifacts. However, as most of them are either semi-automatic or use information from neighbouring slices, they are not scalable. For example, Qiu et al. [21] proposed to automatically detect slices with artifacts by looking for unexpected differences between a specified slice and its neighbouring slices. Hence, artifacts in an isolated slice cannot be detected and corrected. Further, such a method also requires slices to be close enough and the adjacent slice to be devoid of any artifacts, such that the difference between slices will imply the artifact. This sometimes poses restriction on the neuroanatomists who may want slices only from specific regions of the brain or want to slice the brain at larger intervals. Kindle et al. [13], on the other hand, proposed a semi-automatic method where they manually identify small tissue tears and fill them by warping neighboring regions around the tear. This approach only works well when the tear is small, horizontal and smooth. Moreover, one needs to be careful about obtaining undesirable warping effects while fixing these tears, especially when they are severe as shown in Fig. 2.
While the above techniques aim to detect and correct slices which have artifacts, many researchers try to overcome them. The most popular approach among these is performing cryosectioning of frozen mouse brain tissues [3, 7, 16]. The rationale behind it is that frozen tissues are much easier to slice into thin sections without tearing or significant deformation. Another technique often used is the introduction of quality control checks [16]. After sectioning the mouse brain, highly damaged slices are manually removed from the registration pipeline. Further, to aid in registration of such highly damaged slices, manual landmarks are often placed [7] or even manual initial registration is performed [25, 26]. All the above measures which mitigate the 2D slice-specific artifacts and help its registration, in addition to being time consuming and expensive, require a lot of planning of the process. Although, slicing thicker sections may be a plausible solution to avoid tissue tears [2], it constrains the subsequent staining and imaging procedures. One needs to ensure that the slicing thickness is in accordance with the penetration depth of the stain and depth of focus of the light microscope used. Serial two-photon tomography (STPT), though produces artifact-free, well-aligned, high-resolution 3D datasets, which makes the registration process much easier [14, 16, 22], neural circuit mapping based on conventional processed brain sections continues to have technical challenges in standardized registration with highly deformed and damaged brain slices. We present a method to automatically detect and handle damages in such mouse brain microscopic slice images in order to achieve an accurate registration. Furthermore, since we detect artifacts on individual slices without using information from neighbouring slices, our method can be easily scaled to handle very large datasets without imposing any restrictions to the conventional neuroanatomical procedures.
In this paper we introduce a novel geometric algorithm to automatically detect major histological artifacts such as tears and tissue loss (missing data) in thin, high-resolution mouse brain slice images. We not only provide qualitative analysis by visual verification from subject experts but also perform quantitative evaluation of our method. We register 52 conventionally processed mouse brain slice images with major histological artifacts to their corresponding annotated atlas slice images from ARA with and without our damage detection algorithm and compare various registrations errors.
2 Proposed Method
Our algorithm to detect damage regions (tissue tears and tissue loss) in mouse brain slice images is motivated by two key observations. First, the contours of most of the damaged regions have long exterior medial axis creating deep concavity into the tissue (Fig. 2). It is quite rare that the tear happens in the interior of the tissue directly without affecting the boundary of the tissue.
Second, the damage region exhibits vertical asymmetry between left and right regions of the mouse brain. It is also very rare that the same type and shape of tear or missing region happens on both lobes of the brain tissue slice.
Input. Given a high-resolution mouse brain microscopic slice image, we first compute a microscopic-edge image (MEI) by extracting the dominant edges using a variant of Canny edge detector. Our dominant edge detection algorithm automatically computes the threshold for hysteresis to suppress the edges with low gradient magnitude as shown in Fig. 1(i). The automatic threshold computation uses the idea of persistence of edges from the histogram of the gradient magnitude. We skip its details as its beyond the focus of this paper. We then compute the outermost contour of MEI, which serves as the input to our damage region detection algorithm (Fig. 1(ii)).
Construction of Constrained Delaunay Triangulation. Using the vertices V and edges E of the outermost contour of MEI, we first construct a Constrained Delaunay Triangulation (CDT) [5]. All edges of E are a part of this triangulation as shown in Fig. 1(iii). We then remove all the triangles lying inside the contour and retain only the exterior Delanuay triangles. As the outermost contour of MEI is a simple closed curve, we use the Jordan curve theorem to compute whether a triangle is inside or outside the contour [10]. If the winding number of a point inside the triangle is zero, the triangle lies outside the contour, else it lies inside. In order to obtain reliable Voronoi vertices and edges that can be used in computations downstream, we further clean the remaining exterior triangles by removing all “skinny” triangles – any triangle whose circumcenter does not lie within the triangle.
Computing Voronoi vertices and edges. From the vertices \(V^\prime \) and edges \(E^\prime \) of the remaining Delaunay triangles, we represent the exterior medial axis as the sequence of Voronoi edges that do not intersect the edges of the original contour of the image [1]. Since this would create many small medial axes as shown in Fig. 1(iv), we threshold them (remove edge sequence \(<\!\!\alpha \); we use \(\alpha =20\)) and retain only those medial axes corresponding to deep concavities. The vertices of the Delaunay triangles corresponding to the retained medial axis Voronoi vertices serve as candidates for the damaged regions as shown in Fig. 1(v).
Checking for Asymmetry and Damage Region Detection. There may be important features of the brain that may also have long medial axis, but these features are also symmetric on both sides of the brain. Hence, as the final step of our algorithm, we check whether the damage region candidate edge points are symmetric between the left and right half of the mouse brain. For this we first divide mouse brain into two halves by splitting its oriented bounded box (OBB) equally into left and right regions [9]. Popular methods for OBB estimation such as principal component analysis (PCA) [12] will fail when used on highly damaged microscope slices (Fig. 2) because the spurious edge points produced in damaged areas of the tissues images bias the PCA. Hence, we compute the convex hull of edge points in MEI and resample it such that we have a fixed number of points uniformly sampled along the convex hull. We then use PCA on the resampled convex hull curves to compute the OBB of the microscopic image slice. The combination of PCA on the resampled convex hull curve eliminates the edge effects including bias due to noise, tissue damage and other artifacts caused during sample preparation.
We then check for symmetry of the candidate edges of the damaged region by reflecting those edge points about the vertical axis dividing the OBB in half and using a small neighborhood to search for points having similar normal vectors around the expected region of symmetry. Normal vectors of edge points are computed using moving least squares [17] as it smoothly interpolates the normal vectors, diminishing the effect of noise, sharp features and topological foldings. Candidate edge points, which are asymmetric between the left and right regions of the brain are classified as damage region points. For example, as shown in Fig. 1, out of the three candidate damage regions, only the points corresponding to the 2nd candidate damage region were classified as damage region points. Points corresponding to the remaining two (1st & 2nd) candidate damage regions form important features of the mouse brain slice images and hence are also vertically symmetric.
3 Results and Discussion
We evaluate our algorithm on 52 conventionally processed microscopic images of coronal mouse brain slices (5000\(\,\times \,\)8000 pixels) with a resolution of 0.6 \(\upmu \)m per pixel. These images were manually identified by subject experts from different mouse brain datasets to contain severe histological artifacts such as tears and missing data. These artifacts were produced either during serial sectioning of the mouse brain tissue or mounting of the thin slices on glass slides. Among the 52 slices, 45 slices had single tears or missing regions while 7 slices had multiple tears or missing regions. We ran our automatic damage region detection algorithm on all 52 microscopic images and successfully identified the damage regions in all of them as shown in Fig. 2. Our damage region detection results were found qualitatively quite accurate by the subject experts.
We also quantitatively evaluate our algorithm by comparing results from standard feature based registration techniques when used with and without our damage region detection algorithm. Feature based registration algorithms have been quite popular in the past for registration of microscopic images [4, 6, 15, 23]. However, the presence of edges due to the damage regions misleads and corrupts the correspondence finding (Fig. 3A), resulting in bad registration. Hence, it is important to first accurately identify and remove points in the damage regions before performing feature based registration.
We perform an inter-stack feature based registration where we align all 52 microscopic images with their corresponding annotated atlases from ARA mapsFootnote 1 with and without damage region detection. In both cases, for registration, we first perform global affine alignment using a variant of iterative closest point (ICP) [24]. This is followed by a final non-linear alignment by solving the Laplace’s equation with Dirichlet boundary conditions [11] (Fig. 4). The only difference between the two cases is our damage region detection algorithm where the detected damage region points are excluded from the correspondence finding as shown in Fig. 3A. For statistical analysis we compared the root-mean-squared error (RMSE), the median error (MEE) and the maximal error (MAE) of 20 corresponding points which were manually picked and distributed uniformly in the microscopic and atlas image pair (Fig. 3B). Table 1 summarizes the registration errors after both affine and non-linear transformation with and without our damage region detection algorithm. We found lower registration errors when alignment was performed with our algorithm than without it.
We have developed and demonstrated a completely automatic algorithm to not only identify but accurately locate and handle slice-specific histological artifacts such as tissue tears and tissue loss in high-resolution microscopic mouse brain slice images. As these artifacts are very common in conventionally processed slices, our algorithm will have wide applicability and usefulness in broad range of experiments and neuroanatomical laboratories. We show results of one such application where we perform accurate registration of highly damage slices with their corresponding annotated atlas from ARA maps. Such applications play a vital role in reconstruction of mouse brain datasets. Another advantage of our algorithm is that it can locate multiple such artifacts that may be present in single slice images as shown in Fig. 2(vi) and (vii). This enables and facilitates extremely thin sectioning of the mouse brain tissue, which is necessary for an accurate 3D mouse brain model reconstruction. To further illustrate the difficulty and the effectiveness of our method, we also show the results of our damage region detection algorithm on a synthetically damaged slice image with more than three tissue tears, which are deep and randomly placed (Fig. 5).
However, there are still some extreme artifacts, which cannot be handled by our algorithm. For example, slices in which the tear goes all the way through will have more than one component. Such tissues are very difficult to mount since multiple components have to be accurately placed in their original positions onto the glass slide. In such cases, our algorithm will fail as it detects multiple components, and hence we do not process such slices any further. Few other extreme deformations are folding of the tissue and overlap of adjacent tissue regions. For such artifacts, a more complicated or semi-automatic approach might be helpful.
4 Conclusion
To the best of our knowledge the presented work is the first that automatically detects slice-specific histological artifacts such as tissue tears and tissue loss in high-resolution mouse brain slice images without using information from neighbouring slices. Our robust damaged region detection algorithm condones histological artifacts that occur in standard procedures to produce brain slice images. We believe that this work will have a major impact on brain circuit mapping by facilitating conventional neuroanatomical image registration and creation of 3-D whole brain map databases.
Notes
- 1.
Publically available from the Allen Brain Atlas Project.
References
Amenta, N., Bern, M., Eppstein, D.: The crust and the \(\beta \)-skeleton: combinatorial curve reconstruction. Graph. Model Image Process. 60(2), 125–135 (1998)
Berlanga, M.L., Phan, S., Bushong, E.A., Wu, S., Kwon, O., Phung, B.S., Lamont, S., Terada, M., Tasdizen, T., Martone, M.E., et al.: Three-dimensional reconstruction of serial mouse brain sections: solution for flattening high-resolution large-scale mosaics. Front. Neuroanatomy 5, 17 (2011)
Bertrand, L., Nissanov, J.: The neuroterrain 3d mouse brain atlas. Front. Neuroinform. 2, 3 (2008)
Besl, P.J., McKay, N.D.: Method for registration of 3-d shapes. In: Robotics-DL Tentative, pp. 586–606. International Society for Optics and Photonics (1992)
Chew, L.P.: Constrained delaunay triangulations. Algorithmica 4(1–4), 97–108 (1989)
Chui, H., Rangarajan, A.: A new point matching algorithm for non-rigid registration. Comput. Vis. Image Underst. (CVIJ) 89(2), 114–141 (2003)
Crecelius, A.C., Cornett, D.S., Caprioli, R.M., Williams, B., Dawant, B.M., Bodenheimer, B.: Three-dimensional visualization of protein expression in mouse brain structures using imaging mass spectrometry. J. Am. Soc. Mass Spectrometry 16(7), 1093–1099 (2005)
Feng, D., Lau, C., Ng, L., Li, Y., Kuan, L., Sunkin, S.M., Dang, C., Hawrylycz, M.: Exploration and visualization of connectivity in the adult mouse brain. Methods 73, 90–97 (2015)
Gottschalk, S., Lin, M.C., Manocha, D.: OBBTree: a hierarchical structure for rapid interference detection. In: Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques, pp. 171–180. ACM (1996)
Hormann, K., Agathos, A.: The point in polygon problem for arbitrary polygons. Comput. Geometry 20(3), 131–144 (2001)
Jeschke, S., Cline, D., Wonka, P.: A GPU laplacian solver for diffusion curves and poisson image editing. ACM Trans. Graphics (TOG) 28, 116 (2009)
Jolliffe, I.: Principal Component Analysis. Wiley Online Library (2002)
Kindle, L.M., Kakadiaris, I.A., Ju, T., Carson, J.P.: A semiautomated approach for artefact removal in serial tissue cryosections. J. Microscopy 241(2), 200–206 (2011)
Kuan, L., Li, Y., Lau, C., Feng, D., Bernard, A., Sunkin, S.M., Zeng, H., Dang, C., Hawrylycz, M., Ng, L.: Neuroinformatics of the allen mouse brain connectivity atlas. Methods 73, 4–17 (2015)
Kurkure, U., Le, Y.H., Paragios, N., Carson, J.P., Ju, T., Kakadiaris, I.A.: Landmark/image-based deformable registration of gene expression data. In: 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 1089–1096. IEEE (2011)
Lein, E.S., Hawrylycz, M.J., Ao, N., Ayres, M., Bensinger, A., Bernard, A., Boe, A.F., Boguski, M.S., Brockway, K.S., Byrnes, E.J., et al.: Genome-wide atlas of gene expression in the adult mouse brain. Nature 445(7124), 168–176 (2007)
Levin, D.: The approximation power of moving least-squares. Math. Comput. Am. Math. Soc. 67(224), 1517–1531 (1998)
Ng, L., Hawrylycz, M., Haynor, D.: Automated high-throughput registration for localizing 3d mouse brain gene expression using ITK. In: IJ-2005 MICCAI Open-Source Workshop (2005)
Oh, S.W., Harris, J.A., Ng, L., Winslow, B., Cain, N., Mihalas, S., Wang, Q., Lau, C., Kuan, L., Henry, A.M., et al.: A mesoscale connectome of the mouse brain. Nature 508(7495), 207–214 (2014)
Ourselin, S., Roche, A., Subsol, G., Pennec, X., Ayache, N.: Reconstructing a 3d structure from serial histological sections. Image Vis. Comput. 19(1), 25–31 (2001)
Qiu, X., Pridmore, T., Pitiot, A.: Correcting distorted histology slices for 3D reconstruction. Proc. Med. Image Underst. Anal., 224–228, July 2009
Ragan, T., Kadiri, L.R., Venkataraju, K.U., Bahlmann, K., Sutin, J., Taranda, J., Arganda-Carreras, I., Kim, Y., Seung, H.S., Osten, P.: Serial two-photon tomography for automated ex vivo mouse brain imaging. Nature Methods 9(3), 255–258 (2012)
Rangarajan, A., Chui, H., Mjolsness, E., Pappu, S., Davachi, L., Goldman-Rakic, P., Duncan, J.: A robust point-matching algorithm for autoradiograph alignment. Med. Image Anal. 1(4), 379–398 (1997)
Rusinkiewicz, S., Levoy, M.: Efficient variants of the ICP algorithm. In: Third International Conference on 3-D Digital Imaging and Modeling, Proceedings, pp. 145–152. IEEE (2001)
Sawiak, S.J., Williams, G.B., Wood, N.I., Morton, A.J., Carpenter, T.A.: SPMMouse: a new toolbox for SPM in the animal brain. In: ISMRM 17th Scientific Meeting & Exhibition, pp. 18–24 (2009)
Vousden, D.A., Epp, J., Okuno, H., Nieman, B.J., van Eede, M., Dazai, J., Ragan, T., Bito, H., Frankland, P.W., Lerch, J.P., et al.: Whole-brain mapping of behaviourally induced neural activation in mice. Brain Struct. Func. 220(4), 2043–2057 (2015). doi:10.1007/s00429-014-0774-0
Acknowledgement
The authors would like to thank Dr Hong-Wei Dong for providing the mouse brain atlas contour images. This work was supported in part by NIH grants (R01MH105427 and R01NS078434).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Agarwal, N., Xu, X., Gopi, M. (2017). Automatic Detection of Histological Artifacts in Mouse Brain Slice Images. In: Müller, H., et al. Medical Computer Vision and Bayesian and Graphical Models for Biomedical Imaging. BAMBI MCV 2016 2016. Lecture Notes in Computer Science(), vol 10081. Springer, Cham. https://doi.org/10.1007/978-3-319-61188-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-61188-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61187-7
Online ISBN: 978-3-319-61188-4
eBook Packages: Computer ScienceComputer Science (R0)