Experimental results are shown on the application of the algorithm to geometric test images corrupted by Gaussian noise. A comparison of two MAP methods using the relaxation approach and the dynamic programming approach is presented.
Consideration was given to the "operator" version of the dynamic programming method in the problem of decomposing a nonempty set in the presence of inexact calculations of the Bellman function.
Certain hypotheses concerning optimal control are refined and the relationship between the Pontryagin maximum principle and Bellman's dynamic programming method in the context of these hypotheses is discussed.
This approach is based on the pinpointing of the lowest saddle points on the barrier between the unfolded state and native structure on the free-energy landscape of a protein chain; the proposed technique uses the dynamic programming method.
In the second case, a solution is found with the help of the dynamic programming method and a specially chosen adjustment algorithm for unknown parameters.
This paper presents a relaxation approach to MAP algorithm based on Gibbs distribution model for image segmentation and restoration.The algorithm presented is suitable for parallel implementation.Experimental results are shown on the application of the algorithm to geometric test images corrupted by Gaussian noise.A comparison of two MAP methods using the relaxation approach and the dynamic programming approach is presented.
The tomographic image of seismic wave velocity of the media betweenthe crossholes by iterative ray traveltime mothed was studied in this paper.The authorsused the fast curved ray tracing method to solve the initial value problem,and used two step ray tracing method combining with the interpolation mothed to solve the two pointsproblem;avoided the complex calculation and improved the efficient and precision.The in verse problem was solved by LSQR method.In order to get the accurate first-arrival timesthrough...