Scalable Matting: A Sub-linear Approach

no code implementations • 15 Apr 2014 • Philip G. Lee, Ying Wu

However, matting by graph Laplacian is still very difficult to solve and gets much harder as the image size grows: current iterative methods slow down as $\mathcal{O}\left(n^2 \right)$ in the resolution $n$.

Image Matting