/** @file  pmStack.c
 *
 *  This file will perform image combination of several images of the
 *  same field, produce a list of questionable pixels, then tag some
 *  of those pixels as cosmic rays.
 *
 *  @author Paul Price, IfA
 *  @author GLG, MHPCC
 *
 *  @version $Revision: 1.15 $ $Name: not supported by cvs2svn $
 *  @date $Date: 2007-11-10 01:09:20 $
 *  Copyright 2004-2007 Institute for Astronomy, University of Hawaii
 *
 */

#ifdef HAVE_CONFIG_H
#include <config.h>
#endif

#include <stdio.h>
#include <pslib.h>

#include "pmHDU.h"
#include "pmFPA.h"
#include "pmConceptsAverage.h"

#include "pmStack.h"

#define PIXEL_LIST_BUFFER 100           // Number of entries to add to pixel list at a time
#define PIXEL_MAP_BUFFER 2              // Number of entries to add to pixel map at a time

// Internal values for masks
#define MASK_BAD 0x01                   // Mask value for pixels that have formerly been masked as bad
#define MASK_SUSPECT 0x02               // Mask value for pixels that are suspected bad (by pmStackCombine)


// Data structure for use as a buffer when combining pixels
// Use of this structure means we don't have to do an allocation in the combination function for each pixel
typedef struct {
    psVector *pixels;                   // Pixel values
    psVector *masks;                    // Pixel masks
    psVector *weights;                  // Pixel weights
    psVector *sort;                     // Buffer for sorting (to get a robust estimator of the standard dev)
} combineBuffer;

static void combineBufferFree(combineBuffer *buffer)
{
    psFree(buffer->pixels);
    psFree(buffer->masks);
    psFree(buffer->weights);
    psFree(buffer->sort);
    return;
}

static combineBuffer *combineBufferAlloc(long numImages, // Number of images that will be combined
                                         psStatsOptions stat // Statistic to use
    )
{
    combineBuffer *buffer = psAlloc(sizeof(combineBuffer));
    psMemSetDeallocator(buffer, (psFreeFunc)combineBufferFree);

    buffer->pixels = psVectorAlloc(numImages, PS_TYPE_F32);
    buffer->masks = psVectorAlloc(numImages, PS_TYPE_MASK);
    buffer->weights = psVectorAlloc(numImages, PS_TYPE_F32);
    buffer->sort = psVectorAlloc(numImages, PS_TYPE_F32);

    return buffer;
}


// Deallocator for the stack data
static void stackDataFree(pmStackData *data)
{
    psFree(data->readout);
    psFree(data->pixels);
    return;
}


// Generate a mean value for the combination
// Not using psVectorStats because it assumes that the weights are errors, and weights by 1/error^2
static bool combinationMean(float *mean, // Mean value, to return
                            const psVector *values, // Values to combine
                            const psVector *weights, // Weights to apply
                            const psVector *masks, // Mask to apply
                            psMaskType maskVal // Value to mask
                            )
{
    assert(values && weights && masks);
    assert(values->n == weights->n);
    assert(values->n == masks->n);
    assert(values->type.type == PS_TYPE_F32);
    assert(weights->type.type == PS_TYPE_F32);
    assert(masks->type.type == PS_TYPE_MASK);

    float sumValueWeight = 0.0; // Sum of the value multiplied by the weight
    float sumWeight = 0.0;      // Sum of the weights
    for (int i = 0; i < values->n; i++) {
        if (!(masks->data.PS_TYPE_MASK_DATA[i] & maskVal)) {
            sumValueWeight += values->data.F32[i] * weights->data.F32[i];
            sumWeight += weights->data.F32[i];
        }
    }
    if (sumWeight <= 0) {
        return false;
    }

    *mean = sumValueWeight / sumWeight;
    return true;
}

