/homes/esi30/DCS339/coursework/src/Processes/order_statistic.cpp

Go to the documentation of this file.

#include "../progress.hpp"
#include "order_statistic.hpp"

Image_unit* apply_order_statistic(const Image_unit *in, unsigned char radius, std::function<unsigned char(const std::vector<unsigned char>&)> select){
    Progress prog;

    Image_unit *out(new Image_unit(*in));

    std::vector<unsigned char> neighbors_red, neighbors_green, neighbors_blue;
    neighbors_red.reserve((radius*2+1)*(radius*2+1));
    neighbors_green.reserve((radius*2+1)*(radius*2+1));
    neighbors_blue.reserve((radius*2+1)*(radius*2+1));
    for(int y=0; y<static_cast<int>(out->height()); ++y){
        prog.advance(static_cast<double>(y)/out->height());
        for(int x=0; x<static_cast<int>(out->width()); ++x){
            neighbors_red.clear();
            neighbors_green.clear();
            neighbors_blue.clear();
            for(int dy=-static_cast<int>(radius); dy<=static_cast<int>(radius); ++dy)
                for(int dx=-static_cast<int>(radius); dx<=static_cast<int>(radius); ++dx){
                    if(x+dx>=0 && x+dx<static_cast<int>(out->width()) && y+dy>=0 && y+dy<static_cast<int>(out->height())){
                        neighbors_red.push_back(in->red(y+dy, x+dx));
                        neighbors_green.push_back(in->green(y+dy, x+dx));
                        neighbors_blue.push_back(in->blue(y+dy, x+dx));
                    }
                }
            std::sort(neighbors_red.begin(), neighbors_red.end());
            std::sort(neighbors_green.begin(), neighbors_green.end());
            std::sort(neighbors_blue.begin(), neighbors_blue.end());
            out->red(y, x, select(neighbors_red));
            out->green(y, x, select(neighbors_green));
            out->blue(y, x, select(neighbors_blue));
        }
    }

    return out;
}

namespace Processes{
    void order_statistic(){
    }
}