Graph-Order Optimization Algorithm Based on Equal-in-Space Distance Model for High-Resolution Image Matting

Abstract

Image matting is an essential image processing technology. optimized-based image matting methods can significantly improve the alpha matte quality of high-resolution images. However, the local information of the foreground may be similar to the background, which causes the inversion problem of the alpha matte in the single-point optimized. In this paper, we propose an image matting mathematical model of the equal-in-space distance. The model transforms the high-resolution image matting problem into several small-scale combinatorial optimization problems according to the similarity among pixel features. Inspired by spanning tree, we propose a graph-order optimization strategy, which generates the optimization sequence of small-scale optimization problems according to the edge weight among graph nodes. In addition, we designed a graph-order optimization algorithm based on optimized information transfer to solve each node in the graph. Experimental results show that the proposed model solves the alpha matte inversion problem of single-point optimization matting. Besides, the proposed algorithm outperforms the state-of-the-art optimization algorithms for the high-resolution image matting problem.