Fast and robust reconstruction algorithm for fluorescence diffuse optical tomography assuming a cuboid target
Chunlong Sun, Yu Jiang, Jijun Liu, Manabu Machida, Gen Nakamura, and, Goro Nishimura

TL;DR
This paper introduces a rapid and reliable algorithm for fluorescence diffuse optical tomography that accurately locates cuboid-shaped targets, validated through numerical and in vivo experiments.
Contribution
The paper presents a novel fast and robust reconstruction algorithm specifically designed for fluorescence diffuse optical tomography assuming cuboid targets.
Findings
Algorithm successfully locates cuboid targets in simulations.
Validated with in vivo experimental results.
Demonstrates improved speed and robustness over existing methods.
Abstract
A fast and robust algorithm for fluorescence diffuse optical tomography is proposed. We identify the location of a fluorescence target by assuming a cuboid. The proposed numerical method is verified by a numerical experiment and an in vivo experiment.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Fast and robust reconstruction algorithm for fluorescence diffuse optical tomography assuming a cuboid target
Chunlong Sun
\authormark1,2 Yu Jiang
\authormark3 Jijun Liu
\authormark1 Manabu Machida
\authormark4,* Gen Nakamura
\authormark2 and Goro Nishimura\authormark5
\authormark1School of Mathematics, Southeast University, Nanjing 210096, P. R. China
\authormark2Department of Mathematics, Hokkaido University, Sapporo 060-0810, Japan
\authormark3School of Mathematics, Shanghai University of Finance and Economics, Shanghai 200433, P. R. China
\authormark4Institute for Medical Photonics Research, Hamamatsu University School of Medicine, Hamamatsu 431-3192, Japan
\authormark5Research Institute for Electronic Science, Hokkaido University, Sapporo 060-0810, Japan
Abstract
A fast and robust algorithm for fluorescence diffuse optical tomography is proposed. We identify the location of a fluorescence target by assuming a cuboid. The proposed numerical method is verified by a numerical experiment and an in vivo experiment.
††journal: boe††articletype: Research Article
1 Introduction
Fluorescence diffuse optical tomography (FDOT) is one type of optical tomography which makes use of fluorescence light from fluorophore. In FDOT, diffuse light from fluorophore such as Indocyanine Green (ICG) is detected on the boundary of biological tissue to obtain tomographic images [8, 9]. FDOT has been verified in vivo [4, 7] and also in clinical research for breast cancer [1].
To obtain reconstructed images with good quality, a large number of source-detector pairs is necessary. The number of source-detector pairs can be increased by time-dependent experiments [3]. The superiority of the time-resolved approach over the continuous-wave approach in FDOT was concluded [2] although the quality of images can be improved even for a time-independent experiment if a large data set is used [10].
Even if many sources and detectors are used, the resolution of tomographic images from optical tomography cannot be compared to that from X-ray CT. In this paper, we assume a cuboid or rectangular parallelepiped in the medium. Then we try to find the cuboid instead of giving up reconstructing the shape of the target. Thus we can develop a fast and robust numerical algorithm using a cuboid.
The paper is organized as follows. In Sec. 2, we develop the formulation of our FDOT and give an analytical formula for the emission light. The proposed numerical scheme is described in Sec. 3 with a numerical example of an ellipsoidal target. In Sec. 4, we validate our numerical method with a beef experiment. Finally, Sec. 5 is devoted to conclusion.
2 Formulation
Let us suppose that a fluorescence target is embedded in biological tissue occupying the half space (, , ). Let be the speed of light in the medium. Let , be the energy densities of the excitation light and emission light, respectively. Here, with is position and is time. We assume that the reduced scattering coefficient and the absorption coefficient are constants everywhere in the medium. In the medium (), and obey the following diffusion equations.
[TABLE]
where and
[TABLE]
Here, is proportional to the fluorophore concentration and is the fluorescence lifetime. We assumed that and at but the sample is illuminated at position by a pencil beam of the temporal profile () in the - plane. Thus, satisfy the Robin boundary conditions at as
[TABLE]
The parameter is given by with the Fresnel reflectance , which depends on the refractive index of the medium. Suppose the out-going light is detected at on the boundary. The excitation light and emission light are detected through a response function as
[TABLE]
where the function is determined by the detector. These correspond to experimentally measured light , .
Let be the Green’s function which satisfies , with the Robin boundary condition . The Green’s function is obtained as , where . We introduce
[TABLE]
This is called the instrument response function.
Let be a cuboid specified by as , , . We assume that
[TABLE]
where is a constant. Then we obtain
[TABLE]
where we introduced . Equation (7) can be rewritten as
[TABLE]
where
[TABLE]
with and . We can compute using (8).
3 Identification of a cuboid
To illustrate our proposed inversion scheme, we will reconstruct using solely . The reconstruction will be done with the Levenberg-Marquardt method [5, 6]. The choice of initial guesses is important.
Let be the number of source-detector pairs. The positions of each source and detector are denoted by (). At each detector, light is measured at temporal points.
We first look for a rough location of the target in the - plane or a region of interest on the boundary, under which the target is likely to be embedded, by observing (). We call this step of setting the topography process. Then we assume a cubic target whose location and size are determined by four parameters such that , , , , , . Choosing the initial guess for inside , we solve the inverse problem of determining by the Levenberg-Marquardt method and obtain . We refer to this step as the cubic tomography. Finally with the obtained values as the initial guess , we solve the inverse problem of determining a cuboid target. In this way, we can identify for by obtaining reconstructed values . This last step is called the cuboid tomography. The algorithm is summarized as follows.
Step 1.
(Topography process) Find on the boundary.
Step 2.
(Cubic tomography) By searching underneath , obtain reconstructed values .
Step 3.
(Cuboid tomography) Find starting with .
Below, we will demonstrate our algorithm with a numerical experiment. We set , . Let us assume an ellipsoidal target , where the unit of length is , with . In the numerical experiment, -noise is added and , where is drawn from the standard Gaussian distribution. We use the following source-detector pairs () on the boundary: , , , , , where , , , , , , , . We set and (), where . Here, , where has the peak at (). Thus we have () measured values (, ). Let be a vector which contains unknown parameters to be reconstructed. We define
[TABLE]
By using the Levenberg-Marquardt method, we try to find that minimizes .
(Step 1) We find , whereas . Hence we can set . At this moment, we have no knowledge about the depth at which the target is embedded. We suppose together with and .
(Step 2) We set the initial values of in . For example, we can start from . The reconstructed values are
[TABLE]
We note that choosing in is important for fast convergence. If we set , more than iterations are needed whereas about iterations are sufficient for suitable .
(Step 3) Now we give from as . Then assuming a cuboid, we obtain reconstructed values as
[TABLE]
The reconstructed cuboid is shown in Fig. 1 with the ellipsoidal target. The cuboid (blue) and ellipsoid (red) are shown in two-dimensional planes in Fig. 2. We emphasize that the narrowing process is essential. If is used for the initial guess for the cuboid tomography, the iteration of the Levenberg-Marquardt method does not converge except for some special cases.
4 Beef experiment
Let us reconstruct a tube which contains ICG in beef with our reconstruction scheme. Figure 3 shows how the tube was placed in the beef. The tube has the shape of a cylinder of length and diameter . We performed time-dependent measurements using a holder placed on the top of the beef. Four optical fibers (two are for sources and the other two are for detectors) are attached to the holder. The table on which the beef is placed changes positions while the holder is fixed.
Optical parameters for the beef are , . The refractive index is set to . Moreover, . After subtracting the background fluorescence, we could use source-detector pairs (): , , , , , , , , , , , , , , , , where the unit of coordinates is . We set and . The peak of comes at (). Measured times used for reconstruction are (), where .
First we set since measured values were large in this region such as , , , . Although the value of , i.e., for the cube and cuboid, is a parameter to be reconstructed, is determined only up to a constant which comes from the property of the detector. We set , , and obtain
[TABLE]
With the above values as the initial guess we perform the iterative method once again. The reconstructed values are obtained as
[TABLE]
The position of the cuboid is what we expected. For example, we see that the orientation of the cylinder should be almost parallel to the -axis. Thus the position of the fluorescence tube is identified with the proposed numerical scheme.
5 Conclusion
By giving up shape reconstruction, we can identify the location of the target by reconstructing only several unknown parameters. Even for these several parameters, the Levenberg-Marquardt algorithm is not stable unless good initial guesses are used. Thus the proposed procedure of narrowing target domains as is important for the iterative method to work.
Although we assumed the half space in this paper and made use of an analytical solution to the diffusion equation, the proposed algorithm works also in more general cases where diffusion equations must be solved numerically by finite difference method or finite element method [11]. The proposed algorithm can be applied not only to the Levenberg-Marquardt method but also to other iterative schemes such as the conjugate gradient method and the Gauss-Newton method.
In this paper, the algorithm was explained using a single target. The generalization of the method for multiple targets is straightforward at least if the number of targets is known.
Funding
NSFC (No.11421110002, No.11531005, No.91730304) (to J. J. Liu); Grant-in-Aid for Scientific Research (17K05572 and 17H02081) of the Japan Society for the Promotion of Science (JSPS) (to M. Machida); Grant-in-Aid for Scientific Research (15K21766 and 15H05740) of JSPS (to G. Nakamura). Also, the JSPS A3 foresight program: Modeling and Computation of Applied Inverse Problems.
Disclosures
The authors declare that there are no conflicts of interest related to this article.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Corlu, R. Choe, T. Durduran, M. A. Rosen, M. Schweiger, S. R. Arridge, M. D. Schnall, and A. G. Yodh, “Three-dimensional in vivo fluorescence diffuse optical tomography of breast cancer in humans,” \Journal Title Optics Express 15 , 6696–6716 (2007).
- 2[2] N. Ducros, C. D’Andrea, A. Bassi, and F. Peyrin, “Fluorescence diffuse optical tomography: Time-resolved versus continuous-wave in the reflectance configuration,” \Journal Title IRBM 32 , 243–250 (2011).
- 3[3] F. Gao, H. Zhao, L. Zhang, Y. Tanikawa, A. Marjono, and Y. Yamada, “A self-normalized, full time-resolved method for fluorescence diffuse optical tomography,” \Journal Title Optics Express 16 , 13104–13121 (2008).
- 4[4] A. Koenig, L. Hervé, V. Josserand, M. Berger, J. Boutet, A. Da Silva, J.-M. Dinten, P. Peltié, J.-L. Coll, P. Rizo, “In vivo mice lung tumor follow-up with fluorescence diffuse optical tomography,” \Journal Title J. Biomed. Opt. 13 , 011008 (2008).
- 5[5] K. Levenberg, “A Method for the solution of certain non-linear problems in least squares,” \Journal Title Quarterly Appl. Math. 2 , 164–168 (1944).
- 6[6] D. W. Marquardt, “An algorithm for least-squares estimation of nonlinear parameters,” \Journal Title J. Soc. Indust. Appl. Math. 11 , 431–441 (1963).
- 7[7] V. Ntziachristos, C. H. Tung, C. Bremer, and R. Weissleder, “Fluorescence molecular tomography resolves protease activity in vivo,” \Journal Title Nature Medicine 8 , 757–761 (2002).
- 8[8] V. Ntziachristos, C. Bremer, and R. Weissleder, “Fluorescence imaging with near-infrared light: new technological advances that enable in vivo molecular imaging,” \Journal Title Eur. Radiol. 13 , 195–208 (2003).
