/
estimate_alpha_cf.py
78 lines (61 loc) · 2.51 KB
/
estimate_alpha_cf.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
from pymatting.util.util import sanity_check_image, trimap_split
from pymatting.laplacian.cf_laplacian import cf_laplacian
from pymatting.preconditioner.ichol import ichol
from pymatting.solver.cg import cg
import numpy as np
def estimate_alpha_cf(
image, trimap, preconditioner=None, laplacian_kwargs={}, cg_kwargs={}
):
"""
Estimate alpha from an input image and an input trimap using Closed-Form Alpha Matting as proposed by :cite:`levin2007closed`.
Parameters
----------
image: numpy.ndarray
Image with shape :math:`h \\times w \\times d` for which the alpha matte should be estimated
trimap: numpy.ndarray
Trimap with shape :math:`h \\times w` of the image
preconditioner: function or scipy.sparse.linalg.LinearOperator
Function or sparse matrix that applies the preconditioner to a vector (default: ichol)
laplacian_kwargs: dictionary
Arguments passed to the :code:`cf_laplacian` function
cg_kwargs: dictionary
Arguments passed to the :code:`cg` solver
is_known: numpy.ndarray
Binary mask of pixels for which to compute the laplacian matrix.
Providing this parameter might improve performance if few pixels are unknown.
Returns
-------
alpha: numpy.ndarray
Estimated alpha matte
Example
-------
>>> from pymatting import *
>>> image = load_image("data/lemur/lemur.png", "RGB")
>>> trimap = load_image("data/lemur/lemur_trimap.png", "GRAY")
>>> alpha = estimate_alpha_cf(
... image,
... trimap,
... laplacian_kwargs={"epsilon": 1e-6},
... cg_kwargs={"maxiter":2000})
"""
if preconditioner is None:
preconditioner = ichol
sanity_check_image(image)
h, w = trimap.shape[:2]
is_fg, is_bg, is_known, is_unknown = trimap_split(trimap)
L = cf_laplacian(image, **laplacian_kwargs, is_known=is_known)
# Split Laplacian matrix L into
#
# [L_U R ]
# [R^T L_K]
#
# and then solve L_U x_U = -R is_fg_K for x where K (is_known) corresponds to
# fixed pixels and U (is_unknown) corresponds to unknown pixels. For reference, see
# Grady, Leo, et al. "Random walks for interactive alpha-matting." Proceedings of VIIP. Vol. 2005. 2005.
L_U = L[is_unknown, :][:, is_unknown]
R = L[is_unknown, :][:, is_known]
m = is_fg[is_known]
x = trimap.copy().ravel()
x[is_unknown] = cg(L_U, -R.dot(m), M=preconditioner(L_U), **cg_kwargs)
alpha = np.clip(x, 0, 1).reshape(trimap.shape)
return alpha