Fast Approximate Energy Minimization via Graph Cuts
IEEE Transactions on Pattern Analysis and Machine Intelligence
Bayesian Estimation of Layers from Multiple Images
ECCV '02 Proceedings of the 7th European Conference on Computer Vision-Part III
"GrabCut": interactive foreground extraction using iterated graph cuts
ACM SIGGRAPH 2004 Papers
ACM SIGGRAPH 2004 Papers
An Iterative Optimization Approach for Unified Image Segmentation and Matting
ICCV '05 Proceedings of the Tenth IEEE International Conference on Computer Vision - Volume 2
An Iterative Bayesian Approach for Digital Matting
ICPR '06 Proceedings of the 18th International Conference on Pattern Recognition - Volume 02
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper, we formulate the image matting as one of solving energy minimization problems. Our approach has the following advantages. First, the matte estimation is modeled using an energy function as a MRF optimization problem. Second, the energy function combines the gradient of the matte, the gradient of the color and statistical sampling together to achieve global optimization. Third, the matte is directly reconstructed by solving energy equations. Experimental results show that our method is efficient to extract high quality mattes for foregrounds with complex natural images.