/**
* im_benchmarkn:
* @in: input image
* @out: output image
* @n: iterations
*
* This operation runs a complicated set of other operations on image @in,
* producing image @out. Use @n to set the number of iterations to run: a
* larger number will make the operation more CPU-bound, a smaller number will
* make the operation more IO-bound.
*
* See http://www.vips.ecs.soton.ac.uk/index.php?title=Benchmarks for a
* detailed discussion of the benchmark and some sample results.
*
* See also: im_benchmark2().
*
* Returns: 0 on success, -1 on error
*/
int
im_benchmarkn( IMAGE *in, IMAGE *out, int n )
{
IMAGE *t[2];
if( n == 0 )
/* To sRGB.
*/
return( im_LabQ2disp( in, out, im_col_displays( 7 ) ) );
else
return( im_open_local_array( out, t, 2, "benchmarkn", "p" ) ||
benchmark( in, t[0] ) ||
/* Expand back to the original size again ...
* benchmark does a 200 pixel crop plus a 10% shrink,
* so if we chain many of them together the image gets
* too small.
*/
im_affinei_all( t[0], t[1],
vips_interpolate_bilinear_static(),
(double) in->Xsize / t[0]->Xsize, 0, 0,
(double) in->Ysize / t[0]->Ysize,
0, 0 ) ||
im_benchmarkn( t[1], out, n - 1 ) );
}
int
im_similarity( IMAGE *in, IMAGE *out,
double a, double b, double dx, double dy )
{
return( im_affinei_all( in, out,
vips_interpolate_bilinear_static(),
a, -b, b, a, dx, dy ) );
}
int
im_similarity_area( IMAGE *in, IMAGE *out,
double a, double b, double dx, double dy,
int ox, int oy, int ow, int oh )
{
return( im_affinei( in, out,
vips_interpolate_bilinear_static(),
a, -b, b, a, dx, dy,
ox, oy, ow, oh ) );
}
int
im_affine( IMAGE *in, IMAGE *out,
double a, double b, double c, double d, double dx, double dy,
int ox, int oy, int ow, int oh )
{
return( im_affinei( in, out,
vips_interpolate_bilinear_static(),
a, b, c, d, dx, dy,
ox, oy, ow, oh ) );
}
/* Still needed by some parts of mosaic.
*/
int
im__affine( IMAGE *in, IMAGE *out, Transformation *trn )
{
return( im__affinei( in, out,
vips_interpolate_bilinear_static(), trn ) );
}
/* The main part of the benchmark ... transform labq to labq. Chain several of
* these together to get a CPU-bound operation.
*/
static int
benchmark( IMAGE *in, IMAGE *out )
{
IMAGE *t[18];
double one[3] = { 1.0, 1.0, 1.0 };
double zero[3] = { 0.0, 0.0, 0.0 };
double darken[3] = { 1.0 / 1.18, 1.0, 1.0 };
double whitepoint[3] = { 1.06, 1.0, 1.01 };
double shadow[3] = { -2, 0, 0 };
double white[3] = { 100, 0, 0 };
DOUBLEMASK *d652d50 = im_create_dmaskv( "d652d50", 3, 3,
1.13529, -0.0604663, -0.0606321,
0.0975399, 0.935024, -0.0256156,
-0.0336428, 0.0414702, 0.994135 );
im_add_close_callback( out,
(im_callback_fn) im_free_dmask, d652d50, NULL );
return(
/* Set of descriptors for this operation.
*/
im_open_local_array( out, t, 18, "im_benchmark", "p" ) ||
/* Unpack to float.
*/
im_LabQ2Lab( in, t[0] ) ||
/* Crop 100 pixels off all edges.
*/
im_extract_area( t[0], t[1],
100, 100, t[0]->Xsize - 200, t[0]->Ysize - 200 ) ||
/* Shrink by 10%, bilinear interp.
*/
im_affinei_all( t[1], t[2],
vips_interpolate_bilinear_static(),
0.9, 0, 0, 0.9,
0, 0 ) ||
/* Find L ~= 100 areas (white surround).
*/
im_extract_band( t[2], t[3], 0 ) ||
im_moreconst( t[3], t[4], 99 ) ||
/* Adjust white point and shadows.
*/
im_lintra_vec( 3, darken, t[2], zero, t[5] ) ||
im_Lab2XYZ( t[5], t[6] ) ||
im_recomb( t[6], t[7], d652d50 ) ||
im_lintra_vec( 3, whitepoint, t[7], zero, t[8] ) ||
im_lintra( 1.5, t[8], 0.0, t[9] ) ||
im_XYZ2Lab( t[9], t[10] ) ||
im_lintra_vec( 3, one, t[10], shadow, t[11] ) ||
/* Make a solid white image.
*/
im_black( t[12], t[4]->Xsize, t[4]->Ysize, 3 ) ||
im_lintra_vec( 3, zero, t[12], white, t[13] ) ||
/* Reattach border.
*/
im_ifthenelse( t[4], t[13], t[11], t[14] ) ||
/* Sharpen.
*/
im_Lab2LabQ( t[14], t[15] ) ||
im_sharpen( t[15], out, 11, 2.5, 40, 20, 0.5, 1.5 )
);
}
