Optimization of Soft Morphological Filters with Parallel Annealing-Genetic Strategy

As an important issue in signal processing field, filter design is essentially a multiple-parameter optimization problem. Because the searching process of pure simulated annealing is rather long, and pure genetic is easy to be premature convergent, combining the probabilistic jumping search ability of simulated annealing with genetic fast converge to some local minimum of the search space, this paper proposes an effective and easy-to-be implemented parallel annealing-genetic strategy for soft morphological filters design. According to the empirical results as well as comparison with conventional genetic and simulated annealing algorithms, the effective and global optimization ability of the proposed strategy are verified.

[1]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[2]  Jaakko Astola,et al.  Soft morphological filters , 1991, Optics & Photonics.

[3]  Pauli Kuosmanen,et al.  Optimization of soft-morphological filters by genetic algorithms , 1994, Optics & Photonics.

[4]  G. Matheron Random Sets and Integral Geometry , 1976 .

[5]  Jaakko Astola,et al.  Shape preservation criteria and optimal soft morphological filtering , 1995, Journal of Mathematical Imaging and Vision.

[6]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[7]  Zhao Chunhui,et al.  Optimization of soft morphological filters by simulated annealing , 2000, WCC 2000 - ICSP 2000. 2000 5th International Conference on Signal Processing Proceedings. 16th World Computer Congress 2000.

[8]  Pauli Kuosmanen,et al.  Optimal soft-morphological filtering under shape preservation criteria , 1994, Optics & Photonics.

[9]  Jaakko Astola,et al.  Soft morphological filtering , 1995, Journal of Mathematical Imaging and Vision.