Composing photomosaic images using clustering based evolutionary programming

TL;DR

This paper introduces a clustering-based evolutionary programming algorithm for creating photomosaic images, improving visual quality and convergence speed compared to existing methods.

Contribution

The paper presents a novel evolutionary algorithm tailored for photomosaic composition, incorporating clustering to enhance optimization efficiency and image quality.

Findings

Outperforms state-of-the-art algorithms in photomosaic quality

Converges faster due to prior knowledge integration

Effectively handles constraints on image reuse

Abstract

Photomosaic images are a type of images consisting of various tiny images. A complete form can be seen clearly by viewing it from a long distance. Small tiny images which replace blocks of the original image can be seen clearly by viewing it from a short distance. In the past, many algorithms have been proposed trying to automatically compose photomosaic images. Most of these algorithms are designed with greedy algorithms to match the blocks with the tiny images. To obtain a better visual sense and satisfy some commercial requirements, a constraint that a tiny image should not be repeatedly used many times is usually added. With the constraint, the photomosaic problem becomes a combinatorial optimization problem. Evolutionary algorithms imitating the process of natural selection are popular and powerful in combinatorial optimization problems. However, little work has been done on applying evolutionary algorithms to photomosaic problem. In this paper, we present an algorithm called clustering based evolutionary programming to deal with the problem. We give prior knowledge to the optimization algorithm which makes the optimization process converges faster. In our experiment, the proposed algorithm is compared with the state of the art algorithms and software. The results indicate that our algorithm performs the best.