lib/raster/interp.c

/*!
  \file lib/raster/interp.c

  \brief Raster Library - Interpolation methods

  (C) 2001-2009,2013 GRASS Development Team

  This program is free software under the GNU General Public License
  (>=v2). Read the file COPYING that comes with GRASS for details.

  \author Original author CERL
*/

#include <math.h>
#include <string.h>

#include <grass/gis.h>
#include <grass/raster.h>
#include <grass/glocale.h>

DCELL Rast_interp_linear(double u, DCELL c0, DCELL c1)
{
    return u * (c1 - c0) + c0;
}

DCELL Rast_interp_bilinear(double u, double v,
			   DCELL c00, DCELL c01, DCELL c10, DCELL c11)
{
    DCELL c0 = Rast_interp_linear(u, c00, c01);
    DCELL c1 = Rast_interp_linear(u, c10, c11);

    return Rast_interp_linear(v, c0, c1);
}

DCELL Rast_interp_cubic(double u, DCELL c0, DCELL c1, DCELL c2, DCELL c3)
{
    return (u * (u * (u * (c3 - 3 * c2 + 3 * c1 - c0) +
		      (-c3 + 4 * c2 - 5 * c1 + 2 * c0)) + (c2 - c0)) +
	    2 * c1) / 2;
}

DCELL Rast_interp_bicubic(double u, double v,
			  DCELL c00, DCELL c01, DCELL c02, DCELL c03,
			  DCELL c10, DCELL c11, DCELL c12, DCELL c13,
			  DCELL c20, DCELL c21, DCELL c22, DCELL c23,
			  DCELL c30, DCELL c31, DCELL c32, DCELL c33)
{
    DCELL c0 = Rast_interp_cubic(u, c00, c01, c02, c03);
    DCELL c1 = Rast_interp_cubic(u, c10, c11, c12, c13);
    DCELL c2 = Rast_interp_cubic(u, c20, c21, c22, c23);
    DCELL c3 = Rast_interp_cubic(u, c30, c31, c32, c33);

    return Rast_interp_cubic(v, c0, c1, c2, c3);
}

DCELL Rast_interp_lanczos(double u, double v, DCELL *c)
{
    double uweight[5], vweight[5], d, d_pi;
    double usum, vsum;
    DCELL c0, c1, c2, c3, c4;
    double sind, sincd1, sincd2;

    d_pi = u * M_PI;
    sind = 2 * sin(d_pi);
    sincd1 = sind * sin(d_pi / 2);
    uweight[2] = (u == 0 ? 1 : sincd1 / (d_pi * d_pi));
    usum = uweight[2];

    d = u + 2;
    d_pi = d * M_PI;
    if (d > 2)
	uweight[0] = 0.;
    else
	uweight[0] = (d == 0 ? 1 : -sincd1 / (d_pi * d_pi));
    usum += uweight[0];

    d = u + 1.;
    d_pi = d * M_PI;
    sincd2 = sind * sin(d_pi / 2);
    uweight[1] = (d == 0 ? 1 : -sincd2 / (d_pi * d_pi));
    usum += uweight[1];

    d = u - 1.;
    d_pi = d * M_PI;
    uweight[3] = (d == 0 ? 1 : sincd2 / (d_pi * d_pi));
    usum += uweight[3];

    d = u - 2.;
    d_pi = d * M_PI;
    if (d < -2)
	uweight[4] = 0.;
    else
	uweight[4] = (d == 0 ? 1 : -sincd1 / (d_pi * d_pi));
    usum += uweight[4];


    d_pi = v * M_PI;
    sind = 2 * sin(d_pi);
    sincd1 = sind * sin(d_pi / 2);
    vweight[2] = (v == 0 ? 1 : sincd1 / (d_pi * d_pi));
    vsum = vweight[2];

    d = v + 2;
    d_pi = d * M_PI;
    if (d > 2)
	vweight[0] = 0;
    else
	vweight[0] = (d == 0 ? 1 : -sincd1 / (d_pi * d_pi));
    vsum += vweight[0];

    d = v + 1.;
    d_pi = d * M_PI;
    sincd2 = sind * sin(d_pi / 2);
    vweight[1] = (d == 0 ? 1 : -sincd2 / (d_pi * d_pi));
    vsum += vweight[1];

    d = v - 1.;
    d_pi = d * M_PI;
    vweight[3] = (d == 0 ? 1 : sincd2 / (d_pi * d_pi));
    vsum += vweight[3];

    d = v - 2.;
    d_pi = d * M_PI;
    if (d < -2)
	vweight[4] = 0;
    else
	vweight[4] = (d == 0 ? 1 : -sincd1 / (d_pi * d_pi));
    vsum += vweight[4];

    c0 = (c[0] * uweight[0] + c[1] * uweight[1] + c[2] * uweight[2]
	    + c[3] * uweight[3] + c[4] * uweight[4]);
    c1 = (c[5] * uweight[0] + c[6] * uweight[1] + c[7] * uweight[2]
	    + c[8] * uweight[3] + c[9] * uweight[4]);
    c2 = (c[10] * uweight[0] + c[11] * uweight[1] + c[12] * uweight[2]
	    + c[13] * uweight[3] + c[14] * uweight[4]);
    c3 = (c[15] * uweight[0] + c[16] * uweight[1] + c[17] * uweight[2]
	    + c[18] * uweight[3] + c[19] * uweight[4]);
    c4 = (c[20] * uweight[0] + c[21] * uweight[1] + c[22] * uweight[2]
	    + c[23] * uweight[3] + c[24] * uweight[4]);

    return ((c0 * vweight[0] + c1 * vweight[1] + c2 * vweight[2] +
	     c3 * vweight[3] + c4 * vweight[4]) / (usum * vsum));
}

