Blind Restoration of Radiological Images using Hybrid Swarm Optimized Model Implemented on FPGA

Blind Restoration of Radiological Images using Hybrid Swarm Optimized Model Implemented on FPGA

Slami Saadi1, Abderrezak Guessoum2, Maamar Bettayeb3, and Kamel Abdelhafidi4
1Department of Technology, University of Djelfa, Algeria
2Department of Electronics, University of Blida, Algeria
3Department of Electrical and Computer Engineering, University of Sharjah, UAE
4LMetallic and Semiconducting Materials, University of Biskra, Algeria

 
Abstract: Image restoration step is important in many image processing applications. In this work, we attempt to restore radiological images degraded during acquisition and processing. Details of the work, carried out to optimize a neural network (NN) for identifying an autoregressive moving average (ARMA) model used for nonlinearly degraded image restoration, are presented in this paper. The degraded image is expressed as an ARMA process. To improve the learning performance, the NN is fast trained using a hybrid swarm intelligence optimization approach based on the synergy of Particle Swarm (PSO) and Bacterial Foraging (BFO) Algorithms, which is compared with other training techniques such as: the back propagation, Quasi-Newton and Levenberg-Marquardt Algorithms. Both original image and blur function are identified through this model. The optimized ARMA-NN model is implemented on a Xilinx reconfigurable field-programmable gate array (FPGA) using hardware description language: VHDL. This VHDL code is tested on the rapid prototyping platform named ML505 based on a Virtex5-LXT FPGA chip of Xilinx. Simulation results using some test and real images are presented to support the applicability of this approach compared to the standard blind deconvolution method that maximizes the likelihood using an iterative process. The comparison is based on performance evaluation using some recent image quality metrics.


Keywords: Radiological image restoration, ARMA, NN, PSO, BFO, FPGA.
 
 
  Received January 25, 2012; accepted March 28, 2013
 

Full Text

Read 2718 times Last modified on Thursday, 03 October 2013 03:41
Share
Top
We use cookies to improve our website. By continuing to use this website, you are giving consent to cookies being used. More details…