Sequence Of Image Processing Algorithms To Optimize The Dynamic Programming Chain

The application of Image Processing usually cannot be accomplished only in single step or single algorithm. In general it includes more than two steps and the algorithm in every step can be chosen from the possible algorithm set containing many algorithm. The combination of the possible algorithm in multistage algorithm sequence brings up amounts of possible algorithm paths, so it is very important problem to evaluate every possible algorithm path and find out the optimal path or the acceptable path. Aiming to the solution of the optimal problem of the multistage algorithm sequence, the dissertation proposes the Dynamic Programming Chain Method and gives the example of the application based on the image segmentation net. The main ideas in every chapter is following: The first chapter expounds the significance of the research firstly and then summarizes the literature about the research topic of the dissertation. After these, the research aims and contents are proposed. Finally, the main innovations of the dissertation are brought forward. The second chapter specifies four important differences between the algorithms net in Image Processing and general Dynamic Programming. After this, the Dynamic Programming Chain Method based on the synchronous mechanism of modeling and programming is put forward. At last the method and steps to get the optimal algorithm sequence is proposed. The third chapter specifies the concept of image space and then discusses the relationship between the image and the random process. Basing on them, the image random process is given. After the concept of image ordinal number is proposed, this chapter brings forward a series of the number character in the random process as the evaluation function in the programming. As a complement, the other evaluation functions are proposed at last. The forth chapter includes the application of the anterior chapters. At first the survey of image segmentation net is introduced. Then the algorithm choices of the three steps are specified. At last the choices and standardizations to evaluation function is discussed and the concrete expressions are given. The fifth chapter discusses the basic experiment environments and specifies the steps of the experiment at first. Then including to several image containing the noise,amouns of data and images are given. After analyZng them, evaluaion is put forwardto the Dynamic Programming Method.The sixth chaPter summarizes the main Anits and conclusions in the dissertationand prospects the future of the research.