Image-editor-program/applyboxblur.h at main · tiberiu04/Image-editor-program · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include "allocatedouble.h"
#include "structs.h"
#ifndef APPLYBOXBLUR_H
#define APPLYBOXBLUR_H

void applyboxblur(double ****temp, selection *select, image *img)
{
	double kernel[3][3];
	for (int i = 0; i < 3; i++)
		for (int j = 0; j < 3; j++)
			kernel[i][j] = 1; // kernelul standard
	double red, green, blue;
	int m = img->height;
	int n = img->width;
	for (int i = select->y1; i < select->y2; i++)
		for (int j = select->x1; j < select->x2; j++) {
			// verific daca are 8 vecini
			if (i > 0 && i < m - 1 && j > 0 && j < n - 1) { // aplicare filtru
				red = (*temp)[i - 1][j - 1][0] * kernel[0][0] +
								 (*temp)[i - 1][j][0] * kernel[0][1] +
								 (*temp)[i - 1][j + 1][0] * kernel[0][2] +
								 (*temp)[i][j - 1][0] * kernel[1][0] +
								 (*temp)[i][j][0] * kernel[1][1] +
								 (*temp)[i][j + 1][0] * kernel[1][2] +
								 (*temp)[i + 1][j - 1][0] * kernel[2][0] +
								 (*temp)[i + 1][j][0] * kernel[2][1] +
								 (*temp)[i + 1][j + 1][0] * kernel[2][2];
				red /= 9;
				img->rgb[i][j].red = (int)round(red);
			}
		}

	for (int i = select->y1; i < select->y2; i++)
		for (int j = select->x1; j < select->x2; j++) {
			// verific daca are 8 vecini
			if (i > 0 && i < m - 1 && j > 0 && j < n - 1) { // aplicare filtru
				green = (*temp)[i - 1][j - 1][1] * kernel[0][0] +
								 (*temp)[i - 1][j][1] * kernel[0][1] +
								 (*temp)[i - 1][j + 1][1] * kernel[0][2] +
								 (*temp)[i][j - 1][1] * kernel[1][0] +
								 (*temp)[i][j][1] * kernel[1][1] +
								 (*temp)[i][j + 1][1] * kernel[1][2] +
								 (*temp)[i + 1][j - 1][1] * kernel[2][0] +
								 (*temp)[i + 1][j][1] * kernel[2][1] +
								 (*temp)[i + 1][j + 1][1] * kernel[2][2];
				green /= 9;
				img->rgb[i][j].green = (int)round(green);
			}
		}

	for (int i = select->y1; i < select->y2; i++)
		for (int j = select->x1; j < select->x2; j++) {
			// verific ca are 8 vecini
			if (i > 0 && i < m - 1 && j > 0 && j < n - 1) { // aplicare filtru
				blue = (*temp)[i - 1][j - 1][2] * kernel[0][0] +
								 (*temp)[i - 1][j][2] * kernel[0][1] +
								 (*temp)[i - 1][j + 1][2] * kernel[0][2] +
								 (*temp)[i][j - 1][2] * kernel[1][0] +
								 (*temp)[i][j][2] * kernel[1][1] +
								 (*temp)[i][j + 1][2] * kernel[1][2] +
								 (*temp)[i + 1][j - 1][2] * kernel[2][0] +
								 (*temp)[i + 1][j][2] * kernel[2][1] +
								 (*temp)[i + 1][j + 1][2] * kernel[2][2];
				blue /= 9;
				img->rgb[i][j].blue = (int)round(blue);
			}
		}
}

#endif