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
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
|
# Copyright(c) 1986 Association of Universities for Research in Astronomy Inc.
include "../icombine.h"
# IC_MEDIAN -- Median of lines
procedure ic_medians (d, n, npts, median)
pointer d[ARB] # Input data line pointers
int n[npts] # Number of good pixels
int npts # Number of output points per line
real median[npts] # Median
int i, j, k, j1, j2, n1, lo, up, lo1, up1
bool even
real val1, val2, val3
short temp, wtemp
include "../icombine.com"
begin
# If no data return after possibly setting blank values.
if (dflag == D_NONE) {
do i = 1, npts
median[i]= blank
return
}
# If the data were previously sorted then directly compute the median.
if (mclip) {
if (dflag == D_ALL) {
n1 = n[1]
even = (mod (n1, 2) == 0)
j1 = n1 / 2 + 1
j2 = n1 / 2
do i = 1, npts {
k = i - 1
if (even) {
val1 = Mems[d[j1]+k]
val2 = Mems[d[j2]+k]
median[i] = (val1 + val2) / 2.
} else
median[i] = Mems[d[j1]+k]
}
} else {
do i = 1, npts {
k = i - 1
n1 = n[i]
if (n1 > 0) {
j1 = n1 / 2 + 1
if (mod (n1, 2) == 0) {
j2 = n1 / 2
val1 = Mems[d[j1]+k]
val2 = Mems[d[j2]+k]
median[i] = (val1 + val2) / 2.
} else
median[i] = Mems[d[j1]+k]
} else
median[i] = blank
}
}
return
}
# Compute the median.
do i = 1, npts {
k = i - 1
n1 = n[i]
# If there are more than 3 points use Wirth algorithm. This
# is the same as vops$amed.gx except for an even number of
# points it selects the middle two and averages.
if (n1 > 3) {
lo = 1
up = n1
j = max (lo, min (up, (up+1)/2))
while (lo < up) {
if (! (lo < up))
break
temp = Mems[d[j]+k]; lo1 = lo; up1 = up
repeat {
while (Mems[d[lo1]+k] < temp)
lo1 = lo1 + 1
while (temp < Mems[d[up1]+k])
up1 = up1 - 1
if (lo1 <= up1) {
wtemp = Mems[d[lo1]+k]
Mems[d[lo1]+k] = Mems[d[up1]+k]
Mems[d[up1]+k] = wtemp
lo1 = lo1 + 1; up1 = up1 - 1
}
} until (lo1 > up1)
if (up1 < j)
lo = lo1
if (j < lo1)
up = up1
}
median[i] = Mems[d[j]+k]
if (mod (n1,2) == 0) {
lo = 1
up = n1
j = max (lo, min (up, (up+1)/2)+1)
while (lo < up) {
if (! (lo < up))
break
temp = Mems[d[j]+k]; lo1 = lo; up1 = up
repeat {
while (Mems[d[lo1]+k] < temp)
lo1 = lo1 + 1
while (temp < Mems[d[up1]+k])
up1 = up1 - 1
if (lo1 <= up1) {
wtemp = Mems[d[lo1]+k]
Mems[d[lo1]+k] = Mems[d[up1]+k]
Mems[d[up1]+k] = wtemp
lo1 = lo1 + 1; up1 = up1 - 1
}
} until (lo1 > up1)
if (up1 < j)
lo = lo1
if (j < lo1)
up = up1
}
median[i] = (median[i] + Mems[d[j]+k]) / 2
}
# If 3 points find the median directly.
} else if (n1 == 3) {
val1 = Mems[d[1]+k]
val2 = Mems[d[2]+k]
val3 = Mems[d[3]+k]
if (val1 < val2) {
if (val2 < val3) # abc
median[i] = val2
else if (val1 < val3) # acb
median[i] = val3
else # cab
median[i] = val1
} else {
if (val2 > val3) # cba
median[i] = val2
else if (val1 > val3) # bca
median[i] = val3
else # bac
median[i] = val1
}
# If 2 points average.
} else if (n1 == 2) {
val1 = Mems[d[1]+k]
val2 = Mems[d[2]+k]
median[i] = (val1 + val2) / 2
# If 1 point return the value.
} else if (n1 == 1)
median[i] = Mems[d[1]+k]
# If no points return with a possibly blank value.
else
median[i] = blank
}
end
# IC_MEDIAN -- Median of lines
procedure ic_medianr (d, n, npts, median)
pointer d[ARB] # Input data line pointers
int n[npts] # Number of good pixels
int npts # Number of output points per line
real median[npts] # Median
int i, j, k, j1, j2, n1, lo, up, lo1, up1
bool even
real val1, val2, val3
real temp, wtemp
include "../icombine.com"
begin
# If no data return after possibly setting blank values.
if (dflag == D_NONE) {
do i = 1, npts
median[i]= blank
return
}
# If the data were previously sorted then directly compute the median.
if (mclip) {
if (dflag == D_ALL) {
n1 = n[1]
even = (mod (n1, 2) == 0)
j1 = n1 / 2 + 1
j2 = n1 / 2
do i = 1, npts {
k = i - 1
if (even) {
val1 = Memr[d[j1]+k]
val2 = Memr[d[j2]+k]
median[i] = (val1 + val2) / 2.
} else
median[i] = Memr[d[j1]+k]
}
} else {
do i = 1, npts {
k = i - 1
n1 = n[i]
if (n1 > 0) {
j1 = n1 / 2 + 1
if (mod (n1, 2) == 0) {
j2 = n1 / 2
val1 = Memr[d[j1]+k]
val2 = Memr[d[j2]+k]
median[i] = (val1 + val2) / 2.
} else
median[i] = Memr[d[j1]+k]
} else
median[i] = blank
}
}
return
}
# Compute the median.
do i = 1, npts {
k = i - 1
n1 = n[i]
# If there are more than 3 points use Wirth algorithm. This
# is the same as vops$amed.gx except for an even number of
# points it selects the middle two and averages.
if (n1 > 3) {
lo = 1
up = n1
j = max (lo, min (up, (up+1)/2))
while (lo < up) {
if (! (lo < up))
break
temp = Memr[d[j]+k]; lo1 = lo; up1 = up
repeat {
while (Memr[d[lo1]+k] < temp)
lo1 = lo1 + 1
while (temp < Memr[d[up1]+k])
up1 = up1 - 1
if (lo1 <= up1) {
wtemp = Memr[d[lo1]+k]
Memr[d[lo1]+k] = Memr[d[up1]+k]
Memr[d[up1]+k] = wtemp
lo1 = lo1 + 1; up1 = up1 - 1
}
} until (lo1 > up1)
if (up1 < j)
lo = lo1
if (j < lo1)
up = up1
}
median[i] = Memr[d[j]+k]
if (mod (n1,2) == 0) {
lo = 1
up = n1
j = max (lo, min (up, (up+1)/2)+1)
while (lo < up) {
if (! (lo < up))
break
temp = Memr[d[j]+k]; lo1 = lo; up1 = up
repeat {
while (Memr[d[lo1]+k] < temp)
lo1 = lo1 + 1
while (temp < Memr[d[up1]+k])
up1 = up1 - 1
if (lo1 <= up1) {
wtemp = Memr[d[lo1]+k]
Memr[d[lo1]+k] = Memr[d[up1]+k]
Memr[d[up1]+k] = wtemp
lo1 = lo1 + 1; up1 = up1 - 1
}
} until (lo1 > up1)
if (up1 < j)
lo = lo1
if (j < lo1)
up = up1
}
median[i] = (median[i] + Memr[d[j]+k]) / 2
}
# If 3 points find the median directly.
} else if (n1 == 3) {
val1 = Memr[d[1]+k]
val2 = Memr[d[2]+k]
val3 = Memr[d[3]+k]
if (val1 < val2) {
if (val2 < val3) # abc
median[i] = val2
else if (val1 < val3) # acb
median[i] = val3
else # cab
median[i] = val1
} else {
if (val2 > val3) # cba
median[i] = val2
else if (val1 > val3) # bca
median[i] = val3
else # bac
median[i] = val1
}
# If 2 points average.
} else if (n1 == 2) {
val1 = Memr[d[1]+k]
val2 = Memr[d[2]+k]
median[i] = (val1 + val2) / 2
# If 1 point return the value.
} else if (n1 == 1)
median[i] = Memr[d[1]+k]
# If no points return with a possibly blank value.
else
median[i] = blank
}
end
|