// Generate a standard deviation for the combination
// Not using psVectorStats because it has additional allocations which slow things down
static bool combinationStdev(float *median, // Median value, to return
                             float *stdev, // Standard deviation value, to return
                             const psVector *values, // Values to combine
                             const psVector *masks, // Mask to apply
                             psMaskType maskVal, // Value to mask
                             psVector *sortBuffer // Buffer for sorting
                             )
{
    assert(values && masks);
    assert(values->n == masks->n);
    assert(values->type.type == PS_TYPE_F32);
    assert(masks->type.type == PS_TYPE_MASK);
    assert(sortBuffer && sortBuffer->nalloc >= values->n && sortBuffer->type.type == PS_TYPE_F32);

    int num = 0;            // Number of valid values
    for (int i = 0; i < values->n; i++) {
        if (!(masks->data.PS_TYPE_MASK_DATA[i] & maskVal)) {
            sortBuffer->data.F32[num++] = values->data.F32[i];
        }
    }
    sortBuffer->n = num;
    if (!psVectorSortInPlace(sortBuffer)) {
        return false;
    }
    *median = num % 2 ? (sortBuffer->data.F32[num / 2] + sortBuffer->data.F32[num / 2 + 1]) / 2.0 :
        sortBuffer->data.F32[num / 2];
    *stdev = 0.74 * (sortBuffer->data.F32[(int)(0.75 * num)] - sortBuffer->data.F32[(int)(0.25 * num)]);

    return true;
}

// Generate a variance value for the combination
static bool combinationVariance(float *variance, // Variance value, to return
                                const psVector *variances, // Pixel variances to combine
                                const psVector *weights, // Image weights to apply
                                const psVector *masks, // Mask to apply
                                psMaskType maskVal // Value to mask
                                )
{
    assert(variances && weights && masks);
    assert(variances->n == weights->n);
    assert(variances->n == masks->n);
    assert(variances->type.type == PS_TYPE_F32);
    assert(weights->type.type == PS_TYPE_F32);
    assert(masks->type.type == PS_TYPE_MASK);

    // Get the variance in the combination.  We're not using the input pixel variances to generate a
    // weighted average for the pixel flux (because that introduces systematic biases), so the variance
    // of the output pixel value should simply be:
    //     simga^2 = sum(weight_i^2 * sigma_i^2) / (sum(weight_i))^2
    // This reduces, when the weights are all identically unity, to:
    //     variance_combination = sum(variance_i) / N^2
    // and if the variances are all equal:
    //     variance_combination = variance_individual / N
    // which makes sense --- the standard deviation of the combination is reduced by a factor of sqrt(N).

    float sumWeights = 0.0;             // Sum of the global weights
    float sumVarianceWeights = 0.0;     // Sum of the pixel variances multiplied by the global weights
    for (int i = 0; i < variances->n; i++) {
        if (!(masks->data.PS_TYPE_MASK_DATA[i] & maskVal)) {
            sumVarianceWeights += variances->data.F32[i] * PS_SQR(weights->data.F32[i]);
            sumWeights += weights->data.F32[i];
        }
    }

    if (sumWeights <= 0) {
        return false;
    }

    *variance = sumVarianceWeights / PS_SQR(sumWeights);
    return true;
}

