Abstract

Although soft morphological filters give excellent performance in restoring corrupted images, they are hard to design. One successful approach is to use iterative search methods such as genetic algorithms. However, they can be computationally exhaustive taking weeks to converge. Parallel genetic algorithms give massive reductions in processing time, but their performance when implemented on multiprocessor systems or cluster of workstations has a heavy dependence on the number of servers. Also, they require some sort of synchronisation between the working processors. Because of their parallel capabilities, field programmable gate arrays (FPGAs) provide a cheap and efficient way to implement parallel algorithms. In this paper, a realisation of the genetic algorithm on an FPGA is introduced. The genetic algorithm is given the task of optimising a grey-scale soft morphological filter. The soft morphological filter is implemented using a parallel quick sorting algorithm. The results of synthesizing and simulating the design on SPARTAN II FPGA resulted in a good utilisation of the device resources. Also, the optimisation process was performed in a very short time. In contrast with the standard parallel genetic algorithms, the design does not require any synchronisation or management schemes.