Combining Max pooling-Laplacian theory and k-means clustering for novel camouflage pattern design

Abstract

Camouflage is the main means of anti-optical reconnaissance, and camouflage pattern design is an extremely important step in camouflage. Many scholars have proposed many methods for generating camouflage patterns. k-means algorithm can solve the problem of generating camouflage patterns quickly and accurately, but k-means algorithm is prone to inaccurate convergence results when dealing with large data images leading to poor camouflage effects of the generated camouflage patterns. In this paper, we improve the k-means clustering algorithm based on the maximum pooling theory and Laplace's algorithm, and design a new camouflage pattern generation method independently. First, applying the maximum pooling theory combined with discrete Laplace differential operator, the maximum pooling-Laplace algorithm is proposed to compress and enhance the target background to improve the accuracy and speed of camouflage pattern generation; combined with the k-means clustering principle, the background pixel primitives are processed to iteratively calculate the sample data to obtain the camouflage pattern mixed with the background. Using color similarity and shape similarity for evaluation, the results show that the combination of maximum pooling theory with Laplace algorithm and k-means algorithm can effectively solve the problem of inaccurate results of k-means algorithm in processing large data images. The new camouflage pattern generation method realizes the design of camouflage patterns for different backgrounds and achieves good results. In order to verify the practical application value of the design method, this paper produced test pieces based on the designed camouflage pattern generation method and tested the camouflage effect of camouflage pattern in sunny and cloudy days respectively, and the final test results were good.