### Introduction

### Overview of the MBDS Algorithm

Let denote the vector composed of the first measurements, and let denote the unknown signal. Then on the measurement, the entire vector of past and present measurements is given by

\begin{equation}

y^{(k)} = A^{(k)} x + w^{(k)},

\end{equation}

where is the projection matrix, and is Gaussian measurement noise that is assumed to be both independent of and to have independent components, with variance .

Since we are limited to pixel-wise measurements the rows of are vectors with where a measurement is made and everywhere else. Our goal will then be to add new rows to so as to acquire the most informative pixels. For this we first model the posterior distribution . Then we find the pixel location where the posterior variance is largest and measure that location in the next iteration.

The MBDS framework has been constructed to allow the use of a wide range of prior distributions. The reason for this is that different images are best represented by different priors. Although, as a result of this modification there is no closed form expression for the posterior variance, and therefore we estimate it using samples from the posterior distribution. Given we have samples from , the mean and variance of pixel location is given by,

\begin{equation}

\hat{\mu}_s^{(k)} = \frac{1}{L} \displaystyle\sum\limits_{i=1} ^{L} X^{(k,i)}_{s}

\end{equation}

\begin{equation}

\hat{\sigma}^{(k)}_s= \frac{1}{L-1} \displaystyle\sum\limits_{i=1} ^{L} \left( X^{(k,i)}_s - \hat{\mu}^{(k)} _s \right)^2

\end{equation}

Then by finding the location where this quantity is largest, we update the matrix,

\begin{equation}

A^{(k+1)} = \begin{pmatrix}

A^{(k)} \\ m^{(k)t}

\end{pmatrix}.

\label{New_meas_A}

\end{equation}

### Sampling from the Posterior Distribution

For most images sampling from the posterior distribution is intractable. Therefore, we introduce a computationally efficient method for computing the stochastic samples through a local updating technique. Instead of sampling from at each iteration, we store stochastic samples in memory, and update only a window surrounding the measured pixel location .

Consider that we have stochastic samples from the previous iteration . We now sample from , the conditional distribution of the window surrounding the measured pixel, , given all the measurements, , and the other pixels in the image, , to generate samples . Next, we use these stochastically generated samples to replace these corresponding windows of pixels in the stochastic samples to form . In our implementation we use the Hastings-Metropolis algorithm to generate these stochastic samples.

### Results

We use the MBDS algorithm to measure two images, one a synthetic image generated by myself, and the other an image given to us by Prof. Kaldindi's group. The results are shown as videos, where each frame is after of new samples are added. The first image in each video shows the sampling locations in red, and the second the measured image, and the third the reconstructed image.

**MBDS used to measure a synthetic image. Images show the results after approximately 14% of the image is measured. **

This video shows from left to right, the sampling locations, the measured image and the reconstructed image. 1% of new samples are added between frames.

**MBDS used to measure an image provided by Prof. Kaldindi's group. Images show the results after approximately 43% of the image is measured. **

This video shows from left to right, the sampling locations, the measured image and the reconstructed image. 1% of new samples are added between frames.

### References

[1]. Dilshan Godaliyadda, G.M.; Buzzard, G.T.; Bouman, C.A, "A model-based framework for fast dynamic image sampling," Acoustics, Speech and Signal Processing (ICASSP), 2014 IEEE International Conference on , vol., no., pp.1822,1826, 4-9 May 2014