Microscopy imaging experiments generate vast amounts of data, and there is a high demand for smart acquisition and analysis methods. This is especially true for transmission electron microscopy (TEM) where terabytes of data are produced if imaging a full sample at high resolution, and analysis can take several hours. One way to tackle this issue is to collect a continuous stream of low resolution images whilst moving the sample under the microscope, and thereafter use this data to find the parts of the sample deemed most valuable for high-resolution imaging. However, such image streams are degraded by both motion blur and noise. Building on deep learning based approaches developed for deblurring videos of natural scenes we explore the opportunities and limitations of deblurring and denoising images captured from a fast image stream collected by a TEM microscope. We start from existing neural network architectures and make adjustments of convolution blocks and loss functions to better fit TEM data. We present deblurring results on two real datasets of images of kidney tissue and a calibration grid. Both datasets consist of low quality images from a fast image stream captured by moving the sample under the microscope, and the corresponding high quality images of the same region, captured after stopping the movement at each position to let all motion settle. We also explore the generalizability and overfitting on real and synthetically generated data. The quality of the restored images, evaluated both quantitatively and visually, show that using deep learning for image restoration of TEM live image streams has great potential but also comes with some limitations.
Citation: Wieslander H, Wählby C, Sintorn I-M (2021) TEM image restoration from fast image streams. PLoS ONE 16(2): e0246336. https://doi.org/10.1371/journal.pone.0246336
Editor: Khanh N.Q. Le, Taipei Medical University, TAIWAN
Received: October 27, 2020; Accepted: January 16, 2021; Published: February 1, 2021
Copyright: © 2021 Wieslander et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All images files are available from https://zenodo.org/record/4113244.
Funding: Financially supported by the Swedish Foundation for Strategic Research www.strategiska.se (grant BD150008), the European Research Council www.erc.europa.eu (grant ERC2015CoG 682810), (grants awarded to CW) and the Uppsala University AI4Research initiative (awarded to IMS). The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. Vironova provided part-time salary and instrument access (TEM) for author IMS. The funder provided support in the form of salaries for authors IMS but did not have any additional role in the study design, data collection and analysis, decision to publish, or preparation of the manuscript. The specific roles of these authors are articulated in the ‘author contributions’ section.
Competing interests: The authors have declared that no competing interests exist. The commercial affiliation of author IMS does not alter our adherence to PLOS ONE policies on sharing data and materials.
In recent years there has been an explosion in the amount of image data generated from microscopy experiments due to faster and more automated microscopes. The increased speed at which data is collected results in data-volumes that are costly to handle and easily exceed the computational and data storage resources available. This entails a need for smarter acquisition and analysis methods. This is especially apparent for Transmission Electron Microscopy (TEM) where the difference between sample size and details of interest is much larger than in other types of microscopy. As a comparison: in histopathology whole slide imaging (WSI) a sample is typically 2 × 1cm and imaged with a pixel size of 0.275μm resulting in approx. 4 Giga pixels. Whereas, in TEM a sample is typically 3mm in diameter and the details of interest often require at least a 1nm pixel size resulting in more than 4 Tera pixels. Hence, one TEM sample contains more than 1000 times more data than one WSI sample if the full sample is imaged at full resolution. It is thus impossible to image the whole sample at the resolution required for detailed analysis when working with TEM. Since not all data contains valuable information data acquisition and analysis should focus on the data that has the best possibility of answering the research question at hand. One approach to tackle this issue is to use a hierarchical image acquisition and analysis approach, i.e. to acquire and analyze low resolution images to detect regions of interest (ROI) for high resolution imaging. Automatic detection of ROIs can then be used in an online feedback fashion to reduce the amount of data collected. Online feedback microscopy has shown great potential in fluorescence microscopy to automatically pinpoint locations of interest during acquisition . Conrad et al.  presented a workflow for high-resolution image acquisition based on a low resolution pre-scan for automatic identification of mitotic cells. For TEM, Kylberg et. al.  and Suveer et al.  proposed schemes for hierarchical imaging and analysis workflows for virus and cilia detection in TEM, respectively.
A typical approach when working with TEM is that a pathologist/microscopist uses the motorized stage to move the sample at low magnification and manually/visually scans for ROIs. These regions are then imaged at a higher magnification. This approach is time and expert demanding. In addition, capturing a high quality image requires pausing the movement momentarily (typically 1-2 sec) to ensure all movement has stopped prior to acquiring the image. Due to these pauses it can take several hours to automatically image a sample at low magnification where sufficient detail is visible to detect promising objects or ROIs for high magnification imaging. On the other hand, capturing the images while scanning over the sample is fast but results in images with a lot of motion blur and noise, making them unsuitable for further analysis. However, if this noise and blur could be removed, faster imaging and analysis would be possible.
In the field of image restoration, image deblurring refers to the task of recovering the underlying sharp image representation from a degraded image. The degradation process can be formulated as (1) where y is the captured blurry image, h is the blur kernel, x is the underlying sharp image and η is the noise term. Hence, blur can be seen as a combination of degradation based on both intrinsic factors, such as camera focus, and external factors e.g. motion and noise, that mainly arise from the image acquisition process. The recovery process is thus the inverse problem where either h is known a priori and x is recovered, or both x and h are recovered blindly. The effect of the noise term must also be minimized in the process, and depending on the type of noise, different methods can be applied . This results in an ill-posed problem as the number of unknown factors exceeds the data space. Solutions usually involve adding constraints or priors to reduce the solution space. The deblurring problem has been studied extensively and proposed solutions date back to the 1970s, the most prominent of which are based on either Bayesian inference with Maximum Likelihood Estimations [6, 7] or deconvolution in Fourier space . These methods, however, usually produce overly smooth images or images with ringing artifacts. Methods have been proposed to tackle these challenges, for instance, Yuan et al. suggested an extension to the Richardson-Lucy algorithm utilizing a multi-scale approach with bilateral filters .
A challenge with deconvolution solutions is that they are sensitive to the approximation of the point spread function (PSF). These functions easily become complex, especially for TEM data where moving the microscope at a high magnification results in irregular vibrations and drift. Added on top of this is a composition of noise factors. Another problem for deconvolution based solutions is that they usually involve an iterative scheme which makes them rather slow. They also assume that the noise level is low and often struggle with saturated pixels . Recently, more data driven approaches have been developed, based on Convolutional Neural Networks (CNNs), which have shown great promise in dealing with complex PSFs. A benefit of CNNs is that the deblurring procedure is performed directly on the input intensities, mapping the input to the output through a complex (neural network) function, hence approximating blur kernels and iterative deconvolutions can be avoided. Recent research has also suggested using a combination of CNNs with more classical approaches. For instance, Xu et. al  propose to construct the CNN in such a way that it can learn and perform deconvolution based on weighted sums of separable 1D filters. Their method is however limited by the need to train a separate network for each blur kernel. Ren et al.  overcome this limitation by calculating a generalized low-rank approximation to a large number of blur kernels which is then used to initialize the parameters of the network. These methods deal with the non-blind deblurring case, where the blur kernels are known or constructed a priori. For blind deblurring, Chakrabarti  suggest a CNN to predict the complex discrete Fourier transform coefficients for a deconvolution filter. The deconvolution can then be performed in the frequency domain. Similarly, Sun et al.  propose a method for removing non-uniform motion blur based on predicting the blur kernel for smaller image patches resulting in a field of non-uniform blur kernels which can later be used to deconvolve the image. Several other success stories for blind deblurring involve Generative Adversarial Networks (GANs). One example is Kupyn et al.  who propose an end-to-end learned conditional GAN combined with perceptual loss  resulting in state of the art performance. This is extended in  where the backbone is replaced by a flexible feature pyramid network to attain a balance between performance and efficiency.
A parallel field to single image deblurring is video and burst image deblurring. When multiple frames are available, methods can be designed to make use of the additional data in neighboring frames to guide the restoration. This can be achieved either with or without alignment of the frames. Without alignment the network has the freedom to extract relevant spatial/temporal information from each of the input frames, for instance through a series of down-convolutional layers as in , through 3D-convolutions as in , or as in  through attention modules for efficient handling of different amounts of blur. Other methods use alignment modules within the network to guide the restoration. Zhao and Zhang et al.  propose Filter Adaptive Convolutional Layers to align features from the previous time step with the current time step. Wang et al.  perform the alignment of feature maps through deformable convolutions and achieved state of the art results in the NTIRE19  challenge. These types of networks have some drawbacks when the translation between frames is large and are hence not studied here since the translation between frames in the evaluated datasets is irregular and sometimes too large for valuable information to be present in a small time window. If the input images are (more or less) aligned, the network aligning steps can be avoided and focus can be put on the actual deblurring task. Aitalla et al.  propose a network, operating on a burst of images, based on copies of the same UNet architecture with weight sharing and exchange of information through global max pooling layers (where features are pooled with the max operation between networks).
Motion deblurring has mainly been studied with natural scene images and often by simulating the blur occurring through human movement of a camera. Within microscopy, motion deblurring is not such a well-explored area. However, image restoration with focus on denoising (not motion deblurring) has shown great promise for electron microscopy, using both classical (non deep learning) methods  and unsupervised as well as semi-supervised deep learning based methods . Another closely related problem, that of sliding the sample past the camera to create an overview image through video mosaicing, has been more extensively studied. For instance  explore this for confocal microscopy for in vivo imaging, but solve the issue with blurry frames by excluding them. Alternatively,  study real time video mosaicing for high-resolution microendoscopy and solve the blurring issue with a low camera exposure time and slow translations over the sample.
In this paper we study the opportunities and limitations of deep learning methods applied to image reconstruction from fast (live stream) TEM image acquisition. The purpose is to understand if and how a live image stream can be used to replace the standard slow acquisition of low magnification images currently used to find ROIs for high magnification imaging. To the best of our knowledge, no prior work in video deblurring exists for TEM imaging. Video deblurring for TEM poses a number of challenges. Firstly, the magnification at which the specimen is imaged is highly sensitive to movements and vibrations from the mechanics and the piezo electric elements in the stage. Secondly, like with all types of microscopes, noise will always be present in the images, the amount of which is determined by the exposure time and illumination. Lastly, the electron induced changes in sensitive samples can pose challenges for image registration. Here, we focus on the image restoration side of this problem, and investigate how deep learning can be used to improve the quality of images corrupted by motion blur. We also explore the generalizability of networks to non-seen textures and the networks’ prediction and overfitting characteristics.
Our approach to do this is to compare and contrast the performance of two CNN architectures for single-image deblurring and burst image deblurring, respectively, on two transmission electron microscopy live image stream datasets. We adapt the best performing architecture—the burst architecture—to the challenges inherent to TEM data to further improve the performance. Along with real data, we also use synthetic data to visualize and explore the model’s and training scheme’s effect on the restoration result. The paper is structured as follows: First, the image capturing process and dataset design is described in the Data section. Then, the two basic network architectures along with the evaluation metrics used are described in the Method section. In the Experiment section, the training procedure, model comparisons and model improvements are described, along with how we explore and visualize model behaviour, overfitting and generalizability. Finally, we summarize our findings in the Conclusion section.
The main contributions of this paper are: A proof of principle of using CNNs for image restoration from fast TEM video streams. A structured comparison and nuanced evaluation of two video deblurring CNN approaches on real TEM image streams. An application adaptation of the loss function and further improvement of the superior burst architecture. An approach for using synthetic data for visualization of architectural/parameter/training effects. And finally, we design and make available two novel TEM datasets of real video streams and matching high quality images.
The data was collected using a MiniTEM microscope (Vironova AB). The samples were placed on a regular TEM grid (a regularly spaced metal grid) before imaging (Fig 1). High quality frames of size 2048 x 2048 were first collected with an overlap of 50%. After this, a video sequence of the same area but with a frame size of 1024 x 1024 pixels (the motion going vertically upwards), was collected. All images were captured at a field of view of 32μm, and with a per image exposure time of 15ms. Both high quality frames and blurry frames where saved with 16 bit resolution. Two samples where imaged, one of a calibration grid and one of a kidney sample (Fig 2). The data is made available online at . A total of four imaging sequences were captured per sample. For the kidney sample each imaging sequence contained 7-23 high quality images and for the calibration grid 14-18 high quality images. One of the imaging sequences (for each dataset) was put aside and used for testing. As a validation set, one grid cell was chosen that had no overlap with the rest of that image sequence. For the kidney sample the test set resulted in 6 high quality images and the validation set in 3 high quality images. For the calibration grid 8 high quality images were used for testing and 2 for validation. The respective training set size for the kidney dataset and calibration grid dataset was 38 and 35 high quality images. Fig 1 shows how the data was divided into training, validation and test sets.
A sample was imaged by moving the sample past the microscope in a straight vertical movement at four different locations. Note that the placements in the figure does not exactly correspond with the exact locations where the data was collected.
Example images from the two datasets with high quality images (left image of each pair) together with the corresponding blurry and noisy images of the same region (right image of each pair) (a) calibration grid, (b) kidney.
The frames from the video sequence and high quality images were matched by first manually finding which blurry frame best matched each high quality image. The blurry frames were then registered to the high quality image in a semi-automatic way via enhanced correlation coefficient maximization , where initial translation was manually set. The number of frames for both datasets was set to 5, i.e., for each high quality image, 5 blurry frames were registered. This was chosen so that the overlap between frames would not be too small, since after registration we extract the intersection between overlapping regions.
To reduce the range of intensities, the data was scaled to 8 bits. The maximum and minimum values for each dataset were manually set based on the histograms and structures in the sample. The maximum was chosen based on the brightest regions in the samples and set slightly above these intensities. The minimum intensity was chosen so that the black regions between grid cells become zero but dark regions within the sample still maintained some intensity variations.
For each image, a mask was created to indicate the actual sample (content in grid cells). This was used to crop patches containing only information of the sample, leaving out the background resulting from imaging the metal grid between the grid cells.
The mask was created by applying a threshold at zero (minimum value after normalization). For the training data, the mask was thereafter eroded by an circular structuring element of radius 128 pixels for 2 iterations to make it possible to make random crops of size 128 × 128 px containing no grid pixels. Since there is an overlap in the high quality data, the bottom half of each image used for testing and validation was discarded. This was done so that multiple images of the same FOV would not be present. The test and validation images were then regularly tiled (128x128), and tiles including the grid were discarded.
Synthetic data for visualizing network performance
It can be difficult to visualize the actual effect a network has on a sample if it is very complex. We thus created three synthetic test images. One image simulates some of the structures we see in the kidney sample by bright and dark spots and lines in different directions. A structured repetitive pattern (mimicking the squares in the calibration grid) is simulated by drawing some lines at an angle on a blank image. We create two such images, one with only lines in one direction and one with lines in two directions. This to see how dependent the network actually is on the texture of the sample. We add synthetic motion to the images and Gaussian noise to match the real data (the amount was determined visually), see Fig 3.
The top row shows one image with bent lines and circular spots of different intensities and two images with lines in different directions. The bottom row shows the same images after convolution with a motion blur kernel followed by the addition of Gaussian noise.
To find a baseline for model/method selection we evaluated two different network architectures. The first one, DeblurGANv2 , (from here on referred to as DeblurGAN) is based on single image deblurring and uses three registered frames (RGB) as input. It uses a pre-trained backbone to extract features at multiple scales which are then fused and up-scaled to a single output. The network is trained with an adversarial loss function based on both a “patch” discriminator, evaluating smaller patches of the image, and a “full” discriminator evaluating the full image.
The second architecture, proposed by Aitalla et al. , (from here on referred to as Burst) is based on the premise that the slight variation in blur and noise between frames can be utilized to make a better restoration. Collecting images in a “burst” can thus help restoring the underlying information. This network consists of copies of the same UNet architecture with tied weights. The copies exchange information through “global max pooling” layers where features are pooled with the max operation between the networks.
Non-learning methods based on PSF approximation are not considered here. The main reason for this exclusion being that the approximation of the PSF becomes highly difficult with the irregular motion characteristics present in the dataset.
The networks were evaluated based on the Structural Similarity Index Measure (SSIM)  and Peak Signal-to-Noise Ratio (PSNR). SSIM is a windowed approach evaluating the structural similarity between two sub-images (windows) x and y. The similarity is measured as: (2) where μx and μy are the averages of the respective windows, σx,σy the variances and σxy the covariance. The terms c1 and c2 are used to stabilize the division and are derived from the dynamic range of the respective images.
PSNR measures the ration of the maximum power of a signal in relation to the corruption error and is calculated as: (3) where MAXI is the maximum intensity value the image can take and MSE is the mean squared error between the generated and ground truth image.
Since SSIM and PSNR do not always capture the perceived quality of the restoration, resulting images were also visually evaluated.
The networks were trained with training schemes as similar as possible to those presented in their respective papers. If not stated otherwise all parameter settings were the same as those proposed in each paper. For DeblurGAN, the network was first trained with an ImageNet pre-trained backbone frozen for 3 epochs and then unfrozen until convergence. The loss function was a mixture of the adversarial RaGAN-LS loss, mean squared error as content loss and a perceptual loss based on VGG19 feature maps. For the Burst network the loss was a combination of L1-loss and un-normalized horizontal and vertical gradients.
Both networks were trained for 2000 epochs and the network parameters of the best epoch (determined on a validation set and measured in SSIM) were saved for evaluation on the test set. DeblurGAN was trained with Adam as an optimizer with a learning rate of 10−3. The Burst network used the same optimizer but with an initial learning rate of 0.003 and a per epoch learning rate decay of 0.99 (slightly higher than proposed in the original paper to attain a more stable training curve).
For DeblurGAN, three adjacent registered frames were used as input, scaled to an intensity range of 0—1, and the output of the network was a single channel gray scale image. For the Burst network, the number of input frames was varied between 3 and 5. The network was evaluated with 5 frames as input.
Network architecture comparison
The two network architectures were compared quantitatively, by evaluating their performance and qualitatively, by visual inspection of the outputs on both datasets where the networks are trained on the same data as tested on. The quantitative results (mean and standard deviation) are presented in Table 1. A qualitative comparison of the results from the respective networks is presented in Figs 4 and 5 (best viewed on a digital screen).
(a) Ground truth, (b) Input, (c) Output from Burst network, (d) Output from DeblurGAN. The images in the rightmost column are displayed with increased brightness for better visualization.
(a) Ground truth, (b) Input, (c) Output from Burst network, (d) Output from DeblurGAN.
From Table 1 we see that the Burst network performs slightly better than the DeblurGAN network. However, visually (Fig 4) we can see that both the DeblurGAN and the Burst network improve upon the input but with varying levels of quality and with differing side effects. The Burst network outputs a smoother image but with a grid-like artefact pattern. This pattern is an effect of the transpose convolutions in the network. The DeblurGAN, on the other hand, creates a fake texture on top of the output image. This is most probably an effect of the adversarial training where by “hallucinating” certain textures the network can better fool the discriminator. None of the networks are capable of resolving the finer details visible in the ground truth. See for instance the leftmost column of Fig 4, where in the ground truth there are several small fine lines that are not present in the output. The problem probably lies in the fact that there is no information in the input data pertaining to these fine structures. Since the networks are limited to working with the data given as input, one can achieve a better but limited representation of the input, or the network has to compensate and make up information. This could explain the artefacts seen in the DeblurGAN output, where textures that should not be there are created—the generator overcompensates to better fool the discriminator.
The results look much more promising on the calibration grid data (Fig 5) where both networks manage to reconstruct the “horizontal” lines that are barely visible in the input data. We can also see this in the quantitative results in Table 1 where there is a larger improvement on the calibration grid data as compared to no deblurring, than for the kidney data.
As the Burst architecture performed slightly better than the DeblurGAN architecture we chose to continue running experiments on this network to explore and suggest improvements. We started with replacing the UNet base with a Dense UNet . The Dense UNet has shown great potential in other image restoration tasks , and we therefore decided to incorporate it in the Burst model and evaluate its performance. Based on its dense connections, it iteratively concatenates feature maps, and can hence be more parameter efficient since all layers can access the preceding layers’ feature maps. The dense blocks consist of several convolutional blocks including batch-normalization—ReLU—convolution- dropout operations that are densely connected. See Fig 6 for an illustration of the proposed model architecture. The dense UNet model was built with 4 dense blocks in contracting and expanding path where each block consists of 4 convolutional blocks.
(a) Original Burst (UNet base) network. Note that image is only for illustration of differences and that the model also employs other layers such as batch norm and activations. See  for full model configuration. (b) The proposed Burst (Dense UNet base) network. In comparison to the UNet model, the convolutional layers in the proposed model have been replaced by dense blocks and global max pooling layers are removed in the decoder path. Instead, there are ‘Transition up’ layers consisting of a nearest neighbour upsampling followed by a convolution and ‘Transition down’ is a spatial max pooling operation. Note that the Global Max pooling is the layer that combines data from the ‘burts’ of multiple input images.
To get rid of the grid-like pattern seen in Fig 4, we replaced the transpose convolutions with a nearest neighbour upsampling followed by a convolution  (referred to as ‘Transition up’ in Fig 6). The alternative up-sampling method Pixel-shuffle  was investigated but did not further improve the results (not presented).
The combination of the transitional layers and the gradient based loss function produces another artifact (textural “wobbly” grid pattern), seen best in Fig 7c. We therefore replaced the gradient loss with an SSIM based loss function, which has shown to be beneficial for image restoration tasks .
From top (a) BU, (b) BDU + T, (c) BDU + UC, (d) BDU + UC + SSIM. Green square (zoomed in area) highlights an area where improvements on fine details can be seen.
Experiments including global max pooling layers also in the decoder (results not presented) showed no significant improvements on the reconstructed image (neither visually nor quantitatively), and hence these additional layers were not included.
We trained the new network with Adam as optimizer with a fixed learning rate of 0.001 for 2000 epochs. We fixed the seed to have the same data sampling and network initialization for all experiments.
Table 2 shows the quantitative performance for the model including the proposed improvements (individually trained on each dataset). Note that the performance increase with the SSIM loss could be due to using the same evaluation metric as optimization score. A qualitative comparison, showing the benefit of the improvements can be seen in Fig 7. The abbreviations for network configuration stands for (BU) Burst with UNet base, (BDU+T) Burst with Dense UNet base using transpose convolutions, (BDU+UC) Burst with Dense UNet replacing transpose convolution with upsampling followed by convolution and (BDU+UC+SSIM) Burst with Dense UNet base, upsampling followed by convolutions and SSIM loss.
The effect of the improvements are shown in Fig 7. By replacing the UNet base with a Dense UNet we can see a slight improvement in the amount of motion the network removes (see zoomed in area of in Fig 7). The effect of replacing the transposed convolutions and changing the loss function is best seen in the synthetic image. Both Fig 7a and 7b have a grid-like pattern in the output image. For Fig 7a and 7b this arises from the transposed convolutions. Fig 7c has a different more textural “wobbly” pattern which is a result of the gradient loss with the transition layers. In Fig 7d it is clear that both of these effects have been removed.
Exploring network behaviour and overfitting
To better understand the behaviour of the model we evaluate the networks trained on the two different datasets on the synthetically generated images. To adjust the network to the slightly different intensity distribution we do approximately 20 forward passes to update the running mean and variance in the batch normalization layers (no backward pass, i.e., no updating of the weights). The results are shown in Fig 8. Note that the networks are trained on real data and only evaluated on synthetic data.
From top (a) Ground truth, (b) Input, (c) Trained on kidney data, (d) Trained on calibration grid data, (e) Trained on both types of data.
From all three output images the majority of the motion appears to have been removed, i.e the network has learnt some sense of motion. However, the network trained on the calibration grid data has also learnt the underlying grid-like pattern. In the two rightmost images in Fig 8d, we see the effect where the network adds “horizontal” lines to the image that are not present in the input. This result indicates that the network has over-fitted to the underlying texture. The texture/patterns in the kidney data is much more complex, making it more difficult for the network to over-fit to this specific texture, and provides some explanation for the lower quantitative performance on this dataset (see Table 2).
Exploring network generalizability
Since the two datasets were captured under similar imaging conditions, and should have approximately the same amount of motion blur and noise, we further tested the network’s generalization behaviour by training on one dataset and evaluating on the other. Quantitative results for between sample generalizability are presented in Table 3 and qualitative results in Fig 9. From the same experiment, results on the synthetic images are presented in Fig 8.
From top (a) Ground truth, (b) Input, (c) Trained on kidney data, (d) Trained on calibration grid data, (e) Trained on both types of data.
We also evaluate the model to model generalization across different splits of the data. For each split one of the imaging sessions were held out for testing. Quantitative cross validation results are presented in Table 4.
The results in Table 3 show that there is a drop in performance when testing on a different sample type than trained on. The largest drop occurs when testing on calibration grid data. The performance drops with an average of 0.13 points between the network trained on kidney data and the network trained on calibration grid data. The effect can be seen in Fig 8 where the network trained on the calibration grid images learns the underlying texture. This over-fitting to the underlying texture can also be seen in Fig 9d (see arrows) where one can see ghost artifacts, which are also apparent in Fig 8d on synthetic images. However both networks remove some motion and noise even on an unseen sample type. This demonstrates that the network learns a combination of the motion blur/noise and the underlying texture. When training a network on both datasets we see a slight decrease (on average) in performance as compared to having one network per sample (Table 3). Fig 8e also shows that the over-fitting to texture is less prominent and the network generalizes slightly better between the two samples.
The results in Table 4 show that the network generalizes well between different splits of the data and hence network performance is not restricted to one specific split of the data.
We have shown the potential and limitations of applying deep learning methods to improve the quality of TEM images corrupted by motion blur and noise. This is one step towards efficient automated imaging in TEM. We have studied the quality of the output both quantitatively and qualitatively and conclude that using deep learning for TEM image restoration from fast image streams shows substantial promise but has some drawbacks that should be considered for each specific application.
The two network architectures explored (both with and without improvements) were able to reduce blur/noise in the input, but with varying degrees of success. However, the image quality improvements are limited to the information present in the input data. If the information, for instance about finer structures, is lost due to the degradation process in the image acquisition stage, it is difficult for the network to reconstruct it despite having multiple views of the scene. Either the networks try to compensate for this and make up information that is not present in the input, or become limited to reconstructing fine details in the input. We could for instance see this effect in Fig 4 where the DeblurGAN network makes up a significant amount of texture that is not there (and should not be there), while the Burst network outputs a smoother image. The presence of artifacts that the network has created has clear drawbacks when working with pathological diagnostics where the visual details provide clues to the patient’s diagnosis and the pathologist must be able to trust the information in the data. The alternative is to obtain an output with more uncertainties in the restorations but no fake details.
The improvements made to the Burst network resulted in improved blur and noise removal. The combination of the dense blocks and the ‘global max pooling’ layers gives the network the possibility to both access the feature maps from preceding layers (from the dense blocks) and to exchange information between the different feature maps from the multi channel input (through the global max pooling layers). The network becomes more parameter efficient but requires more GPU memory to train.
We have shown that synthetic data is very useful to better visualize and understand the network predictions and performance when working with image restoration tasks. We could for instance discover signs of over-fitting and artifacts arising from the network structure and loss functions. The synthetic data also gave a better visual overview and understanding of what the network had focused on. The network learns a combination of motion and noise and texture/structures in the sample.
We have also shown that one means of reducing the over-fitting to a specific texture is to train with different types of samples.
- 1. Tischer C, Hilsenstein V, Hanson K, Pepperkok R. Chapter 26—Adaptive fluorescence microscopy by online feedback image analysis. In: Waters JC, Wittman T, editors. Quantitative Imaging in Cell Biology. vol. 123 of Methods in Cell Biology. Academic Press; 2014. p. 489–503.
- 2. Conrad C, Wünsche A, Tan TH, Bulkescher J, Sieckmann F, Verissimo F, et al. Micropilot: automation of fluorescence microscopy–based imaging for systems biology. Nature Methods. 2011;8. pmid:21258339
- 3. Kylberg G, Sintorn IM, Borgefors G. Towards automated TEM for virus diagnostics: Segmentation of grid squares and detection of regions of interest. In: Scandinavian Conference on Image Analysis. Springer; 2009. p. 169–178.
- 4. Suveer A, Sladoje N, Lindblad J, Dragomir A, Sintorn IM. Automated detection of cilia in low magnification transmission electron microscopy images using template matching. In: Biomedical Imaging (ISBI), 2016 IEEE 13th International Symposium on. IEEE; 2016. p. 386–390.
- 5. Wang R, Tao D. Recent progress in image deblurring. arXiv preprint arXiv:14096838. 2014.
- 6. Richardson WH. Bayesian-based iterative method of image restoration. JoSA. 1972;62(1):55–59.
- 7. Lucy LB. An iterative technique for the rectification of observed distributions. The astronomical journal. 1974;79:745.
- 8. Wiener N. Extrapolation, Interpolation and Smoothing of Stationary. Time Series, with Engineering Appli cations. 1949.
- 9. Yuan L, Sun J, Quan L, Shum HY. Progressive inter-scale and intra-scale non-blind image deconvolution. Acm Transactions on Graphics (TOG). 2008;27(3):1–10.
- 10. Xu L, Ren JS, Liu C, Jia J. Deep convolutional neural network for image deconvolution. In: Advances in neural information processing systems; 2014. p. 1790–1798.
- 11. Ren W, Zhang J, Ma L, Pan J, Cao X, Zuo W, et al. Deep non-blind deconvolution via generalized low-rank approximation. In: Advances in Neural Information Processing Systems; 2018. p. 297–307.
- 12. Chakrabarti A. A Neural Approach to Blind Motion Deblurring. In: Leibe B, Matas J, Sebe N, Welling M, editors. Computer Vision—ECCV 2016. Cham: Springer International Publishing; 2016. p. 221–235.
- 13. Sun J, Cao W, Xu Z, Ponce J. Learning a convolutional neural network for non-uniform motion blur removal. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition; 2015. p. 769–777.
- 14. Kupyn O, Budzan V, Mykhailych M, Mishkin D, Matas J. DeblurGAN: Blind motion deblurring using conditional adversarial networks. In: Proceedings of the IEEE conference on computer vision and pattern recognition; 2018. p. 8183–8192.
- 15. Johnson J, Alahi A, Fei-Fei L. Perceptual losses for real-time style transfer and super-resolution. In: European conference on computer vision. Springer; 2016. p. 694–711.
- 16. Kupyn O, Martyniuk T, Wu J, Wang Z. DeblurGAN-v2: Deblurring (orders-of-magnitude) faster and better. In: Proceedings of the IEEE International Conference on Computer Vision; 2019. p. 8878–8887.
- 17. Su S, Delbracio M, Wang J, Sapiro G, Heidrich W, Wang O. Deep video deblurring for hand-held cameras. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition; 2017. p. 1279–1288.
- 18. Zhang K, Luo W, Zhong Y, Ma L, Liu W, Li H. Adversarial spatio-temporal learning for video deblurring. IEEE Transactions on Image Processing. 2018;28(1):291–301. pmid:30176588
- 19. Wu J, Yu X, Liu D, Chandraker M, Wang Z. DAVID: Dual-attentional video deblurring. In: The IEEE Winter Conference on Applications of Computer Vision; 2020. p. 2376–2385.
- 20. Zhou S, Zhang J, Pan J, Xie H, Zuo W, Ren J. Spatio-temporal filter adaptive network for video deblurring. In: Proceedings of the IEEE International Conference on Computer Vision; 2019. p. 2482–2491.
- 21. Wang X, Chan KCK, Yu K, Dong C, Loy CC. EDVR: Video Restoration With Enhanced Deformable Convolutional Networks. In: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW); 2019. p. 1954–1963.
- 22. Nah S, Baik S, Hong S, Moon G, Son S, Timofte R, et al. NTIRE 2019 Challenge on Video Deblurring and Super-Resolution: Dataset and Study. In: 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW); 2019. p. 1996–2005.
- 23. Aittala M, Durand F. Burst image deblurring using permutation invariant convolutional neural networks. In: Proceedings of the European Conference on Computer Vision (ECCV); 2018. p. 731–747.
- 24. Roels J, Aelterman J, Luong HQ, Lippens S, Pizurica A, Saeys Y, et al. An overview of state-of-the-art image restoration in electron microscopy. Journal of Microscopy. 2018;271(3):239–254. pmid:29882967
- 25. Buchholz TO, Krull A, Shahidi R, Pigino G, Jékely G, Jug F. Content-aware image restoration for electron microscopy. In: Methods in cell biology. vol. 152. Elsevier; 2019. p. 277–289.
- 26. Kose K, Gou M, Yélamos O, Cordova M, Rossi AM, Nehal KS, et al. Automated video-mosaicking approach for confocal microscopic imaging in vivo: an approach to address challenges in imaging living tissue and extend field of view. Scientific Reports. 2017;7(1):10759. pmid:28883434
- 27. Bedard N, Quang T, Schmeler K, Richards-Kortum R, Tkaczyk TS. Real-time video mosaicing with a high-resolution microendoscope. Biomedical optics express. 2012;3(10):2428–2435. pmid:23082285
- 28. Wieslander H, Wählby C, Sintorn IM. Transmission Electron Microscopy Dataset for Image Deblurring; 2020. Available from: https://doi.org/10.5281/zenodo.4113244.
- 29. Evangelidis GD, Psarakis EZ. Parametric Image Alignment Using Enhanced Correlation Coefficient Maximization. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2008;30(10):1858–1865. pmid:18703836
- 30. Zhou Wang, Bovik AC, Sheikh HR, Simoncelli EP. Image quality assessment: from error visibility to structural similarity. IEEE Transactions on Image Processing. 2004;13(4):600–612.
- 31. Jégou S, Drozdzal M, Vazquez D, Romero A, Bengio Y. The one hundred layers tiramisu: Fully convolutional densenets for semantic segmentation. In: Proceedings of the IEEE conference on computer vision and pattern recognition workshops; 2017. p. 11–19.
- 32. Guan S, Khan AA, Sikdar S, Chitnis PV. Fully Dense UNet for 2-D Sparse Photoacoustic Tomography Artifact Removal. IEEE Journal of Biomedical and Health Informatics. 2020;24(2):568–576. pmid:31021809
- 33. Odena A, Dumoulin V, Olah C. Deconvolution and Checkerboard Artifacts. Distill. 2016.
- 34. Shi W, Caballero J, Huszár F, Totz J, Aitken AP, Bishop R, et al. Real-time single image and video super-resolution using an efficient sub-pixel convolutional neural network. In: Proceedings of the IEEE conference on computer vision and pattern recognition; 2016. p. 1874–1883.
- 35. Zhao H, Gallo O, Frosio I, Kautz J. Loss functions for image restoration with neural networks. IEEE Transactions on computational imaging. 2016;3(1):47–57.