len = length(blocks);
n = sum(size(blocks)) - len;
currsum = sum(abs(blocks(n,1:len)));

int n = (this->width + this->height) - this->width;
double currsum = 0;

for(int i=0; (i < n); i++)
{
    currsum += blocks[i];

}

len = length(blocks);

n = sum(size(blocks)) - len;

currsum = sum(abs(blocks(n,1:len)));

currsum = sum(abs(blocks(end,:)))

int n = (this->width + this->height) - this->width;

int n = this->height;

currsum += blocks[i];

double currsum = 0;
for(int i=0; (i < this->width); i++)
{
    currsum += abs(blocks[this->height-1][i]);
}