Pillow/libImaging/Resample.c

627 lines
21 KiB
C
Raw Normal View History

2010-07-31 06:52:47 +04:00
#include "Imaging.h"
#include <math.h>
2016-05-09 14:37:50 +03:00
#define ROUND_UP(f) ((int) ((f) >= 0.0 ? (f) + 0.5F : (f) - 0.5F))
2010-07-31 06:52:47 +04:00
struct filter {
double (*filter)(double x);
double support;
2010-07-31 06:52:47 +04:00
};
static inline double box_filter(double x)
{
if (x >= -0.5 && x < 0.5)
return 1.0;
return 0.0;
}
static inline double bilinear_filter(double x)
2010-07-31 06:52:47 +04:00
{
if (x < 0.0)
x = -x;
if (x < 1.0)
return 1.0-x;
return 0.0;
}
static inline double hamming_filter(double x)
{
if (x < 0.0)
x = -x;
if (x == 0.0)
return 1.0;
x = x * M_PI;
return sin(x) / x * (0.54f + 0.46f * cos(x));
}
static inline double bicubic_filter(double x)
2010-07-31 06:52:47 +04:00
{
2016-02-10 11:37:16 +03:00
/* https://en.wikipedia.org/wiki/Bicubic_interpolation#Bicubic_convolution_algorithm */
2014-10-25 12:39:03 +04:00
#define a -0.5
2010-07-31 06:52:47 +04:00
if (x < 0.0)
x = -x;
if (x < 1.0)
2014-10-24 12:46:51 +04:00
return ((a + 2.0) * x - (a + 3.0)) * x*x + 1;
2010-07-31 06:52:47 +04:00
if (x < 2.0)
2014-10-24 12:46:51 +04:00
return (((x - 5) * x + 8) * x - 4) * a;
2010-07-31 06:52:47 +04:00
return 0.0;
#undef a
}
static inline double sinc_filter(double x)
{
if (x == 0.0)
return 1.0;
x = x * M_PI;
return sin(x) / x;
}
static inline double lanczos_filter(double x)
{
/* truncated sinc */
if (-3.0 <= x && x < 3.0)
return sinc_filter(x) * sinc_filter(x/3);
return 0.0;
}
2016-06-16 21:57:02 +03:00
static struct filter BOX = { box_filter, 0.5 };
2016-05-03 13:23:16 +03:00
static struct filter BILINEAR = { bilinear_filter, 1.0 };
static struct filter HAMMING = { hamming_filter, 1.0 };
2010-07-31 06:52:47 +04:00
static struct filter BICUBIC = { bicubic_filter, 2.0 };
static struct filter LANCZOS = { lanczos_filter, 3.0 };
2010-07-31 06:52:47 +04:00
2014-10-25 06:04:04 +04:00
2016-05-03 13:23:16 +03:00
/* 8 bits for result. Filter can have negative areas.
In one cases the sum of the coefficients will be negative,
in the other it will be more than 1.0. That is why we need
two extra bits for overflow and int type. */
#define PRECISION_BITS (32 - 8 - 2)
UINT8 _lookups[512] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
2016-09-03 05:19:04 +03:00
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 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, 79,
80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95,
96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111,
112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127,
128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143,
144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159,
160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175,
176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191,
192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207,
208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223,
224, 225, 226, 227, 228, 229, 230, 231, 232, 233, 234, 235, 236, 237, 238, 239,
240, 241, 242, 243, 244, 245, 246, 247, 248, 249, 250, 251, 252, 253, 254, 255,
2016-09-03 05:19:04 +03:00
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255,
255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255
};
UINT8 *lookups = &_lookups[128];
2016-05-03 13:23:16 +03:00
static inline UINT8 clip8(int in)
2014-10-25 06:04:04 +04:00
{
return lookups[in >> PRECISION_BITS];
}
2016-05-05 13:15:54 +03:00
int
2016-11-26 01:38:55 +03:00
precompute_coeffs(int inSize, float in0, float in1, int outSize,
2016-12-01 13:46:12 +03:00
struct filter *filterp, int **boundsp, double **kkp) {
2016-05-05 13:15:54 +03:00
double support, scale, filterscale;
double center, ww, ss;
2016-12-01 13:46:12 +03:00
int xx, x, ksize, xmin, xmax;
int *bounds;
2016-05-05 13:15:54 +03:00
double *kk, *k;
/* prepare for horizontal stretch */
2016-11-24 06:11:36 +03:00
filterscale = scale = (double) (in1 - in0) / outSize;
2016-05-05 13:15:54 +03:00
if (filterscale < 1.0) {
filterscale = 1.0;
}
/* determine support size (length of resampling filter) */
support = filterp->support * filterscale;
2016-06-03 12:51:58 +03:00
/* maximum number of coeffs */
2016-12-01 13:46:12 +03:00
ksize = (int) ceil(support) * 2 + 1;
2016-05-05 13:15:54 +03:00
// check for overflow
2016-12-01 13:46:12 +03:00
if (outSize > INT_MAX / (ksize * sizeof(double))) {
2016-12-01 04:10:58 +03:00
ImagingError_MemoryError();
return 0;
2016-12-01 04:10:58 +03:00
}
2016-05-05 13:15:54 +03:00
/* coefficient buffer */
2016-05-30 13:28:32 +03:00
/* malloc check ok, overflow checked above */
2016-12-01 13:46:12 +03:00
kk = malloc(outSize * ksize * sizeof(double));
2016-12-01 04:10:58 +03:00
if ( ! kk) {
ImagingError_MemoryError();
return 0;
2016-12-01 04:10:58 +03:00
}
2016-05-05 13:15:54 +03:00
2016-12-01 13:46:12 +03:00
/* malloc check ok, ksize*sizeof(double) > 2*sizeof(int) */
bounds = malloc(outSize * 2 * sizeof(int));
if ( ! bounds) {
2016-05-05 13:15:54 +03:00
free(kk);
2016-12-01 04:10:58 +03:00
ImagingError_MemoryError();
return 0;
2016-05-05 13:15:54 +03:00
}
for (xx = 0; xx < outSize; xx++) {
2016-11-24 06:11:36 +03:00
center = in0 + (xx + 0.5) * scale;
2016-05-05 13:15:54 +03:00
ww = 0.0;
ss = 1.0 / filterscale;
xmin = (int) floor(center - support);
if (xmin < 0)
xmin = 0;
xmax = (int) ceil(center + support);
if (xmax > inSize)
xmax = inSize;
xmax -= xmin;
2016-12-01 13:46:12 +03:00
k = &kk[xx * ksize];
for (x = 0; x < xmax; x++) {
double w = filterp->filter((x + xmin - center + 0.5) * ss);
k[x] = w;
ww += w;
// We can skip extreme coefficients if they are zeroes.
2016-07-02 18:24:08 +03:00
if (w == 0) {
// Skip from the start.
2016-07-02 18:24:08 +03:00
if (x == 0) {
// At next loop `x` will be 0.
2016-07-02 18:24:08 +03:00
x -= 1;
// But `w` will not be 0, because it based on `xmin`.
2016-07-02 18:24:08 +03:00
xmin += 1;
xmax -= 1;
} else if (x == xmax - 1) {
// Truncate the last coefficient for current `xx`.
2016-07-02 18:24:08 +03:00
xmax -= 1;
}
}
2016-05-05 13:15:54 +03:00
}
for (x = 0; x < xmax; x++) {
2016-05-05 13:15:54 +03:00
if (ww != 0.0)
k[x] /= ww;
}
// Remaining values should stay empty if they are used despite of xmax.
2016-12-01 13:46:12 +03:00
for (; x < ksize; x++) {
k[x] = 0;
}
2016-12-01 13:46:12 +03:00
bounds[xx * 2 + 0] = xmin;
bounds[xx * 2 + 1] = xmax;
2016-05-05 13:15:54 +03:00
}
2016-12-01 13:46:12 +03:00
*boundsp = bounds;
2016-05-05 13:15:54 +03:00
*kkp = kk;
2016-12-01 13:46:12 +03:00
return ksize;
2016-05-05 13:15:54 +03:00
}
void
2016-12-01 13:46:12 +03:00
normalize_coeffs_8bpc(int outSize, int ksize, double *prekk)
{
int x;
INT32 *kk;
2016-12-01 13:46:12 +03:00
// use the same buffer for normalized coefficients
kk = (INT32 *) prekk;
2016-12-01 13:46:12 +03:00
for (x = 0; x < outSize * ksize; x++) {
if (prekk[x] < 0) {
kk[x] = (int) (-0.5 + prekk[x] * (1 << PRECISION_BITS));
} else {
kk[x] = (int) (0.5 + prekk[x] * (1 << PRECISION_BITS));
}
}
}
void
ImagingResampleHorizontal_8bpc(Imaging imOut, Imaging imIn,
2016-12-01 13:46:12 +03:00
int ksize, int *bounds, double *prekk)
2010-07-31 06:52:47 +04:00
{
ImagingSectionCookie cookie;
2016-05-03 13:23:16 +03:00
int ss0, ss1, ss2, ss3;
int xx, yy, x, xmin, xmax;
INT32 *k, *kk;
2016-12-01 13:46:12 +03:00
// use the same buffer for normalized coefficients
kk = (INT32 *) prekk;
2016-12-01 13:46:12 +03:00
normalize_coeffs_8bpc(imOut->xsize, ksize, prekk);
2014-10-25 05:37:33 +04:00
2010-07-31 06:52:47 +04:00
ImagingSectionEnter(&cookie);
2016-05-05 18:27:33 +03:00
if (imIn->image8) {
for (yy = 0; yy < imOut->ysize; yy++) {
for (xx = 0; xx < imOut->xsize; xx++) {
2016-12-01 13:46:12 +03:00
xmin = bounds[xx * 2 + 0];
xmax = bounds[xx * 2 + 1];
k = &kk[xx * ksize];
2016-05-03 14:22:51 +03:00
ss0 = 1 << (PRECISION_BITS -1);
for (x = 0; x < xmax; x++)
ss0 += ((UINT8) imIn->image8[yy][x + xmin]) * k[x];
2016-05-03 13:23:16 +03:00
imOut->image8[yy][xx] = clip8(ss0);
2010-07-31 06:52:47 +04:00
}
2016-05-05 18:27:33 +03:00
}
} else if (imIn->type == IMAGING_TYPE_UINT8) {
if (imIn->bands == 2) {
for (yy = 0; yy < imOut->ysize; yy++) {
for (xx = 0; xx < imOut->xsize; xx++) {
2016-12-01 13:46:12 +03:00
xmin = bounds[xx * 2 + 0];
xmax = bounds[xx * 2 + 1];
k = &kk[xx * ksize];
ss0 = ss3 = 1 << (PRECISION_BITS -1);
for (x = 0; x < xmax; x++) {
ss0 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 0]) * k[x];
ss3 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 3]) * k[x];
}
2016-05-05 12:53:22 +03:00
imOut->image[yy][xx*4 + 0] = clip8(ss0);
imOut->image[yy][xx*4 + 3] = clip8(ss3);
2016-05-05 12:53:22 +03:00
}
2016-05-05 18:27:33 +03:00
}
} else if (imIn->bands == 3) {
for (yy = 0; yy < imOut->ysize; yy++) {
for (xx = 0; xx < imOut->xsize; xx++) {
2016-12-01 13:46:12 +03:00
xmin = bounds[xx * 2 + 0];
xmax = bounds[xx * 2 + 1];
k = &kk[xx * ksize];
2016-05-05 12:53:22 +03:00
ss0 = ss1 = ss2 = 1 << (PRECISION_BITS -1);
for (x = 0; x < xmax; x++) {
ss0 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 0]) * k[x];
ss1 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 1]) * k[x];
ss2 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 2]) * k[x];
}
2016-05-05 12:53:22 +03:00
imOut->image[yy][xx*4 + 0] = clip8(ss0);
imOut->image[yy][xx*4 + 1] = clip8(ss1);
imOut->image[yy][xx*4 + 2] = clip8(ss2);
}
2016-05-05 18:27:33 +03:00
}
} else {
for (yy = 0; yy < imOut->ysize; yy++) {
for (xx = 0; xx < imOut->xsize; xx++) {
2016-12-01 13:46:12 +03:00
xmin = bounds[xx * 2 + 0];
xmax = bounds[xx * 2 + 1];
k = &kk[xx * ksize];
2016-05-05 12:53:22 +03:00
ss0 = ss1 = ss2 = ss3 = 1 << (PRECISION_BITS -1);
for (x = 0; x < xmax; x++) {
ss0 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 0]) * k[x];
ss1 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 1]) * k[x];
ss2 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 2]) * k[x];
ss3 += ((UINT8) imIn->image[yy][(x + xmin)*4 + 3]) * k[x];
2010-07-31 06:52:47 +04:00
}
2016-05-05 12:53:22 +03:00
imOut->image[yy][xx*4 + 0] = clip8(ss0);
imOut->image[yy][xx*4 + 1] = clip8(ss1);
imOut->image[yy][xx*4 + 2] = clip8(ss2);
imOut->image[yy][xx*4 + 3] = clip8(ss3);
2010-07-31 06:52:47 +04:00
}
2016-05-05 12:53:22 +03:00
}
}
}
ImagingSectionLeave(&cookie);
}
void
ImagingResampleVertical_8bpc(Imaging imOut, Imaging imIn,
2016-12-01 13:46:12 +03:00
int ksize, int *bounds, double *prekk)
2016-05-27 06:52:19 +03:00
{
ImagingSectionCookie cookie;
int ss0, ss1, ss2, ss3;
int xx, yy, y, ymin, ymax;
INT32 *k, *kk;
2016-12-01 13:46:12 +03:00
// use the same buffer for normalized coefficients
kk = (INT32 *) prekk;
2016-12-01 13:46:12 +03:00
normalize_coeffs_8bpc(imOut->ysize, ksize, prekk);
2016-05-27 06:52:19 +03:00
ImagingSectionEnter(&cookie);
if (imIn->image8) {
for (yy = 0; yy < imOut->ysize; yy++) {
2016-12-01 13:46:12 +03:00
k = &kk[yy * ksize];
ymin = bounds[yy * 2 + 0];
ymax = bounds[yy * 2 + 1];
for (xx = 0; xx < imOut->xsize; xx++) {
ss0 = 1 << (PRECISION_BITS -1);
for (y = 0; y < ymax; y++)
ss0 += ((UINT8) imIn->image8[y + ymin][xx]) * k[y];
imOut->image8[yy][xx] = clip8(ss0);
}
}
2016-05-27 06:52:19 +03:00
} else if (imIn->type == IMAGING_TYPE_UINT8) {
if (imIn->bands == 2) {
for (yy = 0; yy < imOut->ysize; yy++) {
2016-12-01 13:46:12 +03:00
k = &kk[yy * ksize];
ymin = bounds[yy * 2 + 0];
ymax = bounds[yy * 2 + 1];
for (xx = 0; xx < imOut->xsize; xx++) {
ss0 = ss3 = 1 << (PRECISION_BITS -1);
for (y = 0; y < ymax; y++) {
ss0 += ((UINT8) imIn->image[y + ymin][xx*4 + 0]) * k[y];
ss3 += ((UINT8) imIn->image[y + ymin][xx*4 + 3]) * k[y];
}
imOut->image[yy][xx*4 + 0] = clip8(ss0);
imOut->image[yy][xx*4 + 3] = clip8(ss3);
}
}
2016-05-27 06:52:19 +03:00
} else if (imIn->bands == 3) {
for (yy = 0; yy < imOut->ysize; yy++) {
2016-12-01 13:46:12 +03:00
k = &kk[yy * ksize];
ymin = bounds[yy * 2 + 0];
ymax = bounds[yy * 2 + 1];
2016-05-27 06:52:19 +03:00
for (xx = 0; xx < imOut->xsize; xx++) {
ss0 = ss1 = ss2 = 1 << (PRECISION_BITS -1);
for (y = 0; y < ymax; y++) {
ss0 += ((UINT8) imIn->image[y + ymin][xx*4 + 0]) * k[y];
ss1 += ((UINT8) imIn->image[y + ymin][xx*4 + 1]) * k[y];
ss2 += ((UINT8) imIn->image[y + ymin][xx*4 + 2]) * k[y];
}
imOut->image[yy][xx*4 + 0] = clip8(ss0);
imOut->image[yy][xx*4 + 1] = clip8(ss1);
imOut->image[yy][xx*4 + 2] = clip8(ss2);
}
}
} else {
for (yy = 0; yy < imOut->ysize; yy++) {
2016-12-01 13:46:12 +03:00
k = &kk[yy * ksize];
ymin = bounds[yy * 2 + 0];
ymax = bounds[yy * 2 + 1];
for (xx = 0; xx < imOut->xsize; xx++) {
ss0 = ss1 = ss2 = ss3 = 1 << (PRECISION_BITS -1);
for (y = 0; y < ymax; y++) {
ss0 += ((UINT8) imIn->image[y + ymin][xx*4 + 0]) * k[y];
ss1 += ((UINT8) imIn->image[y + ymin][xx*4 + 1]) * k[y];
ss2 += ((UINT8) imIn->image[y + ymin][xx*4 + 2]) * k[y];
ss3 += ((UINT8) imIn->image[y + ymin][xx*4 + 3]) * k[y];
}
imOut->image[yy][xx*4 + 0] = clip8(ss0);
imOut->image[yy][xx*4 + 1] = clip8(ss1);
imOut->image[yy][xx*4 + 2] = clip8(ss2);
imOut->image[yy][xx*4 + 3] = clip8(ss3);
}
}
2016-05-27 06:52:19 +03:00
}
}
ImagingSectionLeave(&cookie);
}
void
ImagingResampleHorizontal_32bpc(Imaging imOut, Imaging imIn,
2016-12-01 13:46:12 +03:00
int ksize, int *bounds, double *kk)
2016-05-05 12:53:22 +03:00
{
ImagingSectionCookie cookie;
double ss;
int xx, yy, x, xmin, xmax;
double *k;
2016-05-05 12:53:22 +03:00
2016-06-17 13:03:21 +03:00
ImagingSectionEnter(&cookie);
2016-05-05 18:11:20 +03:00
switch(imIn->type) {
case IMAGING_TYPE_INT32:
for (yy = 0; yy < imOut->ysize; yy++) {
for (xx = 0; xx < imOut->xsize; xx++) {
2016-12-01 13:46:12 +03:00
xmin = bounds[xx * 2 + 0];
xmax = bounds[xx * 2 + 1];
k = &kk[xx * ksize];
2010-07-31 06:52:47 +04:00
ss = 0.0;
for (x = 0; x < xmax; x++)
ss += IMAGING_PIXEL_I(imIn, x + xmin, yy) * k[x];
2016-05-09 14:37:50 +03:00
IMAGING_PIXEL_I(imOut, xx, yy) = ROUND_UP(ss);
2010-07-31 06:52:47 +04:00
}
2016-05-05 18:11:20 +03:00
}
break;
2016-05-05 18:11:20 +03:00
case IMAGING_TYPE_FLOAT32:
for (yy = 0; yy < imOut->ysize; yy++) {
for (xx = 0; xx < imOut->xsize; xx++) {
2016-12-01 13:46:12 +03:00
xmin = bounds[xx * 2 + 0];
xmax = bounds[xx * 2 + 1];
k = &kk[xx * ksize];
ss = 0.0;
for (x = 0; x < xmax; x++)
ss += IMAGING_PIXEL_F(imIn, x + xmin, yy) * k[x];
2014-10-25 05:50:54 +04:00
IMAGING_PIXEL_F(imOut, xx, yy) = ss;
2010-07-31 06:52:47 +04:00
}
2016-05-05 18:11:20 +03:00
}
break;
2010-07-31 06:52:47 +04:00
}
ImagingSectionLeave(&cookie);
}
void
ImagingResampleVertical_32bpc(Imaging imOut, Imaging imIn,
2016-12-01 13:46:12 +03:00
int ksize, int *bounds, double *kk)
{
ImagingSectionCookie cookie;
double ss;
int xx, yy, y, ymin, ymax;
double *k;
2016-06-17 13:03:21 +03:00
ImagingSectionEnter(&cookie);
switch(imIn->type) {
case IMAGING_TYPE_INT32:
for (yy = 0; yy < imOut->ysize; yy++) {
2016-12-01 13:46:12 +03:00
ymin = bounds[yy * 2 + 0];
ymax = bounds[yy * 2 + 1];
k = &kk[yy * ksize];
for (xx = 0; xx < imOut->xsize; xx++) {
ss = 0.0;
for (y = 0; y < ymax; y++)
ss += IMAGING_PIXEL_I(imIn, xx, y + ymin) * k[y];
IMAGING_PIXEL_I(imOut, xx, yy) = ROUND_UP(ss);
}
}
break;
case IMAGING_TYPE_FLOAT32:
for (yy = 0; yy < imOut->ysize; yy++) {
2016-12-01 13:46:12 +03:00
ymin = bounds[yy * 2 + 0];
ymax = bounds[yy * 2 + 1];
k = &kk[yy * ksize];
for (xx = 0; xx < imOut->xsize; xx++) {
ss = 0.0;
for (y = 0; y < ymax; y++)
ss += IMAGING_PIXEL_F(imIn, xx, y + ymin) * k[y];
IMAGING_PIXEL_F(imOut, xx, yy) = ss;
}
}
break;
}
ImagingSectionLeave(&cookie);
2010-07-31 06:52:47 +04:00
}
typedef void (*ResampleFunction)(Imaging imOut, Imaging imIn,
2016-12-01 13:46:12 +03:00
int ksize, int *bounds, double *kk);
Imaging
ImagingResampleInner(Imaging imIn, int xsize, int ysize,
struct filter *filterp, float box[4],
ResampleFunction ResampleHorizontal,
ResampleFunction ResampleVertical);
2014-10-26 00:11:39 +04:00
Imaging
2016-11-30 20:01:28 +03:00
ImagingResample(Imaging imIn, int xsize, int ysize, int filter, float box[4])
{
struct filter *filterp;
ResampleFunction ResampleHorizontal;
ResampleFunction ResampleVertical;
if (strcmp(imIn->mode, "P") == 0 || strcmp(imIn->mode, "1") == 0)
return (Imaging) ImagingError_ModeError();
if (imIn->type == IMAGING_TYPE_SPECIAL) {
return (Imaging) ImagingError_ModeError();
} else if (imIn->image8) {
2016-05-05 12:53:22 +03:00
ResampleHorizontal = ImagingResampleHorizontal_8bpc;
2016-05-27 07:24:22 +03:00
ResampleVertical = ImagingResampleVertical_8bpc;
2016-05-05 12:53:22 +03:00
} else {
switch(imIn->type) {
case IMAGING_TYPE_UINT8:
ResampleHorizontal = ImagingResampleHorizontal_8bpc;
2016-05-27 07:24:22 +03:00
ResampleVertical = ImagingResampleVertical_8bpc;
2016-05-05 12:53:22 +03:00
break;
case IMAGING_TYPE_INT32:
case IMAGING_TYPE_FLOAT32:
ResampleHorizontal = ImagingResampleHorizontal_32bpc;
2016-05-27 07:24:22 +03:00
ResampleVertical = ImagingResampleVertical_32bpc;
2016-05-05 12:53:22 +03:00
break;
default:
return (Imaging) ImagingError_ModeError();
}
}
/* check filter */
switch (filter) {
case IMAGING_TRANSFORM_BOX:
filterp = &BOX;
break;
case IMAGING_TRANSFORM_BILINEAR:
filterp = &BILINEAR;
break;
case IMAGING_TRANSFORM_HAMMING:
filterp = &HAMMING;
break;
case IMAGING_TRANSFORM_BICUBIC:
filterp = &BICUBIC;
break;
case IMAGING_TRANSFORM_LANCZOS:
filterp = &LANCZOS;
break;
default:
return (Imaging) ImagingError_ValueError(
"unsupported resampling filter"
);
}
return ImagingResampleInner(imIn, xsize, ysize, filterp, box,
ResampleHorizontal, ResampleVertical);
}
Imaging
ImagingResampleInner(Imaging imIn, int xsize, int ysize,
struct filter *filterp, float box[4],
ResampleFunction ResampleHorizontal,
ResampleFunction ResampleVertical)
{
Imaging imTemp = NULL;
Imaging imOut = NULL;
2016-12-01 13:46:12 +03:00
int ksize;
int *bounds;
double *kk;
2014-10-26 00:11:39 +04:00
/* two-pass resize, first pass */
2016-11-30 20:01:28 +03:00
if (box[0] || box[2] != xsize) {
2016-12-01 13:46:12 +03:00
ksize = precompute_coeffs(imIn->xsize, box[0], box[2], xsize, filterp,
&bounds, &kk);
if ( ! ksize) {
2016-12-01 04:10:58 +03:00
return NULL;
}
imTemp = ImagingNew(imIn->mode, xsize, imIn->ysize);
if ( ! imTemp) {
2016-12-01 13:46:12 +03:00
free(bounds);
free(kk);
return NULL;
}
2016-12-01 13:46:12 +03:00
ResampleHorizontal(imTemp, imIn, ksize, bounds, kk);
free(bounds);
free(kk);
imOut = imIn = imTemp;
}
/* second pass */
2016-11-30 20:01:28 +03:00
if (box[1] || box[3] != ysize) {
2016-12-01 13:46:12 +03:00
ksize = precompute_coeffs(imIn->ysize, box[1], box[3], ysize, filterp,
&bounds, &kk);
if ( ! ksize) {
ImagingDelete(imTemp);
2016-12-01 04:10:58 +03:00
return NULL;
}
imOut = ImagingNew(imIn->mode, imIn->xsize, ysize);
if ( ! imOut) {
2016-12-01 13:46:12 +03:00
free(bounds);
free(kk);
return NULL;
}
/* imIn can be the original image or horizontally resampled one */
2016-12-01 13:46:12 +03:00
ResampleVertical(imOut, imIn, ksize, bounds, kk);
/* it's safe to call ImagingDelete with empty value
if previous step was not performed. */
ImagingDelete(imTemp);
2016-12-01 13:46:12 +03:00
free(bounds);
free(kk);
}
/* none of the previous steps are performed, copying */
if ( ! imOut) {
imOut = ImagingCopy(imIn);
}
return imOut;
}