Purpose: – Improvements and portability of technologies and smart devices have enabled a rapid growth in the amount of user-generated media such as photographs and videos. Whilst various media generation and management systems exist, it still remains a challenge to discover the right information, for the right purpose. This paper aims to propose an approach to reverse geocoding by cross-referencing multiple geospatial data sources to enable the enrichment of media and therefore enable better organisation and searching of the media to create an overall picture about places. Design/methodology/approach: – The paper presents a system architecture that incorporates the proposed approach to aggregate several geospatial databases to enrich geo-tagged media with human readable information, which will further enable the goal of creating an overall picture about places. The approach enables the semantic information relating to point of interest. Findings: – Implementation of the proposed approach shows that a single geospatial data source does not contain enough information to accurately describe the high-level geospatial information for geocoded multimedia. However, fusing several geospatial data sources together enables richer, more accurate high-level geospatial information to be tagged to the geocoded multimedia. Originality/value: – The contribution in this paper shows that high-level geospatial information can be retrieved from many data sources and fused together to enrich geocoded multimedia which can facilitate better searching and retrieval of the multimedia.

Image registration is one of the most important image processing tools enabling recognition, classification, detection and other analysis tasks. Registration methods are used to solve a large variety of real-world problems, including remote sensing, computer vision, geophysics, medical image analysis, surveillance, and so on. In the last few years, nature-inspired algorithms and metaheuristics have been successfully used to address the image registration problem, becoming a solid alternative for direct optimization methods. The aim of this paper is to investigate and summarize a series of state-of-the-art works reporting evolutionary-based registration methods. The papers were selected using the PRISMA 2020 method. The reported algorithms are reviewed and compared in terms of evolutionary components, fitness function, image similarity measures and algorithm accuracy indexes used in the alignment process.

The work reported in this paper aims at the development of evolutionary algorithms to register images for signature recognition purposes. We propose and develop several registration methods in order to obtain accurate and fast algorithms. First, we introduce two variants of the firefly method that proved to have excellent accuracy and fair run times. In order to speed up the computation, we propose two variants of Accelerated Particle Swarm Optimization (APSO) method. The resulted algorithms are significantly faster than the firefly-based ones, but the recognition rates are a little bit lower. In order to find a trade-off between the recognition rate and the computational complexity of the algorithms, we developed a hybrid method that combines the ability of auto-adaptive Evolution Strategies (ES) search to discover a global optimum solution with the strong quick convergence ability of APSO. The accuracy and the efficiency of the resulted algorithms have been experimentally proved by conducting a long series of tests on various pairs of signature images. The comparative analysis concerning the quality of the proposed methods together with conclusions and suggestions for further developments are provided in the final part of the paper.

The main aim of the reported work is to solve the registration problem for recognition purposes. We introduce two new evolutionary algorithms (EA) consisting of population-based search methods, followed by or combined with a local search scheme. We used a variant of the Firefly algorithm to conduct the population-based search, while the local exploration was implemented by the Two-Membered Evolutionary Strategy (2M-ES). Both algorithms use fitness function based on mutual information (MI) to direct the exploration toward an appropriate candidate solution. A good similarity measure is the one that enables us to predict well, and with the symmetric MI we tie similarity between two objects A and B directly to how well A predicts B, and vice versa. Since the search landscape of normalized mutual information proved more amenable for evolutionary computation algorithms than simple MI, we use normalized mutual information (NMI) defined as symmetric uncertainty. The proposed algorithms are tested against the well-known Principal Axes Transformation technique (PAT), a standard evolutionary strategy and a version of the Firefly algorithm developed to align images. The accuracy and the efficiency of the proposed algorithms are experimentally confirmed by our tests, both methods being excellently fitted to registering images.