Normand Briere
2019-11-07 f868664f7e7626f651e6ade9c9f6863851ef43b7
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
 
import java.lang.Math.*;
import java.awt.*;
 
/**
 * Class containing method to apply a frequency filter to an image.
 *
 * @author Simon Horne.
 */
public class FreqFilter
{
 
    /**
     * Method to apply a high or low pass filter to an image.
     *
     * @param input TwoDArray representing the image.
     * @param h boolean true - highpass, false - lowpass.
     * @return TwoDArray representing new image.
     */
    public static TwoDArray filter(TwoDArray input, boolean lowpass, double r)
    {
        TwoDArray output = new TwoDArray(input.values, input.size, input.size);
 
        int i2, j2;
        double r2 = r * r;
        if (lowpass)
        {//if low pass filter
            for (int j = 0; j < input.size; ++j)
            {
                for (int i = 0; i < input.size; ++i)
                {
                    if (i >= input.size / 2)
                    {
                        i2 = i - input.size;
                    } else
                    {
                        i2 = i;
                    }
                    if (j >= input.size / 2)
                    {
                        j2 = j - input.size;
                    } else
                    {
                        j2 = j;
                    }
                    double d2 = i2 * i2 + j2 * j2;
                    if (d2 > r2)
                    {
                        output.values[i][j] = new ComplexNumber(0, 0);
                    } else
                    {
                        output.values[i][j] = input.values[i][j];
                    }
                }
            }
        } else
        {//else high pass filter
            for (int j = 0; j < input.size; ++j)
            {
                for (int i = 0; i < input.size; ++i)
                {
                    if (i >= input.size / 2)
                    {
                        i2 = i - input.size;
                    } else
                    {
                        i2 = i;
                    }
                    if (j >= input.size / 2)
                    {
                        j2 = j - input.size;
                    } else
                    {
                        j2 = j;
                    }
                    double d2 = i2 * i2 + j2 * j2;
                    if (d2 > r2)
                    {
                        output.values[i][j] = input.values[i][j];
                    } else
                    {
                        output.values[i][j] = new ComplexNumber(0, 0);
                    }
                }
            }
        }
        return output;
    }
    
 
    /**
     * Method to apply a high or low pass filter to an image.
     */
    public static void filterCorners(double[] io, int size, boolean lowpass, double radius)
    {
        int i2, j2;
        double r2 = radius * radius;
        if (lowpass)
        {//if low pass filter
            for (int j = 0; j < size; ++j)
            {
                for (int i = 0; i < size; ++i)
                {
                    i2 = i;
                    if (i2 >= size / 2)
                    {
                        i2 -= size;
                    }
                    
                    j2 = j;
                    if (j2 >= size / 2)
                    {
                        j2 -= size;
                    }
                    
                    double d2 = i2 * i2 + j2 * j2;
                    if (d2 > r2)
                    {
                        io[j*size + i] = 0;
                    }
                }
            }
        } else
        {//else high pass filter
            for (int j = 0; j < size; ++j)
            {
                for (int i = 0; i < size; ++i)
                {
                    i2 = i;
                    if (i2 >= size / 2)
                    {
                        i2 -= size;
                    }
                    
                    j2 = j;
                    if (j2 >= size / 2)
                    {
                        j2 -= size;
                    }
                    
                    double d2 = i2 * i2 + j2 * j2;
                    if (d2 <= r2)
                    {
                        io[j*size + i] = 0;
                    }
                }
            }
        }
    }
    
    /**
     * Method to apply a high or low pass filter to an image.
     */
    public static void filterCenter(double[] io, int size, boolean lowpass, double radius)
    {
        int i2, j2;
        double r2 = radius * radius;
        if (lowpass)
        {//if low pass filter
            for (int j = 0; j < size; ++j)
            {
                for (int i = 0; i < size; ++i)
                {
                    i2 = i - size/2;
                    j2 = j - size/2;
                    
                    double d2 = i2 * i2 + j2 * j2;
                    if (d2 > r2)
                    {
                        io[j*size + i] = 0;
                    }
                }
            }
        } else
        {//else high pass filter
            for (int j = 0; j < size; ++j)
            {
                for (int i = 0; i < size; ++i)
                {
                    i2 = i - size/2;
                    j2 = j - size/2;
                    
                    double d2 = i2 * i2 + j2 * j2;
                    if (d2 <= r2)
                    {
                        io[j*size + i] = 0;
                    }
                }
            }
        }
    }
}