// Given a stack of images, combine with optional rejection.
// Pixels in the stack that are rejected are marked for subsequent
static bool combinePixels(psImage *image, // Combined image, for output
                          psImage *mask, // Combined mask, for output
                          psImage *weight, // Combined variance map, for output
                          const psArray *inputs, // Stack data
                          const psVector *weights, // Global (single value) weights for data, or NULL
                          const psVector *reject, // Indices of pixels to reject, or NULL
                          int x, int y, // Coordinates of interest
                          psMaskType maskVal, // Value to mask
                          psMaskType bad, // Value to give bad pixels
                          int numIter, // Number of rejection iterations
                          float rej, // Number of standard deviations at which to reject
                          combineBuffer *buffer // Buffer for combination; to avoid multiple allocations
                         )
{
    // Rudimentary error checking
    assert(image);
    assert(mask);
    assert(inputs);
    assert(numIter >= 0);
    assert(rej > 0);
    assert(buffer);

    int num = inputs->n;          // Number of images to combine

    psVector *pixelData = buffer->pixels; // Values for the pixel of interest
    psVector *pixelMasks = buffer->masks; // Masks for the pixel of interest
    psVector *pixelWeights = buffer->weights; // Weights for the pixel of interest
    psVector *sort = buffer->sort;      // Sort buffer

    // Extract the pixel and mask data
    int numBad = 0;                     // Number of bad pixels
    for (int i = 0; i < num; i++) {
        pmStackData *data = inputs->data[i]; // Stack data of interest
        if (!data) {
            continue;
        }
        psImage *image = data->readout->image; // Image of interest
        psImage *weight = data->readout->weight; // Weight map of interest
        psImage *mask = data->readout->mask; // Mask of interest
        pixelData->data.F32[i] = image->data.F32[y][x];
        if (weight) {
            pixelWeights->data.F32[i] = weight->data.F32[y][x];
        }
        pixelMasks->data.PS_TYPE_MASK_DATA[i] = mask->data.PS_TYPE_MASK_DATA[y][x];
        if (pixelMasks->data.PS_TYPE_MASK_DATA[i] & maskVal) {
            numBad++;
        }
    }
    if (numBad == num) {
        // Catch the case where everything is masked
        image->data.F32[y][x] = NAN;
        if (weight) {
            weight->data.F32[y][x] = NAN;
        }
        mask->data.PS_TYPE_MASK_DATA[y][x] = bad;
        return false;
    }

    if (reject) {
        for (int i = 0; i < reject->n; i++) {
            pixelMasks->data.PS_TYPE_MASK_DATA[reject->data.U16[i]] |= maskVal;
        }
    }

    // Record the value derived with no clipping, because pixels rejected using the harsh clipping applied in
    // the first pass might later be accepted.
    float mean, variance;               // Mean and variance of the combination
    if (!combinationMean(&mean, pixelData, weights, pixelMasks, maskVal) ||
        (weight && !combinationVariance(&variance, pixelWeights, weights, pixelMasks, maskVal))) {
        image->data.F32[y][x] = NAN;
            mask->data.PS_TYPE_MASK_DATA[y][x] = bad;
        if (weight) {
            weight->data.F32[y][x] = NAN;
        }
        return false;
    }

    image->data.F32[y][x] = mean;
    if (weight) {
        weight->data.F32[y][x] = variance;
    }
    mask->data.PS_TYPE_MASK_DATA[y][x] = 0;

    // The clipping that follows is solely to identify suspect pixels.
    // These suspect pixels will be inspected in more detail by other functions.
    long numClipped = LONG_MAX;         // Number of pixels clipped
    psMaskType ignore = maskVal | bad;  // Ignore values with this mask value
    for (int i = 0; i < numIter && numClipped > 0; i++) {
        float median, stdev;                    // Median and stdev of the combination, for rejection
        // Only get the mean if it's not the first iteration (because we got the mean earlier)
        if (!combinationStdev(&median, &stdev, pixelData, pixelMasks, maskVal, sort)) {
            image->data.F32[y][x] = NAN;
            mask->data.PS_TYPE_MASK_DATA[y][x] = bad;
            weight->data.F32[y][x] = NAN;
            return false;
        }

        float limit = rej * stdev; // Rejection limit
        numClipped = 0;
        for (int j = 0; j < num; j++) {
            if (pixelMasks->data.PS_TYPE_MASK_DATA[j] & ignore) {
                continue;
            }
            float diff = pixelData->data.F32[j] - median;
            if (fabsf(diff) > limit) {
                // Add the pixel as one to inspect
                pmStackData *data = inputs->data[j]; // Stack data of interest
                if (!data) {
                    continue;
                }
                data->pixels = psPixelsAdd(data->pixels, PIXEL_LIST_BUFFER, x, y);
                // Mask it so it's not considered in other iterations within this function
                pixelMasks->data.PS_TYPE_MASK_DATA[j] |= bad;
                numClipped++;
            }
        }
    }

    return true;
}