DCELL Rast_interp_cubic_bspline(double u, DCELL c0, DCELL c1, DCELL c2, DCELL c3)
{
    return (u * (u * (u * (c3 - 3 * c2 + 3 * c1 - c0) +
			  (3 * c2 - 6 * c1 + 3 * c0)) +
			  (3 * c2 - 3 * c0)) +
			   c2 + 4 * c1 + c0) / 6;
}

DCELL Rast_interp_bicubic_bspline(double u, double v,
			  DCELL c00, DCELL c01, DCELL c02, DCELL c03,
			  DCELL c10, DCELL c11, DCELL c12, DCELL c13,
			  DCELL c20, DCELL c21, DCELL c22, DCELL c23,
			  DCELL c30, DCELL c31, DCELL c32, DCELL c33)
{
    DCELL c0 = Rast_interp_cubic_bspline(u, c00, c01, c02, c03);
    DCELL c1 = Rast_interp_cubic_bspline(u, c10, c11, c12, c13);
    DCELL c2 = Rast_interp_cubic_bspline(u, c20, c21, c22, c23);
    DCELL c3 = Rast_interp_cubic_bspline(u, c30, c31, c32, c33);

    return Rast_interp_cubic_bspline(v, c0, c1, c2, c3);
}

/*!
  \brief Get interpolation method from the option.

  Calls G_fatal_error() on unknown interpolation method.

  Supported methods:
   - NEAREST
   - BILINEAR
   - CUBIC

  \code
  int interp_method
  struct Option *opt_method;

  opt_method = G_define_standard_option(G_OPT_R_INTERP_TYPE);

  if (G_parser(argc, argv))
      exit(EXIT_FAILURE);

  interp_method = G_option_to_interp_type(opt_method);
  \endcode

  \param option pointer to interpolation option

  \return interpolation method code
*/
int Rast_option_to_interp_type(const struct Option *option)
{
    int interp_type;

    interp_type = INTERP_UNKNOWN;
    if (option->answer) {
        if (strcmp(option->answer, "nearest") == 0) {
            interp_type = INTERP_NEAREST;
        }
        else if (strcmp(option->answer, "bilinear") == 0) {
            interp_type = INTERP_BILINEAR;
        }
        else if (strcmp(option->answer, "bicubic") == 0) {
            interp_type = INTERP_BICUBIC;
        }
    }

    if (interp_type == INTERP_UNKNOWN)
        G_fatal_error(_("Unknown interpolation method: %s"), option->answer);

    return interp_type;
}