A new minimumcostnetwork flow algorithm is described for the image reconstruction from their two orthogonal 1-d projections.
本文提中一种最小费用流算法,实现从两个正交的一维投影重建图象。
2
On this basis, in order to minimize the two objectives of the transport costs to model, to convert it into a network flow model with a stratified, with the minimumcost maximum flow algorithm.