// Ensure the input array of pmStackData is valid, and get some details out of it
static bool validateInputData(bool *haveWeights, // Do we have weights in the sky images?
                              bool *havePixels, // Do we have lists of pixels?
                              int *num,    // Number of inputs
                              int *numCols, int *numRows, // Size of (sky) images
                              psArray *input // Input array of pmStackData to validate
    )
{
    PS_ASSERT_ARRAY_NON_NULL(input, false);
    *num = input->n;

    pmStackData *data = NULL;           // First image off the rank, used as a template
    for (int i = 0; !data && i < input->n; i++) {
        data = input->data[i];
    }
    PS_ASSERT_PTR_NON_NULL(data, false);
    assert(psMemGetDeallocator(data) == (psFreeFunc)stackDataFree); // Ensure it's the right type
    *haveWeights = false;
    PS_ASSERT_IMAGE_NON_NULL(data->readout->image, false);
    PS_ASSERT_IMAGE_TYPE(data->readout->image, PS_TYPE_F32, false);
    PS_ASSERT_IMAGE_NON_NULL(data->readout->mask, false);
    PS_ASSERT_IMAGE_TYPE(data->readout->mask, PS_TYPE_MASK, false);
    PS_ASSERT_IMAGES_SIZE_EQUAL(data->readout->image, data->readout->mask, false);
    *numCols = data->readout->image->numCols;
    *numRows = data->readout->image->numRows;
    if (data->readout->weight) {
        *haveWeights = true;
        PS_ASSERT_IMAGE_NON_NULL(data->readout->weight, false);
        PS_ASSERT_IMAGES_SIZE_EQUAL(data->readout->image, data->readout->weight, false);
        PS_ASSERT_IMAGE_TYPE(data->readout->weight, PS_TYPE_F32, false);
    }
    *havePixels = (data->pixels != NULL);

    // Make sure the rest correspond with the first
    for (int i = 1; i < *num; i++) {
        pmStackData *data = input->data[i]; // Stack data for this input
        if (!data) {
            continue;
        }
        assert(psMemGetDeallocator(data) == (psFreeFunc)stackDataFree); // Ensure it's the right type
        if (!data->readout) {
            psError(PS_ERR_UNEXPECTED_NULL, true, "The readout is specified in some but not all inputs.");
            return false;
        }
        if ((*havePixels && !data->pixels) || (data->pixels && !*havePixels)) {
            psError(PS_ERR_UNEXPECTED_NULL, true, "The pixels are specified in some but not all inputs.");
            return false;
        }
        PS_ASSERT_IMAGE_NON_NULL(data->readout->image, false);
        PS_ASSERT_IMAGE_NON_NULL(data->readout->mask, false);
        PS_ASSERT_IMAGE_TYPE(data->readout->image, PS_TYPE_F32, false);
        PS_ASSERT_IMAGE_TYPE(data->readout->mask, PS_TYPE_MASK, false);
        PS_ASSERT_IMAGE_SIZE(data->readout->image, *numCols, *numRows, false);
        PS_ASSERT_IMAGES_SIZE_EQUAL(data->readout->image, data->readout->mask, false);
        if (*haveWeights) {
            PS_ASSERT_IMAGE_NON_NULL(data->readout->weight, false);
            PS_ASSERT_IMAGES_SIZE_EQUAL(data->readout->image, data->readout->weight, false);
            PS_ASSERT_IMAGE_TYPE(data->readout->weight, PS_TYPE_F32, false);
        }
    }

    return true;
}


#if 0
// Examine a pixel carefully to see if it should be rejected in the stack by convolving all the input images
// to the same seeing, and clipping there.
static bool convolveTest(psVector *reject, // Image indices to reject for this pixel (output)
                         psVector *inspect, // Images indices to inspect for this pixel (input)
                         psArray *input, // The input pmStackData
                         int xPix, int yPix,   // Pixel coordinates of interest
                         psVector *seeing, // Seeing convolution for each image
                         psMaskType maskVal, // Value to mask
                         float extent,   // Extent of convolution (Gaussian sigmas)
                         float threshold// Rejection threshold (standard deviations)
    )
{
    assert(reject && reject->type.type == PS_TYPE_U16);
    assert(input);
    assert(seeing);
    assert(seeing->n == input->n);

    int num = input->n;                // Number of input images
    psStats *stats = psStatsAlloc(PS_STAT_SAMPLE_MEAN | PS_STAT_SAMPLE_STDEV); // Statistics
    psVector *values = psVectorAlloc(num, PS_TYPE_F32); // Values from convolving the image
    psVector *valuesMask = psVectorAlloc(num, PS_TYPE_MASK); // Mask for convolution values

    for (int i = 0; i < num; i++) {
        pmStackData *data = input->data[i]; // Stacking data
        int radius = extent * seeing->data.F32[i]; // How much to convolve
        psImage *image = data->readout->image; // Image to convolve
        psImage *mask = data->readout->mask; // Image mask

        int xMin = PS_MAX(xPix - radius, 0);
        int xMax = PS_MIN(xPix + radius, image->numCols - 1);
        int yMin = PS_MAX(yPix - radius, 0);
        int yMax = PS_MIN(yPix + radius, image->numRows - 1);

        float sum = 0.0;            // Sum of pixels in convolution
        float sumKernel = 0.0;      // Sum of kernel
        for (int y = yMin; y <= yMax; y++) {
            int v2 = PS_SQR(y - yPix);
            for (int x = xMin; x <= xMax; x++) {
                int u2 = PS_SQR(x - xPix);
                float kernel = expf(-(u2 + v2) / seeing->data.F32[i]);
                if (!(mask->data.PS_TYPE_MASK_DATA[y][x] & maskVal)) {
                    sum += image->data.F32[y][x] * kernel;
                    sumKernel += kernel;
                }
            }
        }

        if (sumKernel != 0.0) {
            values->data.F32[i] = sum / sumKernel;
            valuesMask->data.PS_TYPE_MASK_DATA[i] = 0;
        } else {
            // Everything's masked out; don't include this pixel in the analysis
            values->data.F32[i] = NAN;
            valuesMask->data.PS_TYPE_MASK_DATA[i] = MASK_BAD;
        }
    }

    // Mask the ones we're inspecting
    for (int i = 0; i < inspect->n; i++) {
        valuesMask->data.PS_TYPE_MASK_DATA[inspect->data.U16[i]] |= MASK_SUSPECT;
    }

    if (!psVectorStats(stats, values, NULL, valuesMask, MASK_BAD | MASK_SUSPECT)) {
        psFree(stats);
        psFree(values);
        psFree(valuesMask);
        return false;
    }

    // Inspect the pixels of interest
    float mean = stats->sampleMean;       // Mean value
    float limit = threshold * stats->sampleStdev; // Rejection threshold
    for (int j = 0; j < inspect->n; j++) {
        int index = inspect->data.U16[j]; // Index of interest
        if (fabsf(values->data.F32[index] - mean) > limit) {
            reject->data.U16[reject->n++] = index;
        }
    }

    psFree(stats);
    psFree(values);
    psFree(valuesMask);

    return true;
}
#endif


