RebuilderAverageOptimized.h

Go to the documentation of this file.

#ifndef CLASS_REBUILDERAVERAGEOPTIMIZED
#define CLASS_REBUILDERAVERAGEOPTIMIZED

#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

#include "Rebuilder.h"
#include "Images.h"
#include "DataBlock.h"
#include <iostream>
#include <vector>

using namespace std;

class RebuilderAverageOptimized: public Rebuilder{

public:

    RebuilderAverageOptimized(){};

    ~RebuilderAverageOptimized(){};

    virtual void hidden(Images* img, bool show_data){
        DataBlock** matrix = img->getMatrix();
        int amount_channels = img->getType();
        int count;
        int neighbors=8;
        int w = img->getWidth()/img->getWidthBlock();
        int h = img->getHeight()/img->getHeightBlock();
        do{
            for(int i = 0; i < h; i++){
                for(int j = 0; j < w; j++){
                    if((!matrix[i][j].isValid()) && amountNeighbors(img,i,j)>=neighbors) // si el bloque no es válido
                    {
                        vector<int> add(amount_channels);
                        for(int x=0;x<amount_channels;x++)
                            add[x]=0;
                        count = 0;
                        /* cálculo del promedio de los canales de los vecinos */
                        for(int iBlock = max((int)i-1,0); iBlock <= min(i+1,h-1) ; iBlock++)   
                            for(int jBlock = max((int)j-1,0); jBlock <= min(j+1,w-1); jBlock++) 
                                if((i != iBlock) || (j != jBlock))
                                    if(matrix[iBlock][jBlock].isValid()) // si el bloque vecino existe
                                    {
                                        vector<Pixel> *e = (vector<Pixel>*)matrix[iBlock][jBlock].getExtras();
                                        for(int r=0;r<img->getHeightBlock();r++){
                                            for(int c=0;c<img->getWidthBlock();c++){
                                                vector<int> chnls = e->at((r*img->getWidthBlock())+c).getChannels();
                                                for(int x=0;x<amount_channels;x++){
                                                    add[x]+=chnls[x];
                                                }
                                                count++;
                                            }
                                        }
                                    }           
                        if(count!=0)
                        {
                            for(int x=0;x<amount_channels;x++){
                                add[x]=(int)(add[x]/count);
                                //cout << add[x] << "---";
                            }
                            //cout << i << "-" << j << "\n";
                            DataBlock* px = new DataBlock(amount_channels,add,img->getWidthBlock(),img->getHeightBlock());
                            matrix[i][j]= *px;
                        }
                    }
                }
            }
            neighbors-=1;
        }while(neighbors>=0 && isLossBlock(img));
        if(show_data)
            cout << "The Image has been restored\n";
    }

private:

    int amountNeighbors(Images* img, int i, int j){
        int w = img->getWidth()/img->getWidthBlock();
        int h = img->getHeight()/img->getHeightBlock();
        DataBlock** matrix=img->getMatrix();
        int neighbors=0;
        for(int iBlock = max((int)i-1,0); iBlock <= min(i+1,h-1) ; iBlock++)   
            for(int jBlock = max((int)j-1,0); jBlock <= min(j+1,w-1); jBlock++) 
                if((i != iBlock) || (j != jBlock))
                    if(matrix[iBlock][jBlock].isValid()) // si el bloque vecino existe
                    {
                        neighbors++;
                    }
        //cout << "(" << i << "," << j << "):" << neighbors << "--\n";
        return neighbors;
    }

    bool isLossBlock(Images* img){
        DataBlock** matrix = img->getMatrix();
        int w=img->getWidth()/img->getWidthBlock();
        int h=img->getHeight()/img->getHeightBlock();
        for (int i = 0; i < h; ++i)
        {
            for (int j = 0; j < w; ++j)
            {
                if(!matrix[i][j].isValid())
                    return true;
            }
        }
        return false;
    }

};
#endif