1 | //
|
---|
2 | // C++ Implementation: Scantable
|
---|
3 | //
|
---|
4 | // Description:
|
---|
5 | //
|
---|
6 | //
|
---|
7 | // Author: Malte Marquarding <asap@atnf.csiro.au>, (C) 2005-2013
|
---|
8 | //
|
---|
9 | // Copyright: See COPYING file that comes with this distribution
|
---|
10 | //
|
---|
11 | //
|
---|
12 | #include <map>
|
---|
13 | #include <sys/time.h>
|
---|
14 |
|
---|
15 | #include <atnf/PKSIO/SrcType.h>
|
---|
16 |
|
---|
17 | #include <casa/aips.h>
|
---|
18 | #include <casa/iomanip.h>
|
---|
19 | #include <casa/iostream.h>
|
---|
20 | #include <casa/OS/File.h>
|
---|
21 | #include <casa/OS/Path.h>
|
---|
22 | #include <casa/Logging/LogIO.h>
|
---|
23 | #include <casa/Arrays/Array.h>
|
---|
24 | #include <casa/Arrays/ArrayAccessor.h>
|
---|
25 | #include <casa/Arrays/ArrayLogical.h>
|
---|
26 | #include <casa/Arrays/ArrayMath.h>
|
---|
27 | #include <casa/Arrays/MaskArrMath.h>
|
---|
28 | #include <casa/Arrays/Slice.h>
|
---|
29 | #include <casa/Arrays/Vector.h>
|
---|
30 | #include <casa/Arrays/VectorSTLIterator.h>
|
---|
31 | #include <casa/BasicMath/Math.h>
|
---|
32 | #include <casa/BasicSL/Constants.h>
|
---|
33 | #include <casa/Containers/RecordField.h>
|
---|
34 | #include <casa/Logging/LogIO.h>
|
---|
35 | #include <casa/Quanta/MVAngle.h>
|
---|
36 | #include <casa/Quanta/MVTime.h>
|
---|
37 | #include <casa/Utilities/GenSort.h>
|
---|
38 |
|
---|
39 | #include <coordinates/Coordinates/CoordinateUtil.h>
|
---|
40 |
|
---|
41 | // needed to avoid error in .tcc
|
---|
42 | #include <measures/Measures/MCDirection.h>
|
---|
43 | //
|
---|
44 | #include <measures/Measures/MDirection.h>
|
---|
45 | #include <measures/Measures/MEpoch.h>
|
---|
46 | #include <measures/Measures/MFrequency.h>
|
---|
47 | #include <measures/Measures/MeasRef.h>
|
---|
48 | #include <measures/Measures/MeasTable.h>
|
---|
49 | #include <measures/TableMeasures/ScalarMeasColumn.h>
|
---|
50 | #include <measures/TableMeasures/TableMeasDesc.h>
|
---|
51 | #include <measures/TableMeasures/TableMeasRefDesc.h>
|
---|
52 | #include <measures/TableMeasures/TableMeasValueDesc.h>
|
---|
53 |
|
---|
54 | #include <tables/Tables/ArrColDesc.h>
|
---|
55 | #include <tables/Tables/ExprNode.h>
|
---|
56 | #include <tables/Tables/ScaColDesc.h>
|
---|
57 | #include <tables/Tables/SetupNewTab.h>
|
---|
58 | #include <tables/Tables/TableCopy.h>
|
---|
59 | #include <tables/Tables/TableDesc.h>
|
---|
60 | #include <tables/Tables/TableIter.h>
|
---|
61 | #include <tables/Tables/TableParse.h>
|
---|
62 | #include <tables/Tables/TableRecord.h>
|
---|
63 | #include <tables/Tables/TableRow.h>
|
---|
64 | #include <tables/Tables/TableVector.h>
|
---|
65 |
|
---|
66 | #include "MathUtils.h"
|
---|
67 | #include "STAttr.h"
|
---|
68 | #include "STBaselineTable.h"
|
---|
69 | #include "STLineFinder.h"
|
---|
70 | #include "STPolCircular.h"
|
---|
71 | #include "STPolLinear.h"
|
---|
72 | #include "STPolStokes.h"
|
---|
73 | #include "STUpgrade.h"
|
---|
74 | #include "STFitter.h"
|
---|
75 | #include "Scantable.h"
|
---|
76 |
|
---|
77 | #define debug 1
|
---|
78 |
|
---|
79 | using namespace casa;
|
---|
80 |
|
---|
81 | namespace asap {
|
---|
82 |
|
---|
83 | std::map<std::string, STPol::STPolFactory *> Scantable::factories_;
|
---|
84 |
|
---|
85 | void Scantable::initFactories() {
|
---|
86 | if ( factories_.empty() ) {
|
---|
87 | Scantable::factories_["linear"] = &STPolLinear::myFactory;
|
---|
88 | Scantable::factories_["circular"] = &STPolCircular::myFactory;
|
---|
89 | Scantable::factories_["stokes"] = &STPolStokes::myFactory;
|
---|
90 | }
|
---|
91 | }
|
---|
92 |
|
---|
93 | Scantable::Scantable(Table::TableType ttype) :
|
---|
94 | type_(ttype)
|
---|
95 | {
|
---|
96 | initFactories();
|
---|
97 | setupMainTable();
|
---|
98 | freqTable_ = STFrequencies(*this);
|
---|
99 | table_.rwKeywordSet().defineTable("FREQUENCIES", freqTable_.table());
|
---|
100 | weatherTable_ = STWeather(*this);
|
---|
101 | table_.rwKeywordSet().defineTable("WEATHER", weatherTable_.table());
|
---|
102 | focusTable_ = STFocus(*this);
|
---|
103 | table_.rwKeywordSet().defineTable("FOCUS", focusTable_.table());
|
---|
104 | tcalTable_ = STTcal(*this);
|
---|
105 | table_.rwKeywordSet().defineTable("TCAL", tcalTable_.table());
|
---|
106 | moleculeTable_ = STMolecules(*this);
|
---|
107 | table_.rwKeywordSet().defineTable("MOLECULES", moleculeTable_.table());
|
---|
108 | historyTable_ = STHistory(*this);
|
---|
109 | table_.rwKeywordSet().defineTable("HISTORY", historyTable_.table());
|
---|
110 | fitTable_ = STFit(*this);
|
---|
111 | table_.rwKeywordSet().defineTable("FIT", fitTable_.table());
|
---|
112 | table_.tableInfo().setType( "Scantable" ) ;
|
---|
113 | originalTable_ = table_;
|
---|
114 | attach();
|
---|
115 | }
|
---|
116 |
|
---|
117 | Scantable::Scantable(const std::string& name, Table::TableType ttype) :
|
---|
118 | type_(ttype)
|
---|
119 | {
|
---|
120 | initFactories();
|
---|
121 |
|
---|
122 | Table tab(name, Table::Update);
|
---|
123 | uInt version = tab.keywordSet().asuInt("VERSION");
|
---|
124 | if (version != version_) {
|
---|
125 | STUpgrade upgrader(version_);
|
---|
126 | LogIO os( LogOrigin( "Scantable" ) ) ;
|
---|
127 | os << LogIO::WARN
|
---|
128 | << name << " data format version " << version
|
---|
129 | << " is deprecated" << endl
|
---|
130 | << "Running upgrade."<< endl
|
---|
131 | << LogIO::POST ;
|
---|
132 | std::string outname = upgrader.upgrade(name);
|
---|
133 | if ( outname != name ) {
|
---|
134 | os << LogIO::WARN
|
---|
135 | << "Data will be loaded from " << outname << " instead of "
|
---|
136 | << name << LogIO::POST ;
|
---|
137 | tab = Table(outname, Table::Update ) ;
|
---|
138 | }
|
---|
139 | }
|
---|
140 | if ( type_ == Table::Memory ) {
|
---|
141 | table_ = tab.copyToMemoryTable(generateName());
|
---|
142 | } else {
|
---|
143 | table_ = tab;
|
---|
144 | }
|
---|
145 | table_.tableInfo().setType( "Scantable" ) ;
|
---|
146 |
|
---|
147 | attachSubtables();
|
---|
148 | originalTable_ = table_;
|
---|
149 | attach();
|
---|
150 | }
|
---|
151 | /*
|
---|
152 | Scantable::Scantable(const std::string& name, Table::TableType ttype) :
|
---|
153 | type_(ttype)
|
---|
154 | {
|
---|
155 | initFactories();
|
---|
156 | Table tab(name, Table::Update);
|
---|
157 | uInt version = tab.keywordSet().asuInt("VERSION");
|
---|
158 | if (version != version_) {
|
---|
159 | throw(AipsError("Unsupported version of ASAP file."));
|
---|
160 | }
|
---|
161 | if ( type_ == Table::Memory ) {
|
---|
162 | table_ = tab.copyToMemoryTable(generateName());
|
---|
163 | } else {
|
---|
164 | table_ = tab;
|
---|
165 | }
|
---|
166 |
|
---|
167 | attachSubtables();
|
---|
168 | originalTable_ = table_;
|
---|
169 | attach();
|
---|
170 | }
|
---|
171 | */
|
---|
172 |
|
---|
173 | Scantable::Scantable( const Scantable& other, bool clear )
|
---|
174 | {
|
---|
175 | // with or without data
|
---|
176 | String newname = String(generateName());
|
---|
177 | type_ = other.table_.tableType();
|
---|
178 | if ( other.table_.tableType() == Table::Memory ) {
|
---|
179 | if ( clear ) {
|
---|
180 | table_ = TableCopy::makeEmptyMemoryTable(newname,
|
---|
181 | other.table_, True);
|
---|
182 | } else {
|
---|
183 | table_ = other.table_.copyToMemoryTable(newname);
|
---|
184 | }
|
---|
185 | } else {
|
---|
186 | other.table_.deepCopy(newname, Table::New, False,
|
---|
187 | other.table_.endianFormat(),
|
---|
188 | Bool(clear));
|
---|
189 | table_ = Table(newname, Table::Update);
|
---|
190 | table_.markForDelete();
|
---|
191 | }
|
---|
192 | table_.tableInfo().setType( "Scantable" ) ;
|
---|
193 | /// @todo reindex SCANNO, recompute nbeam, nif, npol
|
---|
194 | if ( clear ) copySubtables(other);
|
---|
195 | attachSubtables();
|
---|
196 | originalTable_ = table_;
|
---|
197 | attach();
|
---|
198 | }
|
---|
199 |
|
---|
200 | void Scantable::copySubtables(const Scantable& other) {
|
---|
201 | Table t = table_.rwKeywordSet().asTable("FREQUENCIES");
|
---|
202 | TableCopy::copyRows(t, other.freqTable_.table());
|
---|
203 | t = table_.rwKeywordSet().asTable("FOCUS");
|
---|
204 | TableCopy::copyRows(t, other.focusTable_.table());
|
---|
205 | t = table_.rwKeywordSet().asTable("WEATHER");
|
---|
206 | TableCopy::copyRows(t, other.weatherTable_.table());
|
---|
207 | t = table_.rwKeywordSet().asTable("TCAL");
|
---|
208 | TableCopy::copyRows(t, other.tcalTable_.table());
|
---|
209 | t = table_.rwKeywordSet().asTable("MOLECULES");
|
---|
210 | TableCopy::copyRows(t, other.moleculeTable_.table());
|
---|
211 | t = table_.rwKeywordSet().asTable("HISTORY");
|
---|
212 | TableCopy::copyRows(t, other.historyTable_.table());
|
---|
213 | t = table_.rwKeywordSet().asTable("FIT");
|
---|
214 | TableCopy::copyRows(t, other.fitTable_.table());
|
---|
215 | }
|
---|
216 |
|
---|
217 | void Scantable::attachSubtables()
|
---|
218 | {
|
---|
219 | freqTable_ = STFrequencies(table_);
|
---|
220 | focusTable_ = STFocus(table_);
|
---|
221 | weatherTable_ = STWeather(table_);
|
---|
222 | tcalTable_ = STTcal(table_);
|
---|
223 | moleculeTable_ = STMolecules(table_);
|
---|
224 | historyTable_ = STHistory(table_);
|
---|
225 | fitTable_ = STFit(table_);
|
---|
226 | }
|
---|
227 |
|
---|
228 | Scantable::~Scantable()
|
---|
229 | {
|
---|
230 | }
|
---|
231 |
|
---|
232 | void Scantable::setupMainTable()
|
---|
233 | {
|
---|
234 | TableDesc td("", "1", TableDesc::Scratch);
|
---|
235 | td.comment() = "An ASAP Scantable";
|
---|
236 | td.rwKeywordSet().define("VERSION", uInt(version_));
|
---|
237 |
|
---|
238 | // n Cycles
|
---|
239 | td.addColumn(ScalarColumnDesc<uInt>("SCANNO"));
|
---|
240 | // new index every nBeam x nIF x nPol
|
---|
241 | td.addColumn(ScalarColumnDesc<uInt>("CYCLENO"));
|
---|
242 |
|
---|
243 | td.addColumn(ScalarColumnDesc<uInt>("BEAMNO"));
|
---|
244 | td.addColumn(ScalarColumnDesc<uInt>("IFNO"));
|
---|
245 | // linear, circular, stokes
|
---|
246 | td.rwKeywordSet().define("POLTYPE", String("linear"));
|
---|
247 | td.addColumn(ScalarColumnDesc<uInt>("POLNO"));
|
---|
248 |
|
---|
249 | td.addColumn(ScalarColumnDesc<uInt>("FREQ_ID"));
|
---|
250 | td.addColumn(ScalarColumnDesc<uInt>("MOLECULE_ID"));
|
---|
251 |
|
---|
252 | ScalarColumnDesc<Int> refbeamnoColumn("REFBEAMNO");
|
---|
253 | refbeamnoColumn.setDefault(Int(-1));
|
---|
254 | td.addColumn(refbeamnoColumn);
|
---|
255 |
|
---|
256 | ScalarColumnDesc<uInt> flagrowColumn("FLAGROW");
|
---|
257 | flagrowColumn.setDefault(uInt(0));
|
---|
258 | td.addColumn(flagrowColumn);
|
---|
259 |
|
---|
260 | td.addColumn(ScalarColumnDesc<Double>("TIME"));
|
---|
261 | TableMeasRefDesc measRef(MEpoch::UTC); // UTC as default
|
---|
262 | TableMeasValueDesc measVal(td, "TIME");
|
---|
263 | TableMeasDesc<MEpoch> mepochCol(measVal, measRef);
|
---|
264 | mepochCol.write(td);
|
---|
265 |
|
---|
266 | td.addColumn(ScalarColumnDesc<Double>("INTERVAL"));
|
---|
267 |
|
---|
268 | td.addColumn(ScalarColumnDesc<String>("SRCNAME"));
|
---|
269 | // Type of source (on=0, off=1, other=-1)
|
---|
270 | ScalarColumnDesc<Int> stypeColumn("SRCTYPE");
|
---|
271 | stypeColumn.setDefault(Int(-1));
|
---|
272 | td.addColumn(stypeColumn);
|
---|
273 | td.addColumn(ScalarColumnDesc<String>("FIELDNAME"));
|
---|
274 |
|
---|
275 | //The actual Data Vectors
|
---|
276 | td.addColumn(ArrayColumnDesc<Float>("SPECTRA"));
|
---|
277 | td.addColumn(ArrayColumnDesc<uChar>("FLAGTRA"));
|
---|
278 | td.addColumn(ArrayColumnDesc<Float>("TSYS"));
|
---|
279 |
|
---|
280 | td.addColumn(ArrayColumnDesc<Double>("DIRECTION",
|
---|
281 | IPosition(1,2),
|
---|
282 | ColumnDesc::Direct));
|
---|
283 | TableMeasRefDesc mdirRef(MDirection::J2000); // default
|
---|
284 | TableMeasValueDesc tmvdMDir(td, "DIRECTION");
|
---|
285 | // the TableMeasDesc gives the column a type
|
---|
286 | TableMeasDesc<MDirection> mdirCol(tmvdMDir, mdirRef);
|
---|
287 | // a uder set table type e.g. GALCTIC, B1950 ...
|
---|
288 | td.rwKeywordSet().define("DIRECTIONREF", String("J2000"));
|
---|
289 | // writing create the measure column
|
---|
290 | mdirCol.write(td);
|
---|
291 | td.addColumn(ScalarColumnDesc<Float>("AZIMUTH"));
|
---|
292 | td.addColumn(ScalarColumnDesc<Float>("ELEVATION"));
|
---|
293 | td.addColumn(ScalarColumnDesc<Float>("OPACITY"));
|
---|
294 |
|
---|
295 | td.addColumn(ScalarColumnDesc<uInt>("TCAL_ID"));
|
---|
296 | ScalarColumnDesc<Int> fitColumn("FIT_ID");
|
---|
297 | fitColumn.setDefault(Int(-1));
|
---|
298 | td.addColumn(fitColumn);
|
---|
299 |
|
---|
300 | td.addColumn(ScalarColumnDesc<uInt>("FOCUS_ID"));
|
---|
301 | td.addColumn(ScalarColumnDesc<uInt>("WEATHER_ID"));
|
---|
302 |
|
---|
303 | // columns which just get dragged along, as they aren't used in asap
|
---|
304 | td.addColumn(ScalarColumnDesc<Double>("SRCVELOCITY"));
|
---|
305 | td.addColumn(ArrayColumnDesc<Double>("SRCPROPERMOTION"));
|
---|
306 | td.addColumn(ArrayColumnDesc<Double>("SRCDIRECTION"));
|
---|
307 | td.addColumn(ArrayColumnDesc<Double>("SCANRATE"));
|
---|
308 |
|
---|
309 | td.rwKeywordSet().define("OBSMODE", String(""));
|
---|
310 |
|
---|
311 | // Now create Table SetUp from the description.
|
---|
312 | SetupNewTable aNewTab(generateName(), td, Table::Scratch);
|
---|
313 | table_ = Table(aNewTab, type_, 0);
|
---|
314 | originalTable_ = table_;
|
---|
315 | }
|
---|
316 |
|
---|
317 | void Scantable::attach()
|
---|
318 | {
|
---|
319 | timeCol_.attach(table_, "TIME");
|
---|
320 | srcnCol_.attach(table_, "SRCNAME");
|
---|
321 | srctCol_.attach(table_, "SRCTYPE");
|
---|
322 | specCol_.attach(table_, "SPECTRA");
|
---|
323 | flagsCol_.attach(table_, "FLAGTRA");
|
---|
324 | tsysCol_.attach(table_, "TSYS");
|
---|
325 | cycleCol_.attach(table_,"CYCLENO");
|
---|
326 | scanCol_.attach(table_, "SCANNO");
|
---|
327 | beamCol_.attach(table_, "BEAMNO");
|
---|
328 | ifCol_.attach(table_, "IFNO");
|
---|
329 | polCol_.attach(table_, "POLNO");
|
---|
330 | integrCol_.attach(table_, "INTERVAL");
|
---|
331 | azCol_.attach(table_, "AZIMUTH");
|
---|
332 | elCol_.attach(table_, "ELEVATION");
|
---|
333 | dirCol_.attach(table_, "DIRECTION");
|
---|
334 | fldnCol_.attach(table_, "FIELDNAME");
|
---|
335 | rbeamCol_.attach(table_, "REFBEAMNO");
|
---|
336 |
|
---|
337 | mweatheridCol_.attach(table_,"WEATHER_ID");
|
---|
338 | mfitidCol_.attach(table_,"FIT_ID");
|
---|
339 | mfreqidCol_.attach(table_, "FREQ_ID");
|
---|
340 | mtcalidCol_.attach(table_, "TCAL_ID");
|
---|
341 | mfocusidCol_.attach(table_, "FOCUS_ID");
|
---|
342 | mmolidCol_.attach(table_, "MOLECULE_ID");
|
---|
343 |
|
---|
344 | //Add auxiliary column for row-based flagging (CAS-1433 Wataru Kawasaki)
|
---|
345 | attachAuxColumnDef(flagrowCol_, "FLAGROW", 0);
|
---|
346 |
|
---|
347 | }
|
---|
348 |
|
---|
349 | template<class T, class T2>
|
---|
350 | void Scantable::attachAuxColumnDef(ScalarColumn<T>& col,
|
---|
351 | const String& colName,
|
---|
352 | const T2& defValue)
|
---|
353 | {
|
---|
354 | try {
|
---|
355 | col.attach(table_, colName);
|
---|
356 | } catch (TableError& err) {
|
---|
357 | String errMesg = err.getMesg();
|
---|
358 | if (errMesg == "Table column " + colName + " is unknown") {
|
---|
359 | table_.addColumn(ScalarColumnDesc<T>(colName));
|
---|
360 | col.attach(table_, colName);
|
---|
361 | col.fillColumn(static_cast<T>(defValue));
|
---|
362 | } else {
|
---|
363 | throw;
|
---|
364 | }
|
---|
365 | } catch (...) {
|
---|
366 | throw;
|
---|
367 | }
|
---|
368 | }
|
---|
369 |
|
---|
370 | template<class T, class T2>
|
---|
371 | void Scantable::attachAuxColumnDef(ArrayColumn<T>& col,
|
---|
372 | const String& colName,
|
---|
373 | const Array<T2>& defValue)
|
---|
374 | {
|
---|
375 | try {
|
---|
376 | col.attach(table_, colName);
|
---|
377 | } catch (TableError& err) {
|
---|
378 | String errMesg = err.getMesg();
|
---|
379 | if (errMesg == "Table column " + colName + " is unknown") {
|
---|
380 | table_.addColumn(ArrayColumnDesc<T>(colName));
|
---|
381 | col.attach(table_, colName);
|
---|
382 |
|
---|
383 | int size = 0;
|
---|
384 | ArrayIterator<T2>& it = defValue.begin();
|
---|
385 | while (it != defValue.end()) {
|
---|
386 | ++size;
|
---|
387 | ++it;
|
---|
388 | }
|
---|
389 | IPosition ip(1, size);
|
---|
390 | Array<T>& arr(ip);
|
---|
391 | for (int i = 0; i < size; ++i)
|
---|
392 | arr[i] = static_cast<T>(defValue[i]);
|
---|
393 |
|
---|
394 | col.fillColumn(arr);
|
---|
395 | } else {
|
---|
396 | throw;
|
---|
397 | }
|
---|
398 | } catch (...) {
|
---|
399 | throw;
|
---|
400 | }
|
---|
401 | }
|
---|
402 |
|
---|
403 | void Scantable::setHeader(const STHeader& sdh)
|
---|
404 | {
|
---|
405 | table_.rwKeywordSet().define("nIF", sdh.nif);
|
---|
406 | table_.rwKeywordSet().define("nBeam", sdh.nbeam);
|
---|
407 | table_.rwKeywordSet().define("nPol", sdh.npol);
|
---|
408 | table_.rwKeywordSet().define("nChan", sdh.nchan);
|
---|
409 | table_.rwKeywordSet().define("Observer", sdh.observer);
|
---|
410 | table_.rwKeywordSet().define("Project", sdh.project);
|
---|
411 | table_.rwKeywordSet().define("Obstype", sdh.obstype);
|
---|
412 | table_.rwKeywordSet().define("AntennaName", sdh.antennaname);
|
---|
413 | table_.rwKeywordSet().define("AntennaPosition", sdh.antennaposition);
|
---|
414 | table_.rwKeywordSet().define("Equinox", sdh.equinox);
|
---|
415 | table_.rwKeywordSet().define("FreqRefFrame", sdh.freqref);
|
---|
416 | table_.rwKeywordSet().define("FreqRefVal", sdh.reffreq);
|
---|
417 | table_.rwKeywordSet().define("Bandwidth", sdh.bandwidth);
|
---|
418 | table_.rwKeywordSet().define("UTC", sdh.utc);
|
---|
419 | table_.rwKeywordSet().define("FluxUnit", sdh.fluxunit);
|
---|
420 | table_.rwKeywordSet().define("Epoch", sdh.epoch);
|
---|
421 | table_.rwKeywordSet().define("POLTYPE", sdh.poltype);
|
---|
422 | }
|
---|
423 |
|
---|
424 | STHeader Scantable::getHeader() const
|
---|
425 | {
|
---|
426 | STHeader sdh;
|
---|
427 | table_.keywordSet().get("nBeam",sdh.nbeam);
|
---|
428 | table_.keywordSet().get("nIF",sdh.nif);
|
---|
429 | table_.keywordSet().get("nPol",sdh.npol);
|
---|
430 | table_.keywordSet().get("nChan",sdh.nchan);
|
---|
431 | table_.keywordSet().get("Observer", sdh.observer);
|
---|
432 | table_.keywordSet().get("Project", sdh.project);
|
---|
433 | table_.keywordSet().get("Obstype", sdh.obstype);
|
---|
434 | table_.keywordSet().get("AntennaName", sdh.antennaname);
|
---|
435 | table_.keywordSet().get("AntennaPosition", sdh.antennaposition);
|
---|
436 | table_.keywordSet().get("Equinox", sdh.equinox);
|
---|
437 | table_.keywordSet().get("FreqRefFrame", sdh.freqref);
|
---|
438 | table_.keywordSet().get("FreqRefVal", sdh.reffreq);
|
---|
439 | table_.keywordSet().get("Bandwidth", sdh.bandwidth);
|
---|
440 | table_.keywordSet().get("UTC", sdh.utc);
|
---|
441 | table_.keywordSet().get("FluxUnit", sdh.fluxunit);
|
---|
442 | table_.keywordSet().get("Epoch", sdh.epoch);
|
---|
443 | table_.keywordSet().get("POLTYPE", sdh.poltype);
|
---|
444 | return sdh;
|
---|
445 | }
|
---|
446 |
|
---|
447 | void Scantable::setSourceType( int stype )
|
---|
448 | {
|
---|
449 | if ( stype < 0 || stype > 1 )
|
---|
450 | throw(AipsError("Illegal sourcetype."));
|
---|
451 | TableVector<Int> tabvec(table_, "SRCTYPE");
|
---|
452 | tabvec = Int(stype);
|
---|
453 | }
|
---|
454 |
|
---|
455 | void Scantable::setSourceName( const std::string& name )
|
---|
456 | {
|
---|
457 | TableVector<String> tabvec(table_, "SRCNAME");
|
---|
458 | tabvec = name;
|
---|
459 | }
|
---|
460 |
|
---|
461 | bool Scantable::conformant( const Scantable& other )
|
---|
462 | {
|
---|
463 | return this->getHeader().conformant(other.getHeader());
|
---|
464 | }
|
---|
465 |
|
---|
466 |
|
---|
467 |
|
---|
468 | std::string Scantable::formatSec(Double x) const
|
---|
469 | {
|
---|
470 | Double xcop = x;
|
---|
471 | MVTime mvt(xcop/24./3600.); // make days
|
---|
472 |
|
---|
473 | if (x < 59.95)
|
---|
474 | return String(" ") + mvt.string(MVTime::TIME_CLEAN_NO_HM, 7)+"s";
|
---|
475 | else if (x < 3599.95)
|
---|
476 | return String(" ") + mvt.string(MVTime::TIME_CLEAN_NO_H,7)+" ";
|
---|
477 | else {
|
---|
478 | ostringstream oss;
|
---|
479 | oss << setw(2) << std::right << setprecision(1) << mvt.hour();
|
---|
480 | oss << ":" << mvt.string(MVTime::TIME_CLEAN_NO_H,7) << " ";
|
---|
481 | return String(oss);
|
---|
482 | }
|
---|
483 | };
|
---|
484 |
|
---|
485 | std::string Scantable::formatDirection(const MDirection& md) const
|
---|
486 | {
|
---|
487 | Vector<Double> t = md.getAngle(Unit(String("rad"))).getValue();
|
---|
488 | Int prec = 7;
|
---|
489 |
|
---|
490 | String ref = md.getRefString();
|
---|
491 | MVAngle mvLon(t[0]);
|
---|
492 | String sLon = mvLon.string(MVAngle::TIME,prec);
|
---|
493 | uInt tp = md.getRef().getType();
|
---|
494 | if (tp == MDirection::GALACTIC ||
|
---|
495 | tp == MDirection::SUPERGAL ) {
|
---|
496 | sLon = mvLon(0.0).string(MVAngle::ANGLE_CLEAN,prec);
|
---|
497 | }
|
---|
498 | MVAngle mvLat(t[1]);
|
---|
499 | String sLat = mvLat.string(MVAngle::ANGLE+MVAngle::DIG2,prec);
|
---|
500 | return ref + String(" ") + sLon + String(" ") + sLat;
|
---|
501 | }
|
---|
502 |
|
---|
503 |
|
---|
504 | std::string Scantable::getFluxUnit() const
|
---|
505 | {
|
---|
506 | return table_.keywordSet().asString("FluxUnit");
|
---|
507 | }
|
---|
508 |
|
---|
509 | void Scantable::setFluxUnit(const std::string& unit)
|
---|
510 | {
|
---|
511 | String tmp(unit);
|
---|
512 | Unit tU(tmp);
|
---|
513 | if (tU==Unit("K") || tU==Unit("Jy")) {
|
---|
514 | table_.rwKeywordSet().define(String("FluxUnit"), tmp);
|
---|
515 | } else {
|
---|
516 | throw AipsError("Illegal unit - must be compatible with Jy or K");
|
---|
517 | }
|
---|
518 | }
|
---|
519 |
|
---|
520 | void Scantable::setInstrument(const std::string& name)
|
---|
521 | {
|
---|
522 | bool throwIt = true;
|
---|
523 | // create an Instrument to see if this is valid
|
---|
524 | STAttr::convertInstrument(name, throwIt);
|
---|
525 | String nameU(name);
|
---|
526 | nameU.upcase();
|
---|
527 | table_.rwKeywordSet().define(String("AntennaName"), nameU);
|
---|
528 | }
|
---|
529 |
|
---|
530 | void Scantable::setFeedType(const std::string& feedtype)
|
---|
531 | {
|
---|
532 | if ( Scantable::factories_.find(feedtype) == Scantable::factories_.end() ) {
|
---|
533 | std::string msg = "Illegal feed type "+ feedtype;
|
---|
534 | throw(casa::AipsError(msg));
|
---|
535 | }
|
---|
536 | table_.rwKeywordSet().define(String("POLTYPE"), feedtype);
|
---|
537 | }
|
---|
538 |
|
---|
539 | MPosition Scantable::getAntennaPosition() const
|
---|
540 | {
|
---|
541 | Vector<Double> antpos;
|
---|
542 | table_.keywordSet().get("AntennaPosition", antpos);
|
---|
543 | MVPosition mvpos(antpos(0),antpos(1),antpos(2));
|
---|
544 | return MPosition(mvpos);
|
---|
545 | }
|
---|
546 |
|
---|
547 | void Scantable::makePersistent(const std::string& filename)
|
---|
548 | {
|
---|
549 | String inname(filename);
|
---|
550 | Path path(inname);
|
---|
551 | /// @todo reindex SCANNO, recompute nbeam, nif, npol
|
---|
552 | inname = path.expandedName();
|
---|
553 | // 2011/03/04 TN
|
---|
554 | // We can comment out this workaround since the essential bug is
|
---|
555 | // fixed in casacore (r20889 in google code).
|
---|
556 | table_.deepCopy(inname, Table::New);
|
---|
557 | // // WORKAROUND !!! for Table bug
|
---|
558 | // // Remove when fixed in casacore
|
---|
559 | // if ( table_.tableType() == Table::Memory && !selector_.empty() ) {
|
---|
560 | // Table tab = table_.copyToMemoryTable(generateName());
|
---|
561 | // tab.deepCopy(inname, Table::New);
|
---|
562 | // tab.markForDelete();
|
---|
563 | //
|
---|
564 | // } else {
|
---|
565 | // table_.deepCopy(inname, Table::New);
|
---|
566 | // }
|
---|
567 | }
|
---|
568 |
|
---|
569 | int Scantable::nbeam( int scanno ) const
|
---|
570 | {
|
---|
571 | if ( scanno < 0 ) {
|
---|
572 | Int n;
|
---|
573 | table_.keywordSet().get("nBeam",n);
|
---|
574 | return int(n);
|
---|
575 | } else {
|
---|
576 | // take the first POLNO,IFNO,CYCLENO as nbeam shouldn't vary with these
|
---|
577 | Table t = table_(table_.col("SCANNO") == scanno);
|
---|
578 | ROTableRow row(t);
|
---|
579 | const TableRecord& rec = row.get(0);
|
---|
580 | Table subt = t( t.col("IFNO") == Int(rec.asuInt("IFNO"))
|
---|
581 | && t.col("POLNO") == Int(rec.asuInt("POLNO"))
|
---|
582 | && t.col("CYCLENO") == Int(rec.asuInt("CYCLENO")) );
|
---|
583 | ROTableVector<uInt> v(subt, "BEAMNO");
|
---|
584 | return int(v.nelements());
|
---|
585 | }
|
---|
586 | return 0;
|
---|
587 | }
|
---|
588 |
|
---|
589 | int Scantable::nif( int scanno ) const
|
---|
590 | {
|
---|
591 | if ( scanno < 0 ) {
|
---|
592 | Int n;
|
---|
593 | table_.keywordSet().get("nIF",n);
|
---|
594 | return int(n);
|
---|
595 | } else {
|
---|
596 | // take the first POLNO,BEAMNO,CYCLENO as nbeam shouldn't vary with these
|
---|
597 | Table t = table_(table_.col("SCANNO") == scanno);
|
---|
598 | ROTableRow row(t);
|
---|
599 | const TableRecord& rec = row.get(0);
|
---|
600 | Table subt = t( t.col("BEAMNO") == Int(rec.asuInt("BEAMNO"))
|
---|
601 | && t.col("POLNO") == Int(rec.asuInt("POLNO"))
|
---|
602 | && t.col("CYCLENO") == Int(rec.asuInt("CYCLENO")) );
|
---|
603 | if ( subt.nrow() == 0 ) return 0;
|
---|
604 | ROTableVector<uInt> v(subt, "IFNO");
|
---|
605 | return int(v.nelements());
|
---|
606 | }
|
---|
607 | return 0;
|
---|
608 | }
|
---|
609 |
|
---|
610 | int Scantable::npol( int scanno ) const
|
---|
611 | {
|
---|
612 | if ( scanno < 0 ) {
|
---|
613 | Int n;
|
---|
614 | table_.keywordSet().get("nPol",n);
|
---|
615 | return n;
|
---|
616 | } else {
|
---|
617 | // take the first POLNO,IFNO,CYCLENO as nbeam shouldn't vary with these
|
---|
618 | Table t = table_(table_.col("SCANNO") == scanno);
|
---|
619 | ROTableRow row(t);
|
---|
620 | const TableRecord& rec = row.get(0);
|
---|
621 | Table subt = t( t.col("BEAMNO") == Int(rec.asuInt("BEAMNO"))
|
---|
622 | && t.col("IFNO") == Int(rec.asuInt("IFNO"))
|
---|
623 | && t.col("CYCLENO") == Int(rec.asuInt("CYCLENO")) );
|
---|
624 | if ( subt.nrow() == 0 ) return 0;
|
---|
625 | ROTableVector<uInt> v(subt, "POLNO");
|
---|
626 | return int(v.nelements());
|
---|
627 | }
|
---|
628 | return 0;
|
---|
629 | }
|
---|
630 |
|
---|
631 | int Scantable::ncycle( int scanno ) const
|
---|
632 | {
|
---|
633 | if ( scanno < 0 ) {
|
---|
634 | Block<String> cols(2);
|
---|
635 | cols[0] = "SCANNO";
|
---|
636 | cols[1] = "CYCLENO";
|
---|
637 | TableIterator it(table_, cols);
|
---|
638 | int n = 0;
|
---|
639 | while ( !it.pastEnd() ) {
|
---|
640 | ++n;
|
---|
641 | ++it;
|
---|
642 | }
|
---|
643 | return n;
|
---|
644 | } else {
|
---|
645 | Table t = table_(table_.col("SCANNO") == scanno);
|
---|
646 | ROTableRow row(t);
|
---|
647 | const TableRecord& rec = row.get(0);
|
---|
648 | Table subt = t( t.col("BEAMNO") == Int(rec.asuInt("BEAMNO"))
|
---|
649 | && t.col("POLNO") == Int(rec.asuInt("POLNO"))
|
---|
650 | && t.col("IFNO") == Int(rec.asuInt("IFNO")) );
|
---|
651 | if ( subt.nrow() == 0 ) return 0;
|
---|
652 | return int(subt.nrow());
|
---|
653 | }
|
---|
654 | return 0;
|
---|
655 | }
|
---|
656 |
|
---|
657 |
|
---|
658 | int Scantable::nrow( int scanno ) const
|
---|
659 | {
|
---|
660 | return int(table_.nrow());
|
---|
661 | }
|
---|
662 |
|
---|
663 | int Scantable::nchan( int ifno ) const
|
---|
664 | {
|
---|
665 | if ( ifno < 0 ) {
|
---|
666 | Int n;
|
---|
667 | table_.keywordSet().get("nChan",n);
|
---|
668 | return int(n);
|
---|
669 | } else {
|
---|
670 | // take the first SCANNO,POLNO,BEAMNO,CYCLENO as nbeam shouldn't
|
---|
671 | // vary with these
|
---|
672 | Table t = table_(table_.col("IFNO") == ifno, 1);
|
---|
673 | if ( t.nrow() == 0 ) return 0;
|
---|
674 | ROArrayColumn<Float> v(t, "SPECTRA");
|
---|
675 | return v.shape(0)(0);
|
---|
676 | }
|
---|
677 | return 0;
|
---|
678 | }
|
---|
679 |
|
---|
680 | int Scantable::nscan() const {
|
---|
681 | Vector<uInt> scannos(scanCol_.getColumn());
|
---|
682 | uInt nout = genSort( scannos, Sort::Ascending,
|
---|
683 | Sort::QuickSort|Sort::NoDuplicates );
|
---|
684 | return int(nout);
|
---|
685 | }
|
---|
686 |
|
---|
687 | int Scantable::getChannels(int whichrow) const
|
---|
688 | {
|
---|
689 | return specCol_.shape(whichrow)(0);
|
---|
690 | }
|
---|
691 |
|
---|
692 | int Scantable::getBeam(int whichrow) const
|
---|
693 | {
|
---|
694 | return beamCol_(whichrow);
|
---|
695 | }
|
---|
696 |
|
---|
697 | std::vector<uint> Scantable::getNumbers(const ScalarColumn<uInt>& col) const
|
---|
698 | {
|
---|
699 | Vector<uInt> nos(col.getColumn());
|
---|
700 | uInt n = genSort( nos, Sort::Ascending, Sort::QuickSort|Sort::NoDuplicates );
|
---|
701 | nos.resize(n, True);
|
---|
702 | std::vector<uint> stlout;
|
---|
703 | nos.tovector(stlout);
|
---|
704 | return stlout;
|
---|
705 | }
|
---|
706 |
|
---|
707 | int Scantable::getIF(int whichrow) const
|
---|
708 | {
|
---|
709 | return ifCol_(whichrow);
|
---|
710 | }
|
---|
711 |
|
---|
712 | int Scantable::getPol(int whichrow) const
|
---|
713 | {
|
---|
714 | return polCol_(whichrow);
|
---|
715 | }
|
---|
716 |
|
---|
717 | std::string Scantable::formatTime(const MEpoch& me, bool showdate) const
|
---|
718 | {
|
---|
719 | return formatTime(me, showdate, 0);
|
---|
720 | }
|
---|
721 |
|
---|
722 | std::string Scantable::formatTime(const MEpoch& me, bool showdate, uInt prec) const
|
---|
723 | {
|
---|
724 | MVTime mvt(me.getValue());
|
---|
725 | if (showdate)
|
---|
726 | //mvt.setFormat(MVTime::YMD);
|
---|
727 | mvt.setFormat(MVTime::YMD, prec);
|
---|
728 | else
|
---|
729 | //mvt.setFormat(MVTime::TIME);
|
---|
730 | mvt.setFormat(MVTime::TIME, prec);
|
---|
731 | ostringstream oss;
|
---|
732 | oss << mvt;
|
---|
733 | return String(oss);
|
---|
734 | }
|
---|
735 |
|
---|
736 | void Scantable::calculateAZEL()
|
---|
737 | {
|
---|
738 | LogIO os( LogOrigin( "Scantable", "calculateAZEL()", WHERE ) ) ;
|
---|
739 | MPosition mp = getAntennaPosition();
|
---|
740 | MEpoch::ROScalarColumn timeCol(table_, "TIME");
|
---|
741 | ostringstream oss;
|
---|
742 | oss << mp;
|
---|
743 | os << "Computed azimuth/elevation using " << endl
|
---|
744 | << String(oss) << endl;
|
---|
745 | for (Int i=0; i<nrow(); ++i) {
|
---|
746 | MEpoch me = timeCol(i);
|
---|
747 | MDirection md = getDirection(i);
|
---|
748 | os << " Time: " << formatTime(me,False)
|
---|
749 | << " Direction: " << formatDirection(md)
|
---|
750 | << endl << " => ";
|
---|
751 | MeasFrame frame(mp, me);
|
---|
752 | Vector<Double> azel =
|
---|
753 | MDirection::Convert(md, MDirection::Ref(MDirection::AZEL,
|
---|
754 | frame)
|
---|
755 | )().getAngle("rad").getValue();
|
---|
756 | azCol_.put(i,Float(azel[0]));
|
---|
757 | elCol_.put(i,Float(azel[1]));
|
---|
758 | os << "azel: " << azel[0]/C::pi*180.0 << " "
|
---|
759 | << azel[1]/C::pi*180.0 << " (deg)" << LogIO::POST;
|
---|
760 | }
|
---|
761 | }
|
---|
762 |
|
---|
763 | void Scantable::clip(const Float uthres, const Float dthres, bool clipoutside, bool unflag)
|
---|
764 | {
|
---|
765 | for (uInt i=0; i<table_.nrow(); ++i) {
|
---|
766 | Vector<uChar> flgs = flagsCol_(i);
|
---|
767 | srchChannelsToClip(i, uthres, dthres, clipoutside, unflag, flgs);
|
---|
768 | flagsCol_.put(i, flgs);
|
---|
769 | }
|
---|
770 | }
|
---|
771 |
|
---|
772 | std::vector<bool> Scantable::getClipMask(int whichrow, const Float uthres, const Float dthres, bool clipoutside, bool unflag)
|
---|
773 | {
|
---|
774 | Vector<uChar> flags;
|
---|
775 | flagsCol_.get(uInt(whichrow), flags);
|
---|
776 | srchChannelsToClip(uInt(whichrow), uthres, dthres, clipoutside, unflag, flags);
|
---|
777 | Vector<Bool> bflag(flags.shape());
|
---|
778 | convertArray(bflag, flags);
|
---|
779 | //bflag = !bflag;
|
---|
780 |
|
---|
781 | std::vector<bool> mask;
|
---|
782 | bflag.tovector(mask);
|
---|
783 | return mask;
|
---|
784 | }
|
---|
785 |
|
---|
786 | void Scantable::srchChannelsToClip(uInt whichrow, const Float uthres, const Float dthres, bool clipoutside, bool unflag,
|
---|
787 | Vector<uChar> flgs)
|
---|
788 | {
|
---|
789 | Vector<Float> spcs = specCol_(whichrow);
|
---|
790 | uInt nchannel = spcs.nelements();
|
---|
791 | if (spcs.nelements() != nchannel) {
|
---|
792 | throw(AipsError("Data has incorrect number of channels"));
|
---|
793 | }
|
---|
794 | uChar userflag = 1 << 7;
|
---|
795 | if (unflag) {
|
---|
796 | userflag = 0 << 7;
|
---|
797 | }
|
---|
798 | if (clipoutside) {
|
---|
799 | for (uInt j = 0; j < nchannel; ++j) {
|
---|
800 | Float spc = spcs(j);
|
---|
801 | if ((spc >= uthres) || (spc <= dthres)) {
|
---|
802 | flgs(j) = userflag;
|
---|
803 | }
|
---|
804 | }
|
---|
805 | } else {
|
---|
806 | for (uInt j = 0; j < nchannel; ++j) {
|
---|
807 | Float spc = spcs(j);
|
---|
808 | if ((spc < uthres) && (spc > dthres)) {
|
---|
809 | flgs(j) = userflag;
|
---|
810 | }
|
---|
811 | }
|
---|
812 | }
|
---|
813 | }
|
---|
814 |
|
---|
815 |
|
---|
816 | void Scantable::flag( int whichrow, const std::vector<bool>& msk, bool unflag ) {
|
---|
817 | std::vector<bool>::const_iterator it;
|
---|
818 | uInt ntrue = 0;
|
---|
819 | if (whichrow >= int(table_.nrow()) ) {
|
---|
820 | throw(AipsError("Invalid row number"));
|
---|
821 | }
|
---|
822 | for (it = msk.begin(); it != msk.end(); ++it) {
|
---|
823 | if ( *it ) {
|
---|
824 | ntrue++;
|
---|
825 | }
|
---|
826 | }
|
---|
827 | //if ( selector_.empty() && (msk.size() == 0 || msk.size() == ntrue) )
|
---|
828 | if ( whichrow == -1 && !unflag && selector_.empty() && (msk.size() == 0 || msk.size() == ntrue) )
|
---|
829 | throw(AipsError("Trying to flag whole scantable."));
|
---|
830 | uChar userflag = 1 << 7;
|
---|
831 | if ( unflag ) {
|
---|
832 | userflag = 0 << 7;
|
---|
833 | }
|
---|
834 | if (whichrow > -1 ) {
|
---|
835 | applyChanFlag(uInt(whichrow), msk, userflag);
|
---|
836 | } else {
|
---|
837 | for ( uInt i=0; i<table_.nrow(); ++i) {
|
---|
838 | applyChanFlag(i, msk, userflag);
|
---|
839 | }
|
---|
840 | }
|
---|
841 | }
|
---|
842 |
|
---|
843 | void Scantable::applyChanFlag( uInt whichrow, const std::vector<bool>& msk, uChar flagval )
|
---|
844 | {
|
---|
845 | if (whichrow >= table_.nrow() ) {
|
---|
846 | throw( casa::indexError<int>( whichrow, "asap::Scantable::applyChanFlag: Invalid row number" ) );
|
---|
847 | }
|
---|
848 | Vector<uChar> flgs = flagsCol_(whichrow);
|
---|
849 | if ( msk.size() == 0 ) {
|
---|
850 | flgs = flagval;
|
---|
851 | flagsCol_.put(whichrow, flgs);
|
---|
852 | return;
|
---|
853 | }
|
---|
854 | if ( int(msk.size()) != nchan( getIF(whichrow) ) ) {
|
---|
855 | throw(AipsError("Mask has incorrect number of channels."));
|
---|
856 | }
|
---|
857 | if ( flgs.nelements() != msk.size() ) {
|
---|
858 | throw(AipsError("Mask has incorrect number of channels."
|
---|
859 | " Probably varying with IF. Please flag per IF"));
|
---|
860 | }
|
---|
861 | std::vector<bool>::const_iterator it;
|
---|
862 | uInt j = 0;
|
---|
863 | for (it = msk.begin(); it != msk.end(); ++it) {
|
---|
864 | if ( *it ) {
|
---|
865 | flgs(j) = flagval;
|
---|
866 | }
|
---|
867 | ++j;
|
---|
868 | }
|
---|
869 | flagsCol_.put(whichrow, flgs);
|
---|
870 | }
|
---|
871 |
|
---|
872 | void Scantable::flagRow(const std::vector<uInt>& rows, bool unflag)
|
---|
873 | {
|
---|
874 | if (selector_.empty() && (rows.size() == table_.nrow()) && !unflag)
|
---|
875 | throw(AipsError("Trying to flag whole scantable."));
|
---|
876 |
|
---|
877 | uInt rowflag = (unflag ? 0 : 1);
|
---|
878 | std::vector<uInt>::const_iterator it;
|
---|
879 | for (it = rows.begin(); it != rows.end(); ++it)
|
---|
880 | flagrowCol_.put(*it, rowflag);
|
---|
881 | }
|
---|
882 |
|
---|
883 | std::vector<bool> Scantable::getMask(int whichrow) const
|
---|
884 | {
|
---|
885 | Vector<uChar> flags;
|
---|
886 | flagsCol_.get(uInt(whichrow), flags);
|
---|
887 | Vector<Bool> bflag(flags.shape());
|
---|
888 | convertArray(bflag, flags);
|
---|
889 | bflag = !bflag;
|
---|
890 | std::vector<bool> mask;
|
---|
891 | bflag.tovector(mask);
|
---|
892 | return mask;
|
---|
893 | }
|
---|
894 |
|
---|
895 | std::vector<float> Scantable::getSpectrum( int whichrow,
|
---|
896 | const std::string& poltype ) const
|
---|
897 | {
|
---|
898 | LogIO os( LogOrigin( "Scantable", "getSpectrum()", WHERE ) ) ;
|
---|
899 |
|
---|
900 | String ptype = poltype;
|
---|
901 | if (poltype == "" ) ptype = getPolType();
|
---|
902 | if ( whichrow < 0 || whichrow >= nrow() )
|
---|
903 | throw(AipsError("Illegal row number."));
|
---|
904 | std::vector<float> out;
|
---|
905 | Vector<Float> arr;
|
---|
906 | uInt requestedpol = polCol_(whichrow);
|
---|
907 | String basetype = getPolType();
|
---|
908 | if ( ptype == basetype ) {
|
---|
909 | specCol_.get(whichrow, arr);
|
---|
910 | } else {
|
---|
911 | CountedPtr<STPol> stpol(STPol::getPolClass(Scantable::factories_,
|
---|
912 | basetype));
|
---|
913 | uInt row = uInt(whichrow);
|
---|
914 | stpol->setSpectra(getPolMatrix(row));
|
---|
915 | Float fang,fhand;
|
---|
916 | fang = focusTable_.getTotalAngle(mfocusidCol_(row));
|
---|
917 | fhand = focusTable_.getFeedHand(mfocusidCol_(row));
|
---|
918 | stpol->setPhaseCorrections(fang, fhand);
|
---|
919 | arr = stpol->getSpectrum(requestedpol, ptype);
|
---|
920 | }
|
---|
921 | if ( arr.nelements() == 0 )
|
---|
922 |
|
---|
923 | os << "Not enough polarisations present to do the conversion."
|
---|
924 | << LogIO::POST;
|
---|
925 | arr.tovector(out);
|
---|
926 | return out;
|
---|
927 | }
|
---|
928 |
|
---|
929 | void Scantable::setSpectrum( const std::vector<float>& spec,
|
---|
930 | int whichrow )
|
---|
931 | {
|
---|
932 | Vector<Float> spectrum(spec);
|
---|
933 | Vector<Float> arr;
|
---|
934 | specCol_.get(whichrow, arr);
|
---|
935 | if ( spectrum.nelements() != arr.nelements() )
|
---|
936 | throw AipsError("The spectrum has incorrect number of channels.");
|
---|
937 | specCol_.put(whichrow, spectrum);
|
---|
938 | }
|
---|
939 |
|
---|
940 |
|
---|
941 | String Scantable::generateName()
|
---|
942 | {
|
---|
943 | return (File::newUniqueName("./","temp")).baseName();
|
---|
944 | }
|
---|
945 |
|
---|
946 | const casa::Table& Scantable::table( ) const
|
---|
947 | {
|
---|
948 | return table_;
|
---|
949 | }
|
---|
950 |
|
---|
951 | casa::Table& Scantable::table( )
|
---|
952 | {
|
---|
953 | return table_;
|
---|
954 | }
|
---|
955 |
|
---|
956 | std::string Scantable::getPolType() const
|
---|
957 | {
|
---|
958 | return table_.keywordSet().asString("POLTYPE");
|
---|
959 | }
|
---|
960 |
|
---|
961 | void Scantable::unsetSelection()
|
---|
962 | {
|
---|
963 | table_ = originalTable_;
|
---|
964 | attach();
|
---|
965 | selector_.reset();
|
---|
966 | }
|
---|
967 |
|
---|
968 | void Scantable::setSelection( const STSelector& selection )
|
---|
969 | {
|
---|
970 | Table tab = const_cast<STSelector&>(selection).apply(originalTable_);
|
---|
971 | if ( tab.nrow() == 0 ) {
|
---|
972 | throw(AipsError("Selection contains no data. Not applying it."));
|
---|
973 | }
|
---|
974 | table_ = tab;
|
---|
975 | attach();
|
---|
976 | // tab.rwKeywordSet().define("nBeam",(Int)(getBeamNos().size())) ;
|
---|
977 | // vector<uint> selectedIFs = getIFNos() ;
|
---|
978 | // Int newnIF = selectedIFs.size() ;
|
---|
979 | // tab.rwKeywordSet().define("nIF",newnIF) ;
|
---|
980 | // if ( newnIF != 0 ) {
|
---|
981 | // Int newnChan = 0 ;
|
---|
982 | // for ( Int i = 0 ; i < newnIF ; i++ ) {
|
---|
983 | // Int nChan = nchan( selectedIFs[i] ) ;
|
---|
984 | // if ( newnChan > nChan )
|
---|
985 | // newnChan = nChan ;
|
---|
986 | // }
|
---|
987 | // tab.rwKeywordSet().define("nChan",newnChan) ;
|
---|
988 | // }
|
---|
989 | // tab.rwKeywordSet().define("nPol",(Int)(getPolNos().size())) ;
|
---|
990 | selector_ = selection;
|
---|
991 | }
|
---|
992 |
|
---|
993 |
|
---|
994 | std::string Scantable::headerSummary()
|
---|
995 | {
|
---|
996 | // Format header info
|
---|
997 | // STHeader sdh;
|
---|
998 | // sdh = getHeader();
|
---|
999 | // sdh.print();
|
---|
1000 | ostringstream oss;
|
---|
1001 | oss.flags(std::ios_base::left);
|
---|
1002 | String tmp;
|
---|
1003 | // Project
|
---|
1004 | table_.keywordSet().get("Project", tmp);
|
---|
1005 | oss << setw(15) << "Project:" << tmp << endl;
|
---|
1006 | // Observation date
|
---|
1007 | oss << setw(15) << "Obs Date:" << getTime(-1,true) << endl;
|
---|
1008 | // Observer
|
---|
1009 | oss << setw(15) << "Observer:"
|
---|
1010 | << table_.keywordSet().asString("Observer") << endl;
|
---|
1011 | // Antenna Name
|
---|
1012 | table_.keywordSet().get("AntennaName", tmp);
|
---|
1013 | oss << setw(15) << "Antenna Name:" << tmp << endl;
|
---|
1014 | // Obs type
|
---|
1015 | table_.keywordSet().get("Obstype", tmp);
|
---|
1016 | // Records (nrow)
|
---|
1017 | oss << setw(15) << "Data Records:" << table_.nrow() << " rows" << endl;
|
---|
1018 | oss << setw(15) << "Obs. Type:" << tmp << endl;
|
---|
1019 | // Beams, IFs, Polarizations, and Channels
|
---|
1020 | oss << setw(15) << "Beams:" << setw(4) << nbeam() << endl
|
---|
1021 | << setw(15) << "IFs:" << setw(4) << nif() << endl
|
---|
1022 | << setw(15) << "Polarisations:" << setw(4) << npol()
|
---|
1023 | << "(" << getPolType() << ")" << endl
|
---|
1024 | << setw(15) << "Channels:" << nchan() << endl;
|
---|
1025 | // Flux unit
|
---|
1026 | table_.keywordSet().get("FluxUnit", tmp);
|
---|
1027 | oss << setw(15) << "Flux Unit:" << tmp << endl;
|
---|
1028 | // Abscissa Unit
|
---|
1029 | oss << setw(15) << "Abscissa:" << getAbcissaLabel(0) << endl;
|
---|
1030 | // Selection
|
---|
1031 | oss << selector_.print() << endl;
|
---|
1032 |
|
---|
1033 | return String(oss);
|
---|
1034 | }
|
---|
1035 |
|
---|
1036 | void Scantable::summary( const std::string& filename )
|
---|
1037 | {
|
---|
1038 | ostringstream oss;
|
---|
1039 | ofstream ofs;
|
---|
1040 | LogIO ols(LogOrigin("Scantable", "summary", WHERE));
|
---|
1041 |
|
---|
1042 | if (filename != "")
|
---|
1043 | ofs.open( filename.c_str(), ios::out );
|
---|
1044 |
|
---|
1045 | oss << endl;
|
---|
1046 | oss << asap::SEPERATOR << endl;
|
---|
1047 | oss << " Scan Table Summary" << endl;
|
---|
1048 | oss << asap::SEPERATOR << endl;
|
---|
1049 |
|
---|
1050 | // Format header info
|
---|
1051 | oss << headerSummary();
|
---|
1052 | oss << endl;
|
---|
1053 |
|
---|
1054 | if (table_.nrow() <= 0){
|
---|
1055 | oss << asap::SEPERATOR << endl;
|
---|
1056 | oss << "The MAIN table is empty: there are no data!!!" << endl;
|
---|
1057 | oss << asap::SEPERATOR << endl;
|
---|
1058 |
|
---|
1059 | ols << String(oss) << LogIO::POST;
|
---|
1060 | if (ofs) {
|
---|
1061 | ofs << String(oss) << flush;
|
---|
1062 | ofs.close();
|
---|
1063 | }
|
---|
1064 | return;
|
---|
1065 | }
|
---|
1066 |
|
---|
1067 |
|
---|
1068 |
|
---|
1069 | // main table
|
---|
1070 | String dirtype = "Position ("
|
---|
1071 | + getDirectionRefString()
|
---|
1072 | + ")";
|
---|
1073 | oss.flags(std::ios_base::left);
|
---|
1074 | oss << setw(5) << "Scan"
|
---|
1075 | << setw(15) << "Source"
|
---|
1076 | << setw(35) << "Time range"
|
---|
1077 | << setw(2) << "" << setw(7) << "Int[s]"
|
---|
1078 | << setw(7) << "Record"
|
---|
1079 | << setw(8) << "SrcType"
|
---|
1080 | << setw(8) << "FreqIDs"
|
---|
1081 | << setw(7) << "MolIDs" << endl;
|
---|
1082 | oss << setw(7)<< "" << setw(6) << "Beam"
|
---|
1083 | << setw(23) << dirtype << endl;
|
---|
1084 |
|
---|
1085 | oss << asap::SEPERATOR << endl;
|
---|
1086 |
|
---|
1087 | // Flush summary and clear up the string
|
---|
1088 | ols << String(oss) << LogIO::POST;
|
---|
1089 | if (ofs) ofs << String(oss) << flush;
|
---|
1090 | oss.str("");
|
---|
1091 | oss.clear();
|
---|
1092 |
|
---|
1093 |
|
---|
1094 | // Get Freq_ID map
|
---|
1095 | ROScalarColumn<uInt> ftabIds(frequencies().table(), "ID");
|
---|
1096 | Int nfid = ftabIds.nrow();
|
---|
1097 | if (nfid <= 0){
|
---|
1098 | oss << "FREQUENCIES subtable is empty: there are no data!!!" << endl;
|
---|
1099 | oss << asap::SEPERATOR << endl;
|
---|
1100 |
|
---|
1101 | ols << String(oss) << LogIO::POST;
|
---|
1102 | if (ofs) {
|
---|
1103 | ofs << String(oss) << flush;
|
---|
1104 | ofs.close();
|
---|
1105 | }
|
---|
1106 | return;
|
---|
1107 | }
|
---|
1108 | // Storages of overall IFNO, POLNO, and nchan per FREQ_ID
|
---|
1109 | // the orders are identical to ID in FREQ subtable
|
---|
1110 | Block< Vector<uInt> > ifNos(nfid), polNos(nfid);
|
---|
1111 | Vector<Int> fIdchans(nfid,-1);
|
---|
1112 | map<uInt, Int> fidMap; // (FREQ_ID, row # in FREQ subtable) pair
|
---|
1113 | for (Int i=0; i < nfid; i++){
|
---|
1114 | // fidMap[freqId] returns row number in FREQ subtable
|
---|
1115 | fidMap.insert(pair<uInt, Int>(ftabIds(i),i));
|
---|
1116 | ifNos[i] = Vector<uInt>();
|
---|
1117 | polNos[i] = Vector<uInt>();
|
---|
1118 | }
|
---|
1119 |
|
---|
1120 | TableIterator iter(table_, "SCANNO");
|
---|
1121 |
|
---|
1122 | // Vars for keeping track of time, freqids, molIds in a SCANNO
|
---|
1123 | //Vector<uInt> freqids;
|
---|
1124 | //Vector<uInt> molids;
|
---|
1125 | Vector<uInt> beamids(1,0);
|
---|
1126 | Vector<MDirection> beamDirs;
|
---|
1127 | Vector<Int> stypeids(1,0);
|
---|
1128 | Vector<String> stypestrs;
|
---|
1129 | Int nfreq(1);
|
---|
1130 | Int nmol(1);
|
---|
1131 | uInt nbeam(1);
|
---|
1132 | uInt nstype(1);
|
---|
1133 |
|
---|
1134 | Double btime(0.0), etime(0.0);
|
---|
1135 | Double meanIntTim(0.0);
|
---|
1136 |
|
---|
1137 | uInt currFreqId(0), ftabRow(0);
|
---|
1138 | Int iflen(0), pollen(0);
|
---|
1139 |
|
---|
1140 | while (!iter.pastEnd()) {
|
---|
1141 | Table subt = iter.table();
|
---|
1142 | uInt snrow = subt.nrow();
|
---|
1143 | ROTableRow row(subt);
|
---|
1144 | const TableRecord& rec = row.get(0);
|
---|
1145 |
|
---|
1146 | // relevant columns
|
---|
1147 | ROScalarColumn<Double> mjdCol(subt,"TIME");
|
---|
1148 | ROScalarColumn<Double> intervalCol(subt,"INTERVAL");
|
---|
1149 | MDirection::ROScalarColumn dirCol(subt,"DIRECTION");
|
---|
1150 |
|
---|
1151 | ScalarColumn<uInt> freqIdCol(subt,"FREQ_ID");
|
---|
1152 | ScalarColumn<uInt> molIdCol(subt,"MOLECULE_ID");
|
---|
1153 | ROScalarColumn<uInt> beamCol(subt,"BEAMNO");
|
---|
1154 | ROScalarColumn<Int> stypeCol(subt,"SRCTYPE");
|
---|
1155 |
|
---|
1156 | ROScalarColumn<uInt> ifNoCol(subt,"IFNO");
|
---|
1157 | ROScalarColumn<uInt> polNoCol(subt,"POLNO");
|
---|
1158 |
|
---|
1159 |
|
---|
1160 | // Times
|
---|
1161 | meanIntTim = sum(intervalCol.getColumn()) / (double) snrow;
|
---|
1162 | minMax(btime, etime, mjdCol.getColumn());
|
---|
1163 | etime += meanIntTim/C::day;
|
---|
1164 |
|
---|
1165 | // MOLECULE_ID and FREQ_ID
|
---|
1166 | Vector<uInt> molids(getNumbers(molIdCol));
|
---|
1167 | molids.shape(nmol);
|
---|
1168 |
|
---|
1169 | Vector<uInt> freqids(getNumbers(freqIdCol));
|
---|
1170 | freqids.shape(nfreq);
|
---|
1171 |
|
---|
1172 | // Add first beamid, and srcNames
|
---|
1173 | beamids.resize(1,False);
|
---|
1174 | beamDirs.resize(1,False);
|
---|
1175 | beamids(0)=beamCol(0);
|
---|
1176 | beamDirs(0)=dirCol(0);
|
---|
1177 | nbeam = 1;
|
---|
1178 |
|
---|
1179 | stypeids.resize(1,False);
|
---|
1180 | stypeids(0)=stypeCol(0);
|
---|
1181 | nstype = 1;
|
---|
1182 |
|
---|
1183 | // Global listings of nchan/IFNO/POLNO per FREQ_ID
|
---|
1184 | currFreqId=freqIdCol(0);
|
---|
1185 | ftabRow = fidMap[currFreqId];
|
---|
1186 | // Assumes an identical number of channels per FREQ_ID
|
---|
1187 | if (fIdchans(ftabRow) < 0 ) {
|
---|
1188 | RORecordFieldPtr< Array<Float> > spec(rec, "SPECTRA");
|
---|
1189 | fIdchans(ftabRow)=(*spec).shape()(0);
|
---|
1190 | }
|
---|
1191 | // Should keep ifNos and polNos form the previous SCANNO
|
---|
1192 | if ( !anyEQ(ifNos[ftabRow],ifNoCol(0)) ) {
|
---|
1193 | ifNos[ftabRow].shape(iflen);
|
---|
1194 | iflen++;
|
---|
1195 | ifNos[ftabRow].resize(iflen,True);
|
---|
1196 | ifNos[ftabRow](iflen-1) = ifNoCol(0);
|
---|
1197 | }
|
---|
1198 | if ( !anyEQ(polNos[ftabRow],polNoCol(0)) ) {
|
---|
1199 | polNos[ftabRow].shape(pollen);
|
---|
1200 | pollen++;
|
---|
1201 | polNos[ftabRow].resize(pollen,True);
|
---|
1202 | polNos[ftabRow](pollen-1) = polNoCol(0);
|
---|
1203 | }
|
---|
1204 |
|
---|
1205 | for (uInt i=1; i < snrow; i++){
|
---|
1206 | // Need to list BEAMNO and DIRECTION in the same order
|
---|
1207 | if ( !anyEQ(beamids,beamCol(i)) ) {
|
---|
1208 | nbeam++;
|
---|
1209 | beamids.resize(nbeam,True);
|
---|
1210 | beamids(nbeam-1)=beamCol(i);
|
---|
1211 | beamDirs.resize(nbeam,True);
|
---|
1212 | beamDirs(nbeam-1)=dirCol(i);
|
---|
1213 | }
|
---|
1214 |
|
---|
1215 | // SRCTYPE is Int (getNumber takes only uInt)
|
---|
1216 | if ( !anyEQ(stypeids,stypeCol(i)) ) {
|
---|
1217 | nstype++;
|
---|
1218 | stypeids.resize(nstype,True);
|
---|
1219 | stypeids(nstype-1)=stypeCol(i);
|
---|
1220 | }
|
---|
1221 |
|
---|
1222 | // Global listings of nchan/IFNO/POLNO per FREQ_ID
|
---|
1223 | currFreqId=freqIdCol(i);
|
---|
1224 | ftabRow = fidMap[currFreqId];
|
---|
1225 | if (fIdchans(ftabRow) < 0 ) {
|
---|
1226 | const TableRecord& rec = row.get(i);
|
---|
1227 | RORecordFieldPtr< Array<Float> > spec(rec, "SPECTRA");
|
---|
1228 | fIdchans(ftabRow) = (*spec).shape()(0);
|
---|
1229 | }
|
---|
1230 | if ( !anyEQ(ifNos[ftabRow],ifNoCol(i)) ) {
|
---|
1231 | ifNos[ftabRow].shape(iflen);
|
---|
1232 | iflen++;
|
---|
1233 | ifNos[ftabRow].resize(iflen,True);
|
---|
1234 | ifNos[ftabRow](iflen-1) = ifNoCol(i);
|
---|
1235 | }
|
---|
1236 | if ( !anyEQ(polNos[ftabRow],polNoCol(i)) ) {
|
---|
1237 | polNos[ftabRow].shape(pollen);
|
---|
1238 | pollen++;
|
---|
1239 | polNos[ftabRow].resize(pollen,True);
|
---|
1240 | polNos[ftabRow](pollen-1) = polNoCol(i);
|
---|
1241 | }
|
---|
1242 | } // end of row iteration
|
---|
1243 |
|
---|
1244 | stypestrs.resize(nstype,False);
|
---|
1245 | for (uInt j=0; j < nstype; j++)
|
---|
1246 | stypestrs(j) = SrcType::getName(stypeids(j));
|
---|
1247 |
|
---|
1248 | // Format Scan summary
|
---|
1249 | oss << setw(4) << std::right << rec.asuInt("SCANNO")
|
---|
1250 | << std::left << setw(1) << ""
|
---|
1251 | << setw(15) << rec.asString("SRCNAME")
|
---|
1252 | << setw(21) << MVTime(btime).string(MVTime::YMD,7)
|
---|
1253 | << setw(3) << " - " << MVTime(etime).string(MVTime::TIME,7)
|
---|
1254 | << setw(3) << "" << setw(6) << meanIntTim << setw(1) << ""
|
---|
1255 | << std::right << setw(5) << snrow << setw(2) << ""
|
---|
1256 | << std::left << stypestrs << setw(1) << ""
|
---|
1257 | << freqids << setw(1) << ""
|
---|
1258 | << molids << endl;
|
---|
1259 | // Format Beam summary
|
---|
1260 | for (uInt j=0; j < nbeam; j++) {
|
---|
1261 | oss << setw(7) << "" << setw(6) << beamids(j) << setw(1) << ""
|
---|
1262 | << formatDirection(beamDirs(j)) << endl;
|
---|
1263 | }
|
---|
1264 | // Flush summary every scan and clear up the string
|
---|
1265 | ols << String(oss) << LogIO::POST;
|
---|
1266 | if (ofs) ofs << String(oss) << flush;
|
---|
1267 | oss.str("");
|
---|
1268 | oss.clear();
|
---|
1269 |
|
---|
1270 | ++iter;
|
---|
1271 | } // end of scan iteration
|
---|
1272 | oss << asap::SEPERATOR << endl;
|
---|
1273 |
|
---|
1274 | // List FRECUENCIES Table (using STFrequencies.print may be slow)
|
---|
1275 | oss << "FREQUENCIES: " << nfreq << endl;
|
---|
1276 | oss << std::right << setw(5) << "ID" << setw(2) << ""
|
---|
1277 | << std::left << setw(5) << "IFNO" << setw(2) << ""
|
---|
1278 | << setw(8) << "Frame"
|
---|
1279 | << setw(16) << "RefVal"
|
---|
1280 | << setw(7) << "RefPix"
|
---|
1281 | << setw(15) << "Increment"
|
---|
1282 | << setw(9) << "Channels"
|
---|
1283 | << setw(6) << "POLNOs" << endl;
|
---|
1284 | Int tmplen;
|
---|
1285 | for (Int i=0; i < nfid; i++){
|
---|
1286 | // List row=i of FREQUENCIES subtable
|
---|
1287 | ifNos[i].shape(tmplen);
|
---|
1288 | if (tmplen >= 1) {
|
---|
1289 | oss << std::right << setw(5) << ftabIds(i) << setw(2) << ""
|
---|
1290 | << setw(3) << ifNos[i](0) << setw(1) << ""
|
---|
1291 | << std::left << setw(46) << frequencies().print(ftabIds(i))
|
---|
1292 | << setw(2) << ""
|
---|
1293 | << std::right << setw(8) << fIdchans[i] << setw(2) << ""
|
---|
1294 | << std::left << polNos[i];
|
---|
1295 | if (tmplen > 1) {
|
---|
1296 | oss << " (" << tmplen << " chains)";
|
---|
1297 | }
|
---|
1298 | oss << endl;
|
---|
1299 | }
|
---|
1300 |
|
---|
1301 | }
|
---|
1302 | oss << asap::SEPERATOR << endl;
|
---|
1303 |
|
---|
1304 | // List MOLECULES Table (currently lists all rows)
|
---|
1305 | oss << "MOLECULES: " << endl;
|
---|
1306 | if (molecules().nrow() <= 0) {
|
---|
1307 | oss << " MOLECULES subtable is empty: there are no data" << endl;
|
---|
1308 | } else {
|
---|
1309 | ROTableRow row(molecules().table());
|
---|
1310 | oss << std::right << setw(5) << "ID"
|
---|
1311 | << std::left << setw(3) << ""
|
---|
1312 | << setw(18) << "RestFreq"
|
---|
1313 | << setw(15) << "Name" << endl;
|
---|
1314 | for (Int i=0; i < molecules().nrow(); i++){
|
---|
1315 | const TableRecord& rec=row.get(i);
|
---|
1316 | oss << std::right << setw(5) << rec.asuInt("ID")
|
---|
1317 | << std::left << setw(3) << ""
|
---|
1318 | << rec.asArrayDouble("RESTFREQUENCY") << setw(1) << ""
|
---|
1319 | << rec.asArrayString("NAME") << endl;
|
---|
1320 | }
|
---|
1321 | }
|
---|
1322 | oss << asap::SEPERATOR << endl;
|
---|
1323 | ols << String(oss) << LogIO::POST;
|
---|
1324 | if (ofs) {
|
---|
1325 | ofs << String(oss) << flush;
|
---|
1326 | ofs.close();
|
---|
1327 | }
|
---|
1328 | // return String(oss);
|
---|
1329 | }
|
---|
1330 |
|
---|
1331 |
|
---|
1332 | std::string Scantable::oldheaderSummary()
|
---|
1333 | {
|
---|
1334 | // Format header info
|
---|
1335 | // STHeader sdh;
|
---|
1336 | // sdh = getHeader();
|
---|
1337 | // sdh.print();
|
---|
1338 | ostringstream oss;
|
---|
1339 | oss.flags(std::ios_base::left);
|
---|
1340 | oss << setw(15) << "Beams:" << setw(4) << nbeam() << endl
|
---|
1341 | << setw(15) << "IFs:" << setw(4) << nif() << endl
|
---|
1342 | << setw(15) << "Polarisations:" << setw(4) << npol()
|
---|
1343 | << "(" << getPolType() << ")" << endl
|
---|
1344 | << setw(15) << "Channels:" << nchan() << endl;
|
---|
1345 | String tmp;
|
---|
1346 | oss << setw(15) << "Observer:"
|
---|
1347 | << table_.keywordSet().asString("Observer") << endl;
|
---|
1348 | oss << setw(15) << "Obs Date:" << getTime(-1,true) << endl;
|
---|
1349 | table_.keywordSet().get("Project", tmp);
|
---|
1350 | oss << setw(15) << "Project:" << tmp << endl;
|
---|
1351 | table_.keywordSet().get("Obstype", tmp);
|
---|
1352 | oss << setw(15) << "Obs. Type:" << tmp << endl;
|
---|
1353 | table_.keywordSet().get("AntennaName", tmp);
|
---|
1354 | oss << setw(15) << "Antenna Name:" << tmp << endl;
|
---|
1355 | table_.keywordSet().get("FluxUnit", tmp);
|
---|
1356 | oss << setw(15) << "Flux Unit:" << tmp << endl;
|
---|
1357 | int nid = moleculeTable_.nrow();
|
---|
1358 | Bool firstline = True;
|
---|
1359 | oss << setw(15) << "Rest Freqs:";
|
---|
1360 | for (int i=0; i<nid; i++) {
|
---|
1361 | Table t = table_(table_.col("MOLECULE_ID") == i, 1);
|
---|
1362 | if (t.nrow() > 0) {
|
---|
1363 | Vector<Double> vec(moleculeTable_.getRestFrequency(i));
|
---|
1364 | if (vec.nelements() > 0) {
|
---|
1365 | if (firstline) {
|
---|
1366 | oss << setprecision(10) << vec << " [Hz]" << endl;
|
---|
1367 | firstline=False;
|
---|
1368 | }
|
---|
1369 | else{
|
---|
1370 | oss << setw(15)<<" " << setprecision(10) << vec << " [Hz]" << endl;
|
---|
1371 | }
|
---|
1372 | } else {
|
---|
1373 | oss << "none" << endl;
|
---|
1374 | }
|
---|
1375 | }
|
---|
1376 | }
|
---|
1377 |
|
---|
1378 | oss << setw(15) << "Abcissa:" << getAbcissaLabel(0) << endl;
|
---|
1379 | oss << selector_.print() << endl;
|
---|
1380 | return String(oss);
|
---|
1381 | }
|
---|
1382 |
|
---|
1383 | //std::string Scantable::summary( const std::string& filename )
|
---|
1384 | void Scantable::oldsummary( const std::string& filename )
|
---|
1385 | {
|
---|
1386 | ostringstream oss;
|
---|
1387 | ofstream ofs;
|
---|
1388 | LogIO ols(LogOrigin("Scantable", "summary", WHERE));
|
---|
1389 |
|
---|
1390 | if (filename != "")
|
---|
1391 | ofs.open( filename.c_str(), ios::out );
|
---|
1392 |
|
---|
1393 | oss << endl;
|
---|
1394 | oss << asap::SEPERATOR << endl;
|
---|
1395 | oss << " Scan Table Summary" << endl;
|
---|
1396 | oss << asap::SEPERATOR << endl;
|
---|
1397 |
|
---|
1398 | // Format header info
|
---|
1399 | oss << oldheaderSummary();
|
---|
1400 | oss << endl;
|
---|
1401 |
|
---|
1402 | // main table
|
---|
1403 | String dirtype = "Position ("
|
---|
1404 | + getDirectionRefString()
|
---|
1405 | + ")";
|
---|
1406 | oss.flags(std::ios_base::left);
|
---|
1407 | oss << setw(5) << "Scan" << setw(15) << "Source"
|
---|
1408 | << setw(10) << "Time" << setw(18) << "Integration"
|
---|
1409 | << setw(15) << "Source Type" << endl;
|
---|
1410 | oss << setw(5) << "" << setw(5) << "Beam" << setw(3) << "" << dirtype << endl;
|
---|
1411 | oss << setw(10) << "" << setw(3) << "IF" << setw(3) << ""
|
---|
1412 | << setw(8) << "Frame" << setw(16)
|
---|
1413 | << "RefVal" << setw(10) << "RefPix" << setw(12) << "Increment"
|
---|
1414 | << setw(7) << "Channels"
|
---|
1415 | << endl;
|
---|
1416 | oss << asap::SEPERATOR << endl;
|
---|
1417 |
|
---|
1418 | // Flush summary and clear up the string
|
---|
1419 | ols << String(oss) << LogIO::POST;
|
---|
1420 | if (ofs) ofs << String(oss) << flush;
|
---|
1421 | oss.str("");
|
---|
1422 | oss.clear();
|
---|
1423 |
|
---|
1424 | TableIterator iter(table_, "SCANNO");
|
---|
1425 | while (!iter.pastEnd()) {
|
---|
1426 | Table subt = iter.table();
|
---|
1427 | ROTableRow row(subt);
|
---|
1428 | MEpoch::ROScalarColumn timeCol(subt,"TIME");
|
---|
1429 | const TableRecord& rec = row.get(0);
|
---|
1430 | oss << setw(4) << std::right << rec.asuInt("SCANNO")
|
---|
1431 | << std::left << setw(1) << ""
|
---|
1432 | << setw(15) << rec.asString("SRCNAME")
|
---|
1433 | << setw(10) << formatTime(timeCol(0), false);
|
---|
1434 | // count the cycles in the scan
|
---|
1435 | TableIterator cyciter(subt, "CYCLENO");
|
---|
1436 | int nint = 0;
|
---|
1437 | while (!cyciter.pastEnd()) {
|
---|
1438 | ++nint;
|
---|
1439 | ++cyciter;
|
---|
1440 | }
|
---|
1441 | oss << setw(3) << std::right << nint << setw(3) << " x " << std::left
|
---|
1442 | << setw(11) << formatSec(rec.asFloat("INTERVAL")) << setw(1) << ""
|
---|
1443 | << setw(15) << SrcType::getName(rec.asInt("SRCTYPE")) << endl;
|
---|
1444 |
|
---|
1445 | TableIterator biter(subt, "BEAMNO");
|
---|
1446 | while (!biter.pastEnd()) {
|
---|
1447 | Table bsubt = biter.table();
|
---|
1448 | ROTableRow brow(bsubt);
|
---|
1449 | const TableRecord& brec = brow.get(0);
|
---|
1450 | uInt row0 = bsubt.rowNumbers(table_)[0];
|
---|
1451 | oss << setw(5) << "" << setw(4) << std::right << brec.asuInt("BEAMNO")<< std::left;
|
---|
1452 | oss << setw(4) << "" << formatDirection(getDirection(row0)) << endl;
|
---|
1453 | TableIterator iiter(bsubt, "IFNO");
|
---|
1454 | while (!iiter.pastEnd()) {
|
---|
1455 | Table isubt = iiter.table();
|
---|
1456 | ROTableRow irow(isubt);
|
---|
1457 | const TableRecord& irec = irow.get(0);
|
---|
1458 | oss << setw(9) << "";
|
---|
1459 | oss << setw(3) << std::right << irec.asuInt("IFNO") << std::left
|
---|
1460 | << setw(1) << "" << frequencies().print(irec.asuInt("FREQ_ID"))
|
---|
1461 | << setw(3) << "" << nchan(irec.asuInt("IFNO"))
|
---|
1462 | << endl;
|
---|
1463 |
|
---|
1464 | ++iiter;
|
---|
1465 | }
|
---|
1466 | ++biter;
|
---|
1467 | }
|
---|
1468 | // Flush summary every scan and clear up the string
|
---|
1469 | ols << String(oss) << LogIO::POST;
|
---|
1470 | if (ofs) ofs << String(oss) << flush;
|
---|
1471 | oss.str("");
|
---|
1472 | oss.clear();
|
---|
1473 |
|
---|
1474 | ++iter;
|
---|
1475 | }
|
---|
1476 | oss << asap::SEPERATOR << endl;
|
---|
1477 | ols << String(oss) << LogIO::POST;
|
---|
1478 | if (ofs) {
|
---|
1479 | ofs << String(oss) << flush;
|
---|
1480 | ofs.close();
|
---|
1481 | }
|
---|
1482 | // return String(oss);
|
---|
1483 | }
|
---|
1484 |
|
---|
1485 | // std::string Scantable::getTime(int whichrow, bool showdate) const
|
---|
1486 | // {
|
---|
1487 | // MEpoch::ROScalarColumn timeCol(table_, "TIME");
|
---|
1488 | // MEpoch me;
|
---|
1489 | // if (whichrow > -1) {
|
---|
1490 | // me = timeCol(uInt(whichrow));
|
---|
1491 | // } else {
|
---|
1492 | // Double tm;
|
---|
1493 | // table_.keywordSet().get("UTC",tm);
|
---|
1494 | // me = MEpoch(MVEpoch(tm));
|
---|
1495 | // }
|
---|
1496 | // return formatTime(me, showdate);
|
---|
1497 | // }
|
---|
1498 |
|
---|
1499 | std::string Scantable::getTime(int whichrow, bool showdate, uInt prec) const
|
---|
1500 | {
|
---|
1501 | MEpoch me;
|
---|
1502 | me = getEpoch(whichrow);
|
---|
1503 | return formatTime(me, showdate, prec);
|
---|
1504 | }
|
---|
1505 |
|
---|
1506 | MEpoch Scantable::getEpoch(int whichrow) const
|
---|
1507 | {
|
---|
1508 | if (whichrow > -1) {
|
---|
1509 | return timeCol_(uInt(whichrow));
|
---|
1510 | } else {
|
---|
1511 | Double tm;
|
---|
1512 | table_.keywordSet().get("UTC",tm);
|
---|
1513 | return MEpoch(MVEpoch(tm));
|
---|
1514 | }
|
---|
1515 | }
|
---|
1516 |
|
---|
1517 | std::string Scantable::getDirectionString(int whichrow) const
|
---|
1518 | {
|
---|
1519 | return formatDirection(getDirection(uInt(whichrow)));
|
---|
1520 | }
|
---|
1521 |
|
---|
1522 |
|
---|
1523 | SpectralCoordinate Scantable::getSpectralCoordinate(int whichrow) const {
|
---|
1524 | const MPosition& mp = getAntennaPosition();
|
---|
1525 | const MDirection& md = getDirection(whichrow);
|
---|
1526 | const MEpoch& me = timeCol_(whichrow);
|
---|
1527 | //Double rf = moleculeTable_.getRestFrequency(mmolidCol_(whichrow));
|
---|
1528 | Vector<Double> rf = moleculeTable_.getRestFrequency(mmolidCol_(whichrow));
|
---|
1529 | return freqTable_.getSpectralCoordinate(md, mp, me, rf,
|
---|
1530 | mfreqidCol_(whichrow));
|
---|
1531 | }
|
---|
1532 |
|
---|
1533 | std::vector< double > Scantable::getAbcissa( int whichrow ) const
|
---|
1534 | {
|
---|
1535 | if ( whichrow > int(table_.nrow()) ) throw(AipsError("Illegal row number"));
|
---|
1536 | std::vector<double> stlout;
|
---|
1537 | int nchan = specCol_(whichrow).nelements();
|
---|
1538 | String us = freqTable_.getUnitString();
|
---|
1539 | if ( us == "" || us == "pixel" || us == "channel" ) {
|
---|
1540 | for (int i=0; i<nchan; ++i) {
|
---|
1541 | stlout.push_back(double(i));
|
---|
1542 | }
|
---|
1543 | return stlout;
|
---|
1544 | }
|
---|
1545 | SpectralCoordinate spc = getSpectralCoordinate(whichrow);
|
---|
1546 | Vector<Double> pixel(nchan);
|
---|
1547 | Vector<Double> world;
|
---|
1548 | indgen(pixel);
|
---|
1549 | if ( Unit(us) == Unit("Hz") ) {
|
---|
1550 | for ( int i=0; i < nchan; ++i) {
|
---|
1551 | Double world;
|
---|
1552 | spc.toWorld(world, pixel[i]);
|
---|
1553 | stlout.push_back(double(world));
|
---|
1554 | }
|
---|
1555 | } else if ( Unit(us) == Unit("km/s") ) {
|
---|
1556 | Vector<Double> world;
|
---|
1557 | spc.pixelToVelocity(world, pixel);
|
---|
1558 | world.tovector(stlout);
|
---|
1559 | }
|
---|
1560 | return stlout;
|
---|
1561 | }
|
---|
1562 | void Scantable::setDirectionRefString( const std::string & refstr )
|
---|
1563 | {
|
---|
1564 | MDirection::Types mdt;
|
---|
1565 | if (refstr != "" && !MDirection::getType(mdt, refstr)) {
|
---|
1566 | throw(AipsError("Illegal Direction frame."));
|
---|
1567 | }
|
---|
1568 | if ( refstr == "" ) {
|
---|
1569 | String defaultstr = MDirection::showType(dirCol_.getMeasRef().getType());
|
---|
1570 | table_.rwKeywordSet().define("DIRECTIONREF", defaultstr);
|
---|
1571 | } else {
|
---|
1572 | table_.rwKeywordSet().define("DIRECTIONREF", String(refstr));
|
---|
1573 | }
|
---|
1574 | }
|
---|
1575 |
|
---|
1576 | std::string Scantable::getDirectionRefString( ) const
|
---|
1577 | {
|
---|
1578 | return table_.keywordSet().asString("DIRECTIONREF");
|
---|
1579 | }
|
---|
1580 |
|
---|
1581 | MDirection Scantable::getDirection(int whichrow ) const
|
---|
1582 | {
|
---|
1583 | String usertype = table_.keywordSet().asString("DIRECTIONREF");
|
---|
1584 | String type = MDirection::showType(dirCol_.getMeasRef().getType());
|
---|
1585 | if ( usertype != type ) {
|
---|
1586 | MDirection::Types mdt;
|
---|
1587 | if (!MDirection::getType(mdt, usertype)) {
|
---|
1588 | throw(AipsError("Illegal Direction frame."));
|
---|
1589 | }
|
---|
1590 | return dirCol_.convert(uInt(whichrow), mdt);
|
---|
1591 | } else {
|
---|
1592 | return dirCol_(uInt(whichrow));
|
---|
1593 | }
|
---|
1594 | }
|
---|
1595 |
|
---|
1596 | std::string Scantable::getAbcissaLabel( int whichrow ) const
|
---|
1597 | {
|
---|
1598 | if ( whichrow > int(table_.nrow()) ) throw(AipsError("Illegal ro number"));
|
---|
1599 | const MPosition& mp = getAntennaPosition();
|
---|
1600 | const MDirection& md = getDirection(whichrow);
|
---|
1601 | const MEpoch& me = timeCol_(whichrow);
|
---|
1602 | //const Double& rf = mmolidCol_(whichrow);
|
---|
1603 | const Vector<Double> rf = moleculeTable_.getRestFrequency(mmolidCol_(whichrow));
|
---|
1604 | SpectralCoordinate spc =
|
---|
1605 | freqTable_.getSpectralCoordinate(md, mp, me, rf, mfreqidCol_(whichrow));
|
---|
1606 |
|
---|
1607 | String s = "Channel";
|
---|
1608 | Unit u = Unit(freqTable_.getUnitString());
|
---|
1609 | if (u == Unit("km/s")) {
|
---|
1610 | s = CoordinateUtil::axisLabel(spc, 0, True,True, True);
|
---|
1611 | } else if (u == Unit("Hz")) {
|
---|
1612 | Vector<String> wau(1);wau = u.getName();
|
---|
1613 | spc.setWorldAxisUnits(wau);
|
---|
1614 | s = CoordinateUtil::axisLabel(spc, 0, True, True, False);
|
---|
1615 | }
|
---|
1616 | return s;
|
---|
1617 |
|
---|
1618 | }
|
---|
1619 |
|
---|
1620 | /**
|
---|
1621 | void asap::Scantable::setRestFrequencies( double rf, const std::string& name,
|
---|
1622 | const std::string& unit )
|
---|
1623 | **/
|
---|
1624 | void Scantable::setRestFrequencies( vector<double> rf, const vector<std::string>& name,
|
---|
1625 | const std::string& unit )
|
---|
1626 |
|
---|
1627 | {
|
---|
1628 | ///@todo lookup in line table to fill in name and formattedname
|
---|
1629 | Unit u(unit);
|
---|
1630 | //Quantum<Double> urf(rf, u);
|
---|
1631 | Quantum<Vector<Double> >urf(rf, u);
|
---|
1632 | Vector<String> formattedname(0);
|
---|
1633 | //cerr<<"Scantable::setRestFrequnecies="<<urf<<endl;
|
---|
1634 |
|
---|
1635 | //uInt id = moleculeTable_.addEntry(urf.getValue("Hz"), name, "");
|
---|
1636 | uInt id = moleculeTable_.addEntry(urf.getValue("Hz"), mathutil::toVectorString(name), formattedname);
|
---|
1637 | TableVector<uInt> tabvec(table_, "MOLECULE_ID");
|
---|
1638 | tabvec = id;
|
---|
1639 | }
|
---|
1640 |
|
---|
1641 | /**
|
---|
1642 | void asap::Scantable::setRestFrequencies( const std::string& name )
|
---|
1643 | {
|
---|
1644 | throw(AipsError("setRestFrequencies( const std::string& name ) NYI"));
|
---|
1645 | ///@todo implement
|
---|
1646 | }
|
---|
1647 | **/
|
---|
1648 |
|
---|
1649 | void Scantable::setRestFrequencies( const vector<std::string>& name )
|
---|
1650 | {
|
---|
1651 | (void) name; // suppress unused warning
|
---|
1652 | throw(AipsError("setRestFrequencies( const vector<std::string>& name ) NYI"));
|
---|
1653 | ///@todo implement
|
---|
1654 | }
|
---|
1655 |
|
---|
1656 | std::vector< unsigned int > Scantable::rownumbers( ) const
|
---|
1657 | {
|
---|
1658 | std::vector<unsigned int> stlout;
|
---|
1659 | Vector<uInt> vec = table_.rowNumbers();
|
---|
1660 | vec.tovector(stlout);
|
---|
1661 | return stlout;
|
---|
1662 | }
|
---|
1663 |
|
---|
1664 |
|
---|
1665 | Matrix<Float> Scantable::getPolMatrix( uInt whichrow ) const
|
---|
1666 | {
|
---|
1667 | ROTableRow row(table_);
|
---|
1668 | const TableRecord& rec = row.get(whichrow);
|
---|
1669 | Table t =
|
---|
1670 | originalTable_( originalTable_.col("SCANNO") == Int(rec.asuInt("SCANNO"))
|
---|
1671 | && originalTable_.col("BEAMNO") == Int(rec.asuInt("BEAMNO"))
|
---|
1672 | && originalTable_.col("IFNO") == Int(rec.asuInt("IFNO"))
|
---|
1673 | && originalTable_.col("CYCLENO") == Int(rec.asuInt("CYCLENO")) );
|
---|
1674 | ROArrayColumn<Float> speccol(t, "SPECTRA");
|
---|
1675 | return speccol.getColumn();
|
---|
1676 | }
|
---|
1677 |
|
---|
1678 | std::vector< std::string > Scantable::columnNames( ) const
|
---|
1679 | {
|
---|
1680 | Vector<String> vec = table_.tableDesc().columnNames();
|
---|
1681 | return mathutil::tovectorstring(vec);
|
---|
1682 | }
|
---|
1683 |
|
---|
1684 | MEpoch::Types Scantable::getTimeReference( ) const
|
---|
1685 | {
|
---|
1686 | return MEpoch::castType(timeCol_.getMeasRef().getType());
|
---|
1687 | }
|
---|
1688 |
|
---|
1689 | void Scantable::addFit( const STFitEntry& fit, int row )
|
---|
1690 | {
|
---|
1691 | //cout << mfitidCol_(uInt(row)) << endl;
|
---|
1692 | LogIO os( LogOrigin( "Scantable", "addFit()", WHERE ) ) ;
|
---|
1693 | os << mfitidCol_(uInt(row)) << LogIO::POST ;
|
---|
1694 | uInt id = fitTable_.addEntry(fit, mfitidCol_(uInt(row)));
|
---|
1695 | mfitidCol_.put(uInt(row), id);
|
---|
1696 | }
|
---|
1697 |
|
---|
1698 | void Scantable::shift(int npix)
|
---|
1699 | {
|
---|
1700 | Vector<uInt> fids(mfreqidCol_.getColumn());
|
---|
1701 | genSort( fids, Sort::Ascending,
|
---|
1702 | Sort::QuickSort|Sort::NoDuplicates );
|
---|
1703 | for (uInt i=0; i<fids.nelements(); ++i) {
|
---|
1704 | frequencies().shiftRefPix(npix, fids[i]);
|
---|
1705 | }
|
---|
1706 | }
|
---|
1707 |
|
---|
1708 | String Scantable::getAntennaName() const
|
---|
1709 | {
|
---|
1710 | String out;
|
---|
1711 | table_.keywordSet().get("AntennaName", out);
|
---|
1712 | String::size_type pos1 = out.find("@") ;
|
---|
1713 | String::size_type pos2 = out.find("//") ;
|
---|
1714 | if ( pos2 != String::npos )
|
---|
1715 | out = out.substr(pos2+2,pos1-pos2-2) ;
|
---|
1716 | else if ( pos1 != String::npos )
|
---|
1717 | out = out.substr(0,pos1) ;
|
---|
1718 | return out;
|
---|
1719 | }
|
---|
1720 |
|
---|
1721 | int Scantable::checkScanInfo(const std::vector<int>& scanlist) const
|
---|
1722 | {
|
---|
1723 | String tbpath;
|
---|
1724 | int ret = 0;
|
---|
1725 | if ( table_.keywordSet().isDefined("GBT_GO") ) {
|
---|
1726 | table_.keywordSet().get("GBT_GO", tbpath);
|
---|
1727 | Table t(tbpath,Table::Old);
|
---|
1728 | // check each scan if other scan of the pair exist
|
---|
1729 | int nscan = scanlist.size();
|
---|
1730 | for (int i = 0; i < nscan; i++) {
|
---|
1731 | Table subt = t( t.col("SCAN") == scanlist[i] );
|
---|
1732 | if (subt.nrow()==0) {
|
---|
1733 | //cerr <<"Scan "<<scanlist[i]<<" cannot be found in the scantable."<<endl;
|
---|
1734 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1735 | os <<LogIO::WARN<<"Scan "<<scanlist[i]<<" cannot be found in the scantable."<<LogIO::POST;
|
---|
1736 | ret = 1;
|
---|
1737 | break;
|
---|
1738 | }
|
---|
1739 | ROTableRow row(subt);
|
---|
1740 | const TableRecord& rec = row.get(0);
|
---|
1741 | int scan1seqn = rec.asuInt("PROCSEQN");
|
---|
1742 | int laston1 = rec.asuInt("LASTON");
|
---|
1743 | if ( rec.asuInt("PROCSIZE")==2 ) {
|
---|
1744 | if ( i < nscan-1 ) {
|
---|
1745 | Table subt2 = t( t.col("SCAN") == scanlist[i+1] );
|
---|
1746 | if ( subt2.nrow() == 0) {
|
---|
1747 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1748 |
|
---|
1749 | //cerr<<"Scan "<<scanlist[i+1]<<" cannot be found in the scantable."<<endl;
|
---|
1750 | os<<LogIO::WARN<<"Scan "<<scanlist[i+1]<<" cannot be found in the scantable."<<LogIO::POST;
|
---|
1751 | ret = 1;
|
---|
1752 | break;
|
---|
1753 | }
|
---|
1754 | ROTableRow row2(subt2);
|
---|
1755 | const TableRecord& rec2 = row2.get(0);
|
---|
1756 | int scan2seqn = rec2.asuInt("PROCSEQN");
|
---|
1757 | int laston2 = rec2.asuInt("LASTON");
|
---|
1758 | if (scan1seqn == 1 && scan2seqn == 2) {
|
---|
1759 | if (laston1 == laston2) {
|
---|
1760 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1761 | //cerr<<"A valid scan pair ["<<scanlist[i]<<","<<scanlist[i+1]<<"]"<<endl;
|
---|
1762 | os<<"A valid scan pair ["<<scanlist[i]<<","<<scanlist[i+1]<<"]"<<LogIO::POST;
|
---|
1763 | i +=1;
|
---|
1764 | }
|
---|
1765 | else {
|
---|
1766 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1767 | //cerr<<"Incorrect scan pair ["<<scanlist[i]<<","<<scanlist[i+1]<<"]"<<endl;
|
---|
1768 | os<<LogIO::WARN<<"Incorrect scan pair ["<<scanlist[i]<<","<<scanlist[i+1]<<"]"<<LogIO::POST;
|
---|
1769 | }
|
---|
1770 | }
|
---|
1771 | else if (scan1seqn==2 && scan2seqn == 1) {
|
---|
1772 | if (laston1 == laston2) {
|
---|
1773 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1774 | //cerr<<"["<<scanlist[i]<<","<<scanlist[i+1]<<"] is a valid scan pair but in incorrect order."<<endl;
|
---|
1775 | os<<LogIO::WARN<<"["<<scanlist[i]<<","<<scanlist[i+1]<<"] is a valid scan pair but in incorrect order."<<LogIO::POST;
|
---|
1776 | ret = 1;
|
---|
1777 | break;
|
---|
1778 | }
|
---|
1779 | }
|
---|
1780 | else {
|
---|
1781 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1782 | //cerr<<"The other scan for "<<scanlist[i]<<" appears to be missing. Check the input scan numbers."<<endl;
|
---|
1783 | os<<LogIO::WARN<<"The other scan for "<<scanlist[i]<<" appears to be missing. Check the input scan numbers."<<LogIO::POST;
|
---|
1784 | ret = 1;
|
---|
1785 | break;
|
---|
1786 | }
|
---|
1787 | }
|
---|
1788 | }
|
---|
1789 | else {
|
---|
1790 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1791 | //cerr<<"The scan does not appear to be standard obsevation."<<endl;
|
---|
1792 | os<<LogIO::WARN<<"The scan does not appear to be standard obsevation."<<LogIO::POST;
|
---|
1793 | }
|
---|
1794 | //if ( i >= nscan ) break;
|
---|
1795 | }
|
---|
1796 | }
|
---|
1797 | else {
|
---|
1798 | LogIO os( LogOrigin( "Scantable", "checkScanInfo()", WHERE ) ) ;
|
---|
1799 | //cerr<<"No reference to GBT_GO table."<<endl;
|
---|
1800 | os<<LogIO::WARN<<"No reference to GBT_GO table."<<LogIO::POST;
|
---|
1801 | ret = 1;
|
---|
1802 | }
|
---|
1803 | return ret;
|
---|
1804 | }
|
---|
1805 |
|
---|
1806 | std::vector<double> Scantable::getDirectionVector(int whichrow) const
|
---|
1807 | {
|
---|
1808 | Vector<Double> Dir = dirCol_(whichrow).getAngle("rad").getValue();
|
---|
1809 | std::vector<double> dir;
|
---|
1810 | Dir.tovector(dir);
|
---|
1811 | return dir;
|
---|
1812 | }
|
---|
1813 |
|
---|
1814 | void asap::Scantable::reshapeSpectrum( int nmin, int nmax )
|
---|
1815 | throw( casa::AipsError )
|
---|
1816 | {
|
---|
1817 | // assumed that all rows have same nChan
|
---|
1818 | Vector<Float> arr = specCol_( 0 ) ;
|
---|
1819 | int nChan = arr.nelements() ;
|
---|
1820 |
|
---|
1821 | // if nmin < 0 or nmax < 0, nothing to do
|
---|
1822 | if ( nmin < 0 ) {
|
---|
1823 | throw( casa::indexError<int>( nmin, "asap::Scantable::reshapeSpectrum: Invalid range. Negative index is specified." ) ) ;
|
---|
1824 | }
|
---|
1825 | if ( nmax < 0 ) {
|
---|
1826 | throw( casa::indexError<int>( nmax, "asap::Scantable::reshapeSpectrum: Invalid range. Negative index is specified." ) ) ;
|
---|
1827 | }
|
---|
1828 |
|
---|
1829 | // if nmin > nmax, exchange values
|
---|
1830 | if ( nmin > nmax ) {
|
---|
1831 | int tmp = nmax ;
|
---|
1832 | nmax = nmin ;
|
---|
1833 | nmin = tmp ;
|
---|
1834 | LogIO os( LogOrigin( "Scantable", "reshapeSpectrum()", WHERE ) ) ;
|
---|
1835 | os << "Swap values. Applied range is ["
|
---|
1836 | << nmin << ", " << nmax << "]" << LogIO::POST ;
|
---|
1837 | }
|
---|
1838 |
|
---|
1839 | // if nmin exceeds nChan, nothing to do
|
---|
1840 | if ( nmin >= nChan ) {
|
---|
1841 | throw( casa::indexError<int>( nmin, "asap::Scantable::reshapeSpectrum: Invalid range. Specified minimum exceeds nChan." ) ) ;
|
---|
1842 | }
|
---|
1843 |
|
---|
1844 | // if nmax exceeds nChan, reset nmax to nChan
|
---|
1845 | if ( nmax >= nChan-1 ) {
|
---|
1846 | if ( nmin == 0 ) {
|
---|
1847 | // nothing to do
|
---|
1848 | LogIO os( LogOrigin( "Scantable", "reshapeSpectrum()", WHERE ) ) ;
|
---|
1849 | os << "Whole range is selected. Nothing to do." << LogIO::POST ;
|
---|
1850 | return ;
|
---|
1851 | }
|
---|
1852 | else {
|
---|
1853 | LogIO os( LogOrigin( "Scantable", "reshapeSpectrum()", WHERE ) ) ;
|
---|
1854 | os << "Specified maximum exceeds nChan. Applied range is ["
|
---|
1855 | << nmin << ", " << nChan-1 << "]." << LogIO::POST ;
|
---|
1856 | nmax = nChan - 1 ;
|
---|
1857 | }
|
---|
1858 | }
|
---|
1859 |
|
---|
1860 | // reshape specCol_ and flagCol_
|
---|
1861 | for ( int irow = 0 ; irow < nrow() ; irow++ ) {
|
---|
1862 | reshapeSpectrum( nmin, nmax, irow ) ;
|
---|
1863 | }
|
---|
1864 |
|
---|
1865 | // update FREQUENCIES subtable
|
---|
1866 | Vector<uInt> freqIdArray = mfreqidCol_.getColumn();
|
---|
1867 | uInt numFreqId = GenSort<uInt>::sort(freqIdArray, Sort::Ascending,
|
---|
1868 | Sort::HeapSort | Sort::NoDuplicates);
|
---|
1869 | Double refpix ;
|
---|
1870 | Double refval ;
|
---|
1871 | Double increment ;
|
---|
1872 | for (uInt irow = 0; irow < numFreqId; irow++) {
|
---|
1873 | freqTable_.getEntry( refpix, refval, increment, freqIdArray[irow] ) ;
|
---|
1874 | /***
|
---|
1875 | * need to shift refpix to nmin
|
---|
1876 | * note that channel nmin in old index will be channel 0 in new one
|
---|
1877 | ***/
|
---|
1878 | refval = refval - ( refpix - nmin ) * increment ;
|
---|
1879 | refpix = 0 ;
|
---|
1880 | freqTable_.setEntry( refpix, refval, increment, freqIdArray[irow] ) ;
|
---|
1881 | }
|
---|
1882 |
|
---|
1883 | // update nchan
|
---|
1884 | int newsize = nmax - nmin + 1 ;
|
---|
1885 | table_.rwKeywordSet().define( "nChan", newsize ) ;
|
---|
1886 |
|
---|
1887 | // update bandwidth
|
---|
1888 | // assumed all spectra in the scantable have same bandwidth
|
---|
1889 | table_.rwKeywordSet().define( "Bandwidth", increment * newsize ) ;
|
---|
1890 |
|
---|
1891 | return ;
|
---|
1892 | }
|
---|
1893 |
|
---|
1894 | void asap::Scantable::reshapeSpectrum( int nmin, int nmax, int irow )
|
---|
1895 | {
|
---|
1896 | // reshape specCol_ and flagCol_
|
---|
1897 | Vector<Float> oldspec = specCol_( irow ) ;
|
---|
1898 | Vector<uChar> oldflag = flagsCol_( irow ) ;
|
---|
1899 | Vector<Float> oldtsys = tsysCol_( irow ) ;
|
---|
1900 | uInt newsize = nmax - nmin + 1 ;
|
---|
1901 | Slice slice( nmin, newsize, 1 ) ;
|
---|
1902 | specCol_.put( irow, oldspec( slice ) ) ;
|
---|
1903 | flagsCol_.put( irow, oldflag( slice ) ) ;
|
---|
1904 | if ( oldspec.size() == oldtsys.size() )
|
---|
1905 | tsysCol_.put( irow, oldtsys( slice ) ) ;
|
---|
1906 |
|
---|
1907 | return ;
|
---|
1908 | }
|
---|
1909 |
|
---|
1910 | void asap::Scantable::regridSpecChannel( double dnu, int nChan )
|
---|
1911 | {
|
---|
1912 | LogIO os( LogOrigin( "Scantable", "regridChannel()", WHERE ) ) ;
|
---|
1913 | os << "Regrid abcissa with spectral resoultion " << dnu << " " << freqTable_.getUnitString() << " with channel number " << ((nChan>0)? String(nChan) : "covering band width")<< LogIO::POST ;
|
---|
1914 | int freqnrow = freqTable_.table().nrow() ;
|
---|
1915 | Vector<bool> firstTime( freqnrow, true ) ;
|
---|
1916 | double oldincr, factor;
|
---|
1917 | uInt currId;
|
---|
1918 | Double refpix ;
|
---|
1919 | Double refval ;
|
---|
1920 | Double increment ;
|
---|
1921 | for ( int irow = 0 ; irow < nrow() ; irow++ ) {
|
---|
1922 | currId = mfreqidCol_(irow);
|
---|
1923 | vector<double> abcissa = getAbcissa( irow ) ;
|
---|
1924 | if (nChan < 0) {
|
---|
1925 | int oldsize = abcissa.size() ;
|
---|
1926 | double bw = (abcissa[oldsize-1]-abcissa[0]) + \
|
---|
1927 | 0.5 * (abcissa[1]-abcissa[0] + abcissa[oldsize-1]-abcissa[oldsize-2]) ;
|
---|
1928 | nChan = int( ceil( abs(bw/dnu) ) ) ;
|
---|
1929 | }
|
---|
1930 | // actual regridding
|
---|
1931 | regridChannel( nChan, dnu, irow ) ;
|
---|
1932 |
|
---|
1933 | // update FREQUENCIES subtable
|
---|
1934 | if (firstTime[currId]) {
|
---|
1935 | oldincr = abcissa[1]-abcissa[0] ;
|
---|
1936 | factor = dnu/oldincr ;
|
---|
1937 | firstTime[currId] = false ;
|
---|
1938 | freqTable_.getEntry( refpix, refval, increment, currId ) ;
|
---|
1939 |
|
---|
1940 | //refval = refval - ( refpix + 0.5 * (1 - factor) ) * increment ;
|
---|
1941 | if (factor > 0 ) {
|
---|
1942 | refpix = (refpix + 0.5)/factor - 0.5;
|
---|
1943 | } else {
|
---|
1944 | refpix = (abcissa.size() - 0.5 - refpix)/abs(factor) - 0.5;
|
---|
1945 | }
|
---|
1946 | freqTable_.setEntry( refpix, refval, increment*factor, currId ) ;
|
---|
1947 | //os << "ID" << currId << ": channel width (Orig) = " << oldincr << " [" << freqTable_.getUnitString() << "], scale factor = " << factor << LogIO::POST ;
|
---|
1948 | //os << " frequency increment (Orig) = " << increment << "-> (New) " << increment*factor << LogIO::POST ;
|
---|
1949 | }
|
---|
1950 | }
|
---|
1951 | }
|
---|
1952 |
|
---|
1953 | void asap::Scantable::regridChannel( int nChan, double dnu )
|
---|
1954 | {
|
---|
1955 | LogIO os( LogOrigin( "Scantable", "regridChannel()", WHERE ) ) ;
|
---|
1956 | os << "Regrid abcissa with channel number " << nChan << " and spectral resoultion " << dnu << "Hz." << LogIO::POST ;
|
---|
1957 | // assumed that all rows have same nChan
|
---|
1958 | Vector<Float> arr = specCol_( 0 ) ;
|
---|
1959 | int oldsize = arr.nelements() ;
|
---|
1960 |
|
---|
1961 | // if oldsize == nChan, nothing to do
|
---|
1962 | if ( oldsize == nChan ) {
|
---|
1963 | os << "Specified channel number is same as current one. Nothing to do." << LogIO::POST ;
|
---|
1964 | return ;
|
---|
1965 | }
|
---|
1966 |
|
---|
1967 | // if oldChan < nChan, unphysical operation
|
---|
1968 | if ( oldsize < nChan ) {
|
---|
1969 | os << "Unphysical operation. Nothing to do." << LogIO::POST ;
|
---|
1970 | return ;
|
---|
1971 | }
|
---|
1972 |
|
---|
1973 | // change channel number for specCol_, flagCol_, and tsysCol_ (if necessary)
|
---|
1974 | vector<string> coordinfo = getCoordInfo() ;
|
---|
1975 | string oldinfo = coordinfo[0] ;
|
---|
1976 | coordinfo[0] = "Hz" ;
|
---|
1977 | setCoordInfo( coordinfo ) ;
|
---|
1978 | for ( int irow = 0 ; irow < nrow() ; irow++ ) {
|
---|
1979 | regridChannel( nChan, dnu, irow ) ;
|
---|
1980 | }
|
---|
1981 | coordinfo[0] = oldinfo ;
|
---|
1982 | setCoordInfo( coordinfo ) ;
|
---|
1983 |
|
---|
1984 |
|
---|
1985 | // NOTE: this method does not update metadata such as
|
---|
1986 | // FREQUENCIES subtable, nChan, Bandwidth, etc.
|
---|
1987 |
|
---|
1988 | return ;
|
---|
1989 | }
|
---|
1990 |
|
---|
1991 | void asap::Scantable::regridChannel( int nChan, double dnu, int irow )
|
---|
1992 | {
|
---|
1993 | // logging
|
---|
1994 | //ofstream ofs( "average.log", std::ios::out | std::ios::app ) ;
|
---|
1995 | //ofs << "IFNO = " << getIF( irow ) << " irow = " << irow << endl ;
|
---|
1996 |
|
---|
1997 | Vector<Float> oldspec = specCol_( irow ) ;
|
---|
1998 | Vector<uChar> oldflag = flagsCol_( irow ) ;
|
---|
1999 | Vector<Float> oldtsys = tsysCol_( irow ) ;
|
---|
2000 | Vector<Float> newspec( nChan, 0 ) ;
|
---|
2001 | Vector<uChar> newflag( nChan, true ) ;
|
---|
2002 | Vector<Float> newtsys ;
|
---|
2003 | bool regridTsys = false ;
|
---|
2004 | if (oldtsys.size() == oldspec.size()) {
|
---|
2005 | regridTsys = true ;
|
---|
2006 | newtsys.resize(nChan,false) ;
|
---|
2007 | newtsys = 0 ;
|
---|
2008 | }
|
---|
2009 |
|
---|
2010 | // regrid
|
---|
2011 | vector<double> abcissa = getAbcissa( irow ) ;
|
---|
2012 | int oldsize = abcissa.size() ;
|
---|
2013 | double olddnu = abcissa[1] - abcissa[0] ;
|
---|
2014 | //int ichan = 0 ;
|
---|
2015 | double wsum = 0.0 ;
|
---|
2016 | Vector<double> zi( nChan+1 ) ;
|
---|
2017 | Vector<double> yi( oldsize + 1 ) ;
|
---|
2018 | yi[0] = abcissa[0] - 0.5 * olddnu ;
|
---|
2019 | for ( int ii = 1 ; ii < oldsize ; ii++ )
|
---|
2020 | yi[ii] = 0.5* (abcissa[ii-1] + abcissa[ii]) ;
|
---|
2021 | yi[oldsize] = abcissa[oldsize-1] \
|
---|
2022 | + 0.5 * (abcissa[oldsize-1] - abcissa[oldsize-2]) ;
|
---|
2023 | //zi[0] = abcissa[0] - 0.5 * olddnu ;
|
---|
2024 | zi[0] = ((olddnu*dnu > 0) ? yi[0] : yi[oldsize]) ;
|
---|
2025 | for ( int ii = 1 ; ii < nChan ; ii++ )
|
---|
2026 | zi[ii] = zi[0] + dnu * ii ;
|
---|
2027 | zi[nChan] = zi[nChan-1] + dnu ;
|
---|
2028 | // Access zi and yi in ascending order
|
---|
2029 | int izs = ((dnu > 0) ? 0 : nChan ) ;
|
---|
2030 | int ize = ((dnu > 0) ? nChan : 0 ) ;
|
---|
2031 | int izincr = ((dnu > 0) ? 1 : -1 ) ;
|
---|
2032 | int ichan = ((olddnu > 0) ? 0 : oldsize ) ;
|
---|
2033 | int iye = ((olddnu > 0) ? oldsize : 0 ) ;
|
---|
2034 | int iyincr = ((olddnu > 0) ? 1 : -1 ) ;
|
---|
2035 | //for ( int ii = izs ; ii != ize ; ii+=izincr ){
|
---|
2036 | int ii = izs ;
|
---|
2037 | while (ii != ize) {
|
---|
2038 | // always zl < zr
|
---|
2039 | double zl = zi[ii] ;
|
---|
2040 | double zr = zi[ii+izincr] ;
|
---|
2041 | // Need to access smaller index for the new spec, flag, and tsys.
|
---|
2042 | // Values between zi[k] and zi[k+1] should be stored in newspec[k], etc.
|
---|
2043 | int i = min(ii, ii+izincr) ;
|
---|
2044 | //for ( int jj = ichan ; jj != iye ; jj+=iyincr ) {
|
---|
2045 | int jj = ichan ;
|
---|
2046 | while (jj != iye) {
|
---|
2047 | // always yl < yr
|
---|
2048 | double yl = yi[jj] ;
|
---|
2049 | double yr = yi[jj+iyincr] ;
|
---|
2050 | // Need to access smaller index for the original spec, flag, and tsys.
|
---|
2051 | // Values between yi[k] and yi[k+1] are stored in oldspec[k], etc.
|
---|
2052 | int j = min(jj, jj+iyincr) ;
|
---|
2053 | if ( yr <= zl ) {
|
---|
2054 | jj += iyincr ;
|
---|
2055 | continue ;
|
---|
2056 | }
|
---|
2057 | else if ( yl <= zl ) {
|
---|
2058 | if ( yr < zr ) {
|
---|
2059 | if (!oldflag[j]) {
|
---|
2060 | newspec[i] += oldspec[j] * ( yr - zl ) ;
|
---|
2061 | if (regridTsys) newtsys[i] += oldtsys[j] * ( yr - zl ) ;
|
---|
2062 | wsum += ( yr - zl ) ;
|
---|
2063 | }
|
---|
2064 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2065 | }
|
---|
2066 | else {
|
---|
2067 | if (!oldflag[j]) {
|
---|
2068 | newspec[i] += oldspec[j] * abs(dnu) ;
|
---|
2069 | if (regridTsys) newtsys[i] += oldtsys[j] * abs(dnu) ;
|
---|
2070 | wsum += abs(dnu) ;
|
---|
2071 | }
|
---|
2072 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2073 | ichan = jj ;
|
---|
2074 | break ;
|
---|
2075 | }
|
---|
2076 | }
|
---|
2077 | else if ( yl < zr ) {
|
---|
2078 | if ( yr <= zr ) {
|
---|
2079 | if (!oldflag[j]) {
|
---|
2080 | newspec[i] += oldspec[j] * ( yr - yl ) ;
|
---|
2081 | if (regridTsys) newtsys[i] += oldtsys[j] * ( yr - yl ) ;
|
---|
2082 | wsum += ( yr - yl ) ;
|
---|
2083 | }
|
---|
2084 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2085 | }
|
---|
2086 | else {
|
---|
2087 | if (!oldflag[j]) {
|
---|
2088 | newspec[i] += oldspec[j] * ( zr - yl ) ;
|
---|
2089 | if (regridTsys) newtsys[i] += oldtsys[j] * ( zr - yl ) ;
|
---|
2090 | wsum += ( zr - yl ) ;
|
---|
2091 | }
|
---|
2092 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2093 | ichan = jj ;
|
---|
2094 | break ;
|
---|
2095 | }
|
---|
2096 | }
|
---|
2097 | else {
|
---|
2098 | ichan = jj - iyincr ;
|
---|
2099 | break ;
|
---|
2100 | }
|
---|
2101 | jj += iyincr ;
|
---|
2102 | }
|
---|
2103 | if ( wsum != 0.0 ) {
|
---|
2104 | newspec[i] /= wsum ;
|
---|
2105 | if (regridTsys) newtsys[i] /= wsum ;
|
---|
2106 | }
|
---|
2107 | wsum = 0.0 ;
|
---|
2108 | ii += izincr ;
|
---|
2109 | }
|
---|
2110 | // if ( dnu > 0.0 ) {
|
---|
2111 | // for ( int ii = 0 ; ii < nChan ; ii++ ) {
|
---|
2112 | // double zl = zi[ii] ;
|
---|
2113 | // double zr = zi[ii+1] ;
|
---|
2114 | // for ( int j = ichan ; j < oldsize ; j++ ) {
|
---|
2115 | // double yl = yi[j] ;
|
---|
2116 | // double yr = yi[j+1] ;
|
---|
2117 | // if ( yl <= zl ) {
|
---|
2118 | // if ( yr <= zl ) {
|
---|
2119 | // continue ;
|
---|
2120 | // }
|
---|
2121 | // else if ( yr <= zr ) {
|
---|
2122 | // if (!oldflag[j]) {
|
---|
2123 | // newspec[ii] += oldspec[j] * ( yr - zl ) ;
|
---|
2124 | // if (regridTsys) newtsys[ii] += oldtsys[j] * ( yr - zl ) ;
|
---|
2125 | // wsum += ( yr - zl ) ;
|
---|
2126 | // }
|
---|
2127 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2128 | // }
|
---|
2129 | // else {
|
---|
2130 | // if (!oldflag[j]) {
|
---|
2131 | // newspec[ii] += oldspec[j] * dnu ;
|
---|
2132 | // if (regridTsys) newtsys[ii] += oldtsys[j] * dnu ;
|
---|
2133 | // wsum += dnu ;
|
---|
2134 | // }
|
---|
2135 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2136 | // ichan = j ;
|
---|
2137 | // break ;
|
---|
2138 | // }
|
---|
2139 | // }
|
---|
2140 | // else if ( yl < zr ) {
|
---|
2141 | // if ( yr <= zr ) {
|
---|
2142 | // if (!oldflag[j]) {
|
---|
2143 | // newspec[ii] += oldspec[j] * ( yr - yl ) ;
|
---|
2144 | // if (regridTsys) newtsys[ii] += oldtsys[j] * ( yr - yl ) ;
|
---|
2145 | // wsum += ( yr - yl ) ;
|
---|
2146 | // }
|
---|
2147 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2148 | // }
|
---|
2149 | // else {
|
---|
2150 | // if (!oldflag[j]) {
|
---|
2151 | // newspec[ii] += oldspec[j] * ( zr - yl ) ;
|
---|
2152 | // if (regridTsys) newtsys[ii] += oldtsys[j] * ( zr - yl ) ;
|
---|
2153 | // wsum += ( zr - yl ) ;
|
---|
2154 | // }
|
---|
2155 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2156 | // ichan = j ;
|
---|
2157 | // break ;
|
---|
2158 | // }
|
---|
2159 | // }
|
---|
2160 | // else {
|
---|
2161 | // ichan = j - 1 ;
|
---|
2162 | // break ;
|
---|
2163 | // }
|
---|
2164 | // }
|
---|
2165 | // if ( wsum != 0.0 ) {
|
---|
2166 | // newspec[ii] /= wsum ;
|
---|
2167 | // if (regridTsys) newtsys[ii] /= wsum ;
|
---|
2168 | // }
|
---|
2169 | // wsum = 0.0 ;
|
---|
2170 | // }
|
---|
2171 | // }
|
---|
2172 | // else if ( dnu < 0.0 ) {
|
---|
2173 | // for ( int ii = 0 ; ii < nChan ; ii++ ) {
|
---|
2174 | // double zl = zi[ii] ;
|
---|
2175 | // double zr = zi[ii+1] ;
|
---|
2176 | // for ( int j = ichan ; j < oldsize ; j++ ) {
|
---|
2177 | // double yl = yi[j] ;
|
---|
2178 | // double yr = yi[j+1] ;
|
---|
2179 | // if ( yl >= zl ) {
|
---|
2180 | // if ( yr >= zl ) {
|
---|
2181 | // continue ;
|
---|
2182 | // }
|
---|
2183 | // else if ( yr >= zr ) {
|
---|
2184 | // if (!oldflag[j]) {
|
---|
2185 | // newspec[ii] += oldspec[j] * abs( yr - zl ) ;
|
---|
2186 | // if (regridTsys) newtsys[ii] += oldtsys[j] * abs( yr - zl ) ;
|
---|
2187 | // wsum += abs( yr - zl ) ;
|
---|
2188 | // }
|
---|
2189 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2190 | // }
|
---|
2191 | // else {
|
---|
2192 | // if (!oldflag[j]) {
|
---|
2193 | // newspec[ii] += oldspec[j] * abs( dnu ) ;
|
---|
2194 | // if (regridTsys) newtsys[ii] += oldtsys[j] * abs( dnu ) ;
|
---|
2195 | // wsum += abs( dnu ) ;
|
---|
2196 | // }
|
---|
2197 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2198 | // ichan = j ;
|
---|
2199 | // break ;
|
---|
2200 | // }
|
---|
2201 | // }
|
---|
2202 | // else if ( yl > zr ) {
|
---|
2203 | // if ( yr >= zr ) {
|
---|
2204 | // if (!oldflag[j]) {
|
---|
2205 | // newspec[ii] += oldspec[j] * abs( yr - yl ) ;
|
---|
2206 | // if (regridTsys) newtsys[ii] += oldtsys[j] * abs( yr - yl ) ;
|
---|
2207 | // wsum += abs( yr - yl ) ;
|
---|
2208 | // }
|
---|
2209 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2210 | // }
|
---|
2211 | // else {
|
---|
2212 | // if (!oldflag[j]) {
|
---|
2213 | // newspec[ii] += oldspec[j] * abs( zr - yl ) ;
|
---|
2214 | // if (regridTsys) newtsys[ii] += oldtsys[j] * abs( zr - yl ) ;
|
---|
2215 | // wsum += abs( zr - yl ) ;
|
---|
2216 | // }
|
---|
2217 | // newflag[ii] = newflag[ii] && oldflag[j] ;
|
---|
2218 | // ichan = j ;
|
---|
2219 | // break ;
|
---|
2220 | // }
|
---|
2221 | // }
|
---|
2222 | // else {
|
---|
2223 | // ichan = j - 1 ;
|
---|
2224 | // break ;
|
---|
2225 | // }
|
---|
2226 | // }
|
---|
2227 | // if ( wsum != 0.0 ) {
|
---|
2228 | // newspec[ii] /= wsum ;
|
---|
2229 | // if (regridTsys) newtsys[ii] /= wsum ;
|
---|
2230 | // }
|
---|
2231 | // wsum = 0.0 ;
|
---|
2232 | // }
|
---|
2233 | // }
|
---|
2234 | // // //ofs << "olddnu = " << olddnu << ", dnu = " << dnu << endl ;
|
---|
2235 | // // pile += dnu ;
|
---|
2236 | // // wedge = olddnu * ( refChan + 1 ) ;
|
---|
2237 | // // while ( wedge < pile ) {
|
---|
2238 | // // newspec[0] += olddnu * oldspec[refChan] ;
|
---|
2239 | // // newflag[0] = newflag[0] || oldflag[refChan] ;
|
---|
2240 | // // //ofs << "channel " << refChan << " is included in new channel 0" << endl ;
|
---|
2241 | // // refChan++ ;
|
---|
2242 | // // wedge += olddnu ;
|
---|
2243 | // // wsum += olddnu ;
|
---|
2244 | // // //ofs << "newspec[0] = " << newspec[0] << " wsum = " << wsum << endl ;
|
---|
2245 | // // }
|
---|
2246 | // // frac = ( wedge - pile ) / olddnu ;
|
---|
2247 | // // wsum += ( 1.0 - frac ) * olddnu ;
|
---|
2248 | // // newspec[0] += ( 1.0 - frac ) * olddnu * oldspec[refChan] ;
|
---|
2249 | // // newflag[0] = newflag[0] || oldflag[refChan] ;
|
---|
2250 | // // //ofs << "channel " << refChan << " is partly included in new channel 0" << " with fraction of " << ( 1.0 - frac ) << endl ;
|
---|
2251 | // // //ofs << "newspec[0] = " << newspec[0] << " wsum = " << wsum << endl ;
|
---|
2252 | // // newspec[0] /= wsum ;
|
---|
2253 | // // //ofs << "newspec[0] = " << newspec[0] << endl ;
|
---|
2254 | // // //ofs << "wedge = " << wedge << ", pile = " << pile << endl ;
|
---|
2255 |
|
---|
2256 | // // /***
|
---|
2257 | // // * ichan = 1 - nChan-2
|
---|
2258 | // // ***/
|
---|
2259 | // // for ( int ichan = 1 ; ichan < nChan - 1 ; ichan++ ) {
|
---|
2260 | // // pile += dnu ;
|
---|
2261 | // // newspec[ichan] += frac * olddnu * oldspec[refChan] ;
|
---|
2262 | // // newflag[ichan] = newflag[ichan] || oldflag[refChan] ;
|
---|
2263 | // // //ofs << "channel " << refChan << " is partly included in new channel " << ichan << " with fraction of " << frac << endl ;
|
---|
2264 | // // refChan++ ;
|
---|
2265 | // // wedge += olddnu ;
|
---|
2266 | // // wsum = frac * olddnu ;
|
---|
2267 | // // //ofs << "newspec[" << ichan << "] = " << newspec[ichan] << " wsum = " << wsum << endl ;
|
---|
2268 | // // while ( wedge < pile ) {
|
---|
2269 | // // newspec[ichan] += olddnu * oldspec[refChan] ;
|
---|
2270 | // // newflag[ichan] = newflag[ichan] || oldflag[refChan] ;
|
---|
2271 | // // //ofs << "channel " << refChan << " is included in new channel " << ichan << endl ;
|
---|
2272 | // // refChan++ ;
|
---|
2273 | // // wedge += olddnu ;
|
---|
2274 | // // wsum += olddnu ;
|
---|
2275 | // // //ofs << "newspec[" << ichan << "] = " << newspec[ichan] << " wsum = " << wsum << endl ;
|
---|
2276 | // // }
|
---|
2277 | // // frac = ( wedge - pile ) / olddnu ;
|
---|
2278 | // // wsum += ( 1.0 - frac ) * olddnu ;
|
---|
2279 | // // newspec[ichan] += ( 1.0 - frac ) * olddnu * oldspec[refChan] ;
|
---|
2280 | // // newflag[ichan] = newflag[ichan] || oldflag[refChan] ;
|
---|
2281 | // // //ofs << "channel " << refChan << " is partly included in new channel " << ichan << " with fraction of " << ( 1.0 - frac ) << endl ;
|
---|
2282 | // // //ofs << "wedge = " << wedge << ", pile = " << pile << endl ;
|
---|
2283 | // // //ofs << "newspec[" << ichan << "] = " << newspec[ichan] << " wsum = " << wsum << endl ;
|
---|
2284 | // // newspec[ichan] /= wsum ;
|
---|
2285 | // // //ofs << "newspec[" << ichan << "] = " << newspec[ichan] << endl ;
|
---|
2286 | // // }
|
---|
2287 |
|
---|
2288 | // // /***
|
---|
2289 | // // * ichan = nChan-1
|
---|
2290 | // // ***/
|
---|
2291 | // // // NOTE: Assumed that all spectra have the same bandwidth
|
---|
2292 | // // pile += dnu ;
|
---|
2293 | // // newspec[nChan-1] += frac * olddnu * oldspec[refChan] ;
|
---|
2294 | // // newflag[nChan-1] = newflag[nChan-1] || oldflag[refChan] ;
|
---|
2295 | // // //ofs << "channel " << refChan << " is partly included in new channel " << nChan-1 << " with fraction of " << frac << endl ;
|
---|
2296 | // // refChan++ ;
|
---|
2297 | // // wedge += olddnu ;
|
---|
2298 | // // wsum = frac * olddnu ;
|
---|
2299 | // // //ofs << "newspec[" << nChan - 1 << "] = " << newspec[nChan-1] << " wsum = " << wsum << endl ;
|
---|
2300 | // // for ( int jchan = refChan ; jchan < oldsize ; jchan++ ) {
|
---|
2301 | // // newspec[nChan-1] += olddnu * oldspec[jchan] ;
|
---|
2302 | // // newflag[nChan-1] = newflag[nChan-1] || oldflag[jchan] ;
|
---|
2303 | // // wsum += olddnu ;
|
---|
2304 | // // //ofs << "channel " << jchan << " is included in new channel " << nChan-1 << " with fraction of " << frac << endl ;
|
---|
2305 | // // //ofs << "newspec[" << nChan - 1 << "] = " << newspec[nChan-1] << " wsum = " << wsum << endl ;
|
---|
2306 | // // }
|
---|
2307 | // // //ofs << "wedge = " << wedge << ", pile = " << pile << endl ;
|
---|
2308 | // // //ofs << "newspec[" << nChan - 1 << "] = " << newspec[nChan-1] << " wsum = " << wsum << endl ;
|
---|
2309 | // // newspec[nChan-1] /= wsum ;
|
---|
2310 | // // //ofs << "newspec[" << nChan - 1 << "] = " << newspec[nChan-1] << endl ;
|
---|
2311 |
|
---|
2312 | // // // ofs.close() ;
|
---|
2313 |
|
---|
2314 | specCol_.put( irow, newspec ) ;
|
---|
2315 | flagsCol_.put( irow, newflag ) ;
|
---|
2316 | if (regridTsys) tsysCol_.put( irow, newtsys );
|
---|
2317 |
|
---|
2318 | return ;
|
---|
2319 | }
|
---|
2320 |
|
---|
2321 | void Scantable::regridChannel( int nChan, double dnu, double fmin, int irow )
|
---|
2322 | {
|
---|
2323 | Vector<Float> oldspec = specCol_( irow ) ;
|
---|
2324 | Vector<uChar> oldflag = flagsCol_( irow ) ;
|
---|
2325 | Vector<Float> oldtsys = tsysCol_( irow ) ;
|
---|
2326 | Vector<Float> newspec( nChan, 0 ) ;
|
---|
2327 | Vector<uChar> newflag( nChan, true ) ;
|
---|
2328 | Vector<Float> newtsys ;
|
---|
2329 | bool regridTsys = false ;
|
---|
2330 | if (oldtsys.size() == oldspec.size()) {
|
---|
2331 | regridTsys = true ;
|
---|
2332 | newtsys.resize(nChan,false) ;
|
---|
2333 | newtsys = 0 ;
|
---|
2334 | }
|
---|
2335 |
|
---|
2336 | // regrid
|
---|
2337 | vector<double> abcissa = getAbcissa( irow ) ;
|
---|
2338 | int oldsize = abcissa.size() ;
|
---|
2339 | double olddnu = abcissa[1] - abcissa[0] ;
|
---|
2340 | //int ichan = 0 ;
|
---|
2341 | double wsum = 0.0 ;
|
---|
2342 | Vector<double> zi( nChan+1 ) ;
|
---|
2343 | Vector<double> yi( oldsize + 1 ) ;
|
---|
2344 | Block<uInt> count( nChan, 0 ) ;
|
---|
2345 | yi[0] = abcissa[0] - 0.5 * olddnu ;
|
---|
2346 | for ( int ii = 1 ; ii < oldsize ; ii++ )
|
---|
2347 | yi[ii] = 0.5* (abcissa[ii-1] + abcissa[ii]) ;
|
---|
2348 | yi[oldsize] = abcissa[oldsize-1] \
|
---|
2349 | + 0.5 * (abcissa[oldsize-1] - abcissa[oldsize-2]) ;
|
---|
2350 | // cout << "olddnu=" << olddnu << ", dnu=" << dnu << " (diff=" << olddnu-dnu << ")" << endl ;
|
---|
2351 | // cout << "yi[0]=" << yi[0] << ", fmin=" << fmin << " (diff=" << yi[0]-fmin << ")" << endl ;
|
---|
2352 | // cout << "oldsize=" << oldsize << ", nChan=" << nChan << endl ;
|
---|
2353 |
|
---|
2354 | // do not regrid if input parameters are almost same as current
|
---|
2355 | // spectral setup
|
---|
2356 | double dnuDiff = abs( ( dnu - olddnu ) / olddnu ) ;
|
---|
2357 | double oldfmin = min( yi[0], yi[oldsize] ) ;
|
---|
2358 | double fminDiff = abs( ( fmin - oldfmin ) / oldfmin ) ;
|
---|
2359 | double nChanDiff = nChan - oldsize ;
|
---|
2360 | double eps = 1.0e-8 ;
|
---|
2361 | if ( nChanDiff == 0 && dnuDiff < eps && fminDiff < eps )
|
---|
2362 | return ;
|
---|
2363 |
|
---|
2364 | //zi[0] = abcissa[0] - 0.5 * olddnu ;
|
---|
2365 | //zi[0] = ((olddnu*dnu > 0) ? yi[0] : yi[oldsize]) ;
|
---|
2366 | if ( dnu > 0 )
|
---|
2367 | zi[0] = fmin - 0.5 * dnu ;
|
---|
2368 | else
|
---|
2369 | zi[0] = fmin + nChan * abs(dnu) ;
|
---|
2370 | for ( int ii = 1 ; ii < nChan ; ii++ )
|
---|
2371 | zi[ii] = zi[0] + dnu * ii ;
|
---|
2372 | zi[nChan] = zi[nChan-1] + dnu ;
|
---|
2373 | // Access zi and yi in ascending order
|
---|
2374 | int izs = ((dnu > 0) ? 0 : nChan ) ;
|
---|
2375 | int ize = ((dnu > 0) ? nChan : 0 ) ;
|
---|
2376 | int izincr = ((dnu > 0) ? 1 : -1 ) ;
|
---|
2377 | int ichan = ((olddnu > 0) ? 0 : oldsize ) ;
|
---|
2378 | int iye = ((olddnu > 0) ? oldsize : 0 ) ;
|
---|
2379 | int iyincr = ((olddnu > 0) ? 1 : -1 ) ;
|
---|
2380 | //for ( int ii = izs ; ii != ize ; ii+=izincr ){
|
---|
2381 | int ii = izs ;
|
---|
2382 | while (ii != ize) {
|
---|
2383 | // always zl < zr
|
---|
2384 | double zl = zi[ii] ;
|
---|
2385 | double zr = zi[ii+izincr] ;
|
---|
2386 | // Need to access smaller index for the new spec, flag, and tsys.
|
---|
2387 | // Values between zi[k] and zi[k+1] should be stored in newspec[k], etc.
|
---|
2388 | int i = min(ii, ii+izincr) ;
|
---|
2389 | //for ( int jj = ichan ; jj != iye ; jj+=iyincr ) {
|
---|
2390 | int jj = ichan ;
|
---|
2391 | while (jj != iye) {
|
---|
2392 | // always yl < yr
|
---|
2393 | double yl = yi[jj] ;
|
---|
2394 | double yr = yi[jj+iyincr] ;
|
---|
2395 | // Need to access smaller index for the original spec, flag, and tsys.
|
---|
2396 | // Values between yi[k] and yi[k+1] are stored in oldspec[k], etc.
|
---|
2397 | int j = min(jj, jj+iyincr) ;
|
---|
2398 | if ( yr <= zl ) {
|
---|
2399 | jj += iyincr ;
|
---|
2400 | continue ;
|
---|
2401 | }
|
---|
2402 | else if ( yl <= zl ) {
|
---|
2403 | if ( yr < zr ) {
|
---|
2404 | if (!oldflag[j]) {
|
---|
2405 | newspec[i] += oldspec[j] * ( yr - zl ) ;
|
---|
2406 | if (regridTsys) newtsys[i] += oldtsys[j] * ( yr - zl ) ;
|
---|
2407 | wsum += ( yr - zl ) ;
|
---|
2408 | count[i]++ ;
|
---|
2409 | }
|
---|
2410 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2411 | }
|
---|
2412 | else {
|
---|
2413 | if (!oldflag[j]) {
|
---|
2414 | newspec[i] += oldspec[j] * abs(dnu) ;
|
---|
2415 | if (regridTsys) newtsys[i] += oldtsys[j] * abs(dnu) ;
|
---|
2416 | wsum += abs(dnu) ;
|
---|
2417 | count[i]++ ;
|
---|
2418 | }
|
---|
2419 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2420 | ichan = jj ;
|
---|
2421 | break ;
|
---|
2422 | }
|
---|
2423 | }
|
---|
2424 | else if ( yl < zr ) {
|
---|
2425 | if ( yr <= zr ) {
|
---|
2426 | if (!oldflag[j]) {
|
---|
2427 | newspec[i] += oldspec[j] * ( yr - yl ) ;
|
---|
2428 | if (regridTsys) newtsys[i] += oldtsys[j] * ( yr - yl ) ;
|
---|
2429 | wsum += ( yr - yl ) ;
|
---|
2430 | count[i]++ ;
|
---|
2431 | }
|
---|
2432 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2433 | }
|
---|
2434 | else {
|
---|
2435 | if (!oldflag[j]) {
|
---|
2436 | newspec[i] += oldspec[j] * ( zr - yl ) ;
|
---|
2437 | if (regridTsys) newtsys[i] += oldtsys[j] * ( zr - yl ) ;
|
---|
2438 | wsum += ( zr - yl ) ;
|
---|
2439 | count[i]++ ;
|
---|
2440 | }
|
---|
2441 | newflag[i] = newflag[i] && oldflag[j] ;
|
---|
2442 | ichan = jj ;
|
---|
2443 | break ;
|
---|
2444 | }
|
---|
2445 | }
|
---|
2446 | else {
|
---|
2447 | //ichan = jj - iyincr ;
|
---|
2448 | break ;
|
---|
2449 | }
|
---|
2450 | jj += iyincr ;
|
---|
2451 | }
|
---|
2452 | if ( wsum != 0.0 ) {
|
---|
2453 | newspec[i] /= wsum ;
|
---|
2454 | if (regridTsys) newtsys[i] /= wsum ;
|
---|
2455 | }
|
---|
2456 | wsum = 0.0 ;
|
---|
2457 | ii += izincr ;
|
---|
2458 | }
|
---|
2459 |
|
---|
2460 | // flag out channels without data
|
---|
2461 | // this is tentative since there is no specific definition
|
---|
2462 | // on bit flag...
|
---|
2463 | uChar noData = 1 << 7 ;
|
---|
2464 | for ( Int i = 0 ; i < nChan ; i++ ) {
|
---|
2465 | if ( count[i] == 0 )
|
---|
2466 | newflag[i] = noData ;
|
---|
2467 | }
|
---|
2468 |
|
---|
2469 | specCol_.put( irow, newspec ) ;
|
---|
2470 | flagsCol_.put( irow, newflag ) ;
|
---|
2471 | if (regridTsys) tsysCol_.put( irow, newtsys );
|
---|
2472 |
|
---|
2473 | return ;
|
---|
2474 | }
|
---|
2475 |
|
---|
2476 | std::vector<float> Scantable::getWeather(int whichrow) const
|
---|
2477 | {
|
---|
2478 | std::vector<float> out(5);
|
---|
2479 | //Float temperature, pressure, humidity, windspeed, windaz;
|
---|
2480 | weatherTable_.getEntry(out[0], out[1], out[2], out[3], out[4],
|
---|
2481 | mweatheridCol_(uInt(whichrow)));
|
---|
2482 |
|
---|
2483 |
|
---|
2484 | return out;
|
---|
2485 | }
|
---|
2486 |
|
---|
2487 | bool Scantable::isAllChannelsFlagged(uInt whichrow)
|
---|
2488 | {
|
---|
2489 | uInt rflag;
|
---|
2490 | flagrowCol_.get(whichrow, rflag);
|
---|
2491 | if (rflag > 0)
|
---|
2492 | return true;
|
---|
2493 | uChar flag;
|
---|
2494 | Vector<uChar> flags;
|
---|
2495 | flagsCol_.get(whichrow, flags);
|
---|
2496 | flag = flags[0];
|
---|
2497 | for (uInt i = 1; i < flags.size(); ++i) {
|
---|
2498 | flag &= flags[i];
|
---|
2499 | }
|
---|
2500 | // return ((flag >> 7) == 1);
|
---|
2501 | return (flag > 0);
|
---|
2502 | }
|
---|
2503 |
|
---|
2504 | std::vector<std::string> Scantable::applyBaselineTable(const std::string& bltable, const bool returnfitresult, const std::string& outbltable, const bool outbltableexists, const bool overwrite)
|
---|
2505 | {
|
---|
2506 | STBaselineTable btin = STBaselineTable(bltable);
|
---|
2507 |
|
---|
2508 | Vector<Bool> applyCol = btin.getApply();
|
---|
2509 | int nRowBl = applyCol.size();
|
---|
2510 | if (nRowBl != nrow()) {
|
---|
2511 | throw(AipsError("Scantable and bltable have different number of rows."));
|
---|
2512 | }
|
---|
2513 |
|
---|
2514 | std::vector<std::string> res;
|
---|
2515 | res.clear();
|
---|
2516 |
|
---|
2517 | bool outBaselineTable = ((outbltable != "") && (!outbltableexists || overwrite));
|
---|
2518 | bool bltableidentical = (bltable == outbltable);
|
---|
2519 | STBaselineTable btout = STBaselineTable(*this);
|
---|
2520 | ROScalarColumn<Double> tcol = ROScalarColumn<Double>(table_, "TIME");
|
---|
2521 | Vector<Double> timeSecCol = tcol.getColumn();
|
---|
2522 |
|
---|
2523 | for (int whichrow = 0; whichrow < nRowBl; ++whichrow) {
|
---|
2524 | if (applyCol[whichrow]) {
|
---|
2525 | std::vector<float> spec = getSpectrum(whichrow);
|
---|
2526 |
|
---|
2527 | std::vector<bool> mask = btin.getMask(whichrow); //use mask_bltable only
|
---|
2528 |
|
---|
2529 | STBaselineFunc::FuncName ftype = btin.getFunctionName(whichrow);
|
---|
2530 | std::vector<int> fpar = btin.getFuncParam(whichrow);
|
---|
2531 | std::vector<float> params;
|
---|
2532 | float rms;
|
---|
2533 | std::vector<float> resfit = doApplyBaselineTable(spec, mask, ftype, fpar, params, rms);
|
---|
2534 | setSpectrum(resfit, whichrow);
|
---|
2535 |
|
---|
2536 | if (returnfitresult) {
|
---|
2537 | res.push_back(packFittingResults(whichrow, params, rms));
|
---|
2538 | }
|
---|
2539 |
|
---|
2540 | if (outBaselineTable) {
|
---|
2541 | if (outbltableexists) {
|
---|
2542 | if (overwrite) {
|
---|
2543 | if (bltableidentical) {
|
---|
2544 | btin.setresult(uInt(whichrow), Vector<Float>(params), Float(rms));
|
---|
2545 | } else {
|
---|
2546 | btout.setresult(uInt(whichrow), Vector<Float>(params), Float(rms));
|
---|
2547 | }
|
---|
2548 | }
|
---|
2549 | } else {
|
---|
2550 | btout.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
2551 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
2552 | true, ftype, fpar, std::vector<float>(),
|
---|
2553 | getMaskListFromMask(mask), params, rms, spec.size(),
|
---|
2554 | 3.0, 0, 0.0, 0, std::vector<int>());
|
---|
2555 | }
|
---|
2556 | }
|
---|
2557 | }
|
---|
2558 | }
|
---|
2559 |
|
---|
2560 | if (outBaselineTable) {
|
---|
2561 | if (bltableidentical) {
|
---|
2562 | btin.save(outbltable);
|
---|
2563 | } else {
|
---|
2564 | btout.save(outbltable);
|
---|
2565 | }
|
---|
2566 | }
|
---|
2567 |
|
---|
2568 | return res;
|
---|
2569 | }
|
---|
2570 |
|
---|
2571 | std::vector<std::string> Scantable::subBaseline(const std::vector<std::string>& blInfoList, const bool returnfitresult, const std::string& outbltable, const bool outbltableexists, const bool overwrite)
|
---|
2572 | {
|
---|
2573 | int nRowBl = blInfoList.size();
|
---|
2574 | int nRowSt = nrow();
|
---|
2575 |
|
---|
2576 | std::vector<std::string> res;
|
---|
2577 | res.clear();
|
---|
2578 |
|
---|
2579 | bool outBaselineTable = ((outbltable != "") && (!outbltableexists || overwrite));
|
---|
2580 | if ((outbltable != "") && outbltableexists && !overwrite) {
|
---|
2581 | throw(AipsError("Cannot overwrite bltable. Set overwrite=True."));
|
---|
2582 | }
|
---|
2583 |
|
---|
2584 | STBaselineTable* btp;
|
---|
2585 | ROScalarColumn<Double> tcol = ROScalarColumn<Double>(table_, "TIME");
|
---|
2586 | Vector<Double> timeSecCol = tcol.getColumn();
|
---|
2587 |
|
---|
2588 | if (outBaselineTable) {
|
---|
2589 | if (outbltableexists) {
|
---|
2590 | btp = new STBaselineTable((String)outbltable);
|
---|
2591 | } else {
|
---|
2592 | btp = new STBaselineTable(*this);
|
---|
2593 | for (int i = 0; i < nRowSt; ++i) {
|
---|
2594 | btp->appendbasedata(getScan(i), getCycle(i), getBeam(i), getIF(i), getPol(i),
|
---|
2595 | 0, timeSecCol[i]);
|
---|
2596 | btp->setApply(i, false);
|
---|
2597 | }
|
---|
2598 | }
|
---|
2599 | }
|
---|
2600 |
|
---|
2601 | for (int i = 0; i < nRowBl; ++i) {
|
---|
2602 | int irow;
|
---|
2603 | STBaselineFunc::FuncName ftype;
|
---|
2604 | std::vector<bool> mask;
|
---|
2605 | std::vector<int> fpar;
|
---|
2606 | float clipth;
|
---|
2607 | int clipn;
|
---|
2608 | bool uself;
|
---|
2609 | float lfth;
|
---|
2610 | std::vector<int> lfedge;
|
---|
2611 | int lfavg;
|
---|
2612 | parseBlInfo(blInfoList[i], irow, ftype, fpar, mask, clipth, clipn, uself, lfth, lfedge, lfavg);
|
---|
2613 |
|
---|
2614 | if (irow < nRowSt) {
|
---|
2615 | std::vector<float> spec = getSpectrum(irow);
|
---|
2616 | std::vector<float> params;
|
---|
2617 | float rms;
|
---|
2618 | std::vector<bool> finalmask;
|
---|
2619 |
|
---|
2620 | std::vector<float> resfit = doSubtractBaseline(spec, mask, ftype, fpar, params, rms, finalmask, clipth, clipn, uself, irow, lfth, lfedge, lfavg);
|
---|
2621 | setSpectrum(resfit, irow);
|
---|
2622 |
|
---|
2623 | if (returnfitresult) {
|
---|
2624 | res.push_back(packFittingResults(irow, params, rms));
|
---|
2625 | }
|
---|
2626 |
|
---|
2627 | if (outBaselineTable) {
|
---|
2628 | Vector<Int> fparam(fpar.size());
|
---|
2629 | for (uInt j = 0; j < fparam.size(); ++j) {
|
---|
2630 | fparam[j] = (Int)fpar[j];
|
---|
2631 | }
|
---|
2632 |
|
---|
2633 | btp->setdata(uInt(irow),
|
---|
2634 | uInt(getScan(irow)), uInt(getCycle(irow)),
|
---|
2635 | uInt(getBeam(irow)), uInt(getIF(irow)), uInt(getPol(irow)),
|
---|
2636 | uInt(0), timeSecCol[irow], Bool(true), ftype, fparam,
|
---|
2637 | Vector<Float>(), getMaskListFromMask(finalmask), Vector<Float>(params),
|
---|
2638 | Float(rms), uInt(spec.size()), Float(clipth), uInt(clipn),
|
---|
2639 | Float(0.0), uInt(0), Vector<uInt>());
|
---|
2640 | }
|
---|
2641 |
|
---|
2642 | }
|
---|
2643 | }
|
---|
2644 |
|
---|
2645 | if (outBaselineTable) {
|
---|
2646 | btp->save(outbltable);
|
---|
2647 | }
|
---|
2648 |
|
---|
2649 | delete btp;
|
---|
2650 | return res;
|
---|
2651 | }
|
---|
2652 |
|
---|
2653 | std::vector<float> Scantable::doApplyBaselineTable(std::vector<float>& spec,
|
---|
2654 | std::vector<bool>& mask,
|
---|
2655 | const STBaselineFunc::FuncName ftype,
|
---|
2656 | std::vector<int>& fpar,
|
---|
2657 | std::vector<float>& params,
|
---|
2658 | float&rms)
|
---|
2659 | {
|
---|
2660 | std::vector<bool> finalmask;
|
---|
2661 | std::vector<int> lfedge;
|
---|
2662 | return doSubtractBaseline(spec, mask, ftype, fpar, params, rms, finalmask, 0.0, 0, false, 0, 0.0, lfedge, 0);
|
---|
2663 | }
|
---|
2664 |
|
---|
2665 | std::vector<float> Scantable::doSubtractBaseline(std::vector<float>& spec,
|
---|
2666 | std::vector<bool>& mask,
|
---|
2667 | const STBaselineFunc::FuncName ftype,
|
---|
2668 | std::vector<int>& fpar,
|
---|
2669 | std::vector<float>& params,
|
---|
2670 | float&rms,
|
---|
2671 | std::vector<bool>& finalmask,
|
---|
2672 | float clipth,
|
---|
2673 | int clipn,
|
---|
2674 | bool uself,
|
---|
2675 | int irow,
|
---|
2676 | float lfth,
|
---|
2677 | std::vector<int>& lfedge,
|
---|
2678 | int lfavg)
|
---|
2679 | {
|
---|
2680 | if (uself) {
|
---|
2681 | STLineFinder lineFinder = STLineFinder();
|
---|
2682 | initLineFinder(lfedge, lfth, lfavg, lineFinder);
|
---|
2683 | std::vector<int> currentEdge;
|
---|
2684 | mask = getCompositeChanMask(irow, mask, lfedge, currentEdge, lineFinder);
|
---|
2685 | }
|
---|
2686 |
|
---|
2687 | std::vector<float> res;
|
---|
2688 | if (ftype == STBaselineFunc::Polynomial) {
|
---|
2689 | res = doPolynomialFitting(spec, mask, fpar[0], params, rms, finalmask, clipth, clipn);
|
---|
2690 | } else if (ftype == STBaselineFunc::Chebyshev) {
|
---|
2691 | res = doChebyshevFitting(spec, mask, fpar[0], params, rms, finalmask, clipth, clipn);
|
---|
2692 | } else if (ftype == STBaselineFunc::CSpline) {
|
---|
2693 | if (fpar.size() > 1) { // reading from baseline table in which pieceEdges are already calculated and stored.
|
---|
2694 | res = doCubicSplineFitting(spec, mask, fpar, params, rms, finalmask, clipth, clipn);
|
---|
2695 | } else { // usual cspline fitting by giving nPiece only. fpar will be replaced with pieceEdges.
|
---|
2696 | res = doCubicSplineFitting(spec, mask, fpar[0], fpar, params, rms, finalmask, clipth, clipn);
|
---|
2697 | }
|
---|
2698 | } else if (ftype == STBaselineFunc::Sinusoid) {
|
---|
2699 | res = doSinusoidFitting(spec, mask, fpar, params, rms, finalmask, clipth, clipn);
|
---|
2700 | }
|
---|
2701 |
|
---|
2702 | return res;
|
---|
2703 | }
|
---|
2704 |
|
---|
2705 | std::string Scantable::packFittingResults(const int irow, const std::vector<float>& params, const float rms)
|
---|
2706 | {
|
---|
2707 | // returned value: "irow:params[0],params[1],..,params[n-1]:rms"
|
---|
2708 | ostringstream os;
|
---|
2709 | os << irow << ':';
|
---|
2710 | for (uInt i = 0; i < params.size(); ++i) {
|
---|
2711 | if (i > 0) {
|
---|
2712 | os << ',';
|
---|
2713 | }
|
---|
2714 | os << params[i];
|
---|
2715 | }
|
---|
2716 | os << ':' << rms;
|
---|
2717 |
|
---|
2718 | return os.str();
|
---|
2719 | }
|
---|
2720 |
|
---|
2721 | void Scantable::parseBlInfo(const std::string& blInfo, int& irow, STBaselineFunc::FuncName& ftype, std::vector<int>& fpar, std::vector<bool>& mask, float& thresClip, int& nIterClip, bool& useLineFinder, float& thresLF, std::vector<int>& edgeLF, int& avgLF)
|
---|
2722 | {
|
---|
2723 | // The baseline info to be parsed must be column-delimited string like
|
---|
2724 | // "0:chebyshev:5:3,5,169,174,485,487" where the elements are
|
---|
2725 | // row number, funcType, funcOrder, maskList, clipThreshold, clipNIter,
|
---|
2726 | // useLineFinder, lfThreshold, lfEdge and lfChanAvgLimit.
|
---|
2727 |
|
---|
2728 | std::vector<string> res = splitToStringList(blInfo, ':');
|
---|
2729 | if (res.size() < 4) {
|
---|
2730 | throw(AipsError("baseline info has bad format")) ;
|
---|
2731 | }
|
---|
2732 |
|
---|
2733 | string ftype0, fpar0, masklist0, uself0, edge0;
|
---|
2734 | std::vector<int> masklist;
|
---|
2735 |
|
---|
2736 | stringstream ss;
|
---|
2737 | ss << res[0];
|
---|
2738 | ss >> irow;
|
---|
2739 | ss.clear(); ss.str("");
|
---|
2740 |
|
---|
2741 | ss << res[1];
|
---|
2742 | ss >> ftype0;
|
---|
2743 | if (ftype0 == "poly") {
|
---|
2744 | ftype = STBaselineFunc::Polynomial;
|
---|
2745 | } else if (ftype0 == "cspline") {
|
---|
2746 | ftype = STBaselineFunc::CSpline;
|
---|
2747 | } else if (ftype0 == "sinusoid") {
|
---|
2748 | ftype = STBaselineFunc::Sinusoid;
|
---|
2749 | } else if (ftype0 == "chebyshev") {
|
---|
2750 | ftype = STBaselineFunc::Chebyshev;
|
---|
2751 | } else {
|
---|
2752 | throw(AipsError("invalid function type."));
|
---|
2753 | }
|
---|
2754 | ss.clear(); ss.str("");
|
---|
2755 |
|
---|
2756 | ss << res[2];
|
---|
2757 | ss >> fpar0;
|
---|
2758 | fpar = splitToIntList(fpar0, ',');
|
---|
2759 | ss.clear(); ss.str("");
|
---|
2760 |
|
---|
2761 | ss << res[3];
|
---|
2762 | ss >> masklist0;
|
---|
2763 | mask = getMaskFromMaskList(nchan(getIF(irow)), splitToIntList(masklist0, ','));
|
---|
2764 | ss.clear(); ss.str("");
|
---|
2765 |
|
---|
2766 | ss << res[4];
|
---|
2767 | ss >> thresClip;
|
---|
2768 | ss.clear(); ss.str("");
|
---|
2769 |
|
---|
2770 | ss << res[5];
|
---|
2771 | ss >> nIterClip;
|
---|
2772 | ss.clear(); ss.str("");
|
---|
2773 |
|
---|
2774 | ss << res[6];
|
---|
2775 | ss >> uself0;
|
---|
2776 | if (uself0 == "true") {
|
---|
2777 | useLineFinder = true;
|
---|
2778 | } else {
|
---|
2779 | useLineFinder = false;
|
---|
2780 | }
|
---|
2781 | ss.clear(); ss.str("");
|
---|
2782 |
|
---|
2783 | if (useLineFinder) {
|
---|
2784 | ss << res[7];
|
---|
2785 | ss >> thresLF;
|
---|
2786 | ss.clear(); ss.str("");
|
---|
2787 |
|
---|
2788 | ss << res[8];
|
---|
2789 | ss >> edge0;
|
---|
2790 | edgeLF = splitToIntList(edge0, ',');
|
---|
2791 | ss.clear(); ss.str("");
|
---|
2792 |
|
---|
2793 | ss << res[9];
|
---|
2794 | ss >> avgLF;
|
---|
2795 | ss.clear(); ss.str("");
|
---|
2796 | }
|
---|
2797 |
|
---|
2798 | }
|
---|
2799 |
|
---|
2800 | std::vector<int> Scantable::splitToIntList(const std::string& s, const char delim)
|
---|
2801 | {
|
---|
2802 | istringstream iss(s);
|
---|
2803 | string tmp;
|
---|
2804 | int tmpi;
|
---|
2805 | std::vector<int> res;
|
---|
2806 | stringstream ss;
|
---|
2807 | while (getline(iss, tmp, delim)) {
|
---|
2808 | ss << tmp;
|
---|
2809 | ss >> tmpi;
|
---|
2810 | res.push_back(tmpi);
|
---|
2811 | ss.clear(); ss.str("");
|
---|
2812 | }
|
---|
2813 |
|
---|
2814 | return res;
|
---|
2815 | }
|
---|
2816 |
|
---|
2817 | std::vector<string> Scantable::splitToStringList(const std::string& s, const char delim)
|
---|
2818 | {
|
---|
2819 | istringstream iss(s);
|
---|
2820 | std::string tmp;
|
---|
2821 | std::vector<string> res;
|
---|
2822 | while (getline(iss, tmp, delim)) {
|
---|
2823 | res.push_back(tmp);
|
---|
2824 | }
|
---|
2825 |
|
---|
2826 | return res;
|
---|
2827 | }
|
---|
2828 |
|
---|
2829 | std::vector<bool> Scantable::getMaskFromMaskList(const int nchan, const std::vector<int>& masklist)
|
---|
2830 | {
|
---|
2831 | if (masklist.size() % 2 != 0) {
|
---|
2832 | throw(AipsError("masklist must have even number of elements."));
|
---|
2833 | }
|
---|
2834 |
|
---|
2835 | std::vector<bool> res(nchan);
|
---|
2836 |
|
---|
2837 | for (int i = 0; i < nchan; ++i) {
|
---|
2838 | res[i] = false;
|
---|
2839 | }
|
---|
2840 | for (uInt j = 0; j < masklist.size(); j += 2) {
|
---|
2841 | for (int i = masklist[j]; i <= masklist[j+1]; ++i) {
|
---|
2842 | res[i] = true;
|
---|
2843 | }
|
---|
2844 | }
|
---|
2845 |
|
---|
2846 | return res;
|
---|
2847 | }
|
---|
2848 |
|
---|
2849 | Vector<uInt> Scantable::getMaskListFromMask(const std::vector<bool>& mask)
|
---|
2850 | {
|
---|
2851 | std::vector<int> masklist;
|
---|
2852 | masklist.clear();
|
---|
2853 |
|
---|
2854 | for (uInt i = 0; i < mask.size(); ++i) {
|
---|
2855 | if (mask[i]) {
|
---|
2856 | if ((i == 0)||(i == mask.size()-1)) {
|
---|
2857 | masklist.push_back(i);
|
---|
2858 | } else {
|
---|
2859 | if ((mask[i])&&(!mask[i-1])) {
|
---|
2860 | masklist.push_back(i);
|
---|
2861 | }
|
---|
2862 | if ((mask[i])&&(!mask[i+1])) {
|
---|
2863 | masklist.push_back(i);
|
---|
2864 | }
|
---|
2865 | }
|
---|
2866 | }
|
---|
2867 | }
|
---|
2868 |
|
---|
2869 | Vector<uInt> res(masklist.size());
|
---|
2870 | for (uInt i = 0; i < masklist.size(); ++i) {
|
---|
2871 | res[i] = (uInt)masklist[i];
|
---|
2872 | }
|
---|
2873 |
|
---|
2874 | return res;
|
---|
2875 | }
|
---|
2876 |
|
---|
2877 | void Scantable::initialiseBaselining(const std::string& blfile,
|
---|
2878 | ofstream& ofs,
|
---|
2879 | const bool outLogger,
|
---|
2880 | bool& outTextFile,
|
---|
2881 | bool& csvFormat,
|
---|
2882 | String& coordInfo,
|
---|
2883 | bool& hasSameNchan,
|
---|
2884 | const std::string& progressInfo,
|
---|
2885 | bool& showProgress,
|
---|
2886 | int& minNRow,
|
---|
2887 | Vector<Double>& timeSecCol)
|
---|
2888 | {
|
---|
2889 | csvFormat = false;
|
---|
2890 | outTextFile = false;
|
---|
2891 |
|
---|
2892 | if (blfile != "") {
|
---|
2893 | csvFormat = (blfile.substr(0, 1) == "T");
|
---|
2894 | ofs.open(blfile.substr(1).c_str(), ios::out | ios::app);
|
---|
2895 | if (ofs) outTextFile = true;
|
---|
2896 | }
|
---|
2897 |
|
---|
2898 | coordInfo = "";
|
---|
2899 | hasSameNchan = true;
|
---|
2900 |
|
---|
2901 | if (outLogger || outTextFile) {
|
---|
2902 | coordInfo = getCoordInfo()[0];
|
---|
2903 | if (coordInfo == "") coordInfo = "channel";
|
---|
2904 | hasSameNchan = hasSameNchanOverIFs();
|
---|
2905 | }
|
---|
2906 |
|
---|
2907 | parseProgressInfo(progressInfo, showProgress, minNRow);
|
---|
2908 |
|
---|
2909 | ROScalarColumn<Double> tcol = ROScalarColumn<Double>(table_, "TIME");
|
---|
2910 | timeSecCol = tcol.getColumn();
|
---|
2911 | }
|
---|
2912 |
|
---|
2913 | void Scantable::finaliseBaselining(const bool outBaselineTable,
|
---|
2914 | STBaselineTable* pbt,
|
---|
2915 | const string& bltable,
|
---|
2916 | const bool outTextFile,
|
---|
2917 | ofstream& ofs)
|
---|
2918 | {
|
---|
2919 | if (outBaselineTable) {
|
---|
2920 | pbt->save(bltable);
|
---|
2921 | }
|
---|
2922 |
|
---|
2923 | if (outTextFile) ofs.close();
|
---|
2924 | }
|
---|
2925 |
|
---|
2926 | void Scantable::initLineFinder(const std::vector<int>& edge,
|
---|
2927 | const float threshold,
|
---|
2928 | const int chanAvgLimit,
|
---|
2929 | STLineFinder& lineFinder)
|
---|
2930 | {
|
---|
2931 | if ((edge.size() > 2) && (edge.size() < getIFNos().size()*2)) {
|
---|
2932 | throw(AipsError("Length of edge element info is less than that of IFs"));
|
---|
2933 | }
|
---|
2934 |
|
---|
2935 | lineFinder.setOptions(threshold, 3, chanAvgLimit);
|
---|
2936 | }
|
---|
2937 |
|
---|
2938 | void Scantable::polyBaseline(const std::vector<bool>& mask, int order,
|
---|
2939 | float thresClip, int nIterClip,
|
---|
2940 | bool getResidual,
|
---|
2941 | const std::string& progressInfo,
|
---|
2942 | const bool outLogger, const std::string& blfile,
|
---|
2943 | const std::string& bltable)
|
---|
2944 | {
|
---|
2945 | /****
|
---|
2946 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
2947 | ****/
|
---|
2948 |
|
---|
2949 | try {
|
---|
2950 | ofstream ofs;
|
---|
2951 | String coordInfo;
|
---|
2952 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
2953 | int minNRow;
|
---|
2954 | int nRow = nrow();
|
---|
2955 | std::vector<bool> chanMask, finalChanMask;
|
---|
2956 | float rms;
|
---|
2957 | bool outBaselineTable = (bltable != "");
|
---|
2958 | STBaselineTable bt = STBaselineTable(*this);
|
---|
2959 | Vector<Double> timeSecCol;
|
---|
2960 |
|
---|
2961 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
2962 | coordInfo, hasSameNchan,
|
---|
2963 | progressInfo, showProgress, minNRow,
|
---|
2964 | timeSecCol);
|
---|
2965 |
|
---|
2966 | std::vector<int> nChanNos;
|
---|
2967 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
2968 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
2969 | &Scantable::getNormalPolynomial,
|
---|
2970 | nChanNos);
|
---|
2971 |
|
---|
2972 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
2973 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
2974 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
2975 |
|
---|
2976 | std::vector<float> params;
|
---|
2977 | int nClipped = 0;
|
---|
2978 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
2979 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
2980 | params, rms, finalChanMask,
|
---|
2981 | nClipped, thresClip, nIterClip, getResidual);
|
---|
2982 |
|
---|
2983 | if (outBaselineTable) {
|
---|
2984 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
2985 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
2986 | true, STBaselineFunc::Polynomial, order, std::vector<float>(),
|
---|
2987 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
2988 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
2989 | } else {
|
---|
2990 | setSpectrum(res, whichrow);
|
---|
2991 | }
|
---|
2992 |
|
---|
2993 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
2994 | coordInfo, hasSameNchan, ofs, "polyBaseline()",
|
---|
2995 | params, nClipped);
|
---|
2996 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
2997 | }
|
---|
2998 |
|
---|
2999 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
3000 |
|
---|
3001 | } catch (...) {
|
---|
3002 | throw;
|
---|
3003 | }
|
---|
3004 |
|
---|
3005 | /****
|
---|
3006 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
3007 | double elapse1 = TimeEnd - TimeStart;
|
---|
3008 | std::cout << "poly-new : " << elapse1 << " (sec.)" << endl;
|
---|
3009 | ****/
|
---|
3010 | }
|
---|
3011 |
|
---|
3012 | void Scantable::autoPolyBaseline(const std::vector<bool>& mask, int order,
|
---|
3013 | float thresClip, int nIterClip,
|
---|
3014 | const std::vector<int>& edge,
|
---|
3015 | float threshold, int chanAvgLimit,
|
---|
3016 | bool getResidual,
|
---|
3017 | const std::string& progressInfo,
|
---|
3018 | const bool outLogger, const std::string& blfile,
|
---|
3019 | const std::string& bltable)
|
---|
3020 | {
|
---|
3021 | try {
|
---|
3022 | ofstream ofs;
|
---|
3023 | String coordInfo;
|
---|
3024 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
3025 | int minNRow;
|
---|
3026 | int nRow = nrow();
|
---|
3027 | std::vector<bool> chanMask, finalChanMask;
|
---|
3028 | float rms;
|
---|
3029 | bool outBaselineTable = (bltable != "");
|
---|
3030 | STBaselineTable bt = STBaselineTable(*this);
|
---|
3031 | Vector<Double> timeSecCol;
|
---|
3032 | STLineFinder lineFinder = STLineFinder();
|
---|
3033 |
|
---|
3034 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
3035 | coordInfo, hasSameNchan,
|
---|
3036 | progressInfo, showProgress, minNRow,
|
---|
3037 | timeSecCol);
|
---|
3038 |
|
---|
3039 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
3040 |
|
---|
3041 | std::vector<int> nChanNos;
|
---|
3042 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
3043 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
3044 | &Scantable::getNormalPolynomial,
|
---|
3045 | nChanNos);
|
---|
3046 |
|
---|
3047 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
3048 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
3049 | std::vector<int> currentEdge;
|
---|
3050 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
3051 |
|
---|
3052 | std::vector<float> params;
|
---|
3053 | int nClipped = 0;
|
---|
3054 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
3055 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
3056 | params, rms, finalChanMask,
|
---|
3057 | nClipped, thresClip, nIterClip, getResidual);
|
---|
3058 |
|
---|
3059 | if (outBaselineTable) {
|
---|
3060 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
3061 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
3062 | true, STBaselineFunc::Polynomial, order, std::vector<float>(),
|
---|
3063 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
3064 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
3065 | } else {
|
---|
3066 | setSpectrum(res, whichrow);
|
---|
3067 | }
|
---|
3068 |
|
---|
3069 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
3070 | coordInfo, hasSameNchan, ofs, "autoPolyBaseline()",
|
---|
3071 | params, nClipped);
|
---|
3072 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
3073 | }
|
---|
3074 |
|
---|
3075 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
3076 |
|
---|
3077 | } catch (...) {
|
---|
3078 | throw;
|
---|
3079 | }
|
---|
3080 | }
|
---|
3081 |
|
---|
3082 | void Scantable::chebyshevBaseline(const std::vector<bool>& mask, int order,
|
---|
3083 | float thresClip, int nIterClip,
|
---|
3084 | bool getResidual,
|
---|
3085 | const std::string& progressInfo,
|
---|
3086 | const bool outLogger, const std::string& blfile,
|
---|
3087 | const std::string& bltable)
|
---|
3088 | {
|
---|
3089 | /*
|
---|
3090 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
3091 | */
|
---|
3092 |
|
---|
3093 | try {
|
---|
3094 | ofstream ofs;
|
---|
3095 | String coordInfo;
|
---|
3096 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
3097 | int minNRow;
|
---|
3098 | int nRow = nrow();
|
---|
3099 | std::vector<bool> chanMask, finalChanMask;
|
---|
3100 | float rms;
|
---|
3101 | bool outBaselineTable = (bltable != "");
|
---|
3102 | STBaselineTable bt = STBaselineTable(*this);
|
---|
3103 | Vector<Double> timeSecCol;
|
---|
3104 |
|
---|
3105 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
3106 | coordInfo, hasSameNchan,
|
---|
3107 | progressInfo, showProgress, minNRow,
|
---|
3108 | timeSecCol);
|
---|
3109 |
|
---|
3110 | std::vector<int> nChanNos;
|
---|
3111 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
3112 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
3113 | &Scantable::getChebyshevPolynomial,
|
---|
3114 | nChanNos);
|
---|
3115 |
|
---|
3116 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
3117 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
3118 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
3119 |
|
---|
3120 | std::vector<float> params;
|
---|
3121 | int nClipped = 0;
|
---|
3122 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
3123 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
3124 | params, rms, finalChanMask,
|
---|
3125 | nClipped, thresClip, nIterClip, getResidual);
|
---|
3126 |
|
---|
3127 | if (outBaselineTable) {
|
---|
3128 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
3129 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
3130 | true, STBaselineFunc::Chebyshev, order, std::vector<float>(),
|
---|
3131 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
3132 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
3133 | } else {
|
---|
3134 | setSpectrum(res, whichrow);
|
---|
3135 | }
|
---|
3136 |
|
---|
3137 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
3138 | coordInfo, hasSameNchan, ofs, "chebyshevBaseline()",
|
---|
3139 | params, nClipped);
|
---|
3140 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
3141 | }
|
---|
3142 |
|
---|
3143 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
3144 |
|
---|
3145 | } catch (...) {
|
---|
3146 | throw;
|
---|
3147 | }
|
---|
3148 |
|
---|
3149 | /*
|
---|
3150 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
3151 | double elapse1 = TimeEnd - TimeStart;
|
---|
3152 | std::cout << "cheby : " << elapse1 << " (sec.)" << endl;
|
---|
3153 | */
|
---|
3154 | }
|
---|
3155 |
|
---|
3156 | void Scantable::autoChebyshevBaseline(const std::vector<bool>& mask, int order,
|
---|
3157 | float thresClip, int nIterClip,
|
---|
3158 | const std::vector<int>& edge,
|
---|
3159 | float threshold, int chanAvgLimit,
|
---|
3160 | bool getResidual,
|
---|
3161 | const std::string& progressInfo,
|
---|
3162 | const bool outLogger, const std::string& blfile,
|
---|
3163 | const std::string& bltable)
|
---|
3164 | {
|
---|
3165 | try {
|
---|
3166 | ofstream ofs;
|
---|
3167 | String coordInfo;
|
---|
3168 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
3169 | int minNRow;
|
---|
3170 | int nRow = nrow();
|
---|
3171 | std::vector<bool> chanMask, finalChanMask;
|
---|
3172 | float rms;
|
---|
3173 | bool outBaselineTable = (bltable != "");
|
---|
3174 | STBaselineTable bt = STBaselineTable(*this);
|
---|
3175 | Vector<Double> timeSecCol;
|
---|
3176 | STLineFinder lineFinder = STLineFinder();
|
---|
3177 |
|
---|
3178 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
3179 | coordInfo, hasSameNchan,
|
---|
3180 | progressInfo, showProgress, minNRow,
|
---|
3181 | timeSecCol);
|
---|
3182 |
|
---|
3183 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
3184 |
|
---|
3185 | std::vector<int> nChanNos;
|
---|
3186 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
3187 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
3188 | &Scantable::getChebyshevPolynomial,
|
---|
3189 | nChanNos);
|
---|
3190 |
|
---|
3191 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
3192 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
3193 | std::vector<int> currentEdge;
|
---|
3194 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
3195 |
|
---|
3196 | std::vector<float> params;
|
---|
3197 | int nClipped = 0;
|
---|
3198 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
3199 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
3200 | params, rms, finalChanMask,
|
---|
3201 | nClipped, thresClip, nIterClip, getResidual);
|
---|
3202 |
|
---|
3203 | if (outBaselineTable) {
|
---|
3204 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
3205 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
3206 | true, STBaselineFunc::Chebyshev, order, std::vector<float>(),
|
---|
3207 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
3208 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
3209 | } else {
|
---|
3210 | setSpectrum(res, whichrow);
|
---|
3211 | }
|
---|
3212 |
|
---|
3213 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
3214 | coordInfo, hasSameNchan, ofs, "autoChebyshevBaseline()",
|
---|
3215 | params, nClipped);
|
---|
3216 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
3217 | }
|
---|
3218 |
|
---|
3219 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
3220 |
|
---|
3221 | } catch (...) {
|
---|
3222 | throw;
|
---|
3223 | }
|
---|
3224 | }
|
---|
3225 |
|
---|
3226 | double Scantable::calculateModelSelectionCriteria(const std::string& valname,
|
---|
3227 | const std::string& blfunc,
|
---|
3228 | int order,
|
---|
3229 | const std::vector<bool>& inMask,
|
---|
3230 | int whichrow,
|
---|
3231 | bool useLineFinder,
|
---|
3232 | const std::vector<int>& edge,
|
---|
3233 | float threshold,
|
---|
3234 | int chanAvgLimit)
|
---|
3235 | {
|
---|
3236 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
3237 | std::vector<bool> chanMask;
|
---|
3238 | chanMask.clear();
|
---|
3239 |
|
---|
3240 | if (useLineFinder) {
|
---|
3241 | STLineFinder lineFinder = STLineFinder();
|
---|
3242 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
3243 | std::vector<int> currentEdge;
|
---|
3244 | chanMask = getCompositeChanMask(whichrow, inMask, edge, currentEdge, lineFinder);
|
---|
3245 | } else {
|
---|
3246 | chanMask = getCompositeChanMask(whichrow, inMask);
|
---|
3247 | }
|
---|
3248 |
|
---|
3249 | return doCalculateModelSelectionCriteria(valname, sp, chanMask, blfunc, order);
|
---|
3250 | }
|
---|
3251 |
|
---|
3252 | double Scantable::doCalculateModelSelectionCriteria(const std::string& valname, const std::vector<float>& spec, const std::vector<bool>& mask, const std::string& blfunc, int order)
|
---|
3253 | {
|
---|
3254 | int nparam;
|
---|
3255 | std::vector<float> params;
|
---|
3256 | std::vector<bool> finalChanMask;
|
---|
3257 | float rms;
|
---|
3258 | int nClipped = 0;
|
---|
3259 | std::vector<float> res;
|
---|
3260 | if (blfunc == "poly") {
|
---|
3261 | nparam = order + 1;
|
---|
3262 | res = doPolynomialFitting(spec, mask, order, params, rms, finalChanMask, nClipped);
|
---|
3263 | } else if (blfunc == "chebyshev") {
|
---|
3264 | nparam = order + 1;
|
---|
3265 | res = doChebyshevFitting(spec, mask, order, params, rms, finalChanMask, nClipped);
|
---|
3266 | } else if (blfunc == "cspline") {
|
---|
3267 | std::vector<int> pieceEdges;//(order+1); //order = npiece
|
---|
3268 | nparam = order + 3;
|
---|
3269 | res = doCubicSplineFitting(spec, mask, order, false, pieceEdges, params, rms, finalChanMask, nClipped);
|
---|
3270 | } else if (blfunc == "sinusoid") {
|
---|
3271 | std::vector<int> nWaves;
|
---|
3272 | nWaves.clear();
|
---|
3273 | for (int i = 0; i <= order; ++i) {
|
---|
3274 | nWaves.push_back(i);
|
---|
3275 | }
|
---|
3276 | nparam = 2*order + 1; // order = nwave
|
---|
3277 | res = doSinusoidFitting(spec, mask, nWaves, params, rms, finalChanMask, nClipped);
|
---|
3278 | } else {
|
---|
3279 | throw(AipsError("blfunc must be poly, chebyshev, cspline or sinusoid."));
|
---|
3280 | }
|
---|
3281 |
|
---|
3282 | double msq = 0.0;
|
---|
3283 | int nusedchan = 0;
|
---|
3284 | int nChan = res.size();
|
---|
3285 | for (int i = 0; i < nChan; ++i) {
|
---|
3286 | if (mask[i]) {
|
---|
3287 | msq += (double)res[i]*(double)res[i];
|
---|
3288 | nusedchan++;
|
---|
3289 | }
|
---|
3290 | }
|
---|
3291 | if (nusedchan == 0) {
|
---|
3292 | throw(AipsError("all channels masked."));
|
---|
3293 | }
|
---|
3294 | msq /= (double)nusedchan;
|
---|
3295 |
|
---|
3296 | nparam++; //add 1 for sigma of Gaussian distribution
|
---|
3297 | const double PI = 6.0 * asin(0.5); // PI (= 3.141592653...)
|
---|
3298 |
|
---|
3299 | if (valname.find("aic") == 0) {
|
---|
3300 | // Original Akaike Information Criterion (AIC)
|
---|
3301 | double aic = nusedchan * (log(2.0 * PI * msq) + 1.0) + 2.0 * nparam;
|
---|
3302 |
|
---|
3303 | // Corrected AIC by Sugiura(1978) (AICc)
|
---|
3304 | if (valname == "aicc") {
|
---|
3305 | if (nusedchan - nparam - 1 <= 0) {
|
---|
3306 | throw(AipsError("channel size is too small to calculate AICc."));
|
---|
3307 | }
|
---|
3308 | aic += 2.0*nparam*(nparam + 1)/(double)(nusedchan - nparam - 1);
|
---|
3309 | }
|
---|
3310 |
|
---|
3311 | return aic;
|
---|
3312 |
|
---|
3313 | } else if (valname == "bic") {
|
---|
3314 | // Bayesian Information Criterion (BIC)
|
---|
3315 | double bic = nusedchan * log(msq) + nparam * log((double)nusedchan);
|
---|
3316 | return bic;
|
---|
3317 |
|
---|
3318 | } else if (valname == "gcv") {
|
---|
3319 | // Generalised Cross Validation
|
---|
3320 | double x = 1.0 - (double)nparam / (double)nusedchan;
|
---|
3321 | double gcv = msq / (x * x);
|
---|
3322 | return gcv;
|
---|
3323 |
|
---|
3324 | } else {
|
---|
3325 | throw(AipsError("valname must be aic, aicc, bic or gcv."));
|
---|
3326 | }
|
---|
3327 | }
|
---|
3328 |
|
---|
3329 | double Scantable::getNormalPolynomial(int n, double x) {
|
---|
3330 | if (n == 0) {
|
---|
3331 | return 1.0;
|
---|
3332 | } else if (n > 0) {
|
---|
3333 | double res = 1.0;
|
---|
3334 | for (int i = 0; i < n; ++i) {
|
---|
3335 | res *= x;
|
---|
3336 | }
|
---|
3337 | return res;
|
---|
3338 | } else {
|
---|
3339 | if (x == 0.0) {
|
---|
3340 | throw(AipsError("infinity result: x=0 given for negative power."));
|
---|
3341 | } else {
|
---|
3342 | return pow(x, (double)n);
|
---|
3343 | }
|
---|
3344 | }
|
---|
3345 | }
|
---|
3346 |
|
---|
3347 | double Scantable::getChebyshevPolynomial(int n, double x) {
|
---|
3348 | if ((x < -1.0)||(x > 1.0)) {
|
---|
3349 | throw(AipsError("out of definition range (-1 <= x <= 1)."));
|
---|
3350 | } else if (x == 1.0) {
|
---|
3351 | return 1.0;
|
---|
3352 | } else if (x == 0.0) {
|
---|
3353 | double res;
|
---|
3354 | if (n%2 == 0) {
|
---|
3355 | if (n%4 == 0) {
|
---|
3356 | res = 1.0;
|
---|
3357 | } else {
|
---|
3358 | res = -1.0;
|
---|
3359 | }
|
---|
3360 | } else {
|
---|
3361 | res = 0.0;
|
---|
3362 | }
|
---|
3363 | return res;
|
---|
3364 | } else if (x == -1.0) {
|
---|
3365 | double res = (n%2 == 0 ? 1.0 : -1.0);
|
---|
3366 | return res;
|
---|
3367 | } else if (n < 0) {
|
---|
3368 | throw(AipsError("the order must be zero or positive."));
|
---|
3369 | } else if (n == 0) {
|
---|
3370 | return 1.0;
|
---|
3371 | } else if (n == 1) {
|
---|
3372 | return x;
|
---|
3373 | } else {
|
---|
3374 | double res[n+1];
|
---|
3375 | for (int i = 0; i < n+1; ++i) {
|
---|
3376 | double res0 = 0.0;
|
---|
3377 | if (i == 0) {
|
---|
3378 | res0 = 1.0;
|
---|
3379 | } else if (i == 1) {
|
---|
3380 | res0 = x;
|
---|
3381 | } else {
|
---|
3382 | res0 = 2.0 * x * res[i-1] - res[i-2];
|
---|
3383 | }
|
---|
3384 | res[i] = res0;
|
---|
3385 | }
|
---|
3386 | return res[n];
|
---|
3387 | }
|
---|
3388 | }
|
---|
3389 |
|
---|
3390 | std::vector<float> Scantable::doPolynomialFitting(const std::vector<float>& data,
|
---|
3391 | const std::vector<bool>& mask,
|
---|
3392 | int order,
|
---|
3393 | std::vector<float>& params,
|
---|
3394 | float& rms,
|
---|
3395 | std::vector<bool>& finalmask,
|
---|
3396 | float clipth,
|
---|
3397 | int clipn)
|
---|
3398 | {
|
---|
3399 | int nClipped = 0;
|
---|
3400 | return doPolynomialFitting(data, mask, order, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
3401 | }
|
---|
3402 |
|
---|
3403 | std::vector<float> Scantable::doPolynomialFitting(const std::vector<float>& data,
|
---|
3404 | const std::vector<bool>& mask,
|
---|
3405 | int order,
|
---|
3406 | std::vector<float>& params,
|
---|
3407 | float& rms,
|
---|
3408 | std::vector<bool>& finalMask,
|
---|
3409 | int& nClipped,
|
---|
3410 | float thresClip,
|
---|
3411 | int nIterClip,
|
---|
3412 | bool getResidual)
|
---|
3413 | {
|
---|
3414 | return doLeastSquareFitting(data, mask,
|
---|
3415 | getPolynomialModel(order, data.size(), &Scantable::getNormalPolynomial),
|
---|
3416 | params, rms, finalMask,
|
---|
3417 | nClipped, thresClip, nIterClip,
|
---|
3418 | getResidual);
|
---|
3419 | }
|
---|
3420 |
|
---|
3421 | std::vector<float> Scantable::doChebyshevFitting(const std::vector<float>& data,
|
---|
3422 | const std::vector<bool>& mask,
|
---|
3423 | int order,
|
---|
3424 | std::vector<float>& params,
|
---|
3425 | float& rms,
|
---|
3426 | std::vector<bool>& finalmask,
|
---|
3427 | float clipth,
|
---|
3428 | int clipn)
|
---|
3429 | {
|
---|
3430 | int nClipped = 0;
|
---|
3431 | return doChebyshevFitting(data, mask, order, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
3432 | }
|
---|
3433 |
|
---|
3434 | std::vector<float> Scantable::doChebyshevFitting(const std::vector<float>& data,
|
---|
3435 | const std::vector<bool>& mask,
|
---|
3436 | int order,
|
---|
3437 | std::vector<float>& params,
|
---|
3438 | float& rms,
|
---|
3439 | std::vector<bool>& finalMask,
|
---|
3440 | int& nClipped,
|
---|
3441 | float thresClip,
|
---|
3442 | int nIterClip,
|
---|
3443 | bool getResidual)
|
---|
3444 | {
|
---|
3445 | return doLeastSquareFitting(data, mask,
|
---|
3446 | getPolynomialModel(order, data.size(), &Scantable::getChebyshevPolynomial),
|
---|
3447 | params, rms, finalMask,
|
---|
3448 | nClipped, thresClip, nIterClip,
|
---|
3449 | getResidual);
|
---|
3450 | }
|
---|
3451 |
|
---|
3452 | std::vector<std::vector<double> > Scantable::getPolynomialModel(int order, int nchan, double (Scantable::*pfunc)(int, double))
|
---|
3453 | {
|
---|
3454 | // model : contains model values for computing the least-square matrix.
|
---|
3455 | // model.size() is nmodel and model[*].size() is nchan.
|
---|
3456 | // Each model element are as follows:
|
---|
3457 | //
|
---|
3458 | // (for normal polynomials)
|
---|
3459 | // model[0] = {1.0, 1.0, 1.0, ..., 1.0},
|
---|
3460 | // model[1] = {0.0, 1.0, 2.0, ..., (nchan-1)}
|
---|
3461 | // model[n-1] = ...,
|
---|
3462 | // model[n] = {0.0^n, 1.0^n, 2.0^n, ..., (nchan-1)^n}
|
---|
3463 | // where (0 <= n <= order)
|
---|
3464 | //
|
---|
3465 | // (for Chebyshev polynomials)
|
---|
3466 | // model[0] = {T0(-1), T0(2/(nchan-1)-1), T0(4/(nchan-1)-1), ..., T0(1)},
|
---|
3467 | // model[n-1] = ...,
|
---|
3468 | // model[n] = {Tn(-1), Tn(2/(nchan-1)-1), Tn(4/(nchan-1)-1), ..., Tn(1)}
|
---|
3469 | // where (0 <= n <= order),
|
---|
3470 |
|
---|
3471 | int nmodel = order + 1;
|
---|
3472 | std::vector<std::vector<double> > model(nmodel, std::vector<double>(nchan));
|
---|
3473 |
|
---|
3474 | double stretch, shift;
|
---|
3475 | if (pfunc == &Scantable::getChebyshevPolynomial) {
|
---|
3476 | stretch = 2.0/(double)(nchan - 1);
|
---|
3477 | shift = -1.0;
|
---|
3478 | } else {
|
---|
3479 | stretch = 1.0;
|
---|
3480 | shift = 0.0;
|
---|
3481 | }
|
---|
3482 |
|
---|
3483 | for (int i = 0; i < nmodel; ++i) {
|
---|
3484 | for (int j = 0; j < nchan; ++j) {
|
---|
3485 | model[i][j] = (this->*pfunc)(i, stretch*(double)j + shift);
|
---|
3486 | }
|
---|
3487 | }
|
---|
3488 |
|
---|
3489 | return model;
|
---|
3490 | }
|
---|
3491 |
|
---|
3492 | std::vector<std::vector<std::vector<double> > > Scantable::getPolynomialModelReservoir(int order,
|
---|
3493 | double (Scantable::*pfunc)(int, double),
|
---|
3494 | std::vector<int>& nChanNos)
|
---|
3495 | {
|
---|
3496 | std::vector<std::vector<std::vector<double> > > res;
|
---|
3497 | res.clear();
|
---|
3498 | nChanNos.clear();
|
---|
3499 |
|
---|
3500 | std::vector<uint> ifNos = getIFNos();
|
---|
3501 | for (uint i = 0; i < ifNos.size(); ++i) {
|
---|
3502 | int currNchan = nchan(ifNos[i]);
|
---|
3503 | bool hasDifferentNchan = (i == 0);
|
---|
3504 | for (uint j = 0; j < i; ++j) {
|
---|
3505 | if (currNchan != nchan(ifNos[j])) {
|
---|
3506 | hasDifferentNchan = true;
|
---|
3507 | break;
|
---|
3508 | }
|
---|
3509 | }
|
---|
3510 | if (hasDifferentNchan) {
|
---|
3511 | res.push_back(getPolynomialModel(order, currNchan, pfunc));
|
---|
3512 | nChanNos.push_back(currNchan);
|
---|
3513 | }
|
---|
3514 | }
|
---|
3515 |
|
---|
3516 | return res;
|
---|
3517 | }
|
---|
3518 |
|
---|
3519 | std::vector<float> Scantable::doLeastSquareFitting(const std::vector<float>& data,
|
---|
3520 | const std::vector<bool>& mask,
|
---|
3521 | const std::vector<std::vector<double> >& model,
|
---|
3522 | std::vector<float>& params,
|
---|
3523 | float& rms,
|
---|
3524 | std::vector<bool>& finalMask,
|
---|
3525 | int& nClipped,
|
---|
3526 | float thresClip,
|
---|
3527 | int nIterClip,
|
---|
3528 | bool getResidual)
|
---|
3529 | {
|
---|
3530 | int nDOF = model.size();
|
---|
3531 | int nChan = data.size();
|
---|
3532 |
|
---|
3533 | if (nDOF == 0) {
|
---|
3534 | throw(AipsError("no model data given"));
|
---|
3535 | }
|
---|
3536 | if (nChan < 2) {
|
---|
3537 | throw(AipsError("data size is too few"));
|
---|
3538 | }
|
---|
3539 | if (nChan != (int)mask.size()) {
|
---|
3540 | throw(AipsError("data and mask sizes are not identical"));
|
---|
3541 | }
|
---|
3542 | for (int i = 0; i < nDOF; ++i) {
|
---|
3543 | if (nChan != (int)model[i].size()) {
|
---|
3544 | throw(AipsError("data and model sizes are not identical"));
|
---|
3545 | }
|
---|
3546 | }
|
---|
3547 |
|
---|
3548 | params.clear();
|
---|
3549 | params.resize(nDOF);
|
---|
3550 |
|
---|
3551 | finalMask.clear();
|
---|
3552 | finalMask.resize(nChan);
|
---|
3553 |
|
---|
3554 | std::vector<int> maskArray(nChan);
|
---|
3555 | int j = 0;
|
---|
3556 | for (int i = 0; i < nChan; ++i) {
|
---|
3557 | maskArray[i] = mask[i] ? 1 : 0;
|
---|
3558 | if (isnan(data[i])) maskArray[i] = 0;
|
---|
3559 | if (isinf(data[i])) maskArray[i] = 0;
|
---|
3560 |
|
---|
3561 | finalMask[i] = (maskArray[i] == 1);
|
---|
3562 | if (finalMask[i]) {
|
---|
3563 | j++;
|
---|
3564 | }
|
---|
3565 |
|
---|
3566 | /*
|
---|
3567 | maskArray[i] = mask[i] ? 1 : 0;
|
---|
3568 | if (mask[i]) {
|
---|
3569 | j++;
|
---|
3570 | }
|
---|
3571 | finalMask[i] = mask[i];
|
---|
3572 | */
|
---|
3573 | }
|
---|
3574 |
|
---|
3575 | int initNData = j;
|
---|
3576 | int nData = initNData;
|
---|
3577 |
|
---|
3578 | std::vector<double> z1(nChan), r1(nChan), residual(nChan);
|
---|
3579 | for (int i = 0; i < nChan; ++i) {
|
---|
3580 | z1[i] = (double)data[i];
|
---|
3581 | r1[i] = 0.0;
|
---|
3582 | residual[i] = 0.0;
|
---|
3583 | }
|
---|
3584 |
|
---|
3585 | for (int nClip = 0; nClip < nIterClip+1; ++nClip) {
|
---|
3586 | // xMatrix : horizontal concatenation of
|
---|
3587 | // the least-sq. matrix (left) and an
|
---|
3588 | // identity matrix (right).
|
---|
3589 | // the right part is used to calculate the inverse matrix of the left part.
|
---|
3590 | double xMatrix[nDOF][2*nDOF];
|
---|
3591 | double zMatrix[nDOF];
|
---|
3592 | for (int i = 0; i < nDOF; ++i) {
|
---|
3593 | for (int j = 0; j < 2*nDOF; ++j) {
|
---|
3594 | xMatrix[i][j] = 0.0;
|
---|
3595 | }
|
---|
3596 | xMatrix[i][nDOF+i] = 1.0;
|
---|
3597 | zMatrix[i] = 0.0;
|
---|
3598 | }
|
---|
3599 |
|
---|
3600 | int nUseData = 0;
|
---|
3601 | for (int k = 0; k < nChan; ++k) {
|
---|
3602 | if (maskArray[k] == 0) continue;
|
---|
3603 |
|
---|
3604 | for (int i = 0; i < nDOF; ++i) {
|
---|
3605 | for (int j = i; j < nDOF; ++j) {
|
---|
3606 | xMatrix[i][j] += model[i][k] * model[j][k];
|
---|
3607 | }
|
---|
3608 | zMatrix[i] += z1[k] * model[i][k];
|
---|
3609 | }
|
---|
3610 |
|
---|
3611 | nUseData++;
|
---|
3612 | }
|
---|
3613 |
|
---|
3614 | if (nUseData < 1) {
|
---|
3615 | throw(AipsError("all channels clipped or masked. can't execute fitting anymore."));
|
---|
3616 | }
|
---|
3617 |
|
---|
3618 | for (int i = 0; i < nDOF; ++i) {
|
---|
3619 | for (int j = 0; j < i; ++j) {
|
---|
3620 | xMatrix[i][j] = xMatrix[j][i];
|
---|
3621 | }
|
---|
3622 | }
|
---|
3623 |
|
---|
3624 | //compute inverse matrix of the left half of xMatrix
|
---|
3625 | std::vector<double> invDiag(nDOF);
|
---|
3626 | for (int i = 0; i < nDOF; ++i) {
|
---|
3627 | invDiag[i] = 1.0 / xMatrix[i][i];
|
---|
3628 | for (int j = 0; j < nDOF; ++j) {
|
---|
3629 | xMatrix[i][j] *= invDiag[i];
|
---|
3630 | }
|
---|
3631 | }
|
---|
3632 |
|
---|
3633 | for (int k = 0; k < nDOF; ++k) {
|
---|
3634 | for (int i = 0; i < nDOF; ++i) {
|
---|
3635 | if (i != k) {
|
---|
3636 | double factor1 = xMatrix[k][k];
|
---|
3637 | double invfactor1 = 1.0 / factor1;
|
---|
3638 | double factor2 = xMatrix[i][k];
|
---|
3639 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
3640 | xMatrix[i][j] *= factor1;
|
---|
3641 | xMatrix[i][j] -= xMatrix[k][j]*factor2;
|
---|
3642 | xMatrix[i][j] *= invfactor1;
|
---|
3643 | }
|
---|
3644 | }
|
---|
3645 | }
|
---|
3646 | double invXDiag = 1.0 / xMatrix[k][k];
|
---|
3647 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
3648 | xMatrix[k][j] *= invXDiag;
|
---|
3649 | }
|
---|
3650 | }
|
---|
3651 |
|
---|
3652 | for (int i = 0; i < nDOF; ++i) {
|
---|
3653 | for (int j = 0; j < nDOF; ++j) {
|
---|
3654 | xMatrix[i][nDOF+j] *= invDiag[j];
|
---|
3655 | }
|
---|
3656 | }
|
---|
3657 | //compute a vector y in which coefficients of the best-fit
|
---|
3658 | //model functions are stored.
|
---|
3659 | //in case of polynomials, y consists of (a0,a1,a2,...)
|
---|
3660 | //where ai is the coefficient of the term x^i.
|
---|
3661 | //in case of sinusoids, y consists of (a0,s1,c1,s2,c2,...)
|
---|
3662 | //where a0 is constant term and s* and c* are of sine
|
---|
3663 | //and cosine functions, respectively.
|
---|
3664 | std::vector<double> y(nDOF);
|
---|
3665 | for (int i = 0; i < nDOF; ++i) {
|
---|
3666 | y[i] = 0.0;
|
---|
3667 | for (int j = 0; j < nDOF; ++j) {
|
---|
3668 | y[i] += xMatrix[i][nDOF+j]*zMatrix[j];
|
---|
3669 | }
|
---|
3670 | params[i] = (float)y[i];
|
---|
3671 | }
|
---|
3672 |
|
---|
3673 | for (int i = 0; i < nChan; ++i) {
|
---|
3674 | r1[i] = y[0];
|
---|
3675 | for (int j = 1; j < nDOF; ++j) {
|
---|
3676 | r1[i] += y[j]*model[j][i];
|
---|
3677 | }
|
---|
3678 | residual[i] = z1[i] - r1[i];
|
---|
3679 | }
|
---|
3680 |
|
---|
3681 | double stdDev = 0.0;
|
---|
3682 | for (int i = 0; i < nChan; ++i) {
|
---|
3683 | if (maskArray[i] == 0) continue;
|
---|
3684 | stdDev += residual[i]*residual[i];
|
---|
3685 | }
|
---|
3686 | stdDev = sqrt(stdDev/(double)nData);
|
---|
3687 | rms = (float)stdDev;
|
---|
3688 |
|
---|
3689 | if ((nClip == nIterClip) || (thresClip <= 0.0)) {
|
---|
3690 | break;
|
---|
3691 | } else {
|
---|
3692 |
|
---|
3693 | double thres = stdDev * thresClip;
|
---|
3694 | int newNData = 0;
|
---|
3695 | for (int i = 0; i < nChan; ++i) {
|
---|
3696 | if (abs(residual[i]) >= thres) {
|
---|
3697 | maskArray[i] = 0;
|
---|
3698 | finalMask[i] = false;
|
---|
3699 | }
|
---|
3700 | if (maskArray[i] > 0) {
|
---|
3701 | newNData++;
|
---|
3702 | }
|
---|
3703 | }
|
---|
3704 | if (newNData == nData) {
|
---|
3705 | break; //no more flag to add. stop iteration.
|
---|
3706 | } else {
|
---|
3707 | nData = newNData;
|
---|
3708 | }
|
---|
3709 |
|
---|
3710 | }
|
---|
3711 | }
|
---|
3712 |
|
---|
3713 | nClipped = initNData - nData;
|
---|
3714 |
|
---|
3715 | std::vector<float> result(nChan);
|
---|
3716 | if (getResidual) {
|
---|
3717 | for (int i = 0; i < nChan; ++i) {
|
---|
3718 | result[i] = (float)residual[i];
|
---|
3719 | }
|
---|
3720 | } else {
|
---|
3721 | for (int i = 0; i < nChan; ++i) {
|
---|
3722 | result[i] = (float)r1[i];
|
---|
3723 | }
|
---|
3724 | }
|
---|
3725 |
|
---|
3726 | return result;
|
---|
3727 | } //xMatrix
|
---|
3728 |
|
---|
3729 | void Scantable::cubicSplineBaseline(const std::vector<bool>& mask, int nPiece,
|
---|
3730 | float thresClip, int nIterClip,
|
---|
3731 | bool getResidual,
|
---|
3732 | const std::string& progressInfo,
|
---|
3733 | const bool outLogger, const std::string& blfile,
|
---|
3734 | const std::string& bltable)
|
---|
3735 | {
|
---|
3736 | /****
|
---|
3737 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
3738 | ****/
|
---|
3739 |
|
---|
3740 | try {
|
---|
3741 | ofstream ofs;
|
---|
3742 | String coordInfo;
|
---|
3743 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
3744 | int minNRow;
|
---|
3745 | int nRow = nrow();
|
---|
3746 | std::vector<bool> chanMask, finalChanMask;
|
---|
3747 | float rms;
|
---|
3748 | bool outBaselineTable = (bltable != "");
|
---|
3749 | STBaselineTable bt = STBaselineTable(*this);
|
---|
3750 | Vector<Double> timeSecCol;
|
---|
3751 |
|
---|
3752 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
3753 | coordInfo, hasSameNchan,
|
---|
3754 | progressInfo, showProgress, minNRow,
|
---|
3755 | timeSecCol);
|
---|
3756 |
|
---|
3757 | std::vector<int> nChanNos;
|
---|
3758 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
3759 | modelReservoir = getPolynomialModelReservoir(3,
|
---|
3760 | &Scantable::getNormalPolynomial,
|
---|
3761 | nChanNos);
|
---|
3762 |
|
---|
3763 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
3764 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
3765 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
3766 |
|
---|
3767 | std::vector<int> pieceEdges;
|
---|
3768 | std::vector<float> params;
|
---|
3769 | int nClipped = 0;
|
---|
3770 | std::vector<float> res = doCubicSplineLeastSquareFitting(sp, chanMask,
|
---|
3771 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
3772 | nPiece, false, pieceEdges, params, rms, finalChanMask,
|
---|
3773 | nClipped, thresClip, nIterClip, getResidual);
|
---|
3774 |
|
---|
3775 | if (outBaselineTable) {
|
---|
3776 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
3777 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
3778 | true, STBaselineFunc::CSpline, pieceEdges, std::vector<float>(),
|
---|
3779 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
3780 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
3781 | } else {
|
---|
3782 | setSpectrum(res, whichrow);
|
---|
3783 | }
|
---|
3784 |
|
---|
3785 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
3786 | coordInfo, hasSameNchan, ofs, "cubicSplineBaseline()",
|
---|
3787 | pieceEdges, params, nClipped);
|
---|
3788 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
3789 | }
|
---|
3790 |
|
---|
3791 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
3792 |
|
---|
3793 | } catch (...) {
|
---|
3794 | throw;
|
---|
3795 | }
|
---|
3796 |
|
---|
3797 | /****
|
---|
3798 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
3799 | double elapse1 = TimeEnd - TimeStart;
|
---|
3800 | std::cout << "cspline-new : " << elapse1 << " (sec.)" << endl;
|
---|
3801 | ****/
|
---|
3802 | }
|
---|
3803 |
|
---|
3804 | void Scantable::autoCubicSplineBaseline(const std::vector<bool>& mask, int nPiece,
|
---|
3805 | float thresClip, int nIterClip,
|
---|
3806 | const std::vector<int>& edge,
|
---|
3807 | float threshold, int chanAvgLimit,
|
---|
3808 | bool getResidual,
|
---|
3809 | const std::string& progressInfo,
|
---|
3810 | const bool outLogger, const std::string& blfile,
|
---|
3811 | const std::string& bltable)
|
---|
3812 | {
|
---|
3813 | try {
|
---|
3814 | ofstream ofs;
|
---|
3815 | String coordInfo;
|
---|
3816 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
3817 | int minNRow;
|
---|
3818 | int nRow = nrow();
|
---|
3819 | std::vector<bool> chanMask, finalChanMask;
|
---|
3820 | float rms;
|
---|
3821 | bool outBaselineTable = (bltable != "");
|
---|
3822 | STBaselineTable bt = STBaselineTable(*this);
|
---|
3823 | Vector<Double> timeSecCol;
|
---|
3824 | STLineFinder lineFinder = STLineFinder();
|
---|
3825 |
|
---|
3826 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
3827 | coordInfo, hasSameNchan,
|
---|
3828 | progressInfo, showProgress, minNRow,
|
---|
3829 | timeSecCol);
|
---|
3830 |
|
---|
3831 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
3832 |
|
---|
3833 | std::vector<int> nChanNos;
|
---|
3834 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
3835 | modelReservoir = getPolynomialModelReservoir(3,
|
---|
3836 | &Scantable::getNormalPolynomial,
|
---|
3837 | nChanNos);
|
---|
3838 |
|
---|
3839 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
3840 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
3841 | std::vector<int> currentEdge;
|
---|
3842 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
3843 |
|
---|
3844 | std::vector<int> pieceEdges;
|
---|
3845 | std::vector<float> params;
|
---|
3846 | int nClipped = 0;
|
---|
3847 | std::vector<float> res = doCubicSplineLeastSquareFitting(sp, chanMask,
|
---|
3848 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
3849 | nPiece, false, pieceEdges, params, rms, finalChanMask,
|
---|
3850 | nClipped, thresClip, nIterClip, getResidual);
|
---|
3851 |
|
---|
3852 | if (outBaselineTable) {
|
---|
3853 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
3854 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
3855 | true, STBaselineFunc::CSpline, pieceEdges, std::vector<float>(),
|
---|
3856 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
3857 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
3858 | } else {
|
---|
3859 | setSpectrum(res, whichrow);
|
---|
3860 | }
|
---|
3861 |
|
---|
3862 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
3863 | coordInfo, hasSameNchan, ofs, "autoCubicSplineBaseline()",
|
---|
3864 | pieceEdges, params, nClipped);
|
---|
3865 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
3866 | }
|
---|
3867 |
|
---|
3868 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
3869 |
|
---|
3870 | } catch (...) {
|
---|
3871 | throw;
|
---|
3872 | }
|
---|
3873 | }
|
---|
3874 |
|
---|
3875 | std::vector<float> Scantable::doCubicSplineFitting(const std::vector<float>& data,
|
---|
3876 | const std::vector<bool>& mask,
|
---|
3877 | std::vector<int>& idxEdge,
|
---|
3878 | std::vector<float>& params,
|
---|
3879 | float& rms,
|
---|
3880 | std::vector<bool>& finalmask,
|
---|
3881 | float clipth,
|
---|
3882 | int clipn)
|
---|
3883 | {
|
---|
3884 | int nClipped = 0;
|
---|
3885 | return doCubicSplineFitting(data, mask, idxEdge.size()-1, true, idxEdge, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
3886 | }
|
---|
3887 |
|
---|
3888 | std::vector<float> Scantable::doCubicSplineFitting(const std::vector<float>& data,
|
---|
3889 | const std::vector<bool>& mask,
|
---|
3890 | int nPiece,
|
---|
3891 | std::vector<int>& idxEdge,
|
---|
3892 | std::vector<float>& params,
|
---|
3893 | float& rms,
|
---|
3894 | std::vector<bool>& finalmask,
|
---|
3895 | float clipth,
|
---|
3896 | int clipn)
|
---|
3897 | {
|
---|
3898 | int nClipped = 0;
|
---|
3899 | return doCubicSplineFitting(data, mask, nPiece, false, idxEdge, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
3900 | }
|
---|
3901 |
|
---|
3902 | std::vector<float> Scantable::doCubicSplineFitting(const std::vector<float>& data,
|
---|
3903 | const std::vector<bool>& mask,
|
---|
3904 | int nPiece,
|
---|
3905 | bool useGivenPieceBoundary,
|
---|
3906 | std::vector<int>& idxEdge,
|
---|
3907 | std::vector<float>& params,
|
---|
3908 | float& rms,
|
---|
3909 | std::vector<bool>& finalMask,
|
---|
3910 | int& nClipped,
|
---|
3911 | float thresClip,
|
---|
3912 | int nIterClip,
|
---|
3913 | bool getResidual)
|
---|
3914 | {
|
---|
3915 | return doCubicSplineLeastSquareFitting(data, mask,
|
---|
3916 | getPolynomialModel(3, data.size(), &Scantable::getNormalPolynomial),
|
---|
3917 | nPiece, useGivenPieceBoundary, idxEdge,
|
---|
3918 | params, rms, finalMask,
|
---|
3919 | nClipped, thresClip, nIterClip,
|
---|
3920 | getResidual);
|
---|
3921 | }
|
---|
3922 |
|
---|
3923 | std::vector<float> Scantable::doCubicSplineLeastSquareFitting(const std::vector<float>& data,
|
---|
3924 | const std::vector<bool>& mask,
|
---|
3925 | const std::vector<std::vector<double> >& model,
|
---|
3926 | int nPiece,
|
---|
3927 | bool useGivenPieceBoundary,
|
---|
3928 | std::vector<int>& idxEdge,
|
---|
3929 | std::vector<float>& params,
|
---|
3930 | float& rms,
|
---|
3931 | std::vector<bool>& finalMask,
|
---|
3932 | int& nClipped,
|
---|
3933 | float thresClip,
|
---|
3934 | int nIterClip,
|
---|
3935 | bool getResidual)
|
---|
3936 | {
|
---|
3937 | int nDOF = nPiece + 3; //number of independent parameters to solve, namely, 4+(nPiece-1).
|
---|
3938 | int nModel = model.size();
|
---|
3939 | int nChan = data.size();
|
---|
3940 |
|
---|
3941 | if (nModel != 4) {
|
---|
3942 | throw(AipsError("model size must be 4."));
|
---|
3943 | }
|
---|
3944 | if (nPiece < 1) {
|
---|
3945 | throw(AipsError("number of the sections must be one or more"));
|
---|
3946 | }
|
---|
3947 | if (nChan < 2*nPiece) {
|
---|
3948 | throw(AipsError("data size is too few"));
|
---|
3949 | }
|
---|
3950 | if (nChan != (int)mask.size()) {
|
---|
3951 | throw(AipsError("data and mask sizes are not identical"));
|
---|
3952 | }
|
---|
3953 | for (int i = 0; i < nModel; ++i) {
|
---|
3954 | if (nChan != (int)model[i].size()) {
|
---|
3955 | throw(AipsError("data and model sizes are not identical"));
|
---|
3956 | }
|
---|
3957 | }
|
---|
3958 |
|
---|
3959 | params.clear();
|
---|
3960 | params.resize(nPiece*nModel);
|
---|
3961 |
|
---|
3962 | finalMask.clear();
|
---|
3963 | finalMask.resize(nChan);
|
---|
3964 |
|
---|
3965 | std::vector<int> maskArray(nChan);
|
---|
3966 | std::vector<int> x(nChan);
|
---|
3967 | int j = 0;
|
---|
3968 | for (int i = 0; i < nChan; ++i) {
|
---|
3969 | maskArray[i] = mask[i] ? 1 : 0;
|
---|
3970 | if (isnan(data[i])) maskArray[i] = 0;
|
---|
3971 | if (isinf(data[i])) maskArray[i] = 0;
|
---|
3972 |
|
---|
3973 | finalMask[i] = (maskArray[i] == 1);
|
---|
3974 | if (finalMask[i]) {
|
---|
3975 | x[j] = i;
|
---|
3976 | j++;
|
---|
3977 | }
|
---|
3978 |
|
---|
3979 | /*
|
---|
3980 | maskArray[i] = mask[i] ? 1 : 0;
|
---|
3981 | if (mask[i]) {
|
---|
3982 | x[j] = i;
|
---|
3983 | j++;
|
---|
3984 | }
|
---|
3985 | finalMask[i] = mask[i];
|
---|
3986 | */
|
---|
3987 | }
|
---|
3988 |
|
---|
3989 | int initNData = j;
|
---|
3990 | int nData = initNData;
|
---|
3991 |
|
---|
3992 | if (initNData < nPiece) {
|
---|
3993 | throw(AipsError("too few non-flagged channels"));
|
---|
3994 | }
|
---|
3995 |
|
---|
3996 | int nElement = (int)(floor(floor((double)(initNData/nPiece))+0.5));
|
---|
3997 | std::vector<double> invEdge(nPiece-1);
|
---|
3998 |
|
---|
3999 | if (useGivenPieceBoundary) {
|
---|
4000 | if ((int)idxEdge.size() != nPiece+1) {
|
---|
4001 | throw(AipsError("pieceEdge.size() must be equal to nPiece+1."));
|
---|
4002 | }
|
---|
4003 | } else {
|
---|
4004 | idxEdge.clear();
|
---|
4005 | idxEdge.resize(nPiece+1);
|
---|
4006 | idxEdge[0] = x[0];
|
---|
4007 | }
|
---|
4008 | for (int i = 1; i < nPiece; ++i) {
|
---|
4009 | int valX = x[nElement*i];
|
---|
4010 | if (!useGivenPieceBoundary) {
|
---|
4011 | idxEdge[i] = valX;
|
---|
4012 | }
|
---|
4013 | invEdge[i-1] = 1.0/(double)valX;
|
---|
4014 | }
|
---|
4015 | if (!useGivenPieceBoundary) {
|
---|
4016 | idxEdge[nPiece] = x[initNData-1]+1;
|
---|
4017 | }
|
---|
4018 |
|
---|
4019 | std::vector<double> z1(nChan), r1(nChan), residual(nChan);
|
---|
4020 | for (int i = 0; i < nChan; ++i) {
|
---|
4021 | z1[i] = (double)data[i];
|
---|
4022 | r1[i] = 0.0;
|
---|
4023 | residual[i] = 0.0;
|
---|
4024 | }
|
---|
4025 |
|
---|
4026 | for (int nClip = 0; nClip < nIterClip+1; ++nClip) {
|
---|
4027 | // xMatrix : horizontal concatenation of
|
---|
4028 | // the least-sq. matrix (left) and an
|
---|
4029 | // identity matrix (right).
|
---|
4030 | // the right part is used to calculate the inverse matrix of the left part.
|
---|
4031 |
|
---|
4032 | double xMatrix[nDOF][2*nDOF];
|
---|
4033 | double zMatrix[nDOF];
|
---|
4034 | for (int i = 0; i < nDOF; ++i) {
|
---|
4035 | for (int j = 0; j < 2*nDOF; ++j) {
|
---|
4036 | xMatrix[i][j] = 0.0;
|
---|
4037 | }
|
---|
4038 | xMatrix[i][nDOF+i] = 1.0;
|
---|
4039 | zMatrix[i] = 0.0;
|
---|
4040 | }
|
---|
4041 |
|
---|
4042 | for (int n = 0; n < nPiece; ++n) {
|
---|
4043 | int nUseDataInPiece = 0;
|
---|
4044 | for (int k = idxEdge[n]; k < idxEdge[n+1]; ++k) {
|
---|
4045 |
|
---|
4046 | if (maskArray[k] == 0) continue;
|
---|
4047 |
|
---|
4048 | for (int i = 0; i < nModel; ++i) {
|
---|
4049 | for (int j = i; j < nModel; ++j) {
|
---|
4050 | xMatrix[i][j] += model[i][k] * model[j][k];
|
---|
4051 | }
|
---|
4052 | zMatrix[i] += z1[k] * model[i][k];
|
---|
4053 | }
|
---|
4054 |
|
---|
4055 | for (int i = 0; i < n; ++i) {
|
---|
4056 | double q = 1.0 - model[1][k]*invEdge[i];
|
---|
4057 | q = q*q*q;
|
---|
4058 | for (int j = 0; j < nModel; ++j) {
|
---|
4059 | xMatrix[j][i+nModel] += q * model[j][k];
|
---|
4060 | }
|
---|
4061 | for (int j = 0; j < i; ++j) {
|
---|
4062 | double r = 1.0 - model[1][k]*invEdge[j];
|
---|
4063 | r = r*r*r;
|
---|
4064 | xMatrix[j+nModel][i+nModel] += r*q;
|
---|
4065 | }
|
---|
4066 | xMatrix[i+nModel][i+nModel] += q*q;
|
---|
4067 | zMatrix[i+nModel] += q*z1[k];
|
---|
4068 | }
|
---|
4069 |
|
---|
4070 | nUseDataInPiece++;
|
---|
4071 | }
|
---|
4072 |
|
---|
4073 | if (nUseDataInPiece < 1) {
|
---|
4074 | std::vector<string> suffixOfPieceNumber(4);
|
---|
4075 | suffixOfPieceNumber[0] = "th";
|
---|
4076 | suffixOfPieceNumber[1] = "st";
|
---|
4077 | suffixOfPieceNumber[2] = "nd";
|
---|
4078 | suffixOfPieceNumber[3] = "rd";
|
---|
4079 | int idxNoDataPiece = (n % 10 <= 3) ? n : 0;
|
---|
4080 | ostringstream oss;
|
---|
4081 | oss << "all channels clipped or masked in " << n << suffixOfPieceNumber[idxNoDataPiece];
|
---|
4082 | oss << " piece of the spectrum. can't execute fitting anymore.";
|
---|
4083 | throw(AipsError(String(oss)));
|
---|
4084 | }
|
---|
4085 | }
|
---|
4086 |
|
---|
4087 | for (int i = 0; i < nDOF; ++i) {
|
---|
4088 | for (int j = 0; j < i; ++j) {
|
---|
4089 | xMatrix[i][j] = xMatrix[j][i];
|
---|
4090 | }
|
---|
4091 | }
|
---|
4092 |
|
---|
4093 | std::vector<double> invDiag(nDOF);
|
---|
4094 | for (int i = 0; i < nDOF; ++i) {
|
---|
4095 | invDiag[i] = 1.0 / xMatrix[i][i];
|
---|
4096 | for (int j = 0; j < nDOF; ++j) {
|
---|
4097 | xMatrix[i][j] *= invDiag[i];
|
---|
4098 | }
|
---|
4099 | }
|
---|
4100 |
|
---|
4101 | for (int k = 0; k < nDOF; ++k) {
|
---|
4102 | for (int i = 0; i < nDOF; ++i) {
|
---|
4103 | if (i != k) {
|
---|
4104 | double factor1 = xMatrix[k][k];
|
---|
4105 | double invfactor1 = 1.0 / factor1;
|
---|
4106 | double factor2 = xMatrix[i][k];
|
---|
4107 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
4108 | xMatrix[i][j] *= factor1;
|
---|
4109 | xMatrix[i][j] -= xMatrix[k][j]*factor2;
|
---|
4110 | xMatrix[i][j] *= invfactor1;
|
---|
4111 | }
|
---|
4112 | }
|
---|
4113 | }
|
---|
4114 | double invXDiag = 1.0 / xMatrix[k][k];
|
---|
4115 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
4116 | xMatrix[k][j] *= invXDiag;
|
---|
4117 | }
|
---|
4118 | }
|
---|
4119 |
|
---|
4120 | for (int i = 0; i < nDOF; ++i) {
|
---|
4121 | for (int j = 0; j < nDOF; ++j) {
|
---|
4122 | xMatrix[i][nDOF+j] *= invDiag[j];
|
---|
4123 | }
|
---|
4124 | }
|
---|
4125 |
|
---|
4126 | //compute a vector y which consists of the coefficients of the best-fit spline curves
|
---|
4127 | //(a0,a1,a2,a3(,b3,c3,...)), namely, the ones for the leftmost piece and the ones of
|
---|
4128 | //cubic terms for the other pieces (in case nPiece>1).
|
---|
4129 | std::vector<double> y(nDOF);
|
---|
4130 | for (int i = 0; i < nDOF; ++i) {
|
---|
4131 | y[i] = 0.0;
|
---|
4132 | for (int j = 0; j < nDOF; ++j) {
|
---|
4133 | y[i] += xMatrix[i][nDOF+j]*zMatrix[j];
|
---|
4134 | }
|
---|
4135 | }
|
---|
4136 |
|
---|
4137 | std::vector<double> a(nModel);
|
---|
4138 | for (int i = 0; i < nModel; ++i) {
|
---|
4139 | a[i] = y[i];
|
---|
4140 | }
|
---|
4141 |
|
---|
4142 | int j = 0;
|
---|
4143 | for (int n = 0; n < nPiece; ++n) {
|
---|
4144 | for (int i = idxEdge[n]; i < idxEdge[n+1]; ++i) {
|
---|
4145 | r1[i] = 0.0;
|
---|
4146 | for (int j = 0; j < nModel; ++j) {
|
---|
4147 | r1[i] += a[j] * model[j][i];
|
---|
4148 | }
|
---|
4149 | }
|
---|
4150 | for (int i = 0; i < nModel; ++i) {
|
---|
4151 | params[j+i] = a[i];
|
---|
4152 | }
|
---|
4153 | j += nModel;
|
---|
4154 |
|
---|
4155 | if (n == nPiece-1) break;
|
---|
4156 |
|
---|
4157 | double d = y[n+nModel];
|
---|
4158 | double iE = invEdge[n];
|
---|
4159 | a[0] += d;
|
---|
4160 | a[1] -= 3.0 * d * iE;
|
---|
4161 | a[2] += 3.0 * d * iE * iE;
|
---|
4162 | a[3] -= d * iE * iE * iE;
|
---|
4163 | }
|
---|
4164 |
|
---|
4165 | //subtract constant value for masked regions at the edge of spectrum
|
---|
4166 | if (idxEdge[0] > 0) {
|
---|
4167 | int n = idxEdge[0];
|
---|
4168 | for (int i = 0; i < idxEdge[0]; ++i) {
|
---|
4169 | //--cubic extrapolate--
|
---|
4170 | //r1[i] = params[0] + params[1]*x1[i] + params[2]*x2[i] + params[3]*x3[i];
|
---|
4171 | //--linear extrapolate--
|
---|
4172 | //r1[i] = (r1[n+1] - r1[n])/(x1[n+1] - x1[n])*(x1[i] - x1[n]) + r1[n];
|
---|
4173 | //--constant--
|
---|
4174 | r1[i] = r1[n];
|
---|
4175 | }
|
---|
4176 | }
|
---|
4177 |
|
---|
4178 | if (idxEdge[nPiece] < nChan) {
|
---|
4179 | int n = idxEdge[nPiece]-1;
|
---|
4180 | for (int i = idxEdge[nPiece]; i < nChan; ++i) {
|
---|
4181 | //--cubic extrapolate--
|
---|
4182 | //int m = 4*(nPiece-1);
|
---|
4183 | //r1[i] = params[m] + params[m+1]*x1[i] + params[m+2]*x2[i] + params[m+3]*x3[i];
|
---|
4184 | //--linear extrapolate--
|
---|
4185 | //r1[i] = (r1[n-1] - r1[n])/(x1[n-1] - x1[n])*(x1[i] - x1[n]) + r1[n];
|
---|
4186 | //--constant--
|
---|
4187 | r1[i] = r1[n];
|
---|
4188 | }
|
---|
4189 | }
|
---|
4190 |
|
---|
4191 | for (int i = 0; i < nChan; ++i) {
|
---|
4192 | residual[i] = z1[i] - r1[i];
|
---|
4193 | }
|
---|
4194 |
|
---|
4195 | double stdDev = 0.0;
|
---|
4196 | for (int i = 0; i < nChan; ++i) {
|
---|
4197 | if (maskArray[i] == 0) continue;
|
---|
4198 | stdDev += residual[i]*residual[i];
|
---|
4199 | }
|
---|
4200 | stdDev = sqrt(stdDev/(double)nData);
|
---|
4201 | rms = (float)stdDev;
|
---|
4202 |
|
---|
4203 | if ((nClip == nIterClip) || (thresClip <= 0.0)) {
|
---|
4204 | break;
|
---|
4205 | } else {
|
---|
4206 |
|
---|
4207 | double thres = stdDev * thresClip;
|
---|
4208 | int newNData = 0;
|
---|
4209 | for (int i = 0; i < nChan; ++i) {
|
---|
4210 | if (abs(residual[i]) >= thres) {
|
---|
4211 | maskArray[i] = 0;
|
---|
4212 | finalMask[i] = false;
|
---|
4213 | }
|
---|
4214 | if (maskArray[i] > 0) {
|
---|
4215 | newNData++;
|
---|
4216 | }
|
---|
4217 | }
|
---|
4218 | if (newNData == nData) {
|
---|
4219 | break; //no more flag to add. iteration stops.
|
---|
4220 | } else {
|
---|
4221 | nData = newNData;
|
---|
4222 | }
|
---|
4223 |
|
---|
4224 | }
|
---|
4225 | }
|
---|
4226 |
|
---|
4227 | nClipped = initNData - nData;
|
---|
4228 |
|
---|
4229 | std::vector<float> result(nChan);
|
---|
4230 | if (getResidual) {
|
---|
4231 | for (int i = 0; i < nChan; ++i) {
|
---|
4232 | result[i] = (float)residual[i];
|
---|
4233 | }
|
---|
4234 | } else {
|
---|
4235 | for (int i = 0; i < nChan; ++i) {
|
---|
4236 | result[i] = (float)r1[i];
|
---|
4237 | }
|
---|
4238 | }
|
---|
4239 |
|
---|
4240 | return result;
|
---|
4241 | }
|
---|
4242 |
|
---|
4243 | std::vector<int> Scantable::selectWaveNumbers(const std::vector<int>& addNWaves,
|
---|
4244 | const std::vector<int>& rejectNWaves)
|
---|
4245 | {
|
---|
4246 | std::vector<bool> chanMask;
|
---|
4247 | std::string fftMethod;
|
---|
4248 | std::string fftThresh;
|
---|
4249 |
|
---|
4250 | return selectWaveNumbers(0, chanMask, false, fftMethod, fftThresh, addNWaves, rejectNWaves);
|
---|
4251 | }
|
---|
4252 |
|
---|
4253 | std::vector<int> Scantable::selectWaveNumbers(const int whichrow,
|
---|
4254 | const std::vector<bool>& chanMask,
|
---|
4255 | const bool applyFFT,
|
---|
4256 | const std::string& fftMethod,
|
---|
4257 | const std::string& fftThresh,
|
---|
4258 | const std::vector<int>& addNWaves,
|
---|
4259 | const std::vector<int>& rejectNWaves)
|
---|
4260 | {
|
---|
4261 | std::vector<int> nWaves;
|
---|
4262 | nWaves.clear();
|
---|
4263 |
|
---|
4264 | if (applyFFT) {
|
---|
4265 | string fftThAttr;
|
---|
4266 | float fftThSigma;
|
---|
4267 | int fftThTop;
|
---|
4268 | parseFFTThresholdInfo(fftThresh, fftThAttr, fftThSigma, fftThTop);
|
---|
4269 | doSelectWaveNumbers(whichrow, chanMask, fftMethod, fftThSigma, fftThTop, fftThAttr, nWaves);
|
---|
4270 | }
|
---|
4271 |
|
---|
4272 | addAuxWaveNumbers(whichrow, addNWaves, rejectNWaves, nWaves);
|
---|
4273 |
|
---|
4274 | return nWaves;
|
---|
4275 | }
|
---|
4276 |
|
---|
4277 | int Scantable::getIdxOfNchan(const int nChan, const std::vector<int>& nChanNos)
|
---|
4278 | {
|
---|
4279 | int idx = -1;
|
---|
4280 | for (uint i = 0; i < nChanNos.size(); ++i) {
|
---|
4281 | if (nChan == nChanNos[i]) {
|
---|
4282 | idx = i;
|
---|
4283 | break;
|
---|
4284 | }
|
---|
4285 | }
|
---|
4286 |
|
---|
4287 | if (idx < 0) {
|
---|
4288 | throw(AipsError("nChan not found in nChhanNos."));
|
---|
4289 | }
|
---|
4290 |
|
---|
4291 | return idx;
|
---|
4292 | }
|
---|
4293 |
|
---|
4294 | void Scantable::parseFFTInfo(const std::string& fftInfo, bool& applyFFT, std::string& fftMethod, std::string& fftThresh)
|
---|
4295 | {
|
---|
4296 | istringstream iss(fftInfo);
|
---|
4297 | std::string tmp;
|
---|
4298 | std::vector<string> res;
|
---|
4299 | while (getline(iss, tmp, ',')) {
|
---|
4300 | res.push_back(tmp);
|
---|
4301 | }
|
---|
4302 | if (res.size() < 3) {
|
---|
4303 | throw(AipsError("wrong value in 'fftinfo' parameter")) ;
|
---|
4304 | }
|
---|
4305 | applyFFT = (res[0] == "true");
|
---|
4306 | fftMethod = res[1];
|
---|
4307 | fftThresh = res[2];
|
---|
4308 | }
|
---|
4309 |
|
---|
4310 | void Scantable::parseFFTThresholdInfo(const std::string& fftThresh, std::string& fftThAttr, float& fftThSigma, int& fftThTop)
|
---|
4311 | {
|
---|
4312 | uInt idxSigma = fftThresh.find("sigma");
|
---|
4313 | uInt idxTop = fftThresh.find("top");
|
---|
4314 |
|
---|
4315 | if (idxSigma == fftThresh.size() - 5) {
|
---|
4316 | std::istringstream is(fftThresh.substr(0, fftThresh.size() - 5));
|
---|
4317 | is >> fftThSigma;
|
---|
4318 | fftThAttr = "sigma";
|
---|
4319 | } else if (idxTop == 0) {
|
---|
4320 | std::istringstream is(fftThresh.substr(3));
|
---|
4321 | is >> fftThTop;
|
---|
4322 | fftThAttr = "top";
|
---|
4323 | } else {
|
---|
4324 | bool isNumber = true;
|
---|
4325 | for (uInt i = 0; i < fftThresh.size()-1; ++i) {
|
---|
4326 | char ch = (fftThresh.substr(i, 1).c_str())[0];
|
---|
4327 | if (!(isdigit(ch) || (fftThresh.substr(i, 1) == "."))) {
|
---|
4328 | isNumber = false;
|
---|
4329 | break;
|
---|
4330 | }
|
---|
4331 | }
|
---|
4332 | if (isNumber) {
|
---|
4333 | std::istringstream is(fftThresh);
|
---|
4334 | is >> fftThSigma;
|
---|
4335 | fftThAttr = "sigma";
|
---|
4336 | } else {
|
---|
4337 | throw(AipsError("fftthresh has a wrong value"));
|
---|
4338 | }
|
---|
4339 | }
|
---|
4340 | }
|
---|
4341 |
|
---|
4342 | void Scantable::doSelectWaveNumbers(const int whichrow, const std::vector<bool>& chanMask, const std::string& fftMethod, const float fftThSigma, const int fftThTop, const std::string& fftThAttr, std::vector<int>& nWaves)
|
---|
4343 | {
|
---|
4344 | std::vector<float> fspec;
|
---|
4345 | if (fftMethod == "fft") {
|
---|
4346 | fspec = execFFT(whichrow, chanMask, false, true);
|
---|
4347 | //} else if (fftMethod == "lsp") {
|
---|
4348 | // fspec = lombScarglePeriodogram(whichrow);
|
---|
4349 | }
|
---|
4350 |
|
---|
4351 | if (fftThAttr == "sigma") {
|
---|
4352 | float mean = 0.0;
|
---|
4353 | float mean2 = 0.0;
|
---|
4354 | for (uInt i = 0; i < fspec.size(); ++i) {
|
---|
4355 | mean += fspec[i];
|
---|
4356 | mean2 += fspec[i]*fspec[i];
|
---|
4357 | }
|
---|
4358 | mean /= float(fspec.size());
|
---|
4359 | mean2 /= float(fspec.size());
|
---|
4360 | float thres = mean + fftThSigma * float(sqrt(mean2 - mean*mean));
|
---|
4361 |
|
---|
4362 | for (uInt i = 0; i < fspec.size(); ++i) {
|
---|
4363 | if (fspec[i] >= thres) {
|
---|
4364 | nWaves.push_back(i);
|
---|
4365 | }
|
---|
4366 | }
|
---|
4367 |
|
---|
4368 | } else if (fftThAttr == "top") {
|
---|
4369 | for (int i = 0; i < fftThTop; ++i) {
|
---|
4370 | float max = 0.0;
|
---|
4371 | int maxIdx = 0;
|
---|
4372 | for (uInt j = 0; j < fspec.size(); ++j) {
|
---|
4373 | if (fspec[j] > max) {
|
---|
4374 | max = fspec[j];
|
---|
4375 | maxIdx = j;
|
---|
4376 | }
|
---|
4377 | }
|
---|
4378 | nWaves.push_back(maxIdx);
|
---|
4379 | fspec[maxIdx] = 0.0;
|
---|
4380 | }
|
---|
4381 |
|
---|
4382 | }
|
---|
4383 |
|
---|
4384 | if (nWaves.size() > 1) {
|
---|
4385 | sort(nWaves.begin(), nWaves.end());
|
---|
4386 | }
|
---|
4387 | }
|
---|
4388 |
|
---|
4389 | void Scantable::addAuxWaveNumbers(const int whichrow, const std::vector<int>& addNWaves, const std::vector<int>& rejectNWaves, std::vector<int>& nWaves)
|
---|
4390 | {
|
---|
4391 | std::vector<int> tempAddNWaves, tempRejectNWaves;
|
---|
4392 | tempAddNWaves.clear();
|
---|
4393 | tempRejectNWaves.clear();
|
---|
4394 |
|
---|
4395 | for (uInt i = 0; i < addNWaves.size(); ++i) {
|
---|
4396 | tempAddNWaves.push_back(addNWaves[i]);
|
---|
4397 | }
|
---|
4398 | if ((tempAddNWaves.size() == 2) && (tempAddNWaves[1] == -999)) {
|
---|
4399 | setWaveNumberListUptoNyquistFreq(whichrow, tempAddNWaves);
|
---|
4400 | }
|
---|
4401 |
|
---|
4402 | for (uInt i = 0; i < rejectNWaves.size(); ++i) {
|
---|
4403 | tempRejectNWaves.push_back(rejectNWaves[i]);
|
---|
4404 | }
|
---|
4405 | if ((tempRejectNWaves.size() == 2) && (tempRejectNWaves[1] == -999)) {
|
---|
4406 | setWaveNumberListUptoNyquistFreq(whichrow, tempRejectNWaves);
|
---|
4407 | }
|
---|
4408 |
|
---|
4409 | for (uInt i = 0; i < tempAddNWaves.size(); ++i) {
|
---|
4410 | bool found = false;
|
---|
4411 | for (uInt j = 0; j < nWaves.size(); ++j) {
|
---|
4412 | if (nWaves[j] == tempAddNWaves[i]) {
|
---|
4413 | found = true;
|
---|
4414 | break;
|
---|
4415 | }
|
---|
4416 | }
|
---|
4417 | if (!found) nWaves.push_back(tempAddNWaves[i]);
|
---|
4418 | }
|
---|
4419 |
|
---|
4420 | for (uInt i = 0; i < tempRejectNWaves.size(); ++i) {
|
---|
4421 | for (std::vector<int>::iterator j = nWaves.begin(); j != nWaves.end(); ) {
|
---|
4422 | if (*j == tempRejectNWaves[i]) {
|
---|
4423 | j = nWaves.erase(j);
|
---|
4424 | } else {
|
---|
4425 | ++j;
|
---|
4426 | }
|
---|
4427 | }
|
---|
4428 | }
|
---|
4429 |
|
---|
4430 | if (nWaves.size() > 1) {
|
---|
4431 | sort(nWaves.begin(), nWaves.end());
|
---|
4432 | unique(nWaves.begin(), nWaves.end());
|
---|
4433 | }
|
---|
4434 | }
|
---|
4435 |
|
---|
4436 | void Scantable::setWaveNumberListUptoNyquistFreq(const int whichrow, std::vector<int>& nWaves)
|
---|
4437 | {
|
---|
4438 | int val = nWaves[0];
|
---|
4439 | int nyquistFreq = nchan(getIF(whichrow))/2+1;
|
---|
4440 | nWaves.clear();
|
---|
4441 | if (val > nyquistFreq) { // for safety, at least nWaves contains a constant; CAS-3759
|
---|
4442 | nWaves.push_back(0);
|
---|
4443 | }
|
---|
4444 | while (val <= nyquistFreq) {
|
---|
4445 | nWaves.push_back(val);
|
---|
4446 | val++;
|
---|
4447 | }
|
---|
4448 | }
|
---|
4449 |
|
---|
4450 | void Scantable::sinusoidBaseline(const std::vector<bool>& mask, const std::string& fftInfo,
|
---|
4451 | const std::vector<int>& addNWaves,
|
---|
4452 | const std::vector<int>& rejectNWaves,
|
---|
4453 | float thresClip, int nIterClip,
|
---|
4454 | bool getResidual,
|
---|
4455 | const std::string& progressInfo,
|
---|
4456 | const bool outLogger, const std::string& blfile,
|
---|
4457 | const std::string& bltable)
|
---|
4458 | {
|
---|
4459 | /****
|
---|
4460 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
4461 | ****/
|
---|
4462 |
|
---|
4463 | try {
|
---|
4464 | ofstream ofs;
|
---|
4465 | String coordInfo;
|
---|
4466 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
4467 | int minNRow;
|
---|
4468 | int nRow = nrow();
|
---|
4469 | std::vector<bool> chanMask, finalChanMask;
|
---|
4470 | float rms;
|
---|
4471 | bool outBaselineTable = (bltable != "");
|
---|
4472 | STBaselineTable bt = STBaselineTable(*this);
|
---|
4473 | Vector<Double> timeSecCol;
|
---|
4474 |
|
---|
4475 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
4476 | coordInfo, hasSameNchan,
|
---|
4477 | progressInfo, showProgress, minNRow,
|
---|
4478 | timeSecCol);
|
---|
4479 |
|
---|
4480 | bool applyFFT;
|
---|
4481 | std::string fftMethod, fftThresh;
|
---|
4482 | parseFFTInfo(fftInfo, applyFFT, fftMethod, fftThresh);
|
---|
4483 |
|
---|
4484 | std::vector<int> nWaves;
|
---|
4485 | std::vector<int> nChanNos;
|
---|
4486 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
4487 | if (!applyFFT) {
|
---|
4488 | nWaves = selectWaveNumbers(addNWaves, rejectNWaves);
|
---|
4489 | modelReservoir = getSinusoidModelReservoir(nWaves, nChanNos);
|
---|
4490 | }
|
---|
4491 |
|
---|
4492 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
4493 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
4494 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
4495 | std::vector<std::vector<double> > model;
|
---|
4496 | if (applyFFT) {
|
---|
4497 | nWaves = selectWaveNumbers(whichrow, chanMask, true, fftMethod, fftThresh,
|
---|
4498 | addNWaves, rejectNWaves);
|
---|
4499 | model = getSinusoidModel(nWaves, sp.size());
|
---|
4500 | } else {
|
---|
4501 | model = modelReservoir[getIdxOfNchan(sp.size(), nChanNos)];
|
---|
4502 | }
|
---|
4503 |
|
---|
4504 | std::vector<float> params;
|
---|
4505 | int nClipped = 0;
|
---|
4506 | std::vector<float> res = doLeastSquareFitting(sp, chanMask, model,
|
---|
4507 | params, rms, finalChanMask,
|
---|
4508 | nClipped, thresClip, nIterClip, getResidual);
|
---|
4509 |
|
---|
4510 | if (outBaselineTable) {
|
---|
4511 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
4512 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
4513 | true, STBaselineFunc::Sinusoid, nWaves, std::vector<float>(),
|
---|
4514 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
4515 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
4516 | } else {
|
---|
4517 | setSpectrum(res, whichrow);
|
---|
4518 | }
|
---|
4519 |
|
---|
4520 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
4521 | coordInfo, hasSameNchan, ofs, "sinusoidBaseline()",
|
---|
4522 | params, nClipped);
|
---|
4523 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
4524 | }
|
---|
4525 |
|
---|
4526 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
4527 |
|
---|
4528 | } catch (...) {
|
---|
4529 | throw;
|
---|
4530 | }
|
---|
4531 |
|
---|
4532 | /****
|
---|
4533 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
4534 | double elapse1 = TimeEnd - TimeStart;
|
---|
4535 | std::cout << "sinusoid-old : " << elapse1 << " (sec.)" << endl;
|
---|
4536 | ****/
|
---|
4537 | }
|
---|
4538 |
|
---|
4539 | void Scantable::autoSinusoidBaseline(const std::vector<bool>& mask, const std::string& fftInfo,
|
---|
4540 | const std::vector<int>& addNWaves,
|
---|
4541 | const std::vector<int>& rejectNWaves,
|
---|
4542 | float thresClip, int nIterClip,
|
---|
4543 | const std::vector<int>& edge,
|
---|
4544 | float threshold, int chanAvgLimit,
|
---|
4545 | bool getResidual,
|
---|
4546 | const std::string& progressInfo,
|
---|
4547 | const bool outLogger, const std::string& blfile,
|
---|
4548 | const std::string& bltable)
|
---|
4549 | {
|
---|
4550 | try {
|
---|
4551 | ofstream ofs;
|
---|
4552 | String coordInfo;
|
---|
4553 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
4554 | int minNRow;
|
---|
4555 | int nRow = nrow();
|
---|
4556 | std::vector<bool> chanMask, finalChanMask;
|
---|
4557 | float rms;
|
---|
4558 | bool outBaselineTable = (bltable != "");
|
---|
4559 | STBaselineTable bt = STBaselineTable(*this);
|
---|
4560 | Vector<Double> timeSecCol;
|
---|
4561 | STLineFinder lineFinder = STLineFinder();
|
---|
4562 |
|
---|
4563 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
4564 | coordInfo, hasSameNchan,
|
---|
4565 | progressInfo, showProgress, minNRow,
|
---|
4566 | timeSecCol);
|
---|
4567 |
|
---|
4568 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
4569 |
|
---|
4570 | bool applyFFT;
|
---|
4571 | string fftMethod, fftThresh;
|
---|
4572 | parseFFTInfo(fftInfo, applyFFT, fftMethod, fftThresh);
|
---|
4573 |
|
---|
4574 | std::vector<int> nWaves;
|
---|
4575 | std::vector<int> nChanNos;
|
---|
4576 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
4577 | if (!applyFFT) {
|
---|
4578 | nWaves = selectWaveNumbers(addNWaves, rejectNWaves);
|
---|
4579 | modelReservoir = getSinusoidModelReservoir(nWaves, nChanNos);
|
---|
4580 | }
|
---|
4581 |
|
---|
4582 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
4583 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
4584 | std::vector<int> currentEdge;
|
---|
4585 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
4586 | std::vector<std::vector<double> > model;
|
---|
4587 | if (applyFFT) {
|
---|
4588 | nWaves = selectWaveNumbers(whichrow, chanMask, true, fftMethod, fftThresh,
|
---|
4589 | addNWaves, rejectNWaves);
|
---|
4590 | model = getSinusoidModel(nWaves, sp.size());
|
---|
4591 | } else {
|
---|
4592 | model = modelReservoir[getIdxOfNchan(sp.size(), nChanNos)];
|
---|
4593 | }
|
---|
4594 |
|
---|
4595 | std::vector<float> params;
|
---|
4596 | int nClipped = 0;
|
---|
4597 | std::vector<float> res = doLeastSquareFitting(sp, chanMask, model,
|
---|
4598 | params, rms, finalChanMask,
|
---|
4599 | nClipped, thresClip, nIterClip, getResidual);
|
---|
4600 |
|
---|
4601 | if (outBaselineTable) {
|
---|
4602 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
4603 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
4604 | true, STBaselineFunc::Sinusoid, nWaves, std::vector<float>(),
|
---|
4605 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
4606 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
4607 | } else {
|
---|
4608 | setSpectrum(res, whichrow);
|
---|
4609 | }
|
---|
4610 |
|
---|
4611 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
4612 | coordInfo, hasSameNchan, ofs, "autoSinusoidBaseline()",
|
---|
4613 | params, nClipped);
|
---|
4614 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
4615 | }
|
---|
4616 |
|
---|
4617 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
4618 |
|
---|
4619 | } catch (...) {
|
---|
4620 | throw;
|
---|
4621 | }
|
---|
4622 | }
|
---|
4623 |
|
---|
4624 | std::vector<float> Scantable::doSinusoidFitting(const std::vector<float>& data,
|
---|
4625 | const std::vector<bool>& mask,
|
---|
4626 | const std::vector<int>& waveNumbers,
|
---|
4627 | std::vector<float>& params,
|
---|
4628 | float& rms,
|
---|
4629 | std::vector<bool>& finalmask,
|
---|
4630 | float clipth,
|
---|
4631 | int clipn)
|
---|
4632 | {
|
---|
4633 | int nClipped = 0;
|
---|
4634 | return doSinusoidFitting(data, mask, waveNumbers, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
4635 | }
|
---|
4636 |
|
---|
4637 | std::vector<float> Scantable::doSinusoidFitting(const std::vector<float>& data,
|
---|
4638 | const std::vector<bool>& mask,
|
---|
4639 | const std::vector<int>& waveNumbers,
|
---|
4640 | std::vector<float>& params,
|
---|
4641 | float& rms,
|
---|
4642 | std::vector<bool>& finalMask,
|
---|
4643 | int& nClipped,
|
---|
4644 | float thresClip,
|
---|
4645 | int nIterClip,
|
---|
4646 | bool getResidual)
|
---|
4647 | {
|
---|
4648 | return doLeastSquareFitting(data, mask,
|
---|
4649 | getSinusoidModel(waveNumbers, data.size()),
|
---|
4650 | params, rms, finalMask,
|
---|
4651 | nClipped, thresClip, nIterClip,
|
---|
4652 | getResidual);
|
---|
4653 | }
|
---|
4654 |
|
---|
4655 | std::vector<std::vector<std::vector<double> > > Scantable::getSinusoidModelReservoir(const std::vector<int>& waveNumbers,
|
---|
4656 | std::vector<int>& nChanNos)
|
---|
4657 | {
|
---|
4658 | std::vector<std::vector<std::vector<double> > > res;
|
---|
4659 | res.clear();
|
---|
4660 | nChanNos.clear();
|
---|
4661 |
|
---|
4662 | std::vector<uint> ifNos = getIFNos();
|
---|
4663 | for (uint i = 0; i < ifNos.size(); ++i) {
|
---|
4664 | int currNchan = nchan(ifNos[i]);
|
---|
4665 | bool hasDifferentNchan = (i == 0);
|
---|
4666 | for (uint j = 0; j < i; ++j) {
|
---|
4667 | if (currNchan != nchan(ifNos[j])) {
|
---|
4668 | hasDifferentNchan = true;
|
---|
4669 | break;
|
---|
4670 | }
|
---|
4671 | }
|
---|
4672 | if (hasDifferentNchan) {
|
---|
4673 | res.push_back(getSinusoidModel(waveNumbers, currNchan));
|
---|
4674 | nChanNos.push_back(currNchan);
|
---|
4675 | }
|
---|
4676 | }
|
---|
4677 |
|
---|
4678 | return res;
|
---|
4679 | }
|
---|
4680 |
|
---|
4681 | std::vector<std::vector<double> > Scantable::getSinusoidModel(const std::vector<int>& waveNumbers, int nchan)
|
---|
4682 | {
|
---|
4683 | // model : contains elemental values for computing the least-square matrix.
|
---|
4684 | // model.size() is nmodel and model[*].size() is nchan.
|
---|
4685 | // Each model element are as follows:
|
---|
4686 | // model[0] = {1.0, 1.0, 1.0, ..., 1.0},
|
---|
4687 | // model[2n-1] = {sin(nPI/L*x[0]), sin(nPI/L*x[1]), ..., sin(nPI/L*x[nchan])},
|
---|
4688 | // model[2n] = {cos(nPI/L*x[0]), cos(nPI/L*x[1]), ..., cos(nPI/L*x[nchan])},
|
---|
4689 | // where (1 <= n <= nMaxWavesInSW),
|
---|
4690 | // or,
|
---|
4691 | // model[2n-1] = {sin(wn[n]PI/L*x[0]), sin(wn[n]PI/L*x[1]), ..., sin(wn[n]PI/L*x[nchan])},
|
---|
4692 | // model[2n] = {cos(wn[n]PI/L*x[0]), cos(wn[n]PI/L*x[1]), ..., cos(wn[n]PI/L*x[nchan])},
|
---|
4693 | // where wn[n] denotes waveNumbers[n] (1 <= n <= waveNumbers.size()).
|
---|
4694 |
|
---|
4695 | std::vector<int> nWaves; // sorted and uniqued array of wave numbers
|
---|
4696 | nWaves.reserve(waveNumbers.size());
|
---|
4697 | copy(waveNumbers.begin(), waveNumbers.end(), back_inserter(nWaves));
|
---|
4698 | sort(nWaves.begin(), nWaves.end());
|
---|
4699 | std::vector<int>::iterator end_it = unique(nWaves.begin(), nWaves.end());
|
---|
4700 | nWaves.erase(end_it, nWaves.end());
|
---|
4701 |
|
---|
4702 | int minNWaves = nWaves[0];
|
---|
4703 | if (minNWaves < 0) {
|
---|
4704 | throw(AipsError("wave number must be positive or zero (i.e. constant)"));
|
---|
4705 | }
|
---|
4706 | bool hasConstantTerm = (minNWaves == 0);
|
---|
4707 | int nmodel = nWaves.size() * 2 - (hasConstantTerm ? 1 : 0); //number of parameters to solve.
|
---|
4708 |
|
---|
4709 | std::vector<std::vector<double> > model(nmodel, std::vector<double>(nchan));
|
---|
4710 |
|
---|
4711 | if (hasConstantTerm) {
|
---|
4712 | for (int j = 0; j < nchan; ++j) {
|
---|
4713 | model[0][j] = 1.0;
|
---|
4714 | }
|
---|
4715 | }
|
---|
4716 |
|
---|
4717 | const double PI = 6.0 * asin(0.5); // PI (= 3.141592653...)
|
---|
4718 | double stretch0 = 2.0*PI/(double)(nchan-1);
|
---|
4719 |
|
---|
4720 | for (uInt i = (hasConstantTerm ? 1 : 0); i < nWaves.size(); ++i) {
|
---|
4721 | int sidx = hasConstantTerm ? 2*i-1 : 2*i;
|
---|
4722 | int cidx = sidx + 1;
|
---|
4723 | double stretch = stretch0*(double)nWaves[i];
|
---|
4724 |
|
---|
4725 | for (int j = 0; j < nchan; ++j) {
|
---|
4726 | model[sidx][j] = sin(stretch*(double)j);
|
---|
4727 | model[cidx][j] = cos(stretch*(double)j);
|
---|
4728 | }
|
---|
4729 | }
|
---|
4730 |
|
---|
4731 | return model;
|
---|
4732 | }
|
---|
4733 |
|
---|
4734 | std::vector<bool> Scantable::getCompositeChanMask(int whichrow,
|
---|
4735 | const std::vector<bool>& inMask)
|
---|
4736 | {
|
---|
4737 | std::vector<bool> mask = getMask(whichrow);
|
---|
4738 | uInt maskSize = mask.size();
|
---|
4739 | if (inMask.size() != 0) {
|
---|
4740 | if (maskSize != inMask.size()) {
|
---|
4741 | throw(AipsError("mask sizes are not the same."));
|
---|
4742 | }
|
---|
4743 | for (uInt i = 0; i < maskSize; ++i) {
|
---|
4744 | mask[i] = mask[i] && inMask[i];
|
---|
4745 | }
|
---|
4746 | }
|
---|
4747 |
|
---|
4748 | return mask;
|
---|
4749 | }
|
---|
4750 |
|
---|
4751 | std::vector<bool> Scantable::getCompositeChanMask(int whichrow,
|
---|
4752 | const std::vector<bool>& inMask,
|
---|
4753 | const std::vector<int>& edge,
|
---|
4754 | std::vector<int>& currEdge,
|
---|
4755 | STLineFinder& lineFinder)
|
---|
4756 | {
|
---|
4757 | std::vector<uint> ifNos = getIFNos();
|
---|
4758 | if ((edge.size() > 2) && (edge.size() < ifNos.size()*2)) {
|
---|
4759 | throw(AipsError("Length of edge element info is less than that of IFs"));
|
---|
4760 | }
|
---|
4761 |
|
---|
4762 | uint idx = 0;
|
---|
4763 | if (edge.size() > 2) {
|
---|
4764 | int ifVal = getIF(whichrow);
|
---|
4765 | bool foundIF = false;
|
---|
4766 | for (uint i = 0; i < ifNos.size(); ++i) {
|
---|
4767 | if (ifVal == (int)ifNos[i]) {
|
---|
4768 | idx = 2*i;
|
---|
4769 | foundIF = true;
|
---|
4770 | break;
|
---|
4771 | }
|
---|
4772 | }
|
---|
4773 | if (!foundIF) {
|
---|
4774 | throw(AipsError("bad IF number"));
|
---|
4775 | }
|
---|
4776 | }
|
---|
4777 |
|
---|
4778 | currEdge.clear();
|
---|
4779 | currEdge.resize(2);
|
---|
4780 | currEdge[0] = edge[idx];
|
---|
4781 | currEdge[1] = edge[idx+1];
|
---|
4782 |
|
---|
4783 | lineFinder.setData(getSpectrum(whichrow));
|
---|
4784 | lineFinder.findLines(getCompositeChanMask(whichrow, inMask), currEdge, whichrow);
|
---|
4785 |
|
---|
4786 | return lineFinder.getMask();
|
---|
4787 | }
|
---|
4788 |
|
---|
4789 | /* for cspline. will be merged once cspline is available in fitter (2011/3/10 WK) */
|
---|
4790 | void Scantable::outputFittingResult(bool outLogger,
|
---|
4791 | bool outTextFile,
|
---|
4792 | bool csvFormat,
|
---|
4793 | const std::vector<bool>& chanMask,
|
---|
4794 | int whichrow,
|
---|
4795 | const casa::String& coordInfo,
|
---|
4796 | bool hasSameNchan,
|
---|
4797 | ofstream& ofs,
|
---|
4798 | const casa::String& funcName,
|
---|
4799 | const std::vector<int>& edge,
|
---|
4800 | const std::vector<float>& params,
|
---|
4801 | const int nClipped)
|
---|
4802 | {
|
---|
4803 | if (outLogger || outTextFile) {
|
---|
4804 | float rms = getRms(chanMask, whichrow);
|
---|
4805 | String masklist = getMaskRangeList(chanMask, whichrow, coordInfo, hasSameNchan);
|
---|
4806 | std::vector<bool> fixed;
|
---|
4807 | fixed.clear();
|
---|
4808 |
|
---|
4809 | if (outLogger) {
|
---|
4810 | LogIO ols(LogOrigin("Scantable", funcName, WHERE));
|
---|
4811 | ols << formatPiecewiseBaselineParams(edge, params, fixed, rms, nClipped,
|
---|
4812 | masklist, whichrow, false, csvFormat) << LogIO::POST ;
|
---|
4813 | }
|
---|
4814 | if (outTextFile) {
|
---|
4815 | ofs << formatPiecewiseBaselineParams(edge, params, fixed, rms, nClipped,
|
---|
4816 | masklist, whichrow, true, csvFormat) << flush;
|
---|
4817 | }
|
---|
4818 | }
|
---|
4819 | }
|
---|
4820 |
|
---|
4821 | /* for poly/chebyshev/sinusoid. */
|
---|
4822 | void Scantable::outputFittingResult(bool outLogger,
|
---|
4823 | bool outTextFile,
|
---|
4824 | bool csvFormat,
|
---|
4825 | const std::vector<bool>& chanMask,
|
---|
4826 | int whichrow,
|
---|
4827 | const casa::String& coordInfo,
|
---|
4828 | bool hasSameNchan,
|
---|
4829 | ofstream& ofs,
|
---|
4830 | const casa::String& funcName,
|
---|
4831 | const std::vector<float>& params,
|
---|
4832 | const int nClipped)
|
---|
4833 | {
|
---|
4834 | if (outLogger || outTextFile) {
|
---|
4835 | float rms = getRms(chanMask, whichrow);
|
---|
4836 | String masklist = getMaskRangeList(chanMask, whichrow, coordInfo, hasSameNchan);
|
---|
4837 | std::vector<bool> fixed;
|
---|
4838 | fixed.clear();
|
---|
4839 |
|
---|
4840 | if (outLogger) {
|
---|
4841 | LogIO ols(LogOrigin("Scantable", funcName, WHERE));
|
---|
4842 | ols << formatBaselineParams(params, fixed, rms, nClipped,
|
---|
4843 | masklist, whichrow, false, csvFormat) << LogIO::POST ;
|
---|
4844 | }
|
---|
4845 | if (outTextFile) {
|
---|
4846 | ofs << formatBaselineParams(params, fixed, rms, nClipped,
|
---|
4847 | masklist, whichrow, true, csvFormat) << flush;
|
---|
4848 | }
|
---|
4849 | }
|
---|
4850 | }
|
---|
4851 |
|
---|
4852 | void Scantable::parseProgressInfo(const std::string& progressInfo, bool& showProgress, int& minNRow)
|
---|
4853 | {
|
---|
4854 | int idxDelimiter = progressInfo.find(",");
|
---|
4855 | if (idxDelimiter < 0) {
|
---|
4856 | throw(AipsError("wrong value in 'showprogress' parameter")) ;
|
---|
4857 | }
|
---|
4858 | showProgress = (progressInfo.substr(0, idxDelimiter) == "true");
|
---|
4859 | std::istringstream is(progressInfo.substr(idxDelimiter+1));
|
---|
4860 | is >> minNRow;
|
---|
4861 | }
|
---|
4862 |
|
---|
4863 | void Scantable::showProgressOnTerminal(const int nProcessed, const int nTotal, const bool showProgress, const int nTotalThreshold)
|
---|
4864 | {
|
---|
4865 | if (showProgress && (nTotal >= nTotalThreshold)) {
|
---|
4866 | int nInterval = int(floor(double(nTotal)/100.0));
|
---|
4867 | if (nInterval == 0) nInterval++;
|
---|
4868 |
|
---|
4869 | if (nProcessed % nInterval == 0) {
|
---|
4870 | printf("\r"); //go to the head of line
|
---|
4871 | printf("\x1b[31m\x1b[1m"); //set red color, highlighted
|
---|
4872 | printf("[%3d%%]", (int)(100.0*(double(nProcessed+1))/(double(nTotal))) );
|
---|
4873 | printf("\x1b[39m\x1b[0m"); //set default attributes
|
---|
4874 | fflush(NULL);
|
---|
4875 | }
|
---|
4876 |
|
---|
4877 | if (nProcessed == nTotal - 1) {
|
---|
4878 | printf("\r\x1b[K"); //clear
|
---|
4879 | fflush(NULL);
|
---|
4880 | }
|
---|
4881 |
|
---|
4882 | }
|
---|
4883 | }
|
---|
4884 |
|
---|
4885 | std::vector<float> Scantable::execFFT(const int whichrow, const std::vector<bool>& inMask, bool getRealImag, bool getAmplitudeOnly)
|
---|
4886 | {
|
---|
4887 | std::vector<bool> mask = getMask(whichrow);
|
---|
4888 |
|
---|
4889 | if (inMask.size() > 0) {
|
---|
4890 | uInt maskSize = mask.size();
|
---|
4891 | if (maskSize != inMask.size()) {
|
---|
4892 | throw(AipsError("mask sizes are not the same."));
|
---|
4893 | }
|
---|
4894 | for (uInt i = 0; i < maskSize; ++i) {
|
---|
4895 | mask[i] = mask[i] && inMask[i];
|
---|
4896 | }
|
---|
4897 | }
|
---|
4898 |
|
---|
4899 | Vector<Float> spec = getSpectrum(whichrow);
|
---|
4900 | mathutil::doZeroOrderInterpolation(spec, mask);
|
---|
4901 |
|
---|
4902 | FFTServer<Float,Complex> ffts;
|
---|
4903 | Vector<Complex> fftres;
|
---|
4904 | ffts.fft0(fftres, spec);
|
---|
4905 |
|
---|
4906 | std::vector<float> res;
|
---|
4907 | float norm = float(2.0/double(spec.size()));
|
---|
4908 |
|
---|
4909 | if (getRealImag) {
|
---|
4910 | for (uInt i = 0; i < fftres.size(); ++i) {
|
---|
4911 | res.push_back(real(fftres[i])*norm);
|
---|
4912 | res.push_back(imag(fftres[i])*norm);
|
---|
4913 | }
|
---|
4914 | } else {
|
---|
4915 | for (uInt i = 0; i < fftres.size(); ++i) {
|
---|
4916 | res.push_back(abs(fftres[i])*norm);
|
---|
4917 | if (!getAmplitudeOnly) res.push_back(arg(fftres[i]));
|
---|
4918 | }
|
---|
4919 | }
|
---|
4920 |
|
---|
4921 | return res;
|
---|
4922 | }
|
---|
4923 |
|
---|
4924 |
|
---|
4925 | float Scantable::getRms(const std::vector<bool>& mask, int whichrow)
|
---|
4926 | {
|
---|
4927 | /****
|
---|
4928 | double ms1TimeStart, ms1TimeEnd;
|
---|
4929 | double elapse1 = 0.0;
|
---|
4930 | ms1TimeStart = mathutil::gettimeofday_sec();
|
---|
4931 | ****/
|
---|
4932 |
|
---|
4933 | Vector<Float> spec;
|
---|
4934 | specCol_.get(whichrow, spec);
|
---|
4935 |
|
---|
4936 | /****
|
---|
4937 | ms1TimeEnd = mathutil::gettimeofday_sec();
|
---|
4938 | elapse1 = ms1TimeEnd - ms1TimeStart;
|
---|
4939 | std::cout << "rm1 : " << elapse1 << " (sec.)" << endl;
|
---|
4940 | ****/
|
---|
4941 |
|
---|
4942 | return (float)doGetRms(mask, spec);
|
---|
4943 | }
|
---|
4944 |
|
---|
4945 | double Scantable::doGetRms(const std::vector<bool>& mask, const Vector<Float>& spec)
|
---|
4946 | {
|
---|
4947 | double mean = 0.0;
|
---|
4948 | double smean = 0.0;
|
---|
4949 | int n = 0;
|
---|
4950 | for (uInt i = 0; i < spec.nelements(); ++i) {
|
---|
4951 | if (mask[i]) {
|
---|
4952 | double val = (double)spec[i];
|
---|
4953 | mean += val;
|
---|
4954 | smean += val*val;
|
---|
4955 | n++;
|
---|
4956 | }
|
---|
4957 | }
|
---|
4958 |
|
---|
4959 | mean /= (double)n;
|
---|
4960 | smean /= (double)n;
|
---|
4961 |
|
---|
4962 | return sqrt(smean - mean*mean);
|
---|
4963 | }
|
---|
4964 |
|
---|
4965 | std::string Scantable::formatBaselineParamsHeader(int whichrow, const std::string& masklist, bool verbose, bool csvformat) const
|
---|
4966 | {
|
---|
4967 | if (verbose) {
|
---|
4968 | ostringstream oss;
|
---|
4969 |
|
---|
4970 | if (csvformat) {
|
---|
4971 | oss << getScan(whichrow) << ",";
|
---|
4972 | oss << getBeam(whichrow) << ",";
|
---|
4973 | oss << getIF(whichrow) << ",";
|
---|
4974 | oss << getPol(whichrow) << ",";
|
---|
4975 | oss << getCycle(whichrow) << ",";
|
---|
4976 | String commaReplacedMasklist = masklist;
|
---|
4977 | string::size_type pos = 0;
|
---|
4978 | while (pos = commaReplacedMasklist.find(","), pos != string::npos) {
|
---|
4979 | commaReplacedMasklist.replace(pos, 1, ";");
|
---|
4980 | pos++;
|
---|
4981 | }
|
---|
4982 | oss << commaReplacedMasklist << ",";
|
---|
4983 | } else {
|
---|
4984 | oss << " Scan[" << getScan(whichrow) << "]";
|
---|
4985 | oss << " Beam[" << getBeam(whichrow) << "]";
|
---|
4986 | oss << " IF[" << getIF(whichrow) << "]";
|
---|
4987 | oss << " Pol[" << getPol(whichrow) << "]";
|
---|
4988 | oss << " Cycle[" << getCycle(whichrow) << "]: " << endl;
|
---|
4989 | oss << "Fitter range = " << masklist << endl;
|
---|
4990 | oss << "Baseline parameters" << endl;
|
---|
4991 | }
|
---|
4992 | oss << flush;
|
---|
4993 |
|
---|
4994 | return String(oss);
|
---|
4995 | }
|
---|
4996 |
|
---|
4997 | return "";
|
---|
4998 | }
|
---|
4999 |
|
---|
5000 | std::string Scantable::formatBaselineParamsFooter(float rms, int nClipped, bool verbose, bool csvformat) const
|
---|
5001 | {
|
---|
5002 | if (verbose) {
|
---|
5003 | ostringstream oss;
|
---|
5004 |
|
---|
5005 | if (csvformat) {
|
---|
5006 | oss << rms << ",";
|
---|
5007 | if (nClipped >= 0) {
|
---|
5008 | oss << nClipped;
|
---|
5009 | }
|
---|
5010 | } else {
|
---|
5011 | oss << "Results of baseline fit" << endl;
|
---|
5012 | oss << " rms = " << setprecision(6) << rms << endl;
|
---|
5013 | if (nClipped >= 0) {
|
---|
5014 | oss << " Number of clipped channels = " << nClipped << endl;
|
---|
5015 | }
|
---|
5016 | for (int i = 0; i < 60; ++i) {
|
---|
5017 | oss << "-";
|
---|
5018 | }
|
---|
5019 | }
|
---|
5020 | oss << endl;
|
---|
5021 | oss << flush;
|
---|
5022 |
|
---|
5023 | return String(oss);
|
---|
5024 | }
|
---|
5025 |
|
---|
5026 | return "";
|
---|
5027 | }
|
---|
5028 |
|
---|
5029 | std::string Scantable::formatBaselineParams(const std::vector<float>& params,
|
---|
5030 | const std::vector<bool>& fixed,
|
---|
5031 | float rms,
|
---|
5032 | int nClipped,
|
---|
5033 | const std::string& masklist,
|
---|
5034 | int whichrow,
|
---|
5035 | bool verbose,
|
---|
5036 | bool csvformat,
|
---|
5037 | int start, int count,
|
---|
5038 | bool resetparamid) const
|
---|
5039 | {
|
---|
5040 | int nParam = (int)(params.size());
|
---|
5041 |
|
---|
5042 | if (nParam < 1) {
|
---|
5043 | return(" Not fitted");
|
---|
5044 | } else {
|
---|
5045 |
|
---|
5046 | ostringstream oss;
|
---|
5047 | oss << formatBaselineParamsHeader(whichrow, masklist, verbose, csvformat);
|
---|
5048 |
|
---|
5049 | if (start < 0) start = 0;
|
---|
5050 | if (count < 0) count = nParam;
|
---|
5051 | int end = start + count;
|
---|
5052 | if (end > nParam) end = nParam;
|
---|
5053 | int paramidoffset = (resetparamid) ? (-start) : 0;
|
---|
5054 |
|
---|
5055 | for (int i = start; i < end; ++i) {
|
---|
5056 | if (i > start) {
|
---|
5057 | oss << ",";
|
---|
5058 | }
|
---|
5059 | std::string sFix = ((fixed.size() > 0) && (fixed[i]) && verbose) ? "(fixed)" : "";
|
---|
5060 | if (csvformat) {
|
---|
5061 | oss << params[i] << sFix;
|
---|
5062 | } else {
|
---|
5063 | oss << " p" << (i+paramidoffset) << sFix << "= " << right << setw(13) << setprecision(6) << params[i];
|
---|
5064 | }
|
---|
5065 | }
|
---|
5066 |
|
---|
5067 | if (csvformat) {
|
---|
5068 | oss << ",";
|
---|
5069 | } else {
|
---|
5070 | oss << endl;
|
---|
5071 | }
|
---|
5072 | oss << formatBaselineParamsFooter(rms, nClipped, verbose, csvformat);
|
---|
5073 |
|
---|
5074 | return String(oss);
|
---|
5075 | }
|
---|
5076 |
|
---|
5077 | }
|
---|
5078 |
|
---|
5079 | std::string Scantable::formatPiecewiseBaselineParams(const std::vector<int>& ranges, const std::vector<float>& params, const std::vector<bool>& fixed, float rms, int nClipped, const std::string& masklist, int whichrow, bool verbose, bool csvformat) const
|
---|
5080 | {
|
---|
5081 | int nOutParam = (int)(params.size());
|
---|
5082 | int nPiece = (int)(ranges.size()) - 1;
|
---|
5083 |
|
---|
5084 | if (nOutParam < 1) {
|
---|
5085 | return(" Not fitted");
|
---|
5086 | } else if (nPiece < 0) {
|
---|
5087 | return formatBaselineParams(params, fixed, rms, nClipped, masklist, whichrow, verbose, csvformat);
|
---|
5088 | } else if (nPiece < 1) {
|
---|
5089 | return(" Bad count of the piece edge info");
|
---|
5090 | } else if (nOutParam % nPiece != 0) {
|
---|
5091 | return(" Bad count of the output baseline parameters");
|
---|
5092 | } else {
|
---|
5093 |
|
---|
5094 | int nParam = nOutParam / nPiece;
|
---|
5095 |
|
---|
5096 | ostringstream oss;
|
---|
5097 | oss << formatBaselineParamsHeader(whichrow, masklist, verbose, csvformat);
|
---|
5098 |
|
---|
5099 | if (csvformat) {
|
---|
5100 | for (int i = 0; i < nPiece; ++i) {
|
---|
5101 | oss << ranges[i] << "," << (ranges[i+1]-1) << ",";
|
---|
5102 | oss << formatBaselineParams(params, fixed, rms, 0, masklist, whichrow, false, csvformat, i*nParam, nParam, true);
|
---|
5103 | }
|
---|
5104 | } else {
|
---|
5105 | stringstream ss;
|
---|
5106 | ss << ranges[nPiece] << flush;
|
---|
5107 | int wRange = ss.str().size() * 2 + 5;
|
---|
5108 |
|
---|
5109 | for (int i = 0; i < nPiece; ++i) {
|
---|
5110 | ss.str("");
|
---|
5111 | ss << " [" << ranges[i] << "," << (ranges[i+1]-1) << "]";
|
---|
5112 | oss << left << setw(wRange) << ss.str();
|
---|
5113 | oss << formatBaselineParams(params, fixed, rms, 0, masklist, whichrow, false, csvformat, i*nParam, nParam, true);
|
---|
5114 | //oss << endl;
|
---|
5115 | }
|
---|
5116 | }
|
---|
5117 |
|
---|
5118 | oss << formatBaselineParamsFooter(rms, nClipped, verbose, csvformat);
|
---|
5119 |
|
---|
5120 | return String(oss);
|
---|
5121 | }
|
---|
5122 |
|
---|
5123 | }
|
---|
5124 |
|
---|
5125 | bool Scantable::hasSameNchanOverIFs()
|
---|
5126 | {
|
---|
5127 | int nIF = nif(-1);
|
---|
5128 | int nCh;
|
---|
5129 | int totalPositiveNChan = 0;
|
---|
5130 | int nPositiveNChan = 0;
|
---|
5131 |
|
---|
5132 | for (int i = 0; i < nIF; ++i) {
|
---|
5133 | nCh = nchan(i);
|
---|
5134 | if (nCh > 0) {
|
---|
5135 | totalPositiveNChan += nCh;
|
---|
5136 | nPositiveNChan++;
|
---|
5137 | }
|
---|
5138 | }
|
---|
5139 |
|
---|
5140 | return (totalPositiveNChan == (nPositiveNChan * nchan(0)));
|
---|
5141 | }
|
---|
5142 |
|
---|
5143 | std::string Scantable::getMaskRangeList(const std::vector<bool>& mask, int whichrow, const casa::String& coordInfo, bool hasSameNchan, bool verbose)
|
---|
5144 | {
|
---|
5145 | if (mask.size() <= 0) {
|
---|
5146 | throw(AipsError("The mask elements should be > 0"));
|
---|
5147 | }
|
---|
5148 | int IF = getIF(whichrow);
|
---|
5149 | if (mask.size() != (uInt)nchan(IF)) {
|
---|
5150 | throw(AipsError("Number of channels in scantable != number of mask elements"));
|
---|
5151 | }
|
---|
5152 |
|
---|
5153 | if (verbose) {
|
---|
5154 | LogIO logOs(LogOrigin("Scantable", "getMaskRangeList()", WHERE));
|
---|
5155 | logOs << LogIO::WARN << "The current mask window unit is " << coordInfo;
|
---|
5156 | if (!hasSameNchan) {
|
---|
5157 | logOs << endl << "This mask is only valid for IF=" << IF;
|
---|
5158 | }
|
---|
5159 | logOs << LogIO::POST;
|
---|
5160 | }
|
---|
5161 |
|
---|
5162 | std::vector<double> abcissa = getAbcissa(whichrow);
|
---|
5163 | std::vector<int> edge = getMaskEdgeIndices(mask);
|
---|
5164 |
|
---|
5165 | ostringstream oss;
|
---|
5166 | oss.setf(ios::fixed);
|
---|
5167 | oss << setprecision(1) << "[";
|
---|
5168 | for (uInt i = 0; i < edge.size(); i+=2) {
|
---|
5169 | if (i > 0) oss << ",";
|
---|
5170 | oss << "[" << (float)abcissa[edge[i]] << "," << (float)abcissa[edge[i+1]] << "]";
|
---|
5171 | }
|
---|
5172 | oss << "]" << flush;
|
---|
5173 |
|
---|
5174 | return String(oss);
|
---|
5175 | }
|
---|
5176 |
|
---|
5177 | std::vector<int> Scantable::getMaskEdgeIndices(const std::vector<bool>& mask)
|
---|
5178 | {
|
---|
5179 | if (mask.size() <= 0) {
|
---|
5180 | throw(AipsError("The mask elements should be > 0"));
|
---|
5181 | }
|
---|
5182 |
|
---|
5183 | std::vector<int> out, startIndices, endIndices;
|
---|
5184 | int maskSize = mask.size();
|
---|
5185 |
|
---|
5186 | startIndices.clear();
|
---|
5187 | endIndices.clear();
|
---|
5188 |
|
---|
5189 | if (mask[0]) {
|
---|
5190 | startIndices.push_back(0);
|
---|
5191 | }
|
---|
5192 | for (int i = 1; i < maskSize; ++i) {
|
---|
5193 | if ((!mask[i-1]) && mask[i]) {
|
---|
5194 | startIndices.push_back(i);
|
---|
5195 | } else if (mask[i-1] && (!mask[i])) {
|
---|
5196 | endIndices.push_back(i-1);
|
---|
5197 | }
|
---|
5198 | }
|
---|
5199 | if (mask[maskSize-1]) {
|
---|
5200 | endIndices.push_back(maskSize-1);
|
---|
5201 | }
|
---|
5202 |
|
---|
5203 | if (startIndices.size() != endIndices.size()) {
|
---|
5204 | throw(AipsError("Inconsistent Mask Size: bad data?"));
|
---|
5205 | }
|
---|
5206 | for (uInt i = 0; i < startIndices.size(); ++i) {
|
---|
5207 | if (startIndices[i] > endIndices[i]) {
|
---|
5208 | throw(AipsError("Mask start index > mask end index"));
|
---|
5209 | }
|
---|
5210 | }
|
---|
5211 |
|
---|
5212 | out.clear();
|
---|
5213 | for (uInt i = 0; i < startIndices.size(); ++i) {
|
---|
5214 | out.push_back(startIndices[i]);
|
---|
5215 | out.push_back(endIndices[i]);
|
---|
5216 | }
|
---|
5217 |
|
---|
5218 | return out;
|
---|
5219 | }
|
---|
5220 |
|
---|
5221 | void Scantable::setTsys(const std::vector<float>& newvals, int whichrow) {
|
---|
5222 | Vector<Float> tsys(newvals);
|
---|
5223 | if (whichrow > -1) {
|
---|
5224 | if (tsysCol_.shape(whichrow) != tsys.shape())
|
---|
5225 | throw(AipsError("Given Tsys values are not of the same shape"));
|
---|
5226 | tsysCol_.put(whichrow, tsys);
|
---|
5227 | } else {
|
---|
5228 | tsysCol_.fillColumn(tsys);
|
---|
5229 | }
|
---|
5230 | }
|
---|
5231 |
|
---|
5232 | vector<float> Scantable::getTsysSpectrum( int whichrow ) const
|
---|
5233 | {
|
---|
5234 | Vector<Float> tsys( tsysCol_(whichrow) ) ;
|
---|
5235 | vector<float> stlTsys ;
|
---|
5236 | tsys.tovector( stlTsys ) ;
|
---|
5237 | return stlTsys ;
|
---|
5238 | }
|
---|
5239 |
|
---|
5240 | vector<uint> Scantable::getMoleculeIdColumnData() const
|
---|
5241 | {
|
---|
5242 | Vector<uInt> molIds(mmolidCol_.getColumn());
|
---|
5243 | vector<uint> res;
|
---|
5244 | molIds.tovector(res);
|
---|
5245 | return res;
|
---|
5246 | }
|
---|
5247 |
|
---|
5248 | void Scantable::setMoleculeIdColumnData(const std::vector<uint>& molids)
|
---|
5249 | {
|
---|
5250 | Vector<uInt> molIds(molids);
|
---|
5251 | Vector<uInt> arr(mmolidCol_.getColumn());
|
---|
5252 | if ( molIds.nelements() != arr.nelements() )
|
---|
5253 | throw AipsError("The input data size must be the number of rows.");
|
---|
5254 | mmolidCol_.putColumn(molIds);
|
---|
5255 | }
|
---|
5256 |
|
---|
5257 |
|
---|
5258 | std::vector<uint> Scantable::getRootTableRowNumbers() const
|
---|
5259 | {
|
---|
5260 | Vector<uInt> rowIds(table_.rowNumbers());
|
---|
5261 | vector<uint> res;
|
---|
5262 | rowIds.tovector(res);
|
---|
5263 | return res;
|
---|
5264 | }
|
---|
5265 |
|
---|
5266 |
|
---|
5267 | void Scantable::dropXPol()
|
---|
5268 | {
|
---|
5269 | if (npol() <= 2) {
|
---|
5270 | return;
|
---|
5271 | }
|
---|
5272 | if (!selector_.empty()) {
|
---|
5273 | throw AipsError("Can only operate with empty selection");
|
---|
5274 | }
|
---|
5275 | std::string taql = "SELECT FROM $1 WHERE POLNO IN [0,1]";
|
---|
5276 | Table tab = tableCommand(taql, table_);
|
---|
5277 | table_ = tab;
|
---|
5278 | table_.rwKeywordSet().define("nPol", Int(2));
|
---|
5279 | originalTable_ = table_;
|
---|
5280 | attach();
|
---|
5281 | }
|
---|
5282 |
|
---|
5283 | }
|
---|
5284 | //namespace asap
|
---|