// Generate a "pixel map".
//
// A "pixel map" is an image-like structure containing a vector that contains the indices of images.  The idea
// is to provide a reverse lookup for an array of pixel lists, so that the image for which a pixel is flagged
// can be identified easily.
static psArray *pixelMapGenerate(const psArray *input, // Data to stack
                                 int numCols, int numRows // Size of (sky) images
    )
{
    psArray *map = psArrayAlloc(numRows); // The pixel map
    for (int y = 0; y < numRows; y++) {
        map->data[y] = psArrayAlloc(numCols);
    }

    for (int i = 0; i < input->n; i++) {
        pmStackData *data = input->data[i];
        if (!data) {
            continue;
        }
        assert(data->pixels);
        psPixels *pixels = data->pixels;// The pixels of interest
        for (int j = 0; j < pixels->n; j++) {
            int x = pixels->data[j].x, y = pixels->data[j].y; // Coordinates of interest
            psArray *columns = map->data[y]; // The columns for that row
            psVector *images = columns->data[x]; // The images for that column
            if (!images) {
                images = columns->data[x] = psVectorAllocEmpty(PIXEL_MAP_BUFFER, PS_TYPE_U16);
            }
            int size = images->n;       // Element number at which to add
            columns->data[x] = psVectorExtend(images, PIXEL_MAP_BUFFER, 1);
            images->data.U16[size] = i;
        }
    }

    return map;
}

// Query a "pixel map", by returning the list of image indices for a particular pixel.
static psVector *pixelMapQuery(const psArray *map, // Pixel map
                               int x, int y // Coordinates of interest
    )
{
    assert(y >= 0 && y < map->n);
    psArray *colMap = map->data[y];     // Columns for that row
    assert(x >= 0 && x < colMap->n);
    return colMap->data[x];
}


//////////////////////////////////////////////////////////////////////////////////////////////////////////////
// Public functions
//////////////////////////////////////////////////////////////////////////////////////////////////////////////

/// Constructor
pmStackData *pmStackDataAlloc(pmReadout *readout, float weight)
{
    pmStackData *data = psAlloc(sizeof(pmStackData)); // Stack data, to return
    psMemSetDeallocator(data, (psFreeFunc)stackDataFree);

    data->readout = psMemIncrRefCounter(readout);
    data->pixels = NULL;
    data->weight = weight;

    return data;
}

