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
|
//# LatticeTwoPtCorr.cc: compute two point correlation functions of a lattice
//# Copyright (C) 1997,1998,1999,2000,2001,2003
//# Associated Universities, Inc. Washington DC, USA.
//#
//# This library is free software; you can redistribute it and/or modify it
//# under the terms of the GNU Library General Public License as published by
//# the Free Software Foundation; either version 2 of the License, or (at your
//# option) any later version.
//#
//# This library is distributed in the hope that it will be useful, but WITHOUT
//# ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
//# FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
//# License for more details.
//#
//# You should have received a copy of the GNU Library General Public License
//# along with this library; if not, write to the Free Software Foundation,
//# Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
//#
//# Correspondence concerning AIPS++ should be addressed as follows:
//# Internet email: aips2-request@nrao.edu.
//# Postal address: AIPS++ Project Office
//# National Radio Astronomy Observatory
//# 520 Edgemont Road
//# Charlottesville, VA 22903-2475 USA
//#
//# $Id$
#ifndef LATTICES_LATTICETWOPTCORR_TCC
#define LATTICES_LATTICETWOPTCORR_TCC
#include <casacore/lattices/LatticeMath/LatticeTwoPtCorr.h>
#include <casacore/casa/Arrays/Array.h>
#include <casacore/casa/Arrays/ArrayAccessor.h>
#include <casacore/casa/Arrays/Matrix.h>
#include <casacore/casa/Arrays/ArrayMath.h>
#include <casacore/casa/Arrays/IPosition.h>
#include <casacore/casa/Exceptions/Error.h>
#include <casacore/lattices/Lattices/LatticeIterator.h>
#include <casacore/lattices/Lattices/LatticeStepper.h>
#include <casacore/casa/Logging/LogIO.h>
#include <casacore/casa/Logging/LogOrigin.h>
#include <casacore/lattices/Lattices/MaskedLatticeIterator.h>
#include <casacore/casa/Utilities/Assert.h>
#include <casacore/casa/BasicSL/String.h>
/*
#include <casacore/casa/Arrays/ArrayIO.h>
#include <casacore/casa/iostream.h>
*/
namespace casacore { //# NAMESPACE CASACORE - BEGIN
template <class T>
void LatticeTwoPtCorr<T>::autoCorrelation (MaskedLattice<T>& latOut,
const MaskedLattice<T>& latIn,
const IPosition& axes,
Method method,
Bool showProgress) const
{
LogIO os(LogOrigin("LatticeTwoPtCorr", "autoCorrelation(...)", WHERE));
// Set up function pointer
FuncPtr funcPtr=0;
if (method==STRUCTUREFUNCTION) {
funcPtr = &LatticeTwoPtCorr<T>::structureFunction;
} else {
os << "Unimplemented method" << LogIO::EXCEPTION;
}
// Do the work
autoCorrelation (latOut, latIn, axes, funcPtr, showProgress);
}
template <class T>
IPosition LatticeTwoPtCorr<T>::setUpShape (const IPosition& inShape, const IPosition& axes)
{
AlwaysAssert (axes.nelements()==2, AipsError);
AlwaysAssert (inShape.nelements()>=2, AipsError);
//
IPosition outShape = inShape;
outShape(axes(0)) = (inShape(axes(0))-1)*2 + 1;
outShape(axes(1)) = (inShape(axes(1))-1)*2 + 1;
//
return outShape;
}
template <class T>
typename LatticeTwoPtCorr<T>::Method LatticeTwoPtCorr<T>::fromString (const String& methodU)
{
String method = methodU;
method.upcase();
typename LatticeTwoPtCorr<T>::Method m = LatticeTwoPtCorr<T>::UNDEFINED;
//
if (method.contains("STR")) {
m = LatticeTwoPtCorr<T>::STRUCTUREFUNCTION;
}
//
return m;
}
template <class T>
String LatticeTwoPtCorr<T>::toString (Method method)
{
String m;
if (method==LatticeTwoPtCorr<T>::STRUCTUREFUNCTION) {
m = String("structurefunction");
} else {
m = String("undefined");
}
//
return m;
}
// Private functions
template <class T>
void LatticeTwoPtCorr<T>::autoCorrelation (MaskedLattice<T>& latOut,
const MaskedLattice<T>& latIn,
const IPosition& axes,
FuncPtr funcPtr,
Bool showProgress) const
{
LogIO os(LogOrigin("LatticeTwoPtCorr", "autoCorrelation(...)", WHERE));
// Check output lattice shape and axes
check (os, latOut, latIn, axes);
//
IPosition shapeIn = latIn.shape();
IPosition shapeOut = latOut.shape();
uInt nDim = shapeIn.nelements();
IPosition axisPath = IPosition::makeAxisPath (nDim, axes);
// Make input iterator
Int nxIn = shapeIn(axes(0));
Int nyIn = shapeIn(axes(1));
IPosition cursorShapeIn(2, nxIn, nyIn);
LatticeStepper stepIn(shapeIn, cursorShapeIn, axes, axisPath);
RO_MaskedLatticeIterator<T> itIn(latIn, stepIn);
Bool inIsMasked = latIn.hasPixelMask();
// Make output iterators
Int nxOut = shapeOut(axes(0));
Int nyOut = shapeOut(axes(1));
IPosition cursorShapeOut(2, nxOut, nyOut);
LatticeStepper stepOut(shapeOut, cursorShapeOut, axes, axisPath);
LatticeIterator<T> itOut(latOut, stepOut);
Bool outIsMasked = latOut.hasPixelMask() && latOut.pixelMask().isWritable();
LatticeIterator<Bool>* itOutMaskPtr = 0;
if (outIsMasked) {
Lattice<Bool>& outMask = latOut.pixelMask();
itOutMaskPtr = new LatticeIterator<Bool>(outMask, stepOut);
}
// Matrices for plane by plane iteration results
Matrix<T> sumOut(nxOut, nyOut);
Matrix<Float> nPtsOut(nxOut, nyOut);
Matrix<Bool> maskOut(nxOut,nyOut);
// Iterate through image, plane by plane. The algorithm is too
// complicated if I iterate tile by tile
Int lxOff = (nxOut-1) / 2;
Int lyOff = (nyOut-1) / 2;
Int lx = 0;
Int ly = 0;
//
for (itIn.reset(),itOut.reset(); !itIn.atEnd(); itIn++,itOut++) {
if (showProgress) {
os << LogIO::NORMAL << "Processing position " << itIn.position() << LogIO::POST;
}
// Get data and mask
const Matrix<T>& dataIn(itIn.matrixCursor());
const Matrix<Bool>& maskIn(itIn.getMask(True));
// Initialize output
T zero(0.0);
sumOut.set (zero);
nPtsOut.set(0.0);
maskOut.set(False);
// Create ArrayAccessors to optimize access to Matricies
ArrayAccessor<T, Axis<1> > jIt(dataIn); // Outer loops
ArrayAccessor<T, Axis<0> > iIt;
ArrayAccessor<T, Axis<1> > jjIt(dataIn); // Inner loops
ArrayAccessor<T, Axis<0> > iiIt;
//
ArrayAccessor<T, Axis<1> > jjItS(sumOut); // Inner loops
ArrayAccessor<T, Axis<0> > iiItS(sumOut);
ArrayAccessor<Float, Axis<1> > jjItN(nPtsOut); // Inner loops
ArrayAccessor<Float, Axis<0> > iiItN(nPtsOut);
//
Int i,j,ii,jj,id,jd;
if (inIsMasked) {
// Create Mask accessors
ArrayAccessor<Bool, Axis<1> > jItM(maskIn); // Outer loops
ArrayAccessor<Bool, Axis<0> > iItM;
ArrayAccessor<Bool, Axis<1> > jjItM(maskIn); // Inner loops
ArrayAccessor<Bool, Axis<0> > iiItM;
//
ArrayAccessor<Bool, Axis<1> > jjItMOut(maskOut); // Inner loops
ArrayAccessor<Bool, Axis<0> > iiItMOut(maskOut);
//
for (j=0; j<nyIn; jIt++,jItM++,++j) {
iIt = jIt;
iItM = jItM;
jd = lyOff - j;
for (i=0; i<nxIn; iIt++,iItM++,++i) {
if (*iItM) {
for (jjIt.reset(),jjItM.reset(),jj=0; jj<nyIn; jjIt++,jjItM++,++jj) {
iiIt = jjIt;
iiItM = jjItM;
ly = jj + jd;
// Locate Accessors in output Matrices
iiItS.reset(jjItS.begin(ly)); // Position at row ly
iiItN.reset(jjItN.begin(ly));
iiItMOut.reset(jjItMOut.begin(ly));
id = lxOff - i;
//
for (ii=0; ii<nxIn; iiIt++,iiItM++,++ii) {
if (*iiItM) {
lx = ii + id;
//
iiItN[lx] += 1.0;
iiItMOut[lx] = True;
iiItS[lx] += ((*this).*funcPtr)(*iIt, *iiIt);
}
}
}
}
}
}
} else {
// No mask, so save a little time...
for (j=0; j<nyIn; jIt++,++j) {
iIt = jIt;
jd = lyOff - j;
for (i=0; i<nxIn; iIt++,++i) {
for (jjIt.reset(),jj=0; jj<nyIn; jjIt++,++jj) {
iiIt = jjIt;
ly = jj + jd;
// Locate Accessors in output Matrices
iiItS.reset(jjItS.begin(ly)); // Position at row ly
iiItN.reset(jjItN.begin(ly));
id = lxOff - i;
//
for (ii=0; ii<nxIn; iiIt++,++ii) {
lx = ii + id;
iiItN[lx] += 1.0;
iiItS[lx] += ((*this).*funcPtr)(*iIt, *iiIt);
}
}
}
}
// There is no input mask so make all output mask points good
maskOut.set(True);
}
// Normalize; use STL iterators for fastest access
typename Array<T>::iterator outIter;
typename Array<T>::iterator sumIter;
typename Array<Float>::iterator nIter;
typename Array<Float>::iterator nIterEnd = nPtsOut.end();
for (outIter=itOut.rwMatrixCursor().begin(),sumIter=sumOut.begin(),nIter=nPtsOut.begin();
nIter!=nIterEnd; ++nIter,++sumIter,++outIter) {
if (*nIter > 0.5) {
*outIter = *sumIter / *nIter;
}
}
//
if (itOutMaskPtr) itOutMaskPtr->rwMatrixCursor() = maskOut;
// Increment output mask iterator
if (itOutMaskPtr) (*itOutMaskPtr)++;
}
// Cleanup
if (itOutMaskPtr) delete itOutMaskPtr;
}
template <class T>
void LatticeTwoPtCorr<T>::check (LogIO& os, const MaskedLattice<T>& latOut,
const MaskedLattice<T>& latIn,
const IPosition& axes) const
{
AlwaysAssert (latIn.ndim() == latOut.ndim(), AipsError);
IPosition inShape = latIn.shape();
IPosition outShape = LatticeTwoPtCorr<T>::setUpShape (inShape, axes);
//
if (!outShape.isEqual(latOut.shape())) {
os << "Input shape = " << inShape << LogIO::POST;
os << "Actual output shape = " << latOut.shape() << LogIO::POST;
os << "Expected output shape = " << outShape << LogIO::POST;
os << "Output lattice has wrong shape" << LogIO::EXCEPTION;
}
}
} //# NAMESPACE CASACORE - END
#endif
|
