Abstract

The paper presents a new memetic, cluster-based methodology for image registration in case of geometric perturbation model involving translation, rotation and scaling. The methodology consists of two stages. First, using the sets of the object pixels belonging to the target image and to the sensed image respectively, the boundaries of the search space are computed. Next, the registration mechanism residing in a hybridization between a version of firefly population-based search procedure and the two membered evolutionary strategy computed on clustered data is applied. In addition, a procedure designed to deal with the premature convergence problem is embedded. The fitness to be maximized by the memetic algorithm is defined by the Dice coefficient, a function implemented to evaluate the similarity between pairs of binary images. The proposed methodology is applied on both binary and monochrome images. In case of monochrome images, a preprocessing step aiming the binarization of the inputs is considered before the registration. The quality of the proposed approach is measured in terms of accuracy and efficiency. The success rate based on Dice coefficient, normalized mutual information measures, and signal-to-noise ratio are used to establish the accuracy of the obtained algorithm, while the efficiency is evaluated by the run time function.

Highlights

  • Often inspiration comes from nature and this extends into the field of computer science

  • We evaluate the similarity between T and T using two metrics commonly used in image processing, signal-to-noise-ratio (SNR) and peak-signal-to-noise ratio (PSNR), and two entropic measures, Shannon normalized mutual information defined by (4) and Tsallis normalized mutual information given by (9)

  • To derive conclusions regarding the quality of the proposed approach a long series of test have been conducted on both binary and monochrome images

Read more

Summary

Introduction

Often inspiration comes from nature and this extends into the field of computer science. The GA approach is compared to the artificial bee colony (ABC) approach in [9], highlighting the advantages of each algorithm: while GA is faster, ABC gives better quality of image registration Another comparison between GA and swarm approach, using the correlation function of two images to estimate the quality of registration process, is reported in [12] with the conclusion that the PSO approach provides superior results. The proposed approach is applied to align either binary or monochrome images In both cases, the first step consists in computing the boundaries of the search space based on the object pixels of the processed images. A comparative analysis against two of the most commonly used methods to align images in case of rigid/affine perturbation, namely one plus one evolutionary optimizer [21] and principal axes transform (PAT) [22] experimentally proves the quality of the proposed methodology. The final part of the paper includes conclusions and suggestions for further developments regarding bio-inspired methods for image registration

Similarity Measures
The Proposed Methodology for Binary Image Alignment
The Search Space Boundaries
Metaheuristics for Image Registration
Cluster-Based Memetic Registration
Monochrome Image Registration
Monochrome Image Registration in Case of Scaling on Multiple Dimensions
Efficiency Measures
Experimental Results and Discussion
Binary Image Registration
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call