Processing images and video for an impressionist effect
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
An optimal algorithm for approximate nearest neighbor searching fixed dimensions
Journal of the ACM (JACM)
Video matting of complex scenes
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
ACM SIGGRAPH 2004 Papers
A Non-Local Algorithm for Image Denoising
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
ACM SIGGRAPH 2005 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
Natural video matting using camera arrays
ACM SIGGRAPH 2006 Papers
Soft scissors: an interactive tool for realtime high quality matting
ACM SIGGRAPH 2007 papers
A Closed-Form Solution to Natural Image Matting
IEEE Transactions on Pattern Analysis and Machine Intelligence
Image and video matting: a survey
Foundations and Trends® in Computer Graphics and Vision
Temporally coherent video matting
Graphical Models
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
CVPR '12 Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR)
Special Section on CAD/Graphics 2013: Confidence-driven image co-matting
Computers and Graphics
| Hi-index | 0.00 |
We present an algorithm for extracting high quality temporally coherent alpha mattes of objects from a video. Our approach extends the conventional image matting approach, i.e. closed-form matting, to video by using multi-frame nonlocal matting Laplacian. Our multi-frame nonlocal matting Laplacian is defined over a nonlocal neighborhood in spatial temporal domain, and it solves the alpha mattes of several video frames all together simultaneously. To speed up computation and to reduce memory requirement for solving the multi-frame nonlocal matting Laplacian, we use the approximate nearest neighbor(ANN) to find the nonlocal neighborhood and the k-d tree implementation to divide the nonlocal matting Laplacian into several smaller linear systems. Finally, we adopt the nonlocal mean regularization to enhance temporal coherence of the estimated alpha mattes and to correct alpha matte errors at low contrast regions. We demonstrate the effectiveness of our approach on various examples with qualitative comparisons to the results from previous matting algorithms.