This paper presents a new method for the matting problem of color image, which is based on the ideology of image matting proposed by Thomas Porter and Tom Duff and the algorithm of D-S evidence theory. Firstly, the given image must be marked as many approaches. The difference from other methods is that the boundary of foreground called uncertain region should only be signed as constraints in this paper. Then 10 features about the candidate pixel, which is one pixel of the uncertain region, are extracted from the corresponding color space as the inputs of D-S evidence theory and partitioned into two conflictive subsets. Moreover, the results of the two subsets computed by the combination rule of D-S evidence theory should be synthesized again to get S according to their confidence levels. Then the comparativeresult of s and (5 (0.5) is used to determine whether the candidate pixel belongs to foreground or not. If S > (5 , the candidate pixels considered as a foreground's pixel. On the contrary, it's a background's pixel. Finally, some images are downloaded from internet and matted by using this paper's method, and the results show that this method performs well.