Bioluminescence tomography(BLT) is an instrumental molecular imaging modality designed for the 3D location and quantification of bioluminescent sources distribution in vivo. In our context, the diffusion approximation(DA) to radiative transfer equation(RTE) is utilized to model the forward process of light propagation. Mathematically, the solution uniqueness does not hold for DA-based BLT which is an inverse source problem of partial differential equations and hence is highly ill-posed. In the current work, we concentrate on a general regularization framework for BLT with Bregman distance as data fidelity and total variation(TV) as regularization. Two specializations of the Bregman distance, the least squares(LS) distance and Kullback-Leibler(KL) divergence, which correspond to the Gaussian and Poisson environments respectively, are demonstrated and the resulting regularization problems are denoted as LS+TV and KL+TV. Based on the constrained Landweber(CL) scheme
and expectation maximization(EM) algorithm for BLT, iterative algorithms for the LS+TV and KL+TV problems in the context of BLT are developed, which are denoted as CL-TV and EM-TV respectively. They are both essentially gradient-based algorithms alternatingly performing the standard CL or EM iteration step and the TV correction step which requires the solution of a weighted ROF model. Chambolle’s duality-based approach is adapted and extended to solving the weighted ROF subproblem. Numerical experiments for a 3D heterogeneous mouse phantom are carried out and preliminary results are reported to verify and evaluate the proposed algorithms. It is found that for piecewise-constant sources both CL-TV and EM-TV outperform the conventional CL and EM algorithms for BLT.
With the emergence of optical cross-connects (OXCs) and optical add/drop multiplexers (OADMs), all-optical networks
and a new layer named as optical layer are emerging. Although the number of available wavelength per fiber and the
bandwidth per wavelength are all becoming larger, the total bandwidth per fiber is limited. So for a network operator,
pre-allocating minimum spare capacity in an optical network under the advanced connection demands to meet to
survivability requirements is needed. In this paper, the above problem can be formulized as an ILP model, in which
different survivability requirements of connections are considered jointly. The solution to this problem has an advantage
over the result of the separate allocation problem, i.e., allocating resources for service connections and protection!
restoration connections are performed separately.