/// Stack input images
bool pmStackCombine(pmReadout *combined, psArray *input, psMaskType maskVal, psMaskType bad,
                    int numIter, float rej)
{
    PS_ASSERT_PTR_NON_NULL(combined, false);
    bool haveWeights;                   // Do we have the weight maps?
    bool havePixels;                    // Do we have lists of pixels?
    int num;                            // Number of inputs
    int numCols, numRows;               // Size of (sky) images
    if (!validateInputData(&haveWeights, &havePixels, &num, &numCols, &numRows, input)) {
        return false;
    }
    PS_ASSERT_INT_POSITIVE(bad, false);
    PS_ASSERT_INT_NONNEGATIVE(numIter, false);
    PS_ASSERT_FLOAT_LARGER_THAN(rej, 0.0, false);
    if (havePixels) {
        // This is a subsequent combination, so expect that the image and mask already exist
        PS_ASSERT_IMAGE_NON_NULL(combined->image, false);
        PS_ASSERT_IMAGE_TYPE(combined->image, PS_TYPE_F32, false);
        PS_ASSERT_IMAGE_NON_NULL(combined->mask, false);
        PS_ASSERT_IMAGE_TYPE(combined->mask, PS_TYPE_MASK, false);
        PS_ASSERT_IMAGES_SIZE_EQUAL(combined->image, combined->mask, false);
    }

    // Pull out the weightings
    psVector *weights = psVectorAlloc(num, PS_TYPE_F32);
    for (int i = 0; i < num; i++) {
        pmStackData *data = input->data[i]; // Stack data for this input
        if (!data) {
            weights->data.F32[i] = 0.0;
        }
        weights->data.F32[i] = data->weight;
    }

    // Buffer for combination
    combineBuffer *buffer = combineBufferAlloc(num, numIter == 0 ? PS_STAT_SAMPLE_MEAN :
                                               PS_STAT_SAMPLE_MEAN | PS_STAT_SAMPLE_MEDIAN);

    if (havePixels) {
        // Only combine select pixels
        psImage *combinedImage = combined->image; // Combined image
        psImage *combinedMask = combined->mask; // Combined mask
        psImage *combinedWeight = combined->weight; // Combined mask

        psArray *pixelMap = pixelMapGenerate(input, numCols, numRows); // Map of pixels to source
        psPixels *pixels = NULL;            // Total list of pixels, with no duplicates
        for (int i = 0; i < num; i++) {
            pmStackData *data = input->data[i]; // Stacking data; contains the list of pixels
            if (!data) {
                continue;
            }
            pixels = psPixelsConcatenate(pixels, data->pixels);
            data->pixels = psPixelsRealloc(data->pixels, PIXEL_LIST_BUFFER); // Just in case more rejection
        }
        for (int i = 0; i < pixels->n; i++) {
            int x = pixels->data[i].x, y = pixels->data[i].y; // Coordinates of interest
            psVector *reject = pixelMapQuery(pixelMap, x, y); // Inspect these images closely
            combinePixels(combinedImage, combinedMask, combinedWeight, input, weights, reject, x, y,
                          maskVal, bad, numIter, rej, buffer);
        }
        psTrace("psModules.imcombine", 5, "Additional %ld pixels fixed.\n", pixels->n);
        psFree(pixels);
        psFree(pixelMap);
    } else {
        // Pull the products out, allocate if necessary
        psImage *combinedImage = combined->image; // Combined image
        if (!combinedImage) {
            combined->image = psImageAlloc(numCols, numRows, PS_TYPE_F32);
            combinedImage = combined->image;
        }
        psImage *combinedMask = combined->mask; // Combined mask
        if (!combinedMask) {
            combined->mask = psImageAlloc(numCols, numRows, PS_TYPE_MASK);
            combinedMask = combined->mask;
        }

        psImage *combinedWeights = combined->weight; // Combined weight map
        if (haveWeights && !combinedWeights) {
            combined->weight = psImageAlloc(numCols, numRows, PS_TYPE_F32);
            combinedWeights = combined->weight;
        }

        // Generate the pixel lists in which to place the rejected pixels
        if (numIter != 0) {
            for (int i = 0; i < num; i++) {
                pmStackData *data = input->data[i]; // Stack data for this input
                if (!data) {
                    continue;
                }
                data->pixels = psPixelsAllocEmpty(PIXEL_LIST_BUFFER);
            }
        }

        for (int y = 0; y < numRows; y++) {
            for (int x = 0; x < numCols; x++) {
                combinePixels(combinedImage, combinedMask, combinedWeights, input, weights, NULL, x, y,
                              maskVal, bad, numIter, rej, buffer);
            }
        }

#ifndef PS_NO_TRACE
        if (psTraceGetLevel("psModules.imcombine") >= 5) {
            for (int i = 0; i < num; i++) {
                pmStackData *data = input->data[i]; // Stack data for this input
                if (!data) {
                    continue;
                }
                psTrace("psModules.imcombine", 5, "Image %d: %ld pixels to inspect.\n", i, data->pixels->n);
            }
        }
#endif
    }

    psFree(weights);
    psFree(buffer);

    return true;
}

