Algorithm 1 Construction of a binary measurement matrix from image maps.
Input: $\mathbf{m}$—$l\times n$ matrix containing l maps with $n=n_x·n_y$ pixels
Input: $\mathbf{r}$—vector of length n with random integer values in the range $[1,l]$
Input: $\mathbf{A}$—a look-up table; $(m+1)\times m$ binary matrix, such that $\mathbf{D}·\mathbf{A}$ is full rank. Here $\mathbf{D}$ is finite difference operator that subtracts matrix rows.
Output: $\mathbf{M}$—$k\times n$ measurement matrix with rows containing binary patterns with n pixels each
function make patterns($\mathbf{m},\mathbf{r},\mathbf{A}$)
$\mathbf{M}\leftarrow \mathrm{initialize}\mathrm{and}\mathrm{fill}\mathrm{with}\mathrm{zeros}$
$p\leftarrow 0$
for $i=1,l$ do	▹ Iterate maps
${\mathbf{m}}_{\mathbf{i}}\leftarrow i-\mathrm{th}\mathrm{row}\mathrm{of}\mathbf{m}$	▹i-th map
for $q=1,(m+1)$ do	▹ Iterate rows of $\mathbf{A}$
for $j=1,m$ do	▹ Iterate sectors of map ${\mathbf{m}}_{\mathbf{i}}$
$p\leftarrow p+1$	▹ Index of the next sampling pattern
$\mathbf{v}\leftarrow where\left(({\mathbf{m}}_{\mathbf{i}}=j)and(\mathbf{r}\ne i)\right)$	▹ Get indices of all pixels of j-th sector of i-th map
$M(p,\mathbf{v})\leftarrow A(q,j)$	▹ Assign binary values to pixels of a sector
end for
end for
end for
return $\tilde{\mathbf{M}}$	▹ Return the measurement matrix
end function