547 lines
13 KiB
C++
547 lines
13 KiB
C++
/* horizontal reduce by a float factor with lanczos3
|
|
*
|
|
* 29/1/16
|
|
* - from shrinkv.c
|
|
* 10/3/16
|
|
* - add other kernels
|
|
*/
|
|
|
|
/*
|
|
|
|
This file is part of VIPS.
|
|
|
|
VIPS is free software; you can redistribute it and/or modify
|
|
it under the terms of the GNU Lesser General Public License as published by
|
|
the Free Software Foundation; either version 2 of the License, or
|
|
(at your option) any later version.
|
|
|
|
This program is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
|
along with this program; if not, write to the Free Software
|
|
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
|
|
02110-1301 USA
|
|
|
|
*/
|
|
|
|
/*
|
|
|
|
These files are distributed with VIPS - http://www.vips.ecs.soton.ac.uk
|
|
|
|
*/
|
|
|
|
/*
|
|
#define DEBUG
|
|
*/
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
#include <config.h>
|
|
#endif /*HAVE_CONFIG_H*/
|
|
#include <vips/intl.h>
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <math.h>
|
|
|
|
#include <vips/vips.h>
|
|
#include <vips/debug.h>
|
|
#include <vips/internal.h>
|
|
|
|
#include "presample.h"
|
|
#include "templates.h"
|
|
|
|
typedef struct _VipsReducev {
|
|
VipsResample parent_instance;
|
|
|
|
double yshrink; /* Shrink factor */
|
|
|
|
/* The thing we use to make the kernel.
|
|
*/
|
|
VipsKernel kernel;
|
|
|
|
/* Number of points in kernel.
|
|
*/
|
|
int n_points;
|
|
|
|
/* Precalculated interpolation matrices. int (used for pel
|
|
* sizes up to short), and double (for all others). We go to
|
|
* scale + 1 so we can round-to-nearest safely.
|
|
*/
|
|
int *matrixi[VIPS_TRANSFORM_SCALE + 1];
|
|
double *matrixf[VIPS_TRANSFORM_SCALE + 1];
|
|
|
|
} VipsReducev;
|
|
|
|
typedef VipsResampleClass VipsReducevClass;
|
|
|
|
/* We need C linkage for this.
|
|
*/
|
|
extern "C" {
|
|
G_DEFINE_TYPE( VipsReducev, vips_reducev, VIPS_TYPE_RESAMPLE );
|
|
}
|
|
|
|
/* You'd think this would vectorise, but gcc hates mixed types in nested loops
|
|
* :-(
|
|
*/
|
|
template <typename T, int max_value>
|
|
static void inline
|
|
reducev_unsigned_int_tab( VipsReducev *reducev,
|
|
VipsPel *pout, const VipsPel *pin,
|
|
const int ne, const int lskip, const int * restrict cy )
|
|
{
|
|
T* restrict out = (T *) pout;
|
|
const T* restrict in = (T *) pin;
|
|
const int n = reducev->n_points;
|
|
const int l1 = lskip / sizeof( T );
|
|
|
|
for( int z = 0; z < ne; z++ ) {
|
|
int sum;
|
|
|
|
sum = reduce_sum<T, int>( in + z, l1, cy, n );
|
|
sum = unsigned_fixed_round( sum );
|
|
sum = VIPS_CLIP( 0, sum, max_value );
|
|
|
|
out[z] = sum;
|
|
}
|
|
}
|
|
|
|
/* An unrolled version of ^^ for the most common case.
|
|
*/
|
|
static void inline
|
|
reducev_unsigned_uint8_6tab( VipsPel *out, const VipsPel *in,
|
|
const int ne, const int lskip, const int *cy )
|
|
{
|
|
const int l1 = lskip;
|
|
const int l2 = l1 + l1;
|
|
const int l3 = l1 + l2;
|
|
const int l4 = l2 + l2;
|
|
const int l5 = l4 + l1;
|
|
|
|
const int c0 = cy[0];
|
|
const int c1 = cy[1];
|
|
const int c2 = cy[2];
|
|
const int c3 = cy[3];
|
|
const int c4 = cy[4];
|
|
const int c5 = cy[5];
|
|
|
|
for( int z = 0; z < ne; z++ ) {
|
|
int sum = unsigned_fixed_round(
|
|
c0 * in[0] +
|
|
c1 * in[l1] +
|
|
c2 * in[l2] +
|
|
c3 * in[l3] +
|
|
c4 * in[l4] +
|
|
c5 * in[l5] );
|
|
|
|
sum = VIPS_CLIP( 0, sum, 255 );
|
|
|
|
out[z] = sum;
|
|
|
|
in += 1;
|
|
}
|
|
}
|
|
|
|
template <typename T, int min_value, int max_value>
|
|
static void inline
|
|
reducev_signed_int_tab( VipsReducev *reducev,
|
|
VipsPel *pout, const VipsPel *pin,
|
|
const int ne, const int lskip, const int * restrict cy )
|
|
{
|
|
T* restrict out = (T *) pout;
|
|
const T* restrict in = (T *) pin;
|
|
const int n = reducev->n_points;
|
|
const int l1 = lskip / sizeof( T );
|
|
|
|
for( int z = 0; z < ne; z++ ) {
|
|
int sum;
|
|
|
|
sum = reduce_sum<T, int>( in + z, l1, cy, n );
|
|
sum = signed_fixed_round( sum );
|
|
sum = VIPS_CLIP( min_value, sum, max_value );
|
|
|
|
out[z] = sum;
|
|
}
|
|
}
|
|
|
|
/* Floating-point version.
|
|
*/
|
|
template <typename T>
|
|
static void inline
|
|
reducev_float_tab( VipsReducev *reducev,
|
|
VipsPel *pout, const VipsPel *pin,
|
|
const int ne, const int lskip, const double * restrict cy )
|
|
{
|
|
T* restrict out = (T *) pout;
|
|
const T* restrict in = (T *) pin;
|
|
const int n = reducev->n_points;
|
|
const int l1 = lskip / sizeof( T );
|
|
|
|
for( int z = 0; z < ne; z++ )
|
|
out[z] = reduce_sum<T, double>( in + z, l1, cy, n );
|
|
}
|
|
|
|
/* 32-bit int output needs a double intermediate.
|
|
*/
|
|
|
|
template <typename T, int max_value>
|
|
static void inline
|
|
reducev_unsigned_int32_tab( VipsReducev *reducev,
|
|
VipsPel *pout, const VipsPel *pin,
|
|
const int ne, const int lskip, const double * restrict cy )
|
|
{
|
|
T* restrict out = (T *) pout;
|
|
const T* restrict in = (T *) pin;
|
|
const int n = reducev->n_points;
|
|
const int l1 = lskip / sizeof( T );
|
|
|
|
for( int z = 0; z < ne; z++ ) {
|
|
double sum;
|
|
|
|
sum = reduce_sum<T, double>( in + z, l1, cy, n );
|
|
out[z] = VIPS_CLIP( 0, sum, max_value );
|
|
}
|
|
}
|
|
|
|
template <typename T, int min_value, int max_value>
|
|
static void inline
|
|
reducev_signed_int32_tab( VipsReducev *reducev,
|
|
VipsPel *pout, const VipsPel *pin,
|
|
const int ne, const int lskip, const double * restrict cy )
|
|
{
|
|
T* restrict out = (T *) pout;
|
|
const T* restrict in = (T *) pin;
|
|
const int n = reducev->n_points;
|
|
const int l1 = lskip / sizeof( T );
|
|
|
|
for( int z = 0; z < ne; z++ ) {
|
|
double sum;
|
|
|
|
sum = reduce_sum<T, double>( in + z, l1, cy, n );
|
|
out[z] = VIPS_CLIP( min_value, sum, max_value );
|
|
}
|
|
}
|
|
|
|
/* Ultra-high-quality version for double images.
|
|
*/
|
|
template <typename T>
|
|
static void inline
|
|
reducev_notab( VipsReducev *reducev,
|
|
VipsPel *pout, const VipsPel *pin,
|
|
const int ne, const int lskip, double y )
|
|
{
|
|
T* restrict out = (T *) pout;
|
|
const T* restrict in = (T *) pin;
|
|
const int n = reducev->n_points;
|
|
const int l1 = lskip / sizeof( T );
|
|
|
|
double cy[MAX_POINTS];
|
|
|
|
vips_reduce_make_mask( reducev->kernel, reducev->yshrink, y, cy );
|
|
|
|
for( int z = 0; z < ne; z++ )
|
|
out[z] = reduce_sum<T, double>( in + z, l1, cy, n );
|
|
}
|
|
|
|
static int
|
|
vips_reducev_gen( VipsRegion *out_region, void *seq,
|
|
void *a, void *b, gboolean *stop )
|
|
{
|
|
VipsImage *in = (VipsImage *) a;
|
|
VipsReducev *reducev = (VipsReducev *) b;
|
|
VipsRegion *ir = (VipsRegion *) seq;
|
|
VipsRect *r = &out_region->valid;
|
|
|
|
/* Double bands for complex.
|
|
*/
|
|
const int bands = in->Bands *
|
|
(vips_band_format_iscomplex( in->BandFmt ) ? 2 : 1);
|
|
int ne = r->width * bands;
|
|
|
|
VipsRect s;
|
|
|
|
#ifdef DEBUG
|
|
printf( "vips_reducev_gen: generating %d x %d at %d x %d\n",
|
|
r->width, r->height, r->left, r->top );
|
|
#endif /*DEBUG*/
|
|
|
|
s.left = r->left;
|
|
s.top = r->top * reducev->yshrink;
|
|
s.width = r->width;
|
|
s.height = r->height * reducev->yshrink + reducev->n_points;
|
|
if( vips_region_prepare( ir, &s ) )
|
|
return( -1 );
|
|
|
|
VIPS_GATE_START( "vips_reducev_gen: work" );
|
|
|
|
for( int y = 0; y < r->height; y ++ ) {
|
|
VipsPel *q =
|
|
VIPS_REGION_ADDR( out_region, r->left, r->top + y );
|
|
const double Y = (r->top + y) * reducev->yshrink;
|
|
VipsPel *p = VIPS_REGION_ADDR( ir, r->left, (int) Y );
|
|
const int sy = Y * VIPS_TRANSFORM_SCALE * 2;
|
|
const int siy = sy & (VIPS_TRANSFORM_SCALE * 2 - 1);
|
|
const int ty = (siy + 1) >> 1;
|
|
const int *cyi = reducev->matrixi[ty];
|
|
const double *cyf = reducev->matrixf[ty];
|
|
const int lskip = VIPS_REGION_LSKIP( ir );
|
|
|
|
switch( in->BandFmt ) {
|
|
case VIPS_FORMAT_UCHAR:
|
|
if( reducev->n_points == 6 )
|
|
reducev_unsigned_uint8_6tab(
|
|
q, p, ne, lskip, cyi );
|
|
else
|
|
reducev_unsigned_int_tab
|
|
<unsigned char, UCHAR_MAX>(
|
|
reducev,
|
|
q, p, ne, lskip, cyi );
|
|
break;
|
|
|
|
case VIPS_FORMAT_CHAR:
|
|
reducev_signed_int_tab
|
|
<signed char, SCHAR_MIN, SCHAR_MAX>(
|
|
reducev,
|
|
q, p, ne, lskip, cyi );
|
|
break;
|
|
|
|
case VIPS_FORMAT_USHORT:
|
|
reducev_unsigned_int_tab
|
|
<unsigned short, USHRT_MAX>(
|
|
reducev,
|
|
q, p, ne, lskip, cyi );
|
|
break;
|
|
|
|
case VIPS_FORMAT_SHORT:
|
|
reducev_signed_int_tab
|
|
<signed short, SHRT_MIN, SHRT_MAX>(
|
|
reducev,
|
|
q, p, ne, lskip, cyi );
|
|
break;
|
|
|
|
case VIPS_FORMAT_UINT:
|
|
reducev_unsigned_int32_tab
|
|
<unsigned int, INT_MAX>(
|
|
reducev,
|
|
q, p, ne, lskip, cyf );
|
|
break;
|
|
|
|
case VIPS_FORMAT_INT:
|
|
reducev_signed_int32_tab
|
|
<signed int, INT_MIN, INT_MAX>(
|
|
reducev,
|
|
q, p, ne, lskip, cyf );
|
|
break;
|
|
|
|
case VIPS_FORMAT_FLOAT:
|
|
case VIPS_FORMAT_COMPLEX:
|
|
reducev_float_tab<float>( reducev,
|
|
q, p, ne, lskip, cyf );
|
|
break;
|
|
|
|
case VIPS_FORMAT_DPCOMPLEX:
|
|
case VIPS_FORMAT_DOUBLE:
|
|
reducev_notab<double>( reducev,
|
|
q, p, ne, lskip, Y - (int) Y );
|
|
break;
|
|
|
|
default:
|
|
g_assert_not_reached();
|
|
break;
|
|
}
|
|
}
|
|
|
|
VIPS_GATE_STOP( "vips_reducev_gen: work" );
|
|
|
|
return( 0 );
|
|
}
|
|
|
|
static int
|
|
vips_reducev_build( VipsObject *object )
|
|
{
|
|
VipsObjectClass *object_class = VIPS_OBJECT_GET_CLASS( object );
|
|
VipsResample *resample = VIPS_RESAMPLE( object );
|
|
VipsReducev *reducev = (VipsReducev *) object;
|
|
VipsImage **t = (VipsImage **) vips_object_local_array( object, 2 );
|
|
|
|
VipsImage *in;
|
|
|
|
if( VIPS_OBJECT_CLASS( vips_reducev_parent_class )->build( object ) )
|
|
return( -1 );
|
|
|
|
in = resample->in;
|
|
|
|
if( reducev->yshrink < 1 ) {
|
|
vips_error( object_class->nickname,
|
|
"%s", _( "reduce factor should be >= 1" ) );
|
|
return( -1 );
|
|
}
|
|
|
|
if( reducev->yshrink == 1 )
|
|
return( vips_image_write( in, resample->out ) );
|
|
|
|
/* Build the tables of pre-computed coefficients.
|
|
*/
|
|
reducev->n_points =
|
|
vips_reduce_get_points( reducev->kernel, reducev->yshrink );
|
|
if( reducev->n_points > MAX_POINTS ) {
|
|
vips_error( object_class->nickname,
|
|
"%s", _( "reduce factor too large" ) );
|
|
return( -1 );
|
|
}
|
|
vips_info( object_class->nickname, "%d point mask", reducev->n_points );
|
|
for( int y = 0; y < VIPS_TRANSFORM_SCALE + 1; y++ ) {
|
|
reducev->matrixf[y] =
|
|
VIPS_ARRAY( object, reducev->n_points, double );
|
|
reducev->matrixi[y] =
|
|
VIPS_ARRAY( object, reducev->n_points, int );
|
|
if( !reducev->matrixf[y] ||
|
|
!reducev->matrixi[y] )
|
|
return( -1 );
|
|
|
|
vips_reduce_make_mask( reducev->kernel, reducev->yshrink,
|
|
(float) y / VIPS_TRANSFORM_SCALE,
|
|
reducev->matrixf[y] );
|
|
|
|
#ifdef DEBUG
|
|
printf( "vips_reducev_build: masks:\n" );
|
|
printf( "%4g ", (double) y / VIPS_TRANSFORM_SCALE );
|
|
for( int i = 0; i < reducev->n_points; i++ )
|
|
printf( " %4g", reducev->matrixf[y][i] );
|
|
printf( "\n" );
|
|
#endif /*DEBUG*/
|
|
|
|
for( int i = 0; i < reducev->n_points; i++ )
|
|
reducev->matrixi[y][i] = reducev->matrixf[y][i] *
|
|
VIPS_INTERPOLATE_SCALE;
|
|
}
|
|
|
|
/* Unpack for processing.
|
|
*/
|
|
if( vips_image_decode( in, &t[0] ) )
|
|
return( -1 );
|
|
in = t[0];
|
|
|
|
/* Add new pixels around the input so we can interpolate at the edges.
|
|
*/
|
|
if( vips_embed( in, &t[1],
|
|
0, reducev->n_points / 2 - 1,
|
|
in->Xsize, in->Ysize + reducev->n_points - 1,
|
|
"extend", VIPS_EXTEND_COPY,
|
|
NULL ) )
|
|
return( -1 );
|
|
in = t[1];
|
|
|
|
if( vips_image_pipelinev( resample->out,
|
|
VIPS_DEMAND_STYLE_SMALLTILE, in, NULL ) )
|
|
return( -1 );
|
|
|
|
/* Size output. Note: we round to nearest to hide rounding errors.
|
|
*
|
|
* Don't change xres/yres, leave that to the application layer. For
|
|
* example, vipsthumbnail knows the true reduce factor (including the
|
|
* fractional part), we just see the integer part here.
|
|
*/
|
|
resample->out->Ysize = VIPS_RINT(
|
|
(in->Ysize - reducev->n_points + 1) / reducev->yshrink );
|
|
if( resample->out->Ysize <= 0 ) {
|
|
vips_error( object_class->nickname,
|
|
"%s", _( "image has shrunk to nothing" ) );
|
|
return( -1 );
|
|
}
|
|
|
|
#ifdef DEBUG
|
|
printf( "vips_reducev_build: reducing %d x %d image to %d x %d\n",
|
|
in->Xsize, in->Ysize,
|
|
resample->out->Xsize, resample->out->Ysize );
|
|
#endif /*DEBUG*/
|
|
|
|
if( vips_image_generate( resample->out,
|
|
vips_start_one, vips_reducev_gen, vips_stop_one,
|
|
in, reducev ) )
|
|
return( -1 );
|
|
|
|
return( 0 );
|
|
}
|
|
|
|
static void
|
|
vips_reducev_class_init( VipsReducevClass *reducev_class )
|
|
{
|
|
GObjectClass *gobject_class = G_OBJECT_CLASS( reducev_class );
|
|
VipsObjectClass *vobject_class = VIPS_OBJECT_CLASS( reducev_class );
|
|
VipsOperationClass *operation_class =
|
|
VIPS_OPERATION_CLASS( reducev_class );
|
|
|
|
VIPS_DEBUG_MSG( "vips_reducev_class_init\n" );
|
|
|
|
gobject_class->set_property = vips_object_set_property;
|
|
gobject_class->get_property = vips_object_get_property;
|
|
|
|
vobject_class->nickname = "reducev";
|
|
vobject_class->description = _( "shrink an image vertically" );
|
|
vobject_class->build = vips_reducev_build;
|
|
|
|
operation_class->flags = VIPS_OPERATION_SEQUENTIAL_UNBUFFERED;
|
|
|
|
VIPS_ARG_DOUBLE( reducev_class, "yshrink", 3,
|
|
_( "Xshrink" ),
|
|
_( "Vertical shrink factor" ),
|
|
VIPS_ARGUMENT_REQUIRED_INPUT,
|
|
G_STRUCT_OFFSET( VipsReducev, yshrink ),
|
|
1, 1000000, 1 );
|
|
|
|
VIPS_ARG_ENUM( reducev_class, "kernel", 3,
|
|
_( "Kernel" ),
|
|
_( "Resampling kernel" ),
|
|
VIPS_ARGUMENT_OPTIONAL_INPUT,
|
|
G_STRUCT_OFFSET( VipsReducev, kernel ),
|
|
VIPS_TYPE_KERNEL, VIPS_KERNEL_LANCZOS3 );
|
|
|
|
}
|
|
|
|
static void
|
|
vips_reducev_init( VipsReducev *reducev )
|
|
{
|
|
reducev->kernel = VIPS_KERNEL_LANCZOS3;
|
|
}
|
|
|
|
/**
|
|
* vips_reducev:
|
|
* @in: input image
|
|
* @out: output image
|
|
* @yshrink: horizontal reduce
|
|
* @...: %NULL-terminated list of optional named arguments
|
|
*
|
|
* Optional arguments:
|
|
*
|
|
* @kernel: #VipsKernel to use to interpolate (default: lanczos3)
|
|
*
|
|
* Reduce @in vertically by a float factor. The pixels in @out are
|
|
* interpolated with a 1D mask. This operation will not work well for
|
|
* a reduction of more than a factor of two.
|
|
*
|
|
* This is a very low-level operation: see vips_resize() for a more
|
|
* convenient way to resize images.
|
|
*
|
|
* This operation does not change xres or yres. The image resolution needs to
|
|
* be updated by the application.
|
|
*
|
|
* See also: vips_shrink(), vips_resize(), vips_affine().
|
|
*
|
|
* Returns: 0 on success, -1 on error
|
|
*/
|
|
int
|
|
vips_reducev( VipsImage *in, VipsImage **out, double yshrink, ... )
|
|
{
|
|
va_list ap;
|
|
int result;
|
|
|
|
va_start( ap, yshrink );
|
|
result = vips_call_split( "reducev", ap, in, out, yshrink );
|
|
va_end( ap );
|
|
|
|
return( result );
|
|
}
|