#if 0
bool pmStackReject(psArray *input, psMaskType maskVal, float extent, float threshold)
{
    bool haveWeights;                   // Do we have the sky weight maps?
    bool havePixels;                    // Do we have lists of pixels?
    int num;                            // Number of inputs
    int numCols, numRows;               // Size of (sky) images
    if (!validateInputData(&haveWeights, &havePixels, &num, &numCols, &numRows, input)) {
        return false;
    }
    if (!havePixels) {
        psError(PS_ERR_UNEXPECTED_NULL, true, "No pixels have been flagged for possible rejection.");
        return false;
    }
    PS_ASSERT_FLOAT_LARGER_THAN(extent, 0.0, false);

    // Want to concatenate the list of pixels, but also want to know where each came from
    psArray *pixelMap = pixelMapGenerate(input, numCols, numRows); // Map of pixels to source
    psPixels *pixels = NULL;            // Total list of pixels, with no duplicates
    for (int i = 0; i < num; i++) {
        pmStackData *data = input->data[i]; // Stacking data; contains the list of pixels
        pixels = psPixelsConcatenate(pixels, data->pixels);
        // Throw out the old in preparation for the new
        data->pixels = psPixelsRealloc(data->pixels, 0);
    }

    // Get the convolution widths
    psVector *seeing = psVectorAlloc(num, PS_TYPE_F32); // Seeing for each image
    const float fwhm2sigma = 1.0 / (2.0*sqrt((double)2.0*(log((double)2.0)))); // Conversion FWHM --> sigma
    float seeingMax = -INFINITY;                // Maximum FWHM
    for (int i = 0; i < num; i++) {
        pmStackData *data = input->data[i]; // Stacking data
        seeing->data.F32[i] = data->seeing * fwhm2sigma;
        if (data->seeing > seeingMax) {
            seeingMax = data->seeing;
        }
    }
    (void)psBinaryOp(seeing, seeing, "*", seeing);
    (void)psBinaryOp(seeing, psScalarAlloc(PS_SQR(seeingMax), PS_TYPE_F32), "-", seeing);
    (void)psUnaryOp(seeing, seeing, "sqrt");


    psVector *reject = psVectorAllocEmpty(num, PS_TYPE_U16); // Image indices to reject for a given pixel

    for (int i = 0; i < pixels->n; i++) {
        int x = pixels->data[i].x;      // x coordinate of interest
        int y = pixels->data[i].y;      // y coordinate of interest
        psVector *inspect = pixelMapQuery(pixelMap, x, y); // Inspect these images closely

        // Can daisy-chain multiple tests here
        reject->n = 0;

        if (!convolveTest(reject, inspect, input, x, y, seeing, maskVal, extent, threshold)) {
            // Some sort of error message here; NAN and mask all the pixels
            for (int i = 0; i < num; i++) {
                pmStackData *data = input->data[i]; // Stacking data
                psPixelsAdd(data->pixels, PIXEL_LIST_BUFFER, x, y);
            }
            continue;
        }

        // Add the rejected pixels to the official rejection list
        for (int i = 0; i < reject->n; i++) {
            pmStackData *data = input->data[reject->data.U16[i]]; // Stacking data
            psPixelsAdd(data->pixels, PIXEL_LIST_BUFFER, x, y);
        }
    }
    psFree(reject);
    psFree(seeing);
    psFree(pixels);
    psFree(pixelMap);

#ifndef PS_NO_TRACE
    if (psTraceGetLevel("psModules.imcombine") >= 5) {
        for (int i = 0; i < num; i++) {
            pmStackData *data = input->data[i]; // Stack data for this input
            psTrace("psModules.imcombine", 5, "Image %d: %ld pixels rejected.\n", i, data->pixels->n);
        }
    }
#endif

    return true;
}
#endif
