A persistent topic in diffuse optical imaging has been how best to design source and detector configurations. Although it is always possible to simulate data with different source-detector configurations and evaluate the image reconstruction results according to various metrics (e.g., bias and variance,1 mutual information2), doing so can be very time- and resource-intensive. For these reasons, there has been enduring interest in methods that allow one to optimize the design of these configurations without having to repeatedly solve the inverse problem. One such approach that has proven popular is singular value analysis (SVA), which involves computing the singular value spectrum of the Jacobian (sensitivity matrix of the forward problem) associated with a particular system configuration and counting the number of singular values above a given threshold.126.96.36.199.8.–9 While SVA is conceptually straightforward, it does not make use of the information contained in the singular vectors of the Jacobian, which can lead to errors in performance predictions.10,11 It also does not exploit knowledge of the covariance of the measurements. In part to address these shortcomings, some have proposed using the Cramér–Rao lower bound (CRLB) as an alternative design guide.1213.–14 The CRLB defines the best achievable precision of any estimator for a given data model and has long been used in the statistical signal processing community—especially in the radar and sonar signal processing communities—to perform feasibility studies and system design. Like SVA, computing the CRLB does not require solving the inverse problem and should therefore be independent of the method selected to do this in practice. But unlike SVA, which can give only a relative indication of system performance overall, the CRLB can in principle yield numerical values of precision as a function of parameters of interest (e.g., inhomogeneity depth). Although other metrics have been recently proposed to optimize the design of data collection strategies for diffuse optical (DOT)15 and fluorescence-mediated tomography (FMT),16 to our knowledge only the CRLB can potentially provide the significant advantage of quantitative estimates of performance. We note that despite yielding a lower bound on theoretically available precision, the CRLB does not guarantee that any particular image reconstruction algorithm will be able to reach or even approach the bound. However, in many settings, including the diffuse optical imaging work cited above, differences in the CRLB are used as a surrogate measure of potential reconstruction accuracy. Thus, to be useful for system design, the CRLB should predict performance trends of reasonable reconstruction algorithms as imaging configurations vary.
Obtaining the CRLB requires inverting the Fisher information matrix (FIM), however, which is usually ill-conditioned (and often underdetermined) in the case of DOT and FMT. Here, we consider the impact of regularizing the FIM (so that it may be inverted) on the ability of so-computed CRLBs to predict system performance in a typical DOT setting. To the best of our knowledge, this issue has not been previously addressed in the diffuse optical imaging community. As we discuss in Sec. 2.1, one way of regularizing the FIM is to assume that the inhomogeneity to be imaged is a point target—an approach that initially appears reasonable since this is often a first step in the analysis of more complex problems (i.e., analogous to using the point spread function (PSF) to characterize instrument performance in optical microscopy). In what follows, we probe the often unexamined assumption that the CRLBs computed for a point target are good predictors of imaging performance obtained with traditional image reconstruction algorithms. We illustrate that the utility of the CRLB for ill-posed problems such as DOT is limited, even under ideal conditions, and that a proper interpretation of the results requires taking into account the methods used to regularize the FIM and the inverse problem.
This article is organized as follows: in Sec. 2, we discuss the computation of the CRLB and the challenge that an ill-conditioned FIM matrix presents. We review two types of strategies to cope with this challenge and further explore the point-target approach with simulations. The results of our investigation are presented in Sec. 3, and we conclude in Sec. 4 with a discussion of the implications for the utility of the CRLB in diffuse optical imaging system design and the importance of considering the regularization method.
CRLB for the Linearized DOT Problem: General Target
The CRLB considered here defines the lowest variance that any unbiased estimator can achieve assuming a given probabilistic data model.17 The basic idea is that the curvature of the log-likelihood function of the data model determines the accuracy with which a particular unknown (e.g., position of an inhomogeneity) may be estimated. Log-likelihood functions that are sharply peaked about the unknown quantity permit a more accurate estimate of its value, while the reverse is true for log-likelihood functions that are rather flat in the neighborhood of the unknown. The CRLB provides a measure of this curvature. It is computed for a vector of unknowns by first calculating the FIM, which consists of second derivatives (and first derivative cross products) of the log-likelihood function with respect to each unknown, and then taking its inverse.
Consider the linearized DOT inverse problem for the case of an absorbing inhomogeneity with differential absorbance distribution and data modelRef. 18 to account for a nonzero background signal. The matrix is the FIM and is at best ill-conditioned (if not low rank) in the case of diffuse optical imaging. An ill-conditioned FIM signifies in this case that our data alone do not contain sufficient information to extract all of the unknown values that we desire from it in a numerically stable manner.
Two approaches for overcoming this roadblock to computing the CRLB have been adopted in the literature. The first regularizes the FIM by adding to it a regularization matrix as is common in, for example, Tikhonov regularization.12 However, because this regularized FIM has not been derived directly from the data model, it is technically no longer a CRLB. One might assume that it is possible to limit the amount of regularization applied so that the bounds computed from this “perturbed” FIM are in reasonable agreement with the true CRLBs. This is an assumption that to our knowledge has not been investigated in the context of ill-posed problems like diffuse optical imaging. We note that in some cases, it might be possible to associate a regularized FIM with an appropriate data model. For example, if a Bayesian perspective is adopted with a white noise Gaussian distribution serving as the prior for , then the resulting FIM will have the same structure as a Tikhonov-regularized matrix. The inverse of this matrix is known as the Bayesian CRLB.19 Such a data model, however, is not always useful; for example, it is known to produce overly smooth solutions at the expense of image resolution. Moreover, in the scenarios reported here, we found it impossible to choose a physically meaningful regularization parameter for this model that did not dominate the resulting CRLB estimate, thus making the latter essentially a reflection of assumed prior knowledge.
The second approach regularizes the FIM by reparameterizing the problem, which results in a reduction of the number of unknowns to be estimated from the data. Approaches that consider the inhomogeneity to be a point target13,20 or a target with a constant and an easily parameterized geometric form (e.g., a sphere)14 fall into this category. When such an assumption is appropriate and this information is used to solve the inverse problem, a maximum likelihood (ML) algorithm can usually attain the CRLBs, resulting in performance that is typically at least an order of magnitude better than what can be achieved with standard reconstruction approaches.21 Unfortunately, data models with a reduced number of unknowns can usually only model a limited subset of scenarios of interest.
It is certainly the case, however, that the resolution of an optical imaging system is often characterized by its ability to image a point target.22 Moreover, using a point target as a proxy for a more complex object is ubiquitous in science. In what follows, we investigate whether CRLBs computed for the case of a point target can be used to predict performance trends when standard DOT reconstruction algorithms (that do not make use of the point-target assumption) are used to solve the inverse problem. Without making use of all of the information available (i.e., that the inhomogeneity is a point target), it is unlikely that any unbiased algorithm will approach the CRLBs, so the resulting numerical estimates of precision will probably not be meaningful per se. But we consider here to what degree they might be useful as relative measures of performance amongst different system configurations as a function of parameters of interest (e.g., inhomogeneity location, , etc.).
CRLB for the Linearized DOT Problem: Point Target
To compute the CRLB for a point target, we re-write as the product of a scalar and a unit vector , which contains zeros everywhere except for the ’th component which is equal to 1. This component encodes the location of the point target in the imaging domain. Our vector of unknowns is , where denotes the position of the point target and its differential absorbance. We use polar coordinates for position here, since we consider a circular imaging geometry in Sec. 2.3 [see Fig. 1(a)]. The resulting CRLB given the Poisson noise model specified by Eq. (1) is
Point-target DOT Simulations
We considered a continuous-wave DOT system with a transmissive circular imaging geometry, although a similar investigation could be carried out for other imaging geometries and modalities (e.g., FMT) with minor modifications to Eq. (3). As shown in Fig. 1(a), we modeled four source-detector configurations that rotate about a 25-mm diameter sample obtaining measurements every 5 deg. This resulted in a total of measurements for the sparsest configuration (det3), and for the densest (det37). The source, detectors, and absorbing inhomogeneity (point target) were assumed to lie in the same plane. We employed the diffusion approximation to the Boltzmann transport equation for an infinite homogeneous medium to compute , assuming background optical properties of and typical of those encountered in small animal imaging.23 The assumption of an infinite homogeneous medium allowed us to rely on analytical forms for the Green’s functions that comprise , which permitted us to side-step the potential complication of computing derivatives of numerically in Eq. (3).
The (noise-free) forward data was modeled as4), so the use of the linear image reconstruction algorithm described in the following paragraph is appropriate. We scaled the maximum value obtained from each source-detector configuration when no absorbing inhomogeneity was present to counts, which could be considered the equivalent of adjusting the source power so as to avoid saturating any detector in a particular configuration. We then added Poisson noise to the modeled data, yielding measurements with 1% to 4% noise. Fifty realizations of measurements for each configuration for an embedded point target at various depths (, 4, 7, and 10 mm) were generated. We used a grid size of 0.25-mm pixels to compute the forward data, which effectively placed a lower limit on the size of the point target, but all two-dimensional reconstructions were performed with a coarser Jacobian (0.5-mm pixels) to avoid inverse crimes.
To perform the image reconstructions, we used a common algebraic iterative technique, the randomized Kaczmarz method (also known as r-ART) implemented in Ref. 24. We employed a relaxation parameter of 1.5 along with a non-negativity constraint and used 50 iterations per reconstruction. These parameters were selected to yield stable results of acceptable quality for all source-detector configurations.
Cramér–Rao Lower Bounds
The CRLBs computed for a point target as a function of target radial position or depth are displayed in Figs. 1(b) and 1(c). Figure 1(b) illustrates the CRLBs for target depth, while Fig. 1(c) displays the CRLBs for target . The bounds for target angle as a function of target radial position are not shown; they are essentially uniform for each detector configuration, except in the immediate vicinity of where angle is not uniquely defined. (Because we collect measurements over a full 360 deg, the CRLBs show no dependency on target angle, so results as a function of target angle are also not shown for brevity.) Since the bounds are reported as standard deviations, lower values indicate better (i.e., more accurate) performance. We see that as expected, all detector configurations perform better with a shallow target than a more deeply embedded one. From these plots, with respect to estimating target depth, we expect the nine-detector configuration that goes out to (det9_45) to perform about as well as the 37-detector configuration (det37), which has more than four times the number of measurements. Surprisingly, the other nine-detector configuration (det9_90) is similar in performance to the three-detector configuration (det3). With respect to estimating target , performance as a function of depth is rather stable, although the configurations with detectors at (det9_90 and det37) seem to suffer when the target is deeper. We note that the trends observed in these plots are in part a direct result of the way that we have chosen to limit the maximum SNR for each configuration, as detectors closer to 0 deg in configurations with elements at , see SNRs that are lower than than what they measure in the or configurations. If we did not equalize the the maximum SNR across configurations, those with detectors at would have the advantage, since being closer to the source, these detectors would measure higher SNRs. In general, however, given our manner of capping SNR per configuration, those detector arrangements without elements that go out to appear to have a distinct performance advantage.
Example reconstructions with the randomized Kaczmarz method (which does not assume a point target) from the four detector configurations for a deep () and shallow () target are displayed in Fig. 2. In Tables 1 and 2, we summarize the reconstruction results of the 50 realizations per configuration using a number of metrics. (Although we have chosen to focus on the results for and as exemplars of a deep and shallow target, respectively, similar conclusions can be drawn from the data at and , which is not shown for brevity.) In Table 1, we compare the standard deviation of the radial position estimate (columns 4 and 5), defined as the location of the peak value of each reconstruction, with the CRLBs (columns 2 and 3) for the deep and shallow targets. We display normalized values in columns 3 and 4 to make comparing relative performance easier. We also include the bias and the average full-width half-maximum (FWHM) area of the reconstructed spots. We show similar metrics in Table 2 for the estimate, which is defined as the peak value of each reconstruction. In Table 2, we notice that the precision estimates for computed from the reconstructions are lower than the CRLBs. This is not an inconsistency, since we see from column 6 that the estimates are significantly biased, so in this case, we would not expect lower bounds computed for unbiased estimates to apply. Overall, we see a lack of correspondence between columns 3 and 4 in both tables, which represent the normalized predicted (from the CRLBs) and computed (from the reconstructions) values for the precision of target radial position and estimates. We also note that no single measure seems to be able to capture imaging performance for a point target. For example, although the reconstructed position estimate for the shallow target with det37 has the smallest bias, the standard deviation for this detector configuration is larger than that of det9_45, which has a larger bias but a standard deviation of 0.
Target radial position estimate: Cramér–Rao lower bound (CRLB) and reconstruction results. Sigma (σ) denotes the standard deviation. Results for deep target (r=4 mm) are in upper half; shallow target (r=10 mm) in lower half. Normalized σ(r) results (columns 3 and 4) were obtained from σ(r) (columns 2 and 5) by dividing by the maximum σ(r) value (deep and shallow targets considered separately). Bias is the average reconstruction position estimate minus the true value; the FWHM denotes the average area enclosed by the half-max contour.
|σ(r) (mm)||Normalized σ(r)||Normalized σ(r)||σ(r) (mm)||Bias (mm)||FWHM (mm2)|
Target δμa estimate: CRLB and reconstruction results. Sigma (σ) denotes the standard deviation. Results for deep target (r=4 mm) are in upper half; shallow target (r=10 mm) in lower half. Normalized σ(δμa) results (columns 3 and 4) were obtained from σ(δμa) (columns 2 and 5) by dividing by the maximum σ(δμa) value (deep and shallow targets considered separately). Bias is the average reconstruction δμa estimate minus the true value.
|σ(δμa) (mm−1)||Normalized σ(δμa)||Normalized σ(δμa)||σ(δμa) (mm−1)||Bias (mm−1)|
Within the three-detector configuration (det3), we did find a correspondence between the average FWHM area and the CRLB for the precision of target radial position as a function of depth, as shown in Fig. 3(a). Such a relationship did not hold up, however, when comparing different detector configurations for the same target depths, as seen in Table 1, nor was it as strong in other source-detector configurations [e.g., det37 in Fig. 3(b)].
Discussion and Conclusions
In this work, we evaluated the potential of the CRLB to serve as a design metric for diffuse optical imaging systems. In the case of DOT and FMT, computing the CRLB requires inverting a matrix that is usually ill-conditioned (if not rank deficient), so a decision about how to regularize the problem must be made before the bound can be determined. Our choice to regularize by employing a point-target model was motivated by the fact that imaging systems are frequently characterized by their ability to resolve point targets (e.g., the imaging PSF), and the approach had been previously reported in the literature.13 We reiterate that we did not expect to obtain imaging performance that quantitatively approached the CRLBs, since we relied on a common inversion algorithm (randomized Kaczmarz method) that did not make use of the point-target assumption. Rather, we tested the hypothesis that point-target CRLBs could be used to predict relative instrument performance. Although we did see some relative agreement between the FWHM values and the CRLB for radial position as a function of target depth, overall our results indicate that point-target CRLBs are not good predictors of imaging performance across different system configurations when standard reconstruction algorithms are employed. This is likely because the impact of regularization across the different system configurations varies depending on the regularization method, e.g., point-target assumption or randomized Kaczmarz method. The agreement seen within a detector configuration suggests that both of these methods share a similar sensitivity to target depth. Although an examination of the effects of the different regularization schemes on the CRLB might shed further light on our results, this represents a substantial analysis in its own right and is beyond the scope of the present paper. We point out that because our investigation was conducted in silico, there were no unmodeled sources of error present aside from the coarser Jacobian used in the reconstructions. That the point-target CRLBs did not prove useful in this situation calls into question their predictive value under more realistic circumstances (e.g., when the inhomogeneity is not a point target).
The point-target CRLBs as computed here are for unbiased estimators, and since one of the consequences of regularization is the introduction of bias in order to stabilize the solution of an ill-posed inverse problem, one might wonder why these bounds would apply to the case of diffuse optical imaging in the first place. Although some have argued that DOT reconstructions are unbiased in the limit of sufficient iterations and high SNR12 or a large number of source–detector pairs,14 this is certainly a valid objection in our case, as our reconstructions do exhibit notable bias in the estimate. But incorporating bias into the CRLB calculation often requires information that in practice is not usually available, so this does not appear to be a useful alternative.
It is also the case that the CRLB represents the best achievable performance for a given data model and therefore not necessarily the expected performance with a particular algorithm. To check whether our results would hold up using a different reconstruction algorithm, we modeled and reconstructed the same data using NIRFAST25 (results not shown), an FEM-based package for modeling light transport in tissue that uses a modified Tikhonov regularization scheme to perform image reconstruction. This also did not produce trends that agreed with the point-target CRLBs. Since we only considered two image reconstruction algorithms here, our results do not preclude the possibility of obtaining agreement with the CRLBs using a different algorithm and/or imaging geometry or modality, as others have reported.12,14 But they do establish that such agreement cannot be assumed a priori when the method of regularizing the inverse solution (e.g., iterative algebraic or modified Tikhonov approaches) does not match the one used to compute the CRLBs (e.g., point-target assumption). From a Bayesian perspective, this outcome is not surprising, since according to this view, a different way of regularizing the inverse solution corresponds to a different data model, and CRLBs are specific to the data model assumed. Of course, a CRLB that applies only to estimators that employ a particular regularization strategy is certainly less powerful and useful than one that applies to the class of all unbiased estimators. Moreover, it is not clear how the regularizing effect of iterative techniques like the randomized Kaczmarz method or modified Tikhonov approach (with a regularization parameter that depends on the iteration number) could be incorporated into the CRLB calculation. Progress in this area could expand the range of reconstruction algorithms for which appropriate CRLBs might be determined.
Despite these issues, the CRLB can be successfully employed in diffuse optical imaging if the regularization of the FIM and inverse problem are properly considered. For example, in Ref. 21, we used point-target CRLBs to characterize the performance of a ML estimator designed to localize a single fluorescently-labeled cell in the field of view—effectively a point target given the reconstruction grid. For this application, point-target CRLBs can be employed to optimize the source-detector configuration, since the ML estimator used in the reconstruction relies on the point-target assumption. In Ref. 26, regularization was achieved by reparameterizing the problem using a spherical harmonic basis, which reduced the number of unknowns to be estimated from the data to an object center position and various shape parameters. The CRLB for the shape parameters was subsequently computed and used to provide confidence limits for the shape estimates. The important caveat in both of these cases is that the FIM was regularized by an assumption appropriate to the problem wherein the CRLB was to be employed.
The larger question that our study raises is whether it is possible, even in principle, to optimize the design of an imaging system independently of the regularization scheme when regularization is an integral part of image formation. If our goal had been to image a point target using a reconstruction algorithm that made use of this assumption (e.g., an ML approach, as in Ref. 21, capable of achieving the CRLBs), the det9_45 configuration would offer us performance as good as or better than any of the other source-detector configurations considered here [see Figs. 1(b) and 1(c)]. But, if we rely on more common image reconstruction algorithms like the randomized Kaczmarz method or the modified Tikhonov approach, then our simulations demonstrate that in this case, the det37 configuration delivers markedly improved performance (see Fig. 2 and Tables 1 and 2). Given the necessity of regularization in diffuse optical imaging and the strong impact it can have on results, our study argues for the importance of taking this aspect of image formation into consideration when attempting to optimize source–detector configurations.
We thank Christ Richmond of MIT Lincoln Laboratory for insightful discussions on the topic of Cramér-Rao bounds. This work was funded by a grant from the National Institutes of Health (R01EB012117).
B. W. Pogueet al., “Statistical analysis of nonlinearly reconstructed near-infrared tomographic images: Part I-theory and simulations,” IEEE Trans. Med. Imag. 21(7), 755–763 (2002).ITMID40278-0062http://dx.doi.org/10.1109/TMI.2002.801155Google Scholar
A. B. Milsteinet al., “Fluorescence optical diffusion tomography using multiple-frequency data,” J. Opt. Soc. Am. A 21(6), 1035–1049 (2004).JOAOD60740-3232http://dx.doi.org/10.1364/JOSAA.21.001035Google Scholar
J. P. Culveret al., “Optimization of optode arrangements for diffuse optical tomography: a singular value analysis,” Opt. Lett. 26(10), 701–703 (2001).OPLEDP0146-9592http://dx.doi.org/10.1364/OL.26.000701Google Scholar
E. E. Graveset al., “Singular-value analysis and optimization of experimental parameters in fluorescence molecular tomography,” J. Opt. Soc. Am. A 21(2), 231–241 (2004).JOAOD60740-3232http://dx.doi.org/10.1364/JOSAA.21.000231Google Scholar
T. LasserV. Ntziachristos, “Optimization of 360 degrees projection fluorescence molecular tomography,” Med. Image Anal. 11(4), 389–399 (2007).Google Scholar
X. ZhangC. Badea, “Effects of sampling strategy on image quality in noncontact panoramic fluorescence diffuse optical tomography for small animal imaging,” Opt. Express 17(7), 5125–5138 (2009).OPEXFF1094-4087http://dx.doi.org/10.1364/OE.17.005125Google Scholar
F. Leblondet al., “Early-photon fluorescence tomography: spatial resolution improvements and noise stability considerations,” J. Opt. Soc. Am. A 26(6), 1444–1457 (2009).JOAOD60740-3232http://dx.doi.org/10.1364/JOSAA.26.001444Google Scholar
D. Wanget al., “Full-angle fluorescence diffuse optical tomography with spatially coded parallel excitation,” IEEE Trans. Inf. Tech. Biomed. 14(6), 1346–1354 (2010).ITIBFX1089-7771http://dx.doi.org/10.1109/TITB.2010.2077306Google Scholar
A. J. Chaudhariet al., “Hyperspectral and multispectral bioluminescence optical tomography for small animal imaging,” Phys. Med. Biol. 50(23), 5421–5441 (2005).PHMBA70031-9155http://dx.doi.org/10.1088/0031-9155/50/23/001Google Scholar
F. LeblondK. M. TichauerB. W. Pogue, “Singular value decomposition metrics show limitations of detector design in diffuse fluorescence tomography,” Biomed. Opt. Express 1(5), 1514–1531 (2010).BOEICL2156-7085http://dx.doi.org/10.1364/BOE.1.001514Google Scholar
P. K. Yalavarthyet al., “Cramér-Rao estimation of error limits for diffuse optical tomography with spatial prior information,” Proc. SPIE 6434, 643403 (2007).PSISDG0277-786Xhttp://dx.doi.org/10.1117/12.699404Google Scholar
M. Boffetyet al., “Cramer-Rao analysis of steady-state and time-domain fluorescence diffuse optical imaging,” Biomed. Opt. Express 2(6), 1626–1636 (2011).BOEICL2156-7085http://dx.doi.org/10.1364/BOE.2.001626Google Scholar
L. ChenN. Chen, “Optimization of source and detector configurations based on Cramer-Rao lower bound analysis,” J. Biomed. Opt. 16(3), 035001 (2011).JBOPFO1083-3668http://dx.doi.org/10.1117/1.3549738Google Scholar
D. KarkalaP. K. Yalavarthy, “Data-resolution based optimization of the data-collection strategy for near infrared diffuse optical tomography,” Med. Phys. 39(8), 4715–4725 (2012).MPHYA60094-2405http://dx.doi.org/10.1118/1.4736820Google Scholar
R. W. HoltF. L. LeblondB. W. Pogue, “Methodology to optimize detector geometry in fluorescence tomography of tissue using the minimized curvature of the summed diffuse sensitivity projections,” J. Opt. Soc. Am. A 30(8), 1613–1619 (2013).JOAOD60740-3232http://dx.doi.org/10.1364/JOSAA.30.001613Google Scholar
S. M. Kay, Fundamentals of Statistical Signal Processing: Estimation Theory, Prentice-Hall, Upper Saddle River, NJ (1993).Google Scholar
M. UnserM. Eden, “Maximum likelihood estimation of linear signal parameters for Poisson processes,” IEEE Trans. Acoust. Speech Signal Process. 36(6), 942–945 (1988).IETABA0096-3518http://dx.doi.org/10.1109/29.1613Google Scholar
Van TreesH. L., Detection, Estimation, and Modulation Theory: Part 1, Wiley, New York (1968).Google Scholar
A. B. Milsteinet al., “Statistical approach for detection and localization of a fluorescing mouse tumor in intralipid,” Appl. Opt. 44(12), 2300–2310 (2005).APOPAI0003-6935http://dx.doi.org/10.1364/AO.44.002300Google Scholar
V. Peraet al., “Maximum likelihood tomographic reconstruction of extremely sparse solutions in diffuse fluorescence flow cytometry,” Opt. Lett. 38(13), 2357–2359 (2013).OPLEDP0146-9592http://dx.doi.org/10.1364/OL.38.002357Google Scholar
M. J. NiedreG. M. TurnerV. Ntziachristos, “Time-resolved imaging of optical coefficients through murine chest cavities,” J. Biomed. Opt. 11(6), 064017 (2006).JBOPFO1083-3668http://dx.doi.org/10.1117/1.2400702Google Scholar
P. C. HansenM. Saxild-Hansen, “AIR tools—a MATLAB package of algebraic iterative reconstruction methods,” J. Comput. Appl. Math. 236, 2167–2178 (2012).JCAMDI0377-0427http://dx.doi.org/10.1016/j.cam.2011.09.039Google Scholar
H. Dehghaniet al., “Near infrared optical tomography using NIRFAST: algorithm for numerical model and image reconstruction,” Commun. Numer. Methods Eng. 25(6), 711–732 (2008).http://dx.doi.org/10.1002/cnm.1162Google Scholar
Vivian Pera received an AB in physics from Harvard University and an MS in electrical engineering from Tufts University. Before returning to school to pursue a doctoral degree, she worked at MIT Lincoln Laboratory developing adaptive signal processing algorithms for radar and sonar applications. She is currently a PhD candidate in the Dept. of Electrical and Computer Engineering at Northeastern University and a member of the Biomedical Optics Research Laboratory.
Dana H. Brooks is a professor of Electrical and Computer Engineering, Northeastern University, and cofounder of their Biomedical Signal Processing, Imaging, Reasoning, and Learning (B-SPIRAL) group and of the Center for Integrative Biomedical Computing at University of Utah. His research includes application of signal processing to medical and biological imaging.