This code accompanies "Differentiable probabilistic models of scientific imaging with the Fourier slice theorem", UAI 2019
Scientific imaging techniques such as optical and electron microscopy and computed tomography (CT) scanning are used to study the 3D structure of an object through 2D observations. These observations are related to the original 3D object through orthogonal integral projections. For common 3D reconstruction algorithms, computational efficiency requires the modeling of the 3D structures to take place in Fourier space by applying the Fourier slice theorem. At present, it is unclear how to differentiate through the projection operator, and hence current learning algorithms can not rely on gradient based methods to optimize 3D structure models. In this paper we show how back-propagation through the projection operator in Fourier space can be achieved. We demonstrate the validity of the approach with experiments on 3D reconstruction of proteins. We further extend our approach to learning probabilistic models of 3D objects. This allows us to predict regions of low sampling rates or estimate noise. A higher sample efficiency can be reached by utilizing the learned uncertainties of the 3D structure as an unsupervised estimate of the model fit. Finally, we demonstrate how the reconstruction algorithm can be extended with an amortized inference scheme on unknown attributes such as object pose. Through empirical studies we show that joint inference of the 3D structure and the object pose becomes more difficult when the ground truth object contains more symmetries. Due to the presence of for instance (approximate) rotational symmetries, the pose estimation can easily get stuck in local optima, inhibiting a fine-grained high-quality estimate of the 3D structure.READ FULL TEXT VIEW PDF
This code accompanies "Differentiable probabilistic models of scientific imaging with the Fourier slice theorem", UAI 2019
The main goal of many scientific imaging methods is to reconstruct a -dimensional structure from (d)-dimensional observations , where is either one or two. For the sake of simplicity we will talk about the case in the rest of this work. The contributions of this paper are:
We view the process of image formation through a graphical model in which latent variables correspond to physical quantities such as the hidden structure v or the relative orientation/pose of a specimen. This enables one to predict errors in the reconstruction of 3D structures through uncertainty estimates. This is especially interesting when objects v are only partially observable, as is the case in certain medical scans, such as breast cancer scans. Moreover, uncertainty prediction enables more data efficient model validation.
Based on the aforementioned innovations, we propose a new method for (unsupervised) reconstruction evaluation. Particularly, we demonstrate that learned uncertainties can replace currently used data inefficient methods of evaluation (see Section 6.2). We thus learn better model fits than traditional methods given the same amount of data.
We extend current approaches such as (Jaitly et al., 2010)
to describe the generative process as a differentiable map by adopting recent techniques from the deep learning community(Jaderberg et al., 2015; Rezende et al., 2016). We demonstrate that this fenables more advanced joint inference schemes over object pose and structure estimation.
Our experimental validation focuses on single particle electron cryo-microscopy (cryoEM). CryoEM is a challenging scientific imaging task, as it suffers from complex sources of observation noise, low signal to noise ratios, and interference corruption. Interference corruption attenuates certain Fourier frequencies in the observations. Radiation exposure is minimized because electron radiation severely damages biological specimens during data collection. Minimal radiation, however, leads to low signal-to-noise ratios, where sensor cells record relatively low electron counts. Since imaging techniques like CT suffer from a subset of these difficulties, we believe that evaluating and analyzing our method on cryoEM problems is appropriate.
Modelling nano-scale structures such as proteins or viruses is a central task in structural biology. By freezing such structures and subsequently projecting them via a parallel electron beam to a sensor grid (see figure 2), CryoEM enables reconstruction and visualization of such structures. The technique has been described as revolutionary because researchers are capable of observing structures that cannot be crystallized, as required for X-ray crystallography (Rupp, 2009).
The main task of reconstructing the structure from projections in cryoEM, and the wider field of medical imaging, is somewhat similar to multi-view scene reconstruction from natural images. There are, however, substantial differences. Most significantly, the projection operation in medical imaging is often an orthogonal integral projection, while in computer vision it is a non-linear perspective projection for which materials exhibit different degrees of opacity. Thus, the generative model in computer vision is more complex. Medical imaging domains, on the other hand, face significant noise and measurement uncertainties, with signal-to-noise ratios as low as 0.05(Baxter et al., 2009).
Most CryoEM techniques (De la Rosa-Trevín et al., 2013; Grigorieff, 2007; Scheres, 2012; Tang et al., 2007) iteratively refine an initial structure by matching a maximum a posteriori (MAP) estimate of the pose (orientation and position) under the proposal structure with the image observation. These approaches suffer from a range of problems such as high sensitivity to poor initialization (Henderson et al., 2012). In contrast to this approach, and closely related to our work, (Brubaker et al., 2015; Punjani et al., 2017) treat poses and structure as latent variables of a joint density model. MAP estimation enables efficient optimization in observation space. Previous work (Sigworth, 1998; Scheres et al., 2007a; Jaitly et al., 2010; Scheres, 2012) has suggested full marginalization, however due to its cost, it is usually intractable.
This paper extends the MAP approach by utilizing variational inference to approximate intractable integrals. Further, reparameterizing posterior distributions enables gradient based learning (Kingma and Welling, 2013; Rezende et al., 2014a). To our knowledge this is the first such approach that provides an efficient way to learn approximate posterior distributions in this domain.
Given a structure v, we consider a generic generative model of observations, one that is common to many imaging modalities. As a specific example, we take the structure v to be a frozen (i.e. cryogenic) protein complex, although the procedure described below applies as well to CT scanning and optical microscopy. v is in a specific pose relative to the direction of the electron radiation beam. This yields a pose-conditional projection, with observation . Specifically, the pose , consists of , corresponding to the rotation of the object with respect to the microscope coordinate frame, and , the translation of the structure with respect to the origin.
The observations are then generated as follows: The specimen in pose is subjected to radiation (the electron beam), yielding an orthographic integral projection onto the plane perpendicular to the beam. The expected projection can be formulated as
Here is the projection operator, is the linear translation operator for translation , and is the linear operator corresponding to rotation . Without loss of generality we can choose the projection direction to be along the -direction . When the projection is recorded with a discrete sensor grid (i.e., sampled), information beyond the Nyquist frequency is aliased. Additionally, the recording is corrupted with noise stemming from the stochastic nature of electron detection events and sensor failures (Egelman, 2016). Low doses are necessary since electron exposure causes damage to sensitive biological molecules. Logically, the effect is more severe for smaller objects of study.
Many sophisticated noise models have been proposed for these phenomena (Faruqi et al., 2003; Vulović et al., 2013; Scheres et al., 2007b). In this work, for simplicity, we assume isotropic Gaussian noise; i.e.,
where models the magnitude of the observation noise. The image formation process is depicted in Figure 2.
The final section below discusses how one can generalize to more sophisticated (learnable) noise models. Note that we do not model interference patterns caused by electron scattering, called defocus and modelled with a contrast transfer function (CTF). This will lead to less realistic generative models, however we see the problem of CTF estimation as somewhat independent of our problem. Ideally, we would like to model the CTF across multiple datasets, but we leave this to future work.
In this section we aim to bridge the gap between our knowledge of the generative process and a differentiable mapping that facilitates direct optimization of hidden variables () with gradient-descent style schemes. We start with an explanation of a naive differentiable implementation in position space, followed by a computationally more efficient version by shifting the computations to the Fourier domain (momentum space).
Our goal is to optimize the conditional log-likehood with respect to the unobserved and v, maximizing the likelihood of the 2D observations. This requires equation (2) to be a differentiable operator with respect to and v. Note that the dependence on and v is fully determined by equation (1). In order to achieve this, we first need to apply the group action onto v. Matrix representations of the group action such as the Euler angles matrix are defined on the sampling grid of v rather than the voxel values . For example, the action induced by a rotation around the z-axis by an angle on the position of an arbitrary voxel can be written as,
This entails two problems. First, the volume after transformation should be sampled at the same grid points as before. This requires interpolation. Second, to achieve a differentiable map we need to formulate the transformation of position values as a transformation of the voxel values.Jaderberg et al. (2015) offers a solution to both problems, known as differentiable sampling111
Originally invented to learn affine transformations on images to ease the classification task for standard neural networks, the approach has since been extend to 3D reconstruction problems from images(Rezende et al., 2016)..
The -th voxel of the transformed volume, , with index vector , can be expressed as a weighted sum of all voxels before transformation . The weights are determined by a sampling kernel , the argument of which is the difference between the transformed voxel’s position and all transformed sampling grid vectors :
A popular kernel in this context is the linear interpolation sampling kernel222Linear kernels are efficient and yield fairly good results. More complex ones such as the Lanczos re-sampling kernel may actually yield worse results due to smoothing.
Computing one voxel only requires a sum over 8 voxels from the original structure. These are determined by flooring and ceiling the elements of . Furthermore, the partial derivatives are provided by,
This framework was originally proposed for any differentiable kernel and any differentiable affine position transformation . In our setting, we restrict ourselves to linear interpolation kernels. The group actions represented by are affine. In this work we represent rotations as Euler angles by using the Z-Y-Z convention. One could also use quaternions or exponential maps. As with rotation, the translation operation is also a transformation of the voxel grid, rather than the voxel values. Thus, equation (4) can also be used to obtain a differentiable translation operation.
Finally, the orthogonal integral projection operator is applied by summing voxel values along one principal direction. Since the position of the hidden volume is arbitrary we can fix this direction to be the Z-axis as discussed in section 3. Denoting a volume, rotated and translated according to , by , the -th element of its expected projection is given by
where denotes the element of .
This concludes a naive approach to modelling a differential map of the expected observation in position space. This approach is not particularly efficient, as according to equation (8) we need to interpolate all voxels to compute one dimensional observation. Moreover, back-propagating through this mapping requires transporting gradients through all voxels. Next, we show how to reduce the cost of this naive approach without a loss of precision by shifting the problem to the Fourier domain.
The projection-slice theorem or Fourier-slice theorem states the equivalence between the Fourier transformof the projection of a dimensional function onto a -dimensional submanifold and a -dimensional slice of the -dimensional Fourier transform of that function. This slice is a -dimensional linear submanifold through the origin in the Fourier domain that is parallel to the projection submanifold .
In our setting, given an axis-aligned projection direction (see equation (1)) and the discrete grid , the expected observation in 2D Fourier space is equal to a central slice through the Fourier transformed 3D structure parallel to the projection direction :
where and denote discrete Fourier transforms in 2 and 3 dimensions. The slice operator is the Fourier equivariant of the projection operator. In our case, it is applied as follows:
where are Fourier indexes.
This allows one to execute the generative model in position or momentum space. It has proven more efficient for most reconstruction algorithms to do computation in the Fourier domain (Sigworth, 2016). This also applies to our algorithm: (i) We reconstruct the structure in the Fourier domain. This means we only need to apply an inverse Fourier transformation at the end of optimization. (ii) We may save the Fourier transformed expected projections a-priori, further this is easily parallelized. Thus even though in its original formulation we can not expect a computational benefit, when sharing the computation across many data points to reconstruct one latent structure the gain is significant. We elaborate on this point with respect to differentiation below.
We incorporate the Fourier Slice Theorem into our approach to build an efficient differentiable generative model. For this we translate all elements of the model to their counterparts in the Fourier domain. The Gaussian noise model becomes (Havin and Jöricke, 1994),
where . In the following, we aim to determine an expression for the expected Fourier projection by deriving the operators counterparts .
We start by noting that it is useful to keep in memory to avoid computing the 3D discrete Fourier transform multiple times during optimization. The inverse Fourier transform is then only applied once, after convergence of the algorithm. Next, we restate that the Fourier transformation is a rotation-equivariant mapping (Chirikjian and Kyatkin, 2000). This means the derivations from Section 4.1 with respect to the rotation apply in this context as well. A translation in the Fourier domain , however, induces a re-weighting of the original Fourier coefficients,
Finally, the last section established the equivalence of the slice and the projection operator (see equation (4.2)) in momentum and position space. Specifically, for the linear interpolation kernel, we compute the set of interpolation points by flooring and ceiling the elements of the vector , . This entails 6 interpolation candidates per voxel of the central slice, in total . Remember, this computation above involved voxels and candidates.
We can further improve the efficiency of the algorithm by swapping the projection and translation operators. That is, due to parallel radiation, and hence orthographic projection,
where . This is more efficient because we reduce the translation to a two dimensional translation. Thus this modifies equation (12) to its two dimensioanl equivalent.
For the naive implementation the cost of a real space forward projection is O. In contrast, converting the volume to the Fourier space O, projecting O and applying the inverse Fourier transform O. At first glance this implies a higher computational cost. However, for large datasets the cost of transforming the volume is amortized over all data points. For gradient descent schemes, we iterate over the dataset more than once, hence the cost of Fourier transforming the observations is further amortized. Furthermore, it is often reasonable to consider only a subset of Fourier frequencies, so back projection becomes O with . The efficiency of this algorithm in the context of cryo-EM was first recognized by Grigorieff (1998). (We provide code for the differentiable observation model and in particular for the Fourier operators: https://github.com/KarenUllrich/pytorch-backprojection.)
Here we describe the variational inference procedure for 3D reconstruction in Fourier space, enabled by the Fourier slice theorem. We assume we have a dataset of observations from a single type of protein with ground truth structure v, and its Fourier transform . We consider two scenarios. In the first, both the pose of the protein and the projection are observed, and inference is only performed over the global protein structure. In the second, the pose of the protein for each observation is unknown. Therefore, inference is done over poses and the protein structure.
The first scenario is synonymous with the setting in tomography, where we observe a frozen cell or larger complex positioned in known poses. This case is often challenging because the sample cannot be observed from all viewing angles. For example, in cryo-EM tomography the specimen frozen in an ice slice can only be rotated till the verge of the slice comes into view. We find similar problems in CT scanning, for example in breast cancer scans. The second scenario is relevant for cryo-EM single particle analysis. In this case multiple identical particles are confined in a frozen sample and no information on their structure or position is available a priori.
In this work we lay the foundations for doing inference in either of the two scenarios. However, our experiments demonstrate that joint inference over the poses and the 3D structure is very sensitive to getting stuck in local minima that correspond to approximate symmetries of the 3D structure. Therefore, the main focus of this work is the setting where the poses are observed.
Here the data comprise image projections and poses, , with Fourier transformed projections denoted . Our goal is to learn a model of the latent structure that as closely as possible resembles the true posterior . For this, we assume a joint latent variable model . To avoid clutter below, we use short-hand notations like for .
Specifically, we minimize an upper bound to the Kullback-Leibler (KL) divergence:
Here, we have assumed that, given the volume, the data are IID: . We have bounded the divergence by the data log-likelihood , a constant with respect to and . This is equivalent to lower bounding the model evidence by introducing a variational posterior (Jordan et al., 1998).
In this work we focus on modelling
as isotropic Gaussian distribution. The prior is assumed to be a standard Gaussian. In practice, we use stochastic gradient descent-like optimization, with the data organized in mini-batches. That is, we learn the distribution parametersfor through stochastic optimization, efficiently by using the reparameterization trick (Kingma and Welling, 2013; Rezende et al., 2014a).
In equation (14), the reconstruction term depends on the number of datapoints. The KL-divergence between the prior and approximate posterior does not. As the sum of the mini-batch objectives should be equal to the objective of the entire dataset, the mini-batch objective is
where is the set of indices of the data in minibatch , and denotes the size of the -th minibatch.
In the second scenario the pose of the 3D structure for each observation is unknown. The data thus comprises the observed projections . Again, we perform inference in the Fourier domain, with transformed projections as data. We perform joint inference over the poses and the volume . We assume the latent variable model can be factored as follows, .
Upper bounding the KL-divergence, as above, we obtain
The prior, approximate posterior and conditional likelihood all factorize across datapoints: , , and . Like equation (15), for mini-batch optimization algorithms we make use of the objective
In Section 5.1, we learn the structure parameters shared across all data points. Here the pose parameters are unique per observation and therefore require separate inference procedures per data point. As an alternative, we can also learn a function that approximates the inference procedure; This is called amortized inference (Kingma and Welling, 2013). In practice, a complex parameterized function such as a neural network predicts the parameters of the variational posterior .
We empirically test the formulation above with simulated data from the well-known GroEL-GroES protein (Xu et al., 1997). To this end we generate three datasets, each with 40K projections onto 128128 images at a resolution of 2.8Å per pixel. The three datasets have signal-to-noise ratios (SNR) of 1.0, 0.04 and 0.01, referred to below as the noise-free, medium-noise and high-noise cases. Figure 7 shows one sample per noise level. As previously stated in Section 3, we do not model the microscope’s defocus or electron scattering effects, as captured by the CTF (Kohl and Reimer, 2008).
Using synthetic data allows us to evaluate the algorithm with the ground-truth structure, e.g., in terms of mean-squared error (MSE). With real-data, where ground truth is unknown, the resolution of a fitted 3D structure is often quantified using Fourier Shell Correlation (Rosenthal and Henderson, 2003): The observations are partitioned randomly into two sets, and , each of which is then independently modeled with the same reconstruction algorithm. The normalized cross-correlation coefficient is then computed as a function of frequency to assess the agreement between the two reconstructions.
Given two 3D structures, and , in the Fourier domain, FSC at frequency is given by
where denotes the set of frequencies in a shell at distance from the origin of the Fourier domain (i.e. with wavelength ). This yields FSC curves like those in Fig. 4. The quality (resolution) of the fit can be measured in terms of the frequency at which this curve crosses a threshold . When one of or is ground truth, then , and when both are noisy reconstructions it is common to use (Rosenthal and Henderson, 2003)). The structure is then said to be resolved to wavelength for which .
When poses are known, the current state-of-the-art (SOTA) is a conventional tomographic reconstruction (a.k.a. back-projection). When poses are unknown, there are several well-known SOTA cryo-EM algorithms (De la Rosa-Trevín et al., 2013; Grigorieff, 2007; Scheres, 2012; Tang et al., 2007). All provide point estimates of the 3D structure. In terms of graphical models, point estimates correspond to the case in which the posterior is modeled as a delta function, , the parameter of which is the 3D voxel array, .
We compare this baseline to a model in which the posterior is a multivariate diagonal Gaussian, . While the latent structure is modeled in Fourier domain, the spatial domain signal is real-valued. We restrict the learnable parameters, and , accordingly 333That is : and with .. We use the reparameterization trick thus correlate the samples accordingly. Finally, the prior in equation (14) in a multivariate standard Gaussian, .
Table 1 shows results with these two models, with known poses (the tomographic setting), and with noise-free observations. Given the sensor resolution of , the highest possible resolution would be the Nyquist wavelength of . Our results show that both models approach this resolution, and in reasonable time.
In this section, we explore how modelling the latent structure with uncertainty can improve data efficiency. For this, recall that FSC is computed by comparing reconstructions based on dataset splits, and . As an alternative, we propose to utilize the learned model uncertainties to achieve a similar result. We thus only need one model fit that includes both dataset splits. Specifically, we propose to extend a measure first presented in Unser et al. (1987): the spectral SNR to the 3D case, and hence refer to it as spectral shell SNR (SS-SNR). When modelling the latent structure as diagonal Gaussian , the SS-SNR can be computed to be
Following the formulation by Unser et al. (1987), we can then express the FSC in terms of the SS-SNR, i.e., .
Figure 4 shows FSC curves based on reconstructions from the medium-noise (top) and high-noise (bottom) datasets. First, we aim to demonstrate that the FSC curves between the Gaussian fit (with all data) vs ground truth, and the MAP estimate model with all data vs ground truth, i.e., FSC(, ) and FSC(, ), yield the same fit quality. Note that we would not usually have access to the ground truth structure. Secondly, because in a realistic scenario we would not have access to the ground truth we would need to split the dataset in two. For this we evaluate the FSC between ground truth and two disjoint splits of the dataset FSC(, ) and FSC(, ). This curve not surprisingly lies under the previous curves. Also note, that the actual measure we would consider FSC(, ) is more conservative. Finally, we show that curve has the same inflection points as the FSC curve. As one would expect, it lies above the conservative FSC(, ).
Using one can quantify the model fit with learned uncertainty rather than FSC curve. As a consequence there is no need to partition the data and perform two separate reconstructions, each with only half the data.
Above we discussed how global uncertainty estimation can help estimate the quality of fit.
Here we demonstrate how local uncertainty can help evaluate the local quality of
fit444Other studies recognize the importance of local uncertainty estimation, measuring
FSC locally in a wavelet basis (Cardone et al., 2013; Kucukelbir et al., 2014; Vilas et al., 2018)..
In many medical settings, such as breast cancer scans, limited viewing directions are available.
This is an issue in tomography, and also occurs in single particle cryo-EM
when the distribution of particle orientations around the viewing sphere are highly anisotropic.
To recreate the same effect we construct a dataset of 40K observations, as before with no noise
to separate the sources of information corruption555For completeness we present the same
experiment with noise in the appendix..
We restrict viewing directions to Euler angles with ;
i.e., no observations outside a cone
As above, we assume a Gaussian posterior over the latent protein structure.
Figure 5 shows the result. We can show that the uncertainty the model has learned correlates with regions in which data has been observed (uncertainty close to 0) and has not been observed (uncertainty close to 1). Due to the pressure from the KL-divergence (see equation (14)) the latter areas of the model default to the prior . This approach can be a helpful method to identify areas of low local quality of fit.
Extending our method from treating structures as latent variables to treating poses as latent variables is difficult. In the following we analyze why this is the case. Note though that, our method of estimating latent structure can be combined with common methods of pose estimation such as branch and bound (Punjani et al., 2017)
without losing any of the benefits we offer. However, ideally it would be interesting to also learn latent pose posteriors. This would be useful to for example detect outliers in the dataset which is common in real world scenarios.
In an initial experiment, we fix the volume to the ground truth. We subsequently only estimate the poses with a simple Dirac model for each data point . In figure 6, we demonstrate the problem of SGD-based learning for this. For one example (samples on top), we show its true error surface, the global optimum (red star) and the changes over the course of optimization (red line). We observe that due to the high symmetries in the structure, the true pose posterior error surface has many symmetries as well. An estimate depending on its starting position, seems to converge to the closest local optimum only rather than the global one. We would hope to be able to fix this problem in the future by applying more advanced density estimation approaches.
This paper introduces practical probabilistic models into the scientific imaging pipeline, where practical refers to scalability through the use of the reparameterization trick. We show how to turn the operators in the pipeline into differentiable maps, as this is required to apply the trick. The main focus of the experiments is to show why this novelty is important, addressing issues such as data efficiency, local uncertainty, and cross validation. Specifically, we found that a parameterized distribution, i.e. the Gaussian, achieves the same quality of fit as a point estimate, i.e. the dirac, while relying on less data. We conclude that our latent variable model is a suitable building block. It can be plugged into many SOTA approaches seamlessly, such as (De la Rosa-Trevín et al., 2013; Grigorieff, 2007; Scheres, 2012; Tang et al., 2007). We also established that the learned uncertainty is predictive of locations with too few samples. Finally, we demonstrated the limits of our current methods in treating poses as latent variables. This problem, however, does not limit the applicability of our method to latent structures. We thus propose to combine common pose estimation with our latent variable structure estimation. This method benefit from the uncertainty measure but also find globally optimal poses.
In future work we hope to find a way to efficiently learn pose posterior distributions as well. We hope that a reasonable approach would be to use multi-modal distributions and thus more advanced density estimation techniques. We will also try to incorporate amortized inference, mentioned in Section 5. Amortization would give the additional advantage of being able to transfer knowledge from protein to protein. Transfer could then lead to more advanced noise and CTF models. Bias in transfer will be a key focus of this effort; i.e., we only want to transfer features of the noise and not the latent structure. Another problem we see with the field of reconstruction algorithms is that the model evaluation can only help to detect variance but not bias in a model class. This is a problem with FSC comparison, but also with our proposal. We believe that an estimate of the data-log-likelihood of a hold out test dataset is generally much better suited. In a probabilistic view, this can be achieved by importance weighting the ELBO (Rezende et al., 2014b).
We thank the reviewers for their valuable feedback, in particular AnonReviewer1. This research was funded in part by Google and by the Canadian Institute for Advanced Research.
Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 3099–3108.
Stochastic backpropagation and approximate inference in deep generative models.In Proceedings of the 31st International Conference on Machine Learning
, Proceedings of Machine Learning Research, pages 1278–1286.
First, to give a visual impression of the observations, we learn from we present in Figure 7 samples from the 3 data sets we use. All of the datasets are based on the same protein estimate of the GroEL-GroES protein(Xu et al., 1997). They differ in the signal-to-noise ratio (SNR). The left row represents noise free data, the middle a moderate common noise level, and the right an extreme level of noise. For each observation example, we show also the corresponding Fourier transformations, their real part in the second column and their imaginary part in the third column.
Further we present the qualitative results of fitting the mid and high level datasets with our method. We visualize the respective protein fit from experiment 6.2 in Figure 8 with the Chimera X software package (Pettersen et al., 2004). The two pictures on the top row represent the middle noise fit, respectively the bottom two the high noise fit.
We shall execute the same experiment as in section 6.3 given the dataset with intermediate noise. We display the experiments of this result in Figure 9. It is clear that while, missing information leads to large deviation in variance we also find that the noise leads to some variance in the observed area.
Again we visualize the result of the fit in Figure 10.
We have not used amortized inference in our experiments. In experiment 6.4 we have modelled poses as local variables and trained them by variational expectation maximization. Other work shows that the amortization gab can be significant(Scheres et al., 2007b; Alemi et al., 2017; Marino et al., 2018). Hence in order to exclude the gap as a reason for failure, we decided to model local variables. We did run experiments though with ResNets as encoders without success either. We believe the core problem in probabilistic pose estimation is the number of local optima. This makes simple SGD a somewhat poor choice, because we rely on finding the global minimum.
The Gaussian noise model is a common but surely oversimplified model (Sigworth, 1998)
. A better model would be the Poisson distribution. The Gaussian is a good approximation to it given a high rate parameter meaning if there is a reasonable high count of radiation hitting the sensors. This is a good assumption for most methods of the field, but can actually be a poor model in some cases of cryo electron microscopy. An example of an elaborate model is presented inVulović et al. (2013).