def test_joint_pdf_gradients_sparse():
h = 1e-4
# Make sure dictionary entries are processed in the same order regardless
# of the platform. Otherwise any random numbers drawn within the loop
# would make the test non-deterministic even if we fix the seed before
# the loop.Right now, this test does not draw any samples, but we still
# sort the entries to prevent future related failures.
for ttype in sorted(factors):
dim = ttype[1]
if dim == 2:
nslices = 1
interp_method = interpolate_scalar_2d
else:
nslices = 45
interp_method = interpolate_scalar_3d
transform = regtransforms[ttype]
factor = factors[ttype]
theta = transform.get_identity_parameters()
static, moving, static_g2w, moving_g2w, smask, mmask, M = \
setup_random_transform(transform, factor, nslices, 5.0)
parzen_hist = ParzenJointHistogram(32)
parzen_hist.setup(static, moving, smask, mmask)
# Sample the fixed-image domain
k = 3
sigma = 0.25
seed = 1234
shape = np.array(static.shape, dtype=np.int32)
samples = sample_domain_regular(k, shape, static_g2w, sigma, seed)
samples = np.array(samples)
samples = np.hstack((samples, np.ones(samples.shape[0])[:, None]))
sp_to_static = np.linalg.inv(static_g2w)
samples_static_grid = (sp_to_static.dot(samples.T).T)[..., :dim]
intensities_static, inside = interp_method(static.astype(np.float32),
samples_static_grid)
# The routines in vector_fields operate, mostly, with float32 because
# they were thought to be used for non-linear registration. We may need
# to write some float64 counterparts for affine registration, where
# memory is not so big issue
intensities_static = np.array(intensities_static, dtype=np.float64)
# Compute the gradient at theta with the implementation under test
M = transform.param_to_matrix(theta)
sp_to_moving = np.linalg.inv(moving_g2w).dot(M)
samples_moving_grid = (sp_to_moving.dot(samples.T).T)[..., :dim]
intensities_moving, inside = interp_method(moving.astype(np.float32),
samples_moving_grid)
intensities_moving = np.array(intensities_moving, dtype=np.float64)
parzen_hist.update_pdfs_sparse(intensities_static, intensities_moving)
# Get the joint distribution evaluated at theta
J0 = np.copy(parzen_hist.joint)
spacing = np.ones(dim + 1, dtype=np.float64)
mgrad, inside = vf.sparse_gradient(moving.astype(np.float32),
sp_to_moving, spacing, samples)
parzen_hist.update_gradient_sparse(theta, transform,
intensities_static,
intensities_moving,
samples[..., :dim], mgrad)
# Get the gradient of the joint distribution w.r.t. the transform
# parameters
actual = np.copy(parzen_hist.joint_grad)
# Compute the gradient using finite-diferences
n = transform.get_number_of_parameters()
expected = np.empty_like(actual)
for i in range(n):
dtheta = theta.copy()
dtheta[i] += h
# Update the joint distribution with the transformed moving image
M = transform.param_to_matrix(dtheta)
sp_to_moving = np.linalg.inv(moving_g2w).dot(M)
samples_moving_grid = sp_to_moving.dot(samples.T).T
intensities_moving, inside = \
interp_method(moving.astype(np.float32), samples_moving_grid)
intensities_moving = np.array(intensities_moving, dtype=np.float64)
parzen_hist.update_pdfs_sparse(intensities_static,
intensities_moving)
J1 = np.copy(parzen_hist.joint)
expected[..., i] = (J1 - J0) / h
# Dot product and norms of gradients of each joint histogram cell
# i.e. the derivatives of each cell w.r.t. all parameters
P = (expected * actual).sum(2)
enorms = np.sqrt((expected**2).sum(2))
anorms = np.sqrt((actual**2).sum(2))
prodnorms = enorms * anorms
# Cosine of angle between the expected and actual gradients.
# Exclude very small gradients
P[prodnorms > 1e-6] /= (prodnorms[prodnorms > 1e-6])
P[prodnorms <= 1e-6] = 0
# Verify that a large proportion of the gradients point almost in
# the same direction. Disregard very small gradients
mean_cosine = P[P != 0].mean()
std_cosine = P[P != 0].std()
assert (mean_cosine > 0.99)
assert (std_cosine < 0.15)
def test_joint_pdf_gradients_sparse():
h = 1e-4
# Make sure dictionary entries are processed in the same order regardless of
# the platform. Otherwise any random numbers drawn within the loop would make
# the test non-deterministic even if we fix the seed before the loop.
# Right now, this test does not draw any samples, but we still sort the entries
# to prevent future related failures.
for ttype in sorted(factors):
dim = ttype[1]
if dim == 2:
nslices = 1
interp_method = vf.interpolate_scalar_2d
else:
nslices = 45
interp_method = vf.interpolate_scalar_3d
transform = regtransforms[ttype]
factor = factors[ttype]
theta = transform.get_identity_parameters()
static, moving, static_g2w, moving_g2w, smask, mmask, M = \
setup_random_transform(transform, factor, nslices, 5.0)
parzen_hist = ParzenJointHistogram(32)
parzen_hist.setup(static, moving, smask, mmask)
# Sample the fixed-image domain
k = 3
sigma = 0.25
seed = 1234
shape = np.array(static.shape, dtype=np.int32)
samples = sample_domain_regular(k, shape, static_g2w, sigma, seed)
samples = np.array(samples)
samples = np.hstack((samples, np.ones(samples.shape[0])[:, None]))
sp_to_static = np.linalg.inv(static_g2w)
samples_static_grid = (sp_to_static.dot(samples.T).T)[..., :dim]
intensities_static, inside = interp_method(static.astype(np.float32),
samples_static_grid)
# The routines in vector_fields operate, mostly, with float32 because
# they were thought to be used for non-linear registration. We may need
# to write some float64 counterparts for affine registration, where
# memory is not so big issue
intensities_static = np.array(intensities_static, dtype=np.float64)
# Compute the gradient at theta with the implementation under test
M = transform.param_to_matrix(theta)
sp_to_moving = np.linalg.inv(moving_g2w).dot(M)
samples_moving_grid = (sp_to_moving.dot(samples.T).T)[..., :dim]
intensities_moving, inside = interp_method(moving.astype(np.float32),
samples_moving_grid)
intensities_moving = np.array(intensities_moving, dtype=np.float64)
parzen_hist.update_pdfs_sparse(intensities_static, intensities_moving)
# Get the joint distribution evaluated at theta
J0 = np.copy(parzen_hist.joint)
spacing = np.ones(dim + 1, dtype=np.float64)
mgrad, inside = vf.sparse_gradient(moving.astype(np.float32),
sp_to_moving, spacing, samples)
parzen_hist.update_gradient_sparse(theta, transform, intensities_static,
intensities_moving, samples[..., :dim],
mgrad)
# Get the gradient of the joint distribution w.r.t. the transform
# parameters
actual = np.copy(parzen_hist.joint_grad)
# Compute the gradient using finite-diferences
n = transform.get_number_of_parameters()
expected = np.empty_like(actual)
for i in range(n):
dtheta = theta.copy()
dtheta[i] += h
# Update the joint distribution with the transformed moving image
M = transform.param_to_matrix(dtheta)
sp_to_moving = np.linalg.inv(moving_g2w).dot(M)
samples_moving_grid = sp_to_moving.dot(samples.T).T
intensities_moving, inside = \
interp_method(moving.astype(np.float32), samples_moving_grid)
intensities_moving = np.array(intensities_moving, dtype=np.float64)
parzen_hist.update_pdfs_sparse(intensities_static, intensities_moving)
J1 = np.copy(parzen_hist.joint)
expected[..., i] = (J1 - J0) / h
# Dot product and norms of gradients of each joint histogram cell
# i.e. the derivatives of each cell w.r.t. all parameters
P = (expected * actual).sum(2)
enorms = np.sqrt((expected ** 2).sum(2))
anorms = np.sqrt((actual ** 2).sum(2))
prodnorms = enorms*anorms
# Cosine of angle between the expected and actual gradients.
# Exclude very small gradients
P[prodnorms > 1e-6] /= (prodnorms[prodnorms > 1e-6])
P[prodnorms <= 1e-6] = 0
# Verify that a large proportion of the gradients point almost in
# the same direction. Disregard very small gradients
mean_cosine = P[P != 0].mean()
std_cosine = P[P != 0].std()
assert(mean_cosine > 0.99)
assert(std_cosine < 0.15)
def test_parzen_densities():
# Test the computation of the joint intensity distribution
# using a dense and a sparse set of values
seed = 1246592
nbins = 32
nr = 30
nc = 35
ns = 20
nvals = 50
for dim in [2, 3]:
if dim == 2:
shape = (nr, nc)
static, moving = create_random_image_pair(shape, nvals, seed)
else:
shape = (ns, nr, nc)
static, moving = create_random_image_pair(shape, nvals, seed)
# Initialize
parzen_hist = ParzenJointHistogram(nbins)
parzen_hist.setup(static, moving)
# Get distributions computed by dense sampling
parzen_hist.update_pdfs_dense(static, moving)
actual_joint_dense = parzen_hist.joint
actual_mmarginal_dense = parzen_hist.mmarginal
actual_smarginal_dense = parzen_hist.smarginal
# Get distributions computed by sparse sampling
sval = static.reshape(-1)
mval = moving.reshape(-1)
parzen_hist.update_pdfs_sparse(sval, mval)
actual_joint_sparse = parzen_hist.joint
actual_mmarginal_sparse = parzen_hist.mmarginal
actual_smarginal_sparse = parzen_hist.smarginal
# Compute the expected joint distribution with dense sampling
expected_joint_dense = np.zeros(shape=(nbins, nbins))
for index in ndindex(shape):
sv = parzen_hist.bin_normalize_static(static[index])
mv = parzen_hist.bin_normalize_moving(moving[index])
sbin = parzen_hist.bin_index(sv)
# The spline is centered at mv, will evaluate for all row
spline_arg = np.array([i - mv for i in range(nbins)])
contribution = cubic_spline(spline_arg)
expected_joint_dense[sbin, :] += contribution
# Compute the expected joint distribution with sparse sampling
expected_joint_sparse = np.zeros(shape=(nbins, nbins))
for index in range(sval.shape[0]):
sv = parzen_hist.bin_normalize_static(sval[index])
mv = parzen_hist.bin_normalize_moving(mval[index])
sbin = parzen_hist.bin_index(sv)
# The spline is centered at mv, will evaluate for all row
spline_arg = np.array([i - mv for i in range(nbins)])
contribution = cubic_spline(spline_arg)
expected_joint_sparse[sbin, :] += contribution
# Verify joint distributions
expected_joint_dense /= expected_joint_dense.sum()
expected_joint_sparse /= expected_joint_sparse.sum()
assert_array_almost_equal(actual_joint_dense, expected_joint_dense)
assert_array_almost_equal(actual_joint_sparse, expected_joint_sparse)
# Verify moving marginals
expected_mmarginal_dense = expected_joint_dense.sum(0)
expected_mmarginal_dense /= expected_mmarginal_dense.sum()
expected_mmarginal_sparse = expected_joint_sparse.sum(0)
expected_mmarginal_sparse /= expected_mmarginal_sparse.sum()
assert_array_almost_equal(actual_mmarginal_dense,
expected_mmarginal_dense)
assert_array_almost_equal(actual_mmarginal_sparse,
expected_mmarginal_sparse)
# Verify static marginals
expected_smarginal_dense = expected_joint_dense.sum(1)
expected_smarginal_dense /= expected_smarginal_dense.sum()
expected_smarginal_sparse = expected_joint_sparse.sum(1)
expected_smarginal_sparse /= expected_smarginal_sparse.sum()
assert_array_almost_equal(actual_smarginal_dense,
expected_smarginal_dense)
assert_array_almost_equal(actual_smarginal_sparse,
expected_smarginal_sparse)
def test_parzen_densities():
# Test the computation of the joint intensity distribution
# using a dense and a sparse set of values
seed = 1246592
nbins = 32
nr = 30
nc = 35
ns = 20
nvals = 50
for dim in [2, 3]:
if dim == 2:
shape = (nr, nc)
static, moving = create_random_image_pair(shape, nvals, seed)
else:
shape = (ns, nr, nc)
static, moving = create_random_image_pair(shape, nvals, seed)
# Initialize
parzen_hist = ParzenJointHistogram(nbins)
parzen_hist.setup(static, moving)
# Get distributions computed by dense sampling
parzen_hist.update_pdfs_dense(static, moving)
actual_joint_dense = parzen_hist.joint
actual_mmarginal_dense = parzen_hist.mmarginal
actual_smarginal_dense = parzen_hist.smarginal
# Get distributions computed by sparse sampling
sval = static.reshape(-1)
mval = moving.reshape(-1)
parzen_hist.update_pdfs_sparse(sval, mval)
actual_joint_sparse = parzen_hist.joint
actual_mmarginal_sparse = parzen_hist.mmarginal
actual_smarginal_sparse = parzen_hist.smarginal
# Compute the expected joint distribution with dense sampling
expected_joint_dense = np.zeros(shape=(nbins, nbins))
for index in ndindex(shape):
sv = parzen_hist.bin_normalize_static(static[index])
mv = parzen_hist.bin_normalize_moving(moving[index])
sbin = parzen_hist.bin_index(sv)
# The spline is centered at mv, will evaluate for all row
spline_arg = np.array([i - mv for i in range(nbins)])
contribution = cubic_spline(spline_arg)
expected_joint_dense[sbin, :] += contribution
# Compute the expected joint distribution with sparse sampling
expected_joint_sparse = np.zeros(shape=(nbins, nbins))
for index in range(sval.shape[0]):
sv = parzen_hist.bin_normalize_static(sval[index])
mv = parzen_hist.bin_normalize_moving(mval[index])
sbin = parzen_hist.bin_index(sv)
# The spline is centered at mv, will evaluate for all row
spline_arg = np.array([i - mv for i in range(nbins)])
contribution = cubic_spline(spline_arg)
expected_joint_sparse[sbin, :] += contribution
# Verify joint distributions
expected_joint_dense /= expected_joint_dense.sum()
expected_joint_sparse /= expected_joint_sparse.sum()
assert_array_almost_equal(actual_joint_dense, expected_joint_dense)
assert_array_almost_equal(actual_joint_sparse, expected_joint_sparse)
# Verify moving marginals
expected_mmarginal_dense = expected_joint_dense.sum(0)
expected_mmarginal_dense /= expected_mmarginal_dense.sum()
expected_mmarginal_sparse = expected_joint_sparse.sum(0)
expected_mmarginal_sparse /= expected_mmarginal_sparse.sum()
assert_array_almost_equal(actual_mmarginal_dense,
expected_mmarginal_dense)
assert_array_almost_equal(actual_mmarginal_sparse,
expected_mmarginal_sparse)
# Verify static marginals
expected_smarginal_dense = expected_joint_dense.sum(1)
expected_smarginal_dense /= expected_smarginal_dense.sum()
expected_smarginal_sparse = expected_joint_sparse.sum(1)
expected_smarginal_sparse /= expected_smarginal_sparse.sum()
assert_array_almost_equal(actual_smarginal_dense,
expected_smarginal_dense)
assert_array_almost_equal(actual_smarginal_sparse,
expected_smarginal_sparse)
