-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMatrixFilter.c
More file actions
62 lines (51 loc) · 1.34 KB
/
Copy pathMatrixFilter.c
File metadata and controls
62 lines (51 loc) · 1.34 KB
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
#include <stdio.h>
int main(){
//Taking the matrix input
int m = 0, n = 0;
printf("Input the matrix size: ");
scanf("%d", &m);
int a[m][m];
printf("\nInput the matrix:\n");
for(int j = 0; j < m; j++){
for(int k = 0; k < m; k++){
scanf("%d", &a[j][k]);
}
}
//Taking the input of the filter matrix
printf("\nInput the matrix size: ");
scanf("%d", &n);
int f[n][n];
printf("\nInput the filter matrix in 0s and 1s:\n");
for(int j = 0; j < n; j++){
for(int k = 0; k < n; k++){
scanf("%d", &f[j][k]);
}
}
//Creating the filtered matrix
int b[m][m], sum = 0;
//Filtering the matrix
for(int i = 0; i < m; i++){
for(int j = 0; j < m; j++){
for(int u = -1*(n/2); u <= n/2; u++){
for(int v = -1*(n/2); v <= n/2; v++){
if((i+u) < 0 || (j+v) < 0 || (j+v) >= m|| (i+u) >= m){
sum += 0;
}
else{
sum += a[i+u][j+v] * f[u+(n/2)][v+(n/2)];
}
}
}
b[i][j] = sum;
sum = 0;
}
}
//Printing the output
printf("\nThe filtered matrix is:\n");
for(int j = 0; j < m; j++){
for(int k = 0; k < m; k++){
printf("%d ", b[j][k]);
}
printf("\n");
}
}