Created
April 9, 2021 04:51
-
-
Save zpincus/be1e2293ec0d679b0f6d3e600ac8fccc to your computer and use it in GitHub Desktop.
thin-plate warping code for skimage
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Copyright (C) 2019, the scikit-image team | |
All rights reserved. | |
Redistribution and use in source and binary forms, with or without | |
modification, are permitted provided that the following conditions are | |
met: | |
1. Redistributions of source code must retain the above copyright | |
notice, this list of conditions and the following disclaimer. | |
2. Redistributions in binary form must reproduce the above copyright | |
notice, this list of conditions and the following disclaimer in | |
the documentation and/or other materials provided with the | |
distribution. | |
3. Neither the name of skimage nor the names of its contributors may be | |
used to endorse or promote products derived from this software without | |
specific prior written permission. | |
THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR | |
IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED | |
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE | |
DISCLAIMED. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, | |
INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES | |
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR | |
SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, | |
STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING | |
IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE | |
POSSIBILITY OF SUCH DAMAGE. | |
from scipy import ndimage | |
import numpy | |
def warp_images(from_points, to_points, images, output_region, interpolation_order = 1, approximate_grid=2): | |
"""Define a thin-plate-spline warping transform that warps from the from_points | |
to the to_points, and then warp the given images by that transform. This | |
transform is described in the paper: "Principal Warps: Thin-Plate Splines and | |
the Decomposition of Deformations" by F.L. Bookstein. | |
Parameters: | |
- from_points and to_points: Nx2 arrays containing N 2D landmark points. | |
- images: list of images to warp with the given warp transform. | |
- output_region: the (xmin, ymin, xmax, ymax) region of the output | |
image that should be produced. (Note: The region is inclusive, i.e. | |
xmin <= x <= xmax) | |
- interpolation_order: if 1, then use linear interpolation; if 0 then use | |
nearest-neighbor. | |
- approximate_grid: defining the warping transform is slow. If approximate_grid | |
is greater than 1, then the transform is defined on a grid 'approximate_grid' | |
times smaller than the output image region, and then the transform is | |
bilinearly interpolated to the larger region. This is fairly accurate | |
for values up to 10 or so. | |
""" | |
transform = _make_inverse_warp(from_points, to_points, output_region, approximate_grid) | |
return [ndimage.map_coordinates(numpy.asarray(image), transform, order=interpolation_order) for image in images] | |
def _make_inverse_warp(from_points, to_points, output_region, approximate_grid): | |
x_min, y_min, x_max, y_max = output_region | |
if approximate_grid is None: approximate_grid = 1 | |
x_steps = (x_max - x_min) // approximate_grid | |
y_steps = (y_max - y_min) // approximate_grid | |
x, y = numpy.mgrid[x_min:x_max:x_steps*1j, y_min:y_max:y_steps*1j] | |
# make the reverse transform warping from the to_points to the from_points, because we | |
# do image interpolation in this reverse fashion | |
transform = _make_warp(to_points, from_points, x, y) | |
if approximate_grid != 1: | |
# linearly interpolate the zoomed transform grid | |
new_x, new_y = numpy.mgrid[x_min:x_max+1, y_min:y_max+1] | |
x_fracs, x_indices = numpy.modf((x_steps-1)*(new_x-x_min)/float(x_max-x_min)) | |
y_fracs, y_indices = numpy.modf((y_steps-1)*(new_y-y_min)/float(y_max-y_min)) | |
x_indices = x_indices.astype(int) | |
y_indices = y_indices.astype(int) | |
x1 = 1 - x_fracs | |
y1 = 1 - y_fracs | |
ix1 = (x_indices+1).clip(0, x_steps-1) | |
iy1 = (y_indices+1).clip(0, y_steps-1) | |
t00 = transform[0][(x_indices, y_indices)] | |
t01 = transform[0][(x_indices, iy1)] | |
t10 = transform[0][(ix1, y_indices)] | |
t11 = transform[0][(ix1, iy1)] | |
transform_x = t00*x1*y1 + t01*x1*y_fracs + t10*x_fracs*y1 + t11*x_fracs*y_fracs | |
t00 = transform[1][(x_indices, y_indices)] | |
t01 = transform[1][(x_indices, iy1)] | |
t10 = transform[1][(ix1, y_indices)] | |
t11 = transform[1][(ix1, iy1)] | |
transform_y = t00*x1*y1 + t01*x1*y_fracs + t10*x_fracs*y1 + t11*x_fracs*y_fracs | |
transform = [transform_x, transform_y] | |
return transform | |
_small = 1e-100 | |
def _U(x): | |
return (x**2) * numpy.where(x<_small, 0, numpy.log(x)) | |
def _interpoint_distances(points): | |
xd = numpy.subtract.outer(points[:,0], points[:,0]) | |
yd = numpy.subtract.outer(points[:,1], points[:,1]) | |
return numpy.sqrt(xd**2 + yd**2) | |
def _make_L_matrix(points): | |
n = len(points) | |
K = _U(_interpoint_distances(points)) | |
P = numpy.ones((n, 3)) | |
P[:,1:] = points | |
O = numpy.zeros((3, 3)) | |
L = numpy.asarray(numpy.bmat([[K, P],[P.transpose(), O]])) | |
return L | |
def _calculate_f(coeffs, points, x, y): | |
w = coeffs[:-3] | |
a1, ax, ay = coeffs[-3:] | |
# The following uses too much RAM: | |
# distances = _U(numpy.sqrt((points[:,0]-x[...,numpy.newaxis])**2 + (points[:,1]-y[...,numpy.newaxis])**2)) | |
# summation = (w * distances).sum(axis=-1) | |
summation = numpy.zeros(x.shape) | |
for wi, Pi in zip(w, points): | |
summation += wi * _U(numpy.sqrt((x-Pi[0])**2 + (y-Pi[1])**2)) | |
return a1 + ax*x + ay*y + summation | |
def _make_warp(from_points, to_points, x_vals, y_vals): | |
from_points, to_points = numpy.asarray(from_points), numpy.asarray(to_points) | |
err = numpy.seterr(divide='ignore') | |
L = _make_L_matrix(from_points) | |
V = numpy.resize(to_points, (len(to_points)+3, 2)) | |
V[-3:, :] = 0 | |
coeffs = numpy.dot(numpy.linalg.pinv(L), V) | |
x_warp = _calculate_f(coeffs[:,0], from_points, x_vals, y_vals) | |
y_warp = _calculate_f(coeffs[:,1], from_points, x_vals, y_vals) | |
numpy.seterr(**err) | |
return [x_warp, y_warp] |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment