Infrared pedestrian segmentation algorithm based on the two-dimensional Kaniadakis entropy thresholding

Abstract

Infrared pedestrian segmentation is a challenging problem in infrared image processing. Kaniadakis entropy thresholding method can segment the infrared image with long tail distribution histogram. However, it failed in images with noise and complex background. In this paper, a novel infrared pedestrian segmentation algorithm based on the two-dimensional Kaniadakis entropy thresholding is proposed to address this problem. First, in order to introduce the spatial information of pixels, the two-dimensional Kaniadakis entropy thresholding algorithm is proposed through extending the one-dimensional Kaniadakis entropy thresholding algorithm and using the two-dimensional histogram of image. The recursive formulas of the two-dimensional algorithm are also presented to improve the computation efficiency. Second, an intensity suppressed strategy is embedded in the optimal thresholds searching process of the two-dimensional Kaniadakis entropy thresholding algorithm to segment the pedestrian in infrared images with complex background. In the experiment, the proposed algorithm is compared with the state-of-the-art image segmentation methods on several infrared images with different backgrounds. The experimental results verify the effectiveness of the proposed method both qualitatively and quantitatively.