Method processInputData

IPL/src/processes/IPLMorphologyBinary.cpp:155–250

bool IPLMorphologyBinary::processInputData(IPLData* data, int, bool useOpenCV)
{
    IPLImage* image = data->toImage();
	
    // delete previous result
    delete _result;
    _result = NULL;

    int width = image->width();
    int height = image->height();

    // get properties
    _kernel     = getProcessPropertyVectorInt("kernel");
    _iterations = getProcessPropertyInt("iterations");
    _operation  = getProcessPropertyInt("operation");

    if (std::accumulate(_kernel.begin(),_kernel.end(),0) == 0)
    {
        //Add an empty image - The image viewer currently may trigger
        //a segfault if we return NULL.
        _result = new IPLImage( IPL_IMAGE_BW, width, height);
        addError("Empty kernel.");
        return false;
    }

    // TODO: implement manhattan distance threshold instead of stupid iterations...
    // TODO: implement border interpolation properties

    enum Operation
    {
        DILATE = 0,
        ERODE,
        OPEN,
        CLOSE
    };

    if (!useOpenCV)
    {
        _result = new IPLImage( IPL_IMAGE_BW, width, height);

        //std::vector<bool> packs its elements bitwise into a vector of
        //bytes. The kernel therefore uses much less cpu cache this way.
        std::vector<bool> kernel;
        kernel.reserve(_kernel.size());
        for (auto &i: _kernel) kernel.push_back(i > 0);

        std::atomic<int> progress(0);
        int totalLines = image->height()*_iterations;
        auto updateProgress = [&]() {
            notifyProgressEventHandler(100*((float)++progress)/totalLines);
        };

        switch(_operation)
        {
        case DILATE:
            dilate(*image->plane(0),*_result->plane(0),_iterations,kernel,updateProgress);
            break;
        case ERODE: