[805] | 1 | //
|
---|
| 2 | // C++ Implementation: Scantable
|
---|
| 3 | //
|
---|
| 4 | // Description:
|
---|
| 5 | //
|
---|
| 6 | //
|
---|
[2791] | 7 | // Author: Malte Marquarding <asap@atnf.csiro.au>, (C) 2005-2013
|
---|
[805] | 8 | //
|
---|
| 9 | // Copyright: See COPYING file that comes with this distribution
|
---|
| 10 | //
|
---|
| 11 | //
|
---|
[206] | 12 | #include <map>
|
---|
[2591] | 13 | #include <sys/time.h>
|
---|
[206] | 14 |
|
---|
[2186] | 15 | #include <atnf/PKSIO/SrcType.h>
|
---|
| 16 |
|
---|
[125] | 17 | #include <casa/aips.h>
|
---|
[2186] | 18 | #include <casa/iomanip.h>
|
---|
[80] | 19 | #include <casa/iostream.h>
|
---|
[2186] | 20 | #include <casa/OS/File.h>
|
---|
[805] | 21 | #include <casa/OS/Path.h>
|
---|
[2658] | 22 | #include <casa/Logging/LogIO.h>
|
---|
[80] | 23 | #include <casa/Arrays/Array.h>
|
---|
[2186] | 24 | #include <casa/Arrays/ArrayAccessor.h>
|
---|
| 25 | #include <casa/Arrays/ArrayLogical.h>
|
---|
[80] | 26 | #include <casa/Arrays/ArrayMath.h>
|
---|
| 27 | #include <casa/Arrays/MaskArrMath.h>
|
---|
[2186] | 28 | #include <casa/Arrays/Slice.h>
|
---|
[1325] | 29 | #include <casa/Arrays/Vector.h>
|
---|
[455] | 30 | #include <casa/Arrays/VectorSTLIterator.h>
|
---|
[418] | 31 | #include <casa/BasicMath/Math.h>
|
---|
[504] | 32 | #include <casa/BasicSL/Constants.h>
|
---|
[2186] | 33 | #include <casa/Containers/RecordField.h>
|
---|
| 34 | #include <casa/Logging/LogIO.h>
|
---|
[286] | 35 | #include <casa/Quanta/MVAngle.h>
|
---|
[2186] | 36 | #include <casa/Quanta/MVTime.h>
|
---|
[902] | 37 | #include <casa/Utilities/GenSort.h>
|
---|
[2] | 38 |
|
---|
[2186] | 39 | #include <coordinates/Coordinates/CoordinateUtil.h>
|
---|
[2] | 40 |
|
---|
[1325] | 41 | // needed to avoid error in .tcc
|
---|
| 42 | #include <measures/Measures/MCDirection.h>
|
---|
| 43 | //
|
---|
| 44 | #include <measures/Measures/MDirection.h>
|
---|
[2186] | 45 | #include <measures/Measures/MEpoch.h>
|
---|
[80] | 46 | #include <measures/Measures/MFrequency.h>
|
---|
[2186] | 47 | #include <measures/Measures/MeasRef.h>
|
---|
| 48 | #include <measures/Measures/MeasTable.h>
|
---|
| 49 | #include <measures/TableMeasures/ScalarMeasColumn.h>
|
---|
| 50 | #include <measures/TableMeasures/TableMeasDesc.h>
|
---|
[805] | 51 | #include <measures/TableMeasures/TableMeasRefDesc.h>
|
---|
| 52 | #include <measures/TableMeasures/TableMeasValueDesc.h>
|
---|
[2] | 53 |
|
---|
[2186] | 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"
|
---|
[2737] | 68 | #include "STBaselineTable.h"
|
---|
[2186] | 69 | #include "STLineFinder.h"
|
---|
| 70 | #include "STPolCircular.h"
|
---|
[896] | 71 | #include "STPolLinear.h"
|
---|
[913] | 72 | #include "STPolStokes.h"
|
---|
[2321] | 73 | #include "STUpgrade.h"
|
---|
[2666] | 74 | #include "STFitter.h"
|
---|
[2186] | 75 | #include "Scantable.h"
|
---|
[2] | 76 |
|
---|
[2462] | 77 | #define debug 1
|
---|
| 78 |
|
---|
[125] | 79 | using namespace casa;
|
---|
[2] | 80 |
|
---|
[805] | 81 | namespace asap {
|
---|
| 82 |
|
---|
[896] | 83 | std::map<std::string, STPol::STPolFactory *> Scantable::factories_;
|
---|
| 84 |
|
---|
| 85 | void Scantable::initFactories() {
|
---|
| 86 | if ( factories_.empty() ) {
|
---|
| 87 | Scantable::factories_["linear"] = &STPolLinear::myFactory;
|
---|
[1323] | 88 | Scantable::factories_["circular"] = &STPolCircular::myFactory;
|
---|
[913] | 89 | Scantable::factories_["stokes"] = &STPolStokes::myFactory;
|
---|
[896] | 90 | }
|
---|
| 91 | }
|
---|
| 92 |
|
---|
[805] | 93 | Scantable::Scantable(Table::TableType ttype) :
|
---|
[852] | 94 | type_(ttype)
|
---|
[206] | 95 | {
|
---|
[896] | 96 | initFactories();
|
---|
[805] | 97 | setupMainTable();
|
---|
[2346] | 98 | freqTable_ = STFrequencies(*this);
|
---|
| 99 | table_.rwKeywordSet().defineTable("FREQUENCIES", freqTable_.table());
|
---|
[852] | 100 | weatherTable_ = STWeather(*this);
|
---|
[805] | 101 | table_.rwKeywordSet().defineTable("WEATHER", weatherTable_.table());
|
---|
[852] | 102 | focusTable_ = STFocus(*this);
|
---|
[805] | 103 | table_.rwKeywordSet().defineTable("FOCUS", focusTable_.table());
|
---|
[852] | 104 | tcalTable_ = STTcal(*this);
|
---|
[805] | 105 | table_.rwKeywordSet().defineTable("TCAL", tcalTable_.table());
|
---|
[852] | 106 | moleculeTable_ = STMolecules(*this);
|
---|
[805] | 107 | table_.rwKeywordSet().defineTable("MOLECULES", moleculeTable_.table());
|
---|
[860] | 108 | historyTable_ = STHistory(*this);
|
---|
| 109 | table_.rwKeywordSet().defineTable("HISTORY", historyTable_.table());
|
---|
[959] | 110 | fitTable_ = STFit(*this);
|
---|
| 111 | table_.rwKeywordSet().defineTable("FIT", fitTable_.table());
|
---|
[1881] | 112 | table_.tableInfo().setType( "Scantable" ) ;
|
---|
[805] | 113 | originalTable_ = table_;
|
---|
[322] | 114 | attach();
|
---|
[18] | 115 | }
|
---|
[206] | 116 |
|
---|
[805] | 117 | Scantable::Scantable(const std::string& name, Table::TableType ttype) :
|
---|
[852] | 118 | type_(ttype)
|
---|
[206] | 119 | {
|
---|
[896] | 120 | initFactories();
|
---|
[1819] | 121 |
|
---|
[865] | 122 | Table tab(name, Table::Update);
|
---|
[1009] | 123 | uInt version = tab.keywordSet().asuInt("VERSION");
|
---|
[483] | 124 | if (version != version_) {
|
---|
[2321] | 125 | STUpgrade upgrader(version_);
|
---|
[2162] | 126 | LogIO os( LogOrigin( "Scantable" ) ) ;
|
---|
| 127 | os << LogIO::WARN
|
---|
[2321] | 128 | << name << " data format version " << version
|
---|
| 129 | << " is deprecated" << endl
|
---|
| 130 | << "Running upgrade."<< endl
|
---|
[2162] | 131 | << LogIO::POST ;
|
---|
[2321] | 132 | std::string outname = upgrader.upgrade(name);
|
---|
[2332] | 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 | }
|
---|
[483] | 139 | }
|
---|
[1009] | 140 | if ( type_ == Table::Memory ) {
|
---|
[852] | 141 | table_ = tab.copyToMemoryTable(generateName());
|
---|
[1009] | 142 | } else {
|
---|
[805] | 143 | table_ = tab;
|
---|
[1009] | 144 | }
|
---|
[1881] | 145 | table_.tableInfo().setType( "Scantable" ) ;
|
---|
[1009] | 146 |
|
---|
[859] | 147 | attachSubtables();
|
---|
[805] | 148 | originalTable_ = table_;
|
---|
[329] | 149 | attach();
|
---|
[2] | 150 | }
|
---|
[1819] | 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 | }
|
---|
[2] | 166 |
|
---|
[1819] | 167 | attachSubtables();
|
---|
| 168 | originalTable_ = table_;
|
---|
| 169 | attach();
|
---|
| 170 | }
|
---|
| 171 | */
|
---|
| 172 |
|
---|
[2658] | 173 | Scantable::Scantable( const Scantable& other, bool clear )
|
---|
[206] | 174 | {
|
---|
[805] | 175 | // with or without data
|
---|
[859] | 176 | String newname = String(generateName());
|
---|
[865] | 177 | type_ = other.table_.tableType();
|
---|
[859] | 178 | if ( other.table_.tableType() == Table::Memory ) {
|
---|
| 179 | if ( clear ) {
|
---|
| 180 | table_ = TableCopy::makeEmptyMemoryTable(newname,
|
---|
| 181 | other.table_, True);
|
---|
[2818] | 182 | } else {
|
---|
[859] | 183 | table_ = other.table_.copyToMemoryTable(newname);
|
---|
[2818] | 184 | }
|
---|
[16] | 185 | } else {
|
---|
[915] | 186 | other.table_.deepCopy(newname, Table::New, False,
|
---|
| 187 | other.table_.endianFormat(),
|
---|
[865] | 188 | Bool(clear));
|
---|
| 189 | table_ = Table(newname, Table::Update);
|
---|
| 190 | table_.markForDelete();
|
---|
| 191 | }
|
---|
[1881] | 192 | table_.tableInfo().setType( "Scantable" ) ;
|
---|
[1111] | 193 | /// @todo reindex SCANNO, recompute nbeam, nif, npol
|
---|
[2819] | 194 | if ( !clear ) copySubtables(other);
|
---|
[859] | 195 | attachSubtables();
|
---|
[805] | 196 | originalTable_ = table_;
|
---|
[322] | 197 | attach();
|
---|
[2] | 198 | }
|
---|
| 199 |
|
---|
[865] | 200 | void Scantable::copySubtables(const Scantable& other) {
|
---|
| 201 | Table t = table_.rwKeywordSet().asTable("FREQUENCIES");
|
---|
[2346] | 202 | TableCopy::copyRows(t, other.freqTable_.table());
|
---|
[865] | 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());
|
---|
[972] | 213 | t = table_.rwKeywordSet().asTable("FIT");
|
---|
| 214 | TableCopy::copyRows(t, other.fitTable_.table());
|
---|
[865] | 215 | }
|
---|
| 216 |
|
---|
[859] | 217 | void Scantable::attachSubtables()
|
---|
| 218 | {
|
---|
[2346] | 219 | freqTable_ = STFrequencies(table_);
|
---|
[859] | 220 | focusTable_ = STFocus(table_);
|
---|
| 221 | weatherTable_ = STWeather(table_);
|
---|
| 222 | tcalTable_ = STTcal(table_);
|
---|
| 223 | moleculeTable_ = STMolecules(table_);
|
---|
[860] | 224 | historyTable_ = STHistory(table_);
|
---|
[972] | 225 | fitTable_ = STFit(table_);
|
---|
[859] | 226 | }
|
---|
| 227 |
|
---|
[805] | 228 | Scantable::~Scantable()
|
---|
[206] | 229 | {
|
---|
[2] | 230 | }
|
---|
| 231 |
|
---|
[805] | 232 | void Scantable::setupMainTable()
|
---|
[206] | 233 | {
|
---|
[805] | 234 | TableDesc td("", "1", TableDesc::Scratch);
|
---|
| 235 | td.comment() = "An ASAP Scantable";
|
---|
[1009] | 236 | td.rwKeywordSet().define("VERSION", uInt(version_));
|
---|
[2] | 237 |
|
---|
[805] | 238 | // n Cycles
|
---|
| 239 | td.addColumn(ScalarColumnDesc<uInt>("SCANNO"));
|
---|
| 240 | // new index every nBeam x nIF x nPol
|
---|
| 241 | td.addColumn(ScalarColumnDesc<uInt>("CYCLENO"));
|
---|
[2] | 242 |
|
---|
[805] | 243 | td.addColumn(ScalarColumnDesc<uInt>("BEAMNO"));
|
---|
| 244 | td.addColumn(ScalarColumnDesc<uInt>("IFNO"));
|
---|
[972] | 245 | // linear, circular, stokes
|
---|
[805] | 246 | td.rwKeywordSet().define("POLTYPE", String("linear"));
|
---|
| 247 | td.addColumn(ScalarColumnDesc<uInt>("POLNO"));
|
---|
[138] | 248 |
|
---|
[805] | 249 | td.addColumn(ScalarColumnDesc<uInt>("FREQ_ID"));
|
---|
| 250 | td.addColumn(ScalarColumnDesc<uInt>("MOLECULE_ID"));
|
---|
[80] | 251 |
|
---|
[1819] | 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 |
|
---|
[805] | 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);
|
---|
[483] | 265 |
|
---|
[805] | 266 | td.addColumn(ScalarColumnDesc<Double>("INTERVAL"));
|
---|
| 267 |
|
---|
[2] | 268 | td.addColumn(ScalarColumnDesc<String>("SRCNAME"));
|
---|
[805] | 269 | // Type of source (on=0, off=1, other=-1)
|
---|
[1503] | 270 | ScalarColumnDesc<Int> stypeColumn("SRCTYPE");
|
---|
| 271 | stypeColumn.setDefault(Int(-1));
|
---|
| 272 | td.addColumn(stypeColumn);
|
---|
[805] | 273 | td.addColumn(ScalarColumnDesc<String>("FIELDNAME"));
|
---|
| 274 |
|
---|
| 275 | //The actual Data Vectors
|
---|
[2] | 276 | td.addColumn(ArrayColumnDesc<Float>("SPECTRA"));
|
---|
| 277 | td.addColumn(ArrayColumnDesc<uChar>("FLAGTRA"));
|
---|
[89] | 278 | td.addColumn(ArrayColumnDesc<Float>("TSYS"));
|
---|
[805] | 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);
|
---|
[987] | 287 | // a uder set table type e.g. GALCTIC, B1950 ...
|
---|
| 288 | td.rwKeywordSet().define("DIRECTIONREF", String("J2000"));
|
---|
[805] | 289 | // writing create the measure column
|
---|
| 290 | mdirCol.write(td);
|
---|
[923] | 291 | td.addColumn(ScalarColumnDesc<Float>("AZIMUTH"));
|
---|
| 292 | td.addColumn(ScalarColumnDesc<Float>("ELEVATION"));
|
---|
[1047] | 293 | td.addColumn(ScalarColumnDesc<Float>("OPACITY"));
|
---|
[105] | 294 |
|
---|
[805] | 295 | td.addColumn(ScalarColumnDesc<uInt>("TCAL_ID"));
|
---|
[972] | 296 | ScalarColumnDesc<Int> fitColumn("FIT_ID");
|
---|
[973] | 297 | fitColumn.setDefault(Int(-1));
|
---|
[972] | 298 | td.addColumn(fitColumn);
|
---|
[805] | 299 |
|
---|
| 300 | td.addColumn(ScalarColumnDesc<uInt>("FOCUS_ID"));
|
---|
| 301 | td.addColumn(ScalarColumnDesc<uInt>("WEATHER_ID"));
|
---|
| 302 |
|
---|
[999] | 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 |
|
---|
[805] | 309 | td.rwKeywordSet().define("OBSMODE", String(""));
|
---|
| 310 |
|
---|
[418] | 311 | // Now create Table SetUp from the description.
|
---|
[859] | 312 | SetupNewTable aNewTab(generateName(), td, Table::Scratch);
|
---|
[852] | 313 | table_ = Table(aNewTab, type_, 0);
|
---|
[805] | 314 | originalTable_ = table_;
|
---|
| 315 | }
|
---|
[418] | 316 |
|
---|
[805] | 317 | void Scantable::attach()
|
---|
[455] | 318 | {
|
---|
[805] | 319 | timeCol_.attach(table_, "TIME");
|
---|
| 320 | srcnCol_.attach(table_, "SRCNAME");
|
---|
[1068] | 321 | srctCol_.attach(table_, "SRCTYPE");
|
---|
[805] | 322 | specCol_.attach(table_, "SPECTRA");
|
---|
| 323 | flagsCol_.attach(table_, "FLAGTRA");
|
---|
[865] | 324 | tsysCol_.attach(table_, "TSYS");
|
---|
[805] | 325 | cycleCol_.attach(table_,"CYCLENO");
|
---|
| 326 | scanCol_.attach(table_, "SCANNO");
|
---|
| 327 | beamCol_.attach(table_, "BEAMNO");
|
---|
[847] | 328 | ifCol_.attach(table_, "IFNO");
|
---|
| 329 | polCol_.attach(table_, "POLNO");
|
---|
[805] | 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");
|
---|
[455] | 336 |
|
---|
[1730] | 337 | mweatheridCol_.attach(table_,"WEATHER_ID");
|
---|
[805] | 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");
|
---|
[1819] | 343 |
|
---|
| 344 | //Add auxiliary column for row-based flagging (CAS-1433 Wataru Kawasaki)
|
---|
| 345 | attachAuxColumnDef(flagrowCol_, "FLAGROW", 0);
|
---|
| 346 |
|
---|
[455] | 347 | }
|
---|
| 348 |
|
---|
[1819] | 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 |
|
---|
[901] | 403 | void Scantable::setHeader(const STHeader& sdh)
|
---|
[206] | 404 | {
|
---|
[18] | 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);
|
---|
[206] | 419 | table_.rwKeywordSet().define("FluxUnit", sdh.fluxunit);
|
---|
| 420 | table_.rwKeywordSet().define("Epoch", sdh.epoch);
|
---|
[905] | 421 | table_.rwKeywordSet().define("POLTYPE", sdh.poltype);
|
---|
[50] | 422 | }
|
---|
[21] | 423 |
|
---|
[901] | 424 | STHeader Scantable::getHeader() const
|
---|
[206] | 425 | {
|
---|
[901] | 426 | STHeader sdh;
|
---|
[21] | 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);
|
---|
[206] | 441 | table_.keywordSet().get("FluxUnit", sdh.fluxunit);
|
---|
| 442 | table_.keywordSet().get("Epoch", sdh.epoch);
|
---|
[905] | 443 | table_.keywordSet().get("POLTYPE", sdh.poltype);
|
---|
[21] | 444 | return sdh;
|
---|
[18] | 445 | }
|
---|
[805] | 446 |
|
---|
[1360] | 447 | void Scantable::setSourceType( int stype )
|
---|
[1068] | 448 | {
|
---|
| 449 | if ( stype < 0 || stype > 1 )
|
---|
| 450 | throw(AipsError("Illegal sourcetype."));
|
---|
| 451 | TableVector<Int> tabvec(table_, "SRCTYPE");
|
---|
| 452 | tabvec = Int(stype);
|
---|
| 453 | }
|
---|
| 454 |
|
---|
[2818] | 455 | void Scantable::setSourceName( const std::string& name )
|
---|
| 456 | {
|
---|
| 457 | TableVector<String> tabvec(table_, "SRCNAME");
|
---|
| 458 | tabvec = name;
|
---|
| 459 | }
|
---|
| 460 |
|
---|
[845] | 461 | bool Scantable::conformant( const Scantable& other )
|
---|
| 462 | {
|
---|
| 463 | return this->getHeader().conformant(other.getHeader());
|
---|
| 464 | }
|
---|
| 465 |
|
---|
| 466 |
|
---|
[50] | 467 |
|
---|
[805] | 468 | std::string Scantable::formatSec(Double x) const
|
---|
[206] | 469 | {
|
---|
[105] | 470 | Double xcop = x;
|
---|
| 471 | MVTime mvt(xcop/24./3600.); // make days
|
---|
[365] | 472 |
|
---|
[105] | 473 | if (x < 59.95)
|
---|
[281] | 474 | return String(" ") + mvt.string(MVTime::TIME_CLEAN_NO_HM, 7)+"s";
|
---|
[745] | 475 | else if (x < 3599.95)
|
---|
[281] | 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);
|
---|
[745] | 482 | }
|
---|
[105] | 483 | };
|
---|
| 484 |
|
---|
[805] | 485 | std::string Scantable::formatDirection(const MDirection& md) const
|
---|
[281] | 486 | {
|
---|
| 487 | Vector<Double> t = md.getAngle(Unit(String("rad"))).getValue();
|
---|
| 488 | Int prec = 7;
|
---|
| 489 |
|
---|
[2575] | 490 | String ref = md.getRefString();
|
---|
[281] | 491 | MVAngle mvLon(t[0]);
|
---|
| 492 | String sLon = mvLon.string(MVAngle::TIME,prec);
|
---|
[987] | 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 | }
|
---|
[281] | 498 | MVAngle mvLat(t[1]);
|
---|
| 499 | String sLat = mvLat.string(MVAngle::ANGLE+MVAngle::DIG2,prec);
|
---|
[2575] | 500 | return ref + String(" ") + sLon + String(" ") + sLat;
|
---|
[281] | 501 | }
|
---|
| 502 |
|
---|
| 503 |
|
---|
[805] | 504 | std::string Scantable::getFluxUnit() const
|
---|
[206] | 505 | {
|
---|
[847] | 506 | return table_.keywordSet().asString("FluxUnit");
|
---|
[206] | 507 | }
|
---|
| 508 |
|
---|
[805] | 509 | void Scantable::setFluxUnit(const std::string& unit)
|
---|
[218] | 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 |
|
---|
[805] | 520 | void Scantable::setInstrument(const std::string& name)
|
---|
[236] | 521 | {
|
---|
[805] | 522 | bool throwIt = true;
|
---|
[996] | 523 | // create an Instrument to see if this is valid
|
---|
| 524 | STAttr::convertInstrument(name, throwIt);
|
---|
[236] | 525 | String nameU(name);
|
---|
| 526 | nameU.upcase();
|
---|
| 527 | table_.rwKeywordSet().define(String("AntennaName"), nameU);
|
---|
| 528 | }
|
---|
| 529 |
|
---|
[1189] | 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 |
|
---|
[1743] | 539 | MPosition Scantable::getAntennaPosition() const
|
---|
[805] | 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 | }
|
---|
[281] | 546 |
|
---|
[805] | 547 | void Scantable::makePersistent(const std::string& filename)
|
---|
| 548 | {
|
---|
| 549 | String inname(filename);
|
---|
| 550 | Path path(inname);
|
---|
[1111] | 551 | /// @todo reindex SCANNO, recompute nbeam, nif, npol
|
---|
[805] | 552 | inname = path.expandedName();
|
---|
[2030] | 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 | // }
|
---|
[805] | 567 | }
|
---|
| 568 |
|
---|
[837] | 569 | int Scantable::nbeam( int scanno ) const
|
---|
[805] | 570 | {
|
---|
| 571 | if ( scanno < 0 ) {
|
---|
| 572 | Int n;
|
---|
| 573 | table_.keywordSet().get("nBeam",n);
|
---|
| 574 | return int(n);
|
---|
[105] | 575 | } else {
|
---|
[805] | 576 | // take the first POLNO,IFNO,CYCLENO as nbeam shouldn't vary with these
|
---|
[888] | 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");
|
---|
[805] | 584 | return int(v.nelements());
|
---|
[105] | 585 | }
|
---|
[805] | 586 | return 0;
|
---|
| 587 | }
|
---|
[455] | 588 |
|
---|
[837] | 589 | int Scantable::nif( int scanno ) const
|
---|
[805] | 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
|
---|
[888] | 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");
|
---|
[805] | 605 | return int(v.nelements());
|
---|
[2] | 606 | }
|
---|
[805] | 607 | return 0;
|
---|
| 608 | }
|
---|
[321] | 609 |
|
---|
[837] | 610 | int Scantable::npol( int scanno ) const
|
---|
[805] | 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
|
---|
[888] | 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");
|
---|
[805] | 626 | return int(v.nelements());
|
---|
[321] | 627 | }
|
---|
[805] | 628 | return 0;
|
---|
[2] | 629 | }
|
---|
[805] | 630 |
|
---|
[845] | 631 | int Scantable::ncycle( int scanno ) const
|
---|
[206] | 632 | {
|
---|
[805] | 633 | if ( scanno < 0 ) {
|
---|
[837] | 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;
|
---|
[902] | 641 | ++it;
|
---|
[837] | 642 | }
|
---|
| 643 | return n;
|
---|
[805] | 644 | } else {
|
---|
[888] | 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());
|
---|
[805] | 653 | }
|
---|
| 654 | return 0;
|
---|
[18] | 655 | }
|
---|
[455] | 656 |
|
---|
| 657 |
|
---|
[845] | 658 | int Scantable::nrow( int scanno ) const
|
---|
[805] | 659 | {
|
---|
[845] | 660 | return int(table_.nrow());
|
---|
| 661 | }
|
---|
| 662 |
|
---|
| 663 | int Scantable::nchan( int ifno ) const
|
---|
| 664 | {
|
---|
| 665 | if ( ifno < 0 ) {
|
---|
[805] | 666 | Int n;
|
---|
| 667 | table_.keywordSet().get("nChan",n);
|
---|
| 668 | return int(n);
|
---|
| 669 | } else {
|
---|
[1360] | 670 | // take the first SCANNO,POLNO,BEAMNO,CYCLENO as nbeam shouldn't
|
---|
| 671 | // vary with these
|
---|
[2244] | 672 | Table t = table_(table_.col("IFNO") == ifno, 1);
|
---|
[888] | 673 | if ( t.nrow() == 0 ) return 0;
|
---|
| 674 | ROArrayColumn<Float> v(t, "SPECTRA");
|
---|
[923] | 675 | return v.shape(0)(0);
|
---|
[805] | 676 | }
|
---|
| 677 | return 0;
|
---|
[18] | 678 | }
|
---|
[455] | 679 |
|
---|
[1111] | 680 | int Scantable::nscan() const {
|
---|
| 681 | Vector<uInt> scannos(scanCol_.getColumn());
|
---|
[1148] | 682 | uInt nout = genSort( scannos, Sort::Ascending,
|
---|
[1111] | 683 | Sort::QuickSort|Sort::NoDuplicates );
|
---|
| 684 | return int(nout);
|
---|
| 685 | }
|
---|
| 686 |
|
---|
[923] | 687 | int Scantable::getChannels(int whichrow) const
|
---|
| 688 | {
|
---|
| 689 | return specCol_.shape(whichrow)(0);
|
---|
| 690 | }
|
---|
[847] | 691 |
|
---|
| 692 | int Scantable::getBeam(int whichrow) const
|
---|
| 693 | {
|
---|
| 694 | return beamCol_(whichrow);
|
---|
| 695 | }
|
---|
| 696 |
|
---|
[1694] | 697 | std::vector<uint> Scantable::getNumbers(const ScalarColumn<uInt>& col) const
|
---|
[1111] | 698 | {
|
---|
| 699 | Vector<uInt> nos(col.getColumn());
|
---|
[1148] | 700 | uInt n = genSort( nos, Sort::Ascending, Sort::QuickSort|Sort::NoDuplicates );
|
---|
| 701 | nos.resize(n, True);
|
---|
[1111] | 702 | std::vector<uint> stlout;
|
---|
| 703 | nos.tovector(stlout);
|
---|
| 704 | return stlout;
|
---|
| 705 | }
|
---|
| 706 |
|
---|
[847] | 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 |
|
---|
[805] | 717 | std::string Scantable::formatTime(const MEpoch& me, bool showdate) const
|
---|
| 718 | {
|
---|
[1947] | 719 | return formatTime(me, showdate, 0);
|
---|
| 720 | }
|
---|
| 721 |
|
---|
| 722 | std::string Scantable::formatTime(const MEpoch& me, bool showdate, uInt prec) const
|
---|
| 723 | {
|
---|
[805] | 724 | MVTime mvt(me.getValue());
|
---|
| 725 | if (showdate)
|
---|
[1947] | 726 | //mvt.setFormat(MVTime::YMD);
|
---|
| 727 | mvt.setFormat(MVTime::YMD, prec);
|
---|
[805] | 728 | else
|
---|
[1947] | 729 | //mvt.setFormat(MVTime::TIME);
|
---|
| 730 | mvt.setFormat(MVTime::TIME, prec);
|
---|
[805] | 731 | ostringstream oss;
|
---|
| 732 | oss << mvt;
|
---|
| 733 | return String(oss);
|
---|
| 734 | }
|
---|
[488] | 735 |
|
---|
[805] | 736 | void Scantable::calculateAZEL()
|
---|
[2658] | 737 | {
|
---|
| 738 | LogIO os( LogOrigin( "Scantable", "calculateAZEL()", WHERE ) ) ;
|
---|
[805] | 739 | MPosition mp = getAntennaPosition();
|
---|
| 740 | MEpoch::ROScalarColumn timeCol(table_, "TIME");
|
---|
| 741 | ostringstream oss;
|
---|
[2658] | 742 | oss << mp;
|
---|
| 743 | os << "Computed azimuth/elevation using " << endl
|
---|
| 744 | << String(oss) << endl;
|
---|
[996] | 745 | for (Int i=0; i<nrow(); ++i) {
|
---|
[805] | 746 | MEpoch me = timeCol(i);
|
---|
[987] | 747 | MDirection md = getDirection(i);
|
---|
[2658] | 748 | os << " Time: " << formatTime(me,False)
|
---|
| 749 | << " Direction: " << formatDirection(md)
|
---|
[805] | 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();
|
---|
[923] | 756 | azCol_.put(i,Float(azel[0]));
|
---|
| 757 | elCol_.put(i,Float(azel[1]));
|
---|
[2658] | 758 | os << "azel: " << azel[0]/C::pi*180.0 << " "
|
---|
| 759 | << azel[1]/C::pi*180.0 << " (deg)" << LogIO::POST;
|
---|
[16] | 760 | }
|
---|
[805] | 761 | }
|
---|
[89] | 762 |
|
---|
[1819] | 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);
|
---|
[2348] | 790 | uInt nchannel = spcs.nelements();
|
---|
[1819] | 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 |
|
---|
[1994] | 815 |
|
---|
| 816 | void Scantable::flag( int whichrow, const std::vector<bool>& msk, bool unflag ) {
|
---|
[1333] | 817 | std::vector<bool>::const_iterator it;
|
---|
| 818 | uInt ntrue = 0;
|
---|
[1994] | 819 | if (whichrow >= int(table_.nrow()) ) {
|
---|
| 820 | throw(AipsError("Invalid row number"));
|
---|
| 821 | }
|
---|
[1333] | 822 | for (it = msk.begin(); it != msk.end(); ++it) {
|
---|
| 823 | if ( *it ) {
|
---|
| 824 | ntrue++;
|
---|
| 825 | }
|
---|
| 826 | }
|
---|
[1994] | 827 | //if ( selector_.empty() && (msk.size() == 0 || msk.size() == ntrue) )
|
---|
| 828 | if ( whichrow == -1 && !unflag && selector_.empty() && (msk.size() == 0 || msk.size() == ntrue) )
|
---|
[1000] | 829 | throw(AipsError("Trying to flag whole scantable."));
|
---|
[1994] | 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 {
|
---|
[1000] | 837 | for ( uInt i=0; i<table_.nrow(); ++i) {
|
---|
[1994] | 838 | applyChanFlag(i, msk, userflag);
|
---|
[1000] | 839 | }
|
---|
[1994] | 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);
|
---|
[1000] | 852 | return;
|
---|
| 853 | }
|
---|
[2348] | 854 | if ( int(msk.size()) != nchan( getIF(whichrow) ) ) {
|
---|
[1000] | 855 | throw(AipsError("Mask has incorrect number of channels."));
|
---|
| 856 | }
|
---|
[1994] | 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;
|
---|
[1000] | 866 | }
|
---|
[1994] | 867 | ++j;
|
---|
[1000] | 868 | }
|
---|
[1994] | 869 | flagsCol_.put(whichrow, flgs);
|
---|
[865] | 870 | }
|
---|
| 871 |
|
---|
[1819] | 872 | void Scantable::flagRow(const std::vector<uInt>& rows, bool unflag)
|
---|
| 873 | {
|
---|
[2683] | 874 | if (selector_.empty() && (rows.size() == table_.nrow()) && !unflag)
|
---|
[1819] | 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 |
|
---|
[805] | 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 | }
|
---|
[89] | 894 |
|
---|
[896] | 895 | std::vector<float> Scantable::getSpectrum( int whichrow,
|
---|
[902] | 896 | const std::string& poltype ) const
|
---|
[805] | 897 | {
|
---|
[2658] | 898 | LogIO os( LogOrigin( "Scantable", "getSpectrum()", WHERE ) ) ;
|
---|
| 899 |
|
---|
[905] | 900 | String ptype = poltype;
|
---|
| 901 | if (poltype == "" ) ptype = getPolType();
|
---|
[902] | 902 | if ( whichrow < 0 || whichrow >= nrow() )
|
---|
| 903 | throw(AipsError("Illegal row number."));
|
---|
[896] | 904 | std::vector<float> out;
|
---|
[805] | 905 | Vector<Float> arr;
|
---|
[896] | 906 | uInt requestedpol = polCol_(whichrow);
|
---|
| 907 | String basetype = getPolType();
|
---|
[905] | 908 | if ( ptype == basetype ) {
|
---|
[896] | 909 | specCol_.get(whichrow, arr);
|
---|
| 910 | } else {
|
---|
[1598] | 911 | CountedPtr<STPol> stpol(STPol::getPolClass(Scantable::factories_,
|
---|
[1586] | 912 | basetype));
|
---|
[1334] | 913 | uInt row = uInt(whichrow);
|
---|
| 914 | stpol->setSpectra(getPolMatrix(row));
|
---|
[2047] | 915 | Float fang,fhand;
|
---|
[1586] | 916 | fang = focusTable_.getTotalAngle(mfocusidCol_(row));
|
---|
[1334] | 917 | fhand = focusTable_.getFeedHand(mfocusidCol_(row));
|
---|
[1586] | 918 | stpol->setPhaseCorrections(fang, fhand);
|
---|
[1334] | 919 | arr = stpol->getSpectrum(requestedpol, ptype);
|
---|
[896] | 920 | }
|
---|
[902] | 921 | if ( arr.nelements() == 0 )
|
---|
[2658] | 922 |
|
---|
| 923 | os << "Not enough polarisations present to do the conversion."
|
---|
| 924 | << LogIO::POST;
|
---|
[805] | 925 | arr.tovector(out);
|
---|
| 926 | return out;
|
---|
[89] | 927 | }
|
---|
[212] | 928 |
|
---|
[1360] | 929 | void Scantable::setSpectrum( const std::vector<float>& spec,
|
---|
[884] | 930 | int whichrow )
|
---|
| 931 | {
|
---|
| 932 | Vector<Float> spectrum(spec);
|
---|
| 933 | Vector<Float> arr;
|
---|
| 934 | specCol_.get(whichrow, arr);
|
---|
| 935 | if ( spectrum.nelements() != arr.nelements() )
|
---|
[896] | 936 | throw AipsError("The spectrum has incorrect number of channels.");
|
---|
[884] | 937 | specCol_.put(whichrow, spectrum);
|
---|
| 938 | }
|
---|
| 939 |
|
---|
| 940 |
|
---|
[805] | 941 | String Scantable::generateName()
|
---|
[745] | 942 | {
|
---|
[805] | 943 | return (File::newUniqueName("./","temp")).baseName();
|
---|
[212] | 944 | }
|
---|
| 945 |
|
---|
[805] | 946 | const casa::Table& Scantable::table( ) const
|
---|
[212] | 947 | {
|
---|
[805] | 948 | return table_;
|
---|
[212] | 949 | }
|
---|
| 950 |
|
---|
[805] | 951 | casa::Table& Scantable::table( )
|
---|
[386] | 952 | {
|
---|
[805] | 953 | return table_;
|
---|
[386] | 954 | }
|
---|
| 955 |
|
---|
[896] | 956 | std::string Scantable::getPolType() const
|
---|
| 957 | {
|
---|
| 958 | return table_.keywordSet().asString("POLTYPE");
|
---|
| 959 | }
|
---|
| 960 |
|
---|
[805] | 961 | void Scantable::unsetSelection()
|
---|
[380] | 962 | {
|
---|
[805] | 963 | table_ = originalTable_;
|
---|
[847] | 964 | attach();
|
---|
[805] | 965 | selector_.reset();
|
---|
[380] | 966 | }
|
---|
[386] | 967 |
|
---|
[805] | 968 | void Scantable::setSelection( const STSelector& selection )
|
---|
[430] | 969 | {
|
---|
[805] | 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;
|
---|
[847] | 975 | attach();
|
---|
[2084] | 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())) ;
|
---|
[805] | 990 | selector_ = selection;
|
---|
[430] | 991 | }
|
---|
| 992 |
|
---|
[2111] | 993 |
|
---|
[2163] | 994 | std::string Scantable::headerSummary()
|
---|
[447] | 995 | {
|
---|
[805] | 996 | // Format header info
|
---|
[2111] | 997 | // STHeader sdh;
|
---|
| 998 | // sdh = getHeader();
|
---|
| 999 | // sdh.print();
|
---|
[805] | 1000 | ostringstream oss;
|
---|
| 1001 | oss.flags(std::ios_base::left);
|
---|
[2290] | 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
|
---|
[805] | 1020 | oss << setw(15) << "Beams:" << setw(4) << nbeam() << endl
|
---|
| 1021 | << setw(15) << "IFs:" << setw(4) << nif() << endl
|
---|
[896] | 1022 | << setw(15) << "Polarisations:" << setw(4) << npol()
|
---|
| 1023 | << "(" << getPolType() << ")" << endl
|
---|
[1694] | 1024 | << setw(15) << "Channels:" << nchan() << endl;
|
---|
[2290] | 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
|
---|
[2813] | 1123 | //Vector<uInt> freqids;
|
---|
| 1124 | //Vector<uInt> molids;
|
---|
[2290] | 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
|
---|
[2813] | 1166 | Vector<uInt> molids(getNumbers(molIdCol));
|
---|
[2290] | 1167 | molids.shape(nmol);
|
---|
| 1168 |
|
---|
[2813] | 1169 | Vector<uInt> freqids(getNumbers(freqIdCol));
|
---|
[2290] | 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);
|
---|
[2531] | 1288 | if (tmplen >= 1) {
|
---|
[2290] | 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) << ""
|
---|
[2531] | 1294 | << std::left << polNos[i];
|
---|
| 1295 | if (tmplen > 1) {
|
---|
| 1296 | oss << " (" << tmplen << " chains)";
|
---|
| 1297 | }
|
---|
| 1298 | oss << endl;
|
---|
[2290] | 1299 | }
|
---|
[2531] | 1300 |
|
---|
[2290] | 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;
|
---|
[805] | 1345 | String tmp;
|
---|
[860] | 1346 | oss << setw(15) << "Observer:"
|
---|
| 1347 | << table_.keywordSet().asString("Observer") << endl;
|
---|
[805] | 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;
|
---|
[1819] | 1357 | int nid = moleculeTable_.nrow();
|
---|
| 1358 | Bool firstline = True;
|
---|
[805] | 1359 | oss << setw(15) << "Rest Freqs:";
|
---|
[1819] | 1360 | for (int i=0; i<nid; i++) {
|
---|
[2244] | 1361 | Table t = table_(table_.col("MOLECULE_ID") == i, 1);
|
---|
[1819] | 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 | }
|
---|
[805] | 1376 | }
|
---|
[941] | 1377 |
|
---|
| 1378 | oss << setw(15) << "Abcissa:" << getAbcissaLabel(0) << endl;
|
---|
[805] | 1379 | oss << selector_.print() << endl;
|
---|
[2111] | 1380 | return String(oss);
|
---|
| 1381 | }
|
---|
| 1382 |
|
---|
[2286] | 1383 | //std::string Scantable::summary( const std::string& filename )
|
---|
[2290] | 1384 | void Scantable::oldsummary( const std::string& filename )
|
---|
[2111] | 1385 | {
|
---|
| 1386 | ostringstream oss;
|
---|
[2286] | 1387 | ofstream ofs;
|
---|
| 1388 | LogIO ols(LogOrigin("Scantable", "summary", WHERE));
|
---|
| 1389 |
|
---|
| 1390 | if (filename != "")
|
---|
| 1391 | ofs.open( filename.c_str(), ios::out );
|
---|
| 1392 |
|
---|
[805] | 1393 | oss << endl;
|
---|
[2111] | 1394 | oss << asap::SEPERATOR << endl;
|
---|
| 1395 | oss << " Scan Table Summary" << endl;
|
---|
| 1396 | oss << asap::SEPERATOR << endl;
|
---|
| 1397 |
|
---|
| 1398 | // Format header info
|
---|
[2290] | 1399 | oss << oldheaderSummary();
|
---|
[2111] | 1400 | oss << endl;
|
---|
| 1401 |
|
---|
[805] | 1402 | // main table
|
---|
| 1403 | String dirtype = "Position ("
|
---|
[987] | 1404 | + getDirectionRefString()
|
---|
[805] | 1405 | + ")";
|
---|
[2111] | 1406 | oss.flags(std::ios_base::left);
|
---|
[941] | 1407 | oss << setw(5) << "Scan" << setw(15) << "Source"
|
---|
[2005] | 1408 | << setw(10) << "Time" << setw(18) << "Integration"
|
---|
| 1409 | << setw(15) << "Source Type" << endl;
|
---|
[941] | 1410 | oss << setw(5) << "" << setw(5) << "Beam" << setw(3) << "" << dirtype << endl;
|
---|
[1694] | 1411 | oss << setw(10) << "" << setw(3) << "IF" << setw(3) << ""
|
---|
[805] | 1412 | << setw(8) << "Frame" << setw(16)
|
---|
[1694] | 1413 | << "RefVal" << setw(10) << "RefPix" << setw(12) << "Increment"
|
---|
| 1414 | << setw(7) << "Channels"
|
---|
| 1415 | << endl;
|
---|
[805] | 1416 | oss << asap::SEPERATOR << endl;
|
---|
[2286] | 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 |
|
---|
[805] | 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
|
---|
[2005] | 1442 | << setw(11) << formatSec(rec.asFloat("INTERVAL")) << setw(1) << ""
|
---|
| 1443 | << setw(15) << SrcType::getName(rec.asInt("SRCTYPE")) << endl;
|
---|
[447] | 1444 |
|
---|
[805] | 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);
|
---|
[1000] | 1450 | uInt row0 = bsubt.rowNumbers(table_)[0];
|
---|
[941] | 1451 | oss << setw(5) << "" << setw(4) << std::right << brec.asuInt("BEAMNO")<< std::left;
|
---|
[987] | 1452 | oss << setw(4) << "" << formatDirection(getDirection(row0)) << endl;
|
---|
[805] | 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);
|
---|
[1694] | 1458 | oss << setw(9) << "";
|
---|
[941] | 1459 | oss << setw(3) << std::right << irec.asuInt("IFNO") << std::left
|
---|
[1694] | 1460 | << setw(1) << "" << frequencies().print(irec.asuInt("FREQ_ID"))
|
---|
| 1461 | << setw(3) << "" << nchan(irec.asuInt("IFNO"))
|
---|
[1375] | 1462 | << endl;
|
---|
[447] | 1463 |
|
---|
[805] | 1464 | ++iiter;
|
---|
| 1465 | }
|
---|
| 1466 | ++biter;
|
---|
| 1467 | }
|
---|
[2286] | 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 |
|
---|
[805] | 1474 | ++iter;
|
---|
[447] | 1475 | }
|
---|
[2286] | 1476 | oss << asap::SEPERATOR << endl;
|
---|
| 1477 | ols << String(oss) << LogIO::POST;
|
---|
| 1478 | if (ofs) {
|
---|
[2290] | 1479 | ofs << String(oss) << flush;
|
---|
[2286] | 1480 | ofs.close();
|
---|
| 1481 | }
|
---|
| 1482 | // return String(oss);
|
---|
[447] | 1483 | }
|
---|
| 1484 |
|
---|
[1947] | 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
|
---|
[777] | 1500 | {
|
---|
[805] | 1501 | MEpoch me;
|
---|
[1947] | 1502 | me = getEpoch(whichrow);
|
---|
| 1503 | return formatTime(me, showdate, prec);
|
---|
[777] | 1504 | }
|
---|
[805] | 1505 |
|
---|
[1411] | 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);
|
---|
[1598] | 1513 | return MEpoch(MVEpoch(tm));
|
---|
[1411] | 1514 | }
|
---|
| 1515 | }
|
---|
| 1516 |
|
---|
[1068] | 1517 | std::string Scantable::getDirectionString(int whichrow) const
|
---|
| 1518 | {
|
---|
| 1519 | return formatDirection(getDirection(uInt(whichrow)));
|
---|
| 1520 | }
|
---|
| 1521 |
|
---|
[1598] | 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);
|
---|
[1819] | 1527 | //Double rf = moleculeTable_.getRestFrequency(mmolidCol_(whichrow));
|
---|
| 1528 | Vector<Double> rf = moleculeTable_.getRestFrequency(mmolidCol_(whichrow));
|
---|
[2346] | 1529 | return freqTable_.getSpectralCoordinate(md, mp, me, rf,
|
---|
[1598] | 1530 | mfreqidCol_(whichrow));
|
---|
| 1531 | }
|
---|
| 1532 |
|
---|
[1360] | 1533 | std::vector< double > Scantable::getAbcissa( int whichrow ) const
|
---|
[865] | 1534 | {
|
---|
[1507] | 1535 | if ( whichrow > int(table_.nrow()) ) throw(AipsError("Illegal row number"));
|
---|
[865] | 1536 | std::vector<double> stlout;
|
---|
| 1537 | int nchan = specCol_(whichrow).nelements();
|
---|
[2346] | 1538 | String us = freqTable_.getUnitString();
|
---|
[865] | 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 | }
|
---|
[1598] | 1545 | SpectralCoordinate spc = getSpectralCoordinate(whichrow);
|
---|
[865] | 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 | }
|
---|
[1360] | 1562 | void Scantable::setDirectionRefString( const std::string & refstr )
|
---|
[987] | 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 | }
|
---|
[865] | 1575 |
|
---|
[1360] | 1576 | std::string Scantable::getDirectionRefString( ) const
|
---|
[987] | 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 |
|
---|
[847] | 1596 | std::string Scantable::getAbcissaLabel( int whichrow ) const
|
---|
| 1597 | {
|
---|
[996] | 1598 | if ( whichrow > int(table_.nrow()) ) throw(AipsError("Illegal ro number"));
|
---|
[847] | 1599 | const MPosition& mp = getAntennaPosition();
|
---|
[987] | 1600 | const MDirection& md = getDirection(whichrow);
|
---|
[847] | 1601 | const MEpoch& me = timeCol_(whichrow);
|
---|
[1819] | 1602 | //const Double& rf = mmolidCol_(whichrow);
|
---|
| 1603 | const Vector<Double> rf = moleculeTable_.getRestFrequency(mmolidCol_(whichrow));
|
---|
[847] | 1604 | SpectralCoordinate spc =
|
---|
[2346] | 1605 | freqTable_.getSpectralCoordinate(md, mp, me, rf, mfreqidCol_(whichrow));
|
---|
[847] | 1606 |
|
---|
| 1607 | String s = "Channel";
|
---|
[2346] | 1608 | Unit u = Unit(freqTable_.getUnitString());
|
---|
[847] | 1609 | if (u == Unit("km/s")) {
|
---|
[1170] | 1610 | s = CoordinateUtil::axisLabel(spc, 0, True,True, True);
|
---|
[847] | 1611 | } else if (u == Unit("Hz")) {
|
---|
| 1612 | Vector<String> wau(1);wau = u.getName();
|
---|
| 1613 | spc.setWorldAxisUnits(wau);
|
---|
[1170] | 1614 | s = CoordinateUtil::axisLabel(spc, 0, True, True, False);
|
---|
[847] | 1615 | }
|
---|
| 1616 | return s;
|
---|
| 1617 |
|
---|
| 1618 | }
|
---|
| 1619 |
|
---|
[1819] | 1620 | /**
|
---|
| 1621 | void asap::Scantable::setRestFrequencies( double rf, const std::string& name,
|
---|
[1170] | 1622 | const std::string& unit )
|
---|
[1819] | 1623 | **/
|
---|
| 1624 | void Scantable::setRestFrequencies( vector<double> rf, const vector<std::string>& name,
|
---|
| 1625 | const std::string& unit )
|
---|
| 1626 |
|
---|
[847] | 1627 | {
|
---|
[923] | 1628 | ///@todo lookup in line table to fill in name and formattedname
|
---|
[847] | 1629 | Unit u(unit);
|
---|
[1819] | 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);
|
---|
[847] | 1637 | TableVector<uInt> tabvec(table_, "MOLECULE_ID");
|
---|
| 1638 | tabvec = id;
|
---|
| 1639 | }
|
---|
| 1640 |
|
---|
[1819] | 1641 | /**
|
---|
| 1642 | void asap::Scantable::setRestFrequencies( const std::string& name )
|
---|
[847] | 1643 | {
|
---|
| 1644 | throw(AipsError("setRestFrequencies( const std::string& name ) NYI"));
|
---|
| 1645 | ///@todo implement
|
---|
| 1646 | }
|
---|
[1819] | 1647 | **/
|
---|
[2012] | 1648 |
|
---|
[1819] | 1649 | void Scantable::setRestFrequencies( const vector<std::string>& name )
|
---|
| 1650 | {
|
---|
[2163] | 1651 | (void) name; // suppress unused warning
|
---|
[1819] | 1652 | throw(AipsError("setRestFrequencies( const vector<std::string>& name ) NYI"));
|
---|
| 1653 | ///@todo implement
|
---|
| 1654 | }
|
---|
[847] | 1655 |
|
---|
[1360] | 1656 | std::vector< unsigned int > Scantable::rownumbers( ) const
|
---|
[852] | 1657 | {
|
---|
| 1658 | std::vector<unsigned int> stlout;
|
---|
| 1659 | Vector<uInt> vec = table_.rowNumbers();
|
---|
| 1660 | vec.tovector(stlout);
|
---|
| 1661 | return stlout;
|
---|
| 1662 | }
|
---|
| 1663 |
|
---|
[865] | 1664 |
|
---|
[1360] | 1665 | Matrix<Float> Scantable::getPolMatrix( uInt whichrow ) const
|
---|
[896] | 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 | }
|
---|
[865] | 1677 |
|
---|
[1360] | 1678 | std::vector< std::string > Scantable::columnNames( ) const
|
---|
[902] | 1679 | {
|
---|
| 1680 | Vector<String> vec = table_.tableDesc().columnNames();
|
---|
| 1681 | return mathutil::tovectorstring(vec);
|
---|
| 1682 | }
|
---|
[896] | 1683 |
|
---|
[1360] | 1684 | MEpoch::Types Scantable::getTimeReference( ) const
|
---|
[915] | 1685 | {
|
---|
| 1686 | return MEpoch::castType(timeCol_.getMeasRef().getType());
|
---|
[972] | 1687 | }
|
---|
[915] | 1688 |
|
---|
[1360] | 1689 | void Scantable::addFit( const STFitEntry& fit, int row )
|
---|
[972] | 1690 | {
|
---|
[1819] | 1691 | //cout << mfitidCol_(uInt(row)) << endl;
|
---|
| 1692 | LogIO os( LogOrigin( "Scantable", "addFit()", WHERE ) ) ;
|
---|
| 1693 | os << mfitidCol_(uInt(row)) << LogIO::POST ;
|
---|
[972] | 1694 | uInt id = fitTable_.addEntry(fit, mfitidCol_(uInt(row)));
|
---|
| 1695 | mfitidCol_.put(uInt(row), id);
|
---|
| 1696 | }
|
---|
[915] | 1697 |
|
---|
[1360] | 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) {
|
---|
[1567] | 1704 | frequencies().shiftRefPix(npix, fids[i]);
|
---|
[1360] | 1705 | }
|
---|
| 1706 | }
|
---|
[987] | 1707 |
|
---|
[1819] | 1708 | String Scantable::getAntennaName() const
|
---|
[1391] | 1709 | {
|
---|
| 1710 | String out;
|
---|
| 1711 | table_.keywordSet().get("AntennaName", out);
|
---|
[1987] | 1712 | String::size_type pos1 = out.find("@") ;
|
---|
| 1713 | String::size_type pos2 = out.find("//") ;
|
---|
| 1714 | if ( pos2 != String::npos )
|
---|
[2036] | 1715 | out = out.substr(pos2+2,pos1-pos2-2) ;
|
---|
[1987] | 1716 | else if ( pos1 != String::npos )
|
---|
| 1717 | out = out.substr(0,pos1) ;
|
---|
[1391] | 1718 | return out;
|
---|
[987] | 1719 | }
|
---|
[1391] | 1720 |
|
---|
[1730] | 1721 | int Scantable::checkScanInfo(const std::vector<int>& scanlist) const
|
---|
[1391] | 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]+1 );
|
---|
| 1732 | if (subt.nrow()==0) {
|
---|
[1819] | 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;
|
---|
[1391] | 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]+1 );
|
---|
| 1746 | if ( subt2.nrow() == 0) {
|
---|
[1819] | 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;
|
---|
[1391] | 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) {
|
---|
[1819] | 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;
|
---|
[1391] | 1763 | i +=1;
|
---|
| 1764 | }
|
---|
| 1765 | else {
|
---|
[1819] | 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;
|
---|
[1391] | 1769 | }
|
---|
| 1770 | }
|
---|
| 1771 | else if (scan1seqn==2 && scan2seqn == 1) {
|
---|
| 1772 | if (laston1 == laston2) {
|
---|
[1819] | 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;
|
---|
[1391] | 1776 | ret = 1;
|
---|
| 1777 | break;
|
---|
| 1778 | }
|
---|
| 1779 | }
|
---|
| 1780 | else {
|
---|
[1819] | 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;
|
---|
[1391] | 1784 | ret = 1;
|
---|
| 1785 | break;
|
---|
| 1786 | }
|
---|
| 1787 | }
|
---|
| 1788 | }
|
---|
| 1789 | else {
|
---|
[1819] | 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;
|
---|
[1391] | 1793 | }
|
---|
| 1794 | //if ( i >= nscan ) break;
|
---|
| 1795 | }
|
---|
| 1796 | }
|
---|
| 1797 | else {
|
---|
[1819] | 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;
|
---|
[1391] | 1801 | ret = 1;
|
---|
| 1802 | }
|
---|
| 1803 | return ret;
|
---|
| 1804 | }
|
---|
| 1805 |
|
---|
[1730] | 1806 | std::vector<double> Scantable::getDirectionVector(int whichrow) const
|
---|
[1391] | 1807 | {
|
---|
| 1808 | Vector<Double> Dir = dirCol_(whichrow).getAngle("rad").getValue();
|
---|
| 1809 | std::vector<double> dir;
|
---|
| 1810 | Dir.tovector(dir);
|
---|
| 1811 | return dir;
|
---|
| 1812 | }
|
---|
| 1813 |
|
---|
[1819] | 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
|
---|
[2672] | 1845 | if ( nmax >= nChan-1 ) {
|
---|
[1819] | 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 | Double refpix ;
|
---|
| 1867 | Double refval ;
|
---|
| 1868 | Double increment ;
|
---|
[2346] | 1869 | int freqnrow = freqTable_.table().nrow() ;
|
---|
[1819] | 1870 | Vector<uInt> oldId( freqnrow ) ;
|
---|
| 1871 | Vector<uInt> newId( freqnrow ) ;
|
---|
| 1872 | for ( int irow = 0 ; irow < freqnrow ; irow++ ) {
|
---|
[2346] | 1873 | freqTable_.getEntry( refpix, refval, increment, irow ) ;
|
---|
[1819] | 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 ;
|
---|
[2346] | 1880 | freqTable_.setEntry( refpix, refval, increment, irow ) ;
|
---|
[1819] | 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 ) ;
|
---|
[2475] | 1899 | Vector<Float> oldtsys = tsysCol_( irow ) ;
|
---|
[1819] | 1900 | uInt newsize = nmax - nmin + 1 ;
|
---|
[2475] | 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 ) ) ;
|
---|
[1819] | 1906 |
|
---|
| 1907 | return ;
|
---|
| 1908 | }
|
---|
| 1909 |
|
---|
[2435] | 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 ) ;
|
---|
[2433] | 1932 |
|
---|
[2435] | 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 ) ;
|
---|
[2463] | 1939 |
|
---|
[2437] | 1940 | //refval = refval - ( refpix + 0.5 * (1 - factor) ) * increment ;
|
---|
[2463] | 1941 | if (factor > 0 ) {
|
---|
[2462] | 1942 | refpix = (refpix + 0.5)/factor - 0.5;
|
---|
| 1943 | } else {
|
---|
[2463] | 1944 | refpix = (abcissa.size() - 0.5 - refpix)/abs(factor) - 0.5;
|
---|
[2462] | 1945 | }
|
---|
[2435] | 1946 | freqTable_.setEntry( refpix, refval, increment*factor, currId ) ;
|
---|
[2463] | 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 ;
|
---|
[2435] | 1949 | }
|
---|
| 1950 | }
|
---|
| 1951 | }
|
---|
| 1952 |
|
---|
[1819] | 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 |
|
---|
[2433] | 1973 | // change channel number for specCol_, flagCol_, and tsysCol_ (if necessary)
|
---|
[1819] | 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 ) ;
|
---|
[2431] | 1999 | Vector<Float> oldtsys = tsysCol_( irow ) ;
|
---|
[1819] | 2000 | Vector<Float> newspec( nChan, 0 ) ;
|
---|
[2431] | 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 | }
|
---|
[1819] | 2009 |
|
---|
| 2010 | // regrid
|
---|
| 2011 | vector<double> abcissa = getAbcissa( irow ) ;
|
---|
| 2012 | int oldsize = abcissa.size() ;
|
---|
| 2013 | double olddnu = abcissa[1] - abcissa[0] ;
|
---|
[2462] | 2014 | //int ichan = 0 ;
|
---|
[1819] | 2015 | double wsum = 0.0 ;
|
---|
[2433] | 2016 | Vector<double> zi( nChan+1 ) ;
|
---|
| 2017 | Vector<double> yi( oldsize + 1 ) ;
|
---|
[1819] | 2018 | yi[0] = abcissa[0] - 0.5 * olddnu ;
|
---|
[2431] | 2019 | for ( int ii = 1 ; ii < oldsize ; ii++ )
|
---|
[2433] | 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]) ;
|
---|
[2462] | 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 ;
|
---|
[1819] | 2056 | }
|
---|
[2462] | 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 | }
|
---|
[2431] | 2076 | }
|
---|
[2462] | 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 | }
|
---|
[1819] | 2096 | }
|
---|
[2462] | 2097 | else {
|
---|
| 2098 | ichan = jj - iyincr ;
|
---|
| 2099 | break ;
|
---|
[2431] | 2100 | }
|
---|
[2462] | 2101 | jj += iyincr ;
|
---|
[1819] | 2102 | }
|
---|
[2462] | 2103 | if ( wsum != 0.0 ) {
|
---|
| 2104 | newspec[i] /= wsum ;
|
---|
| 2105 | if (regridTsys) newtsys[i] /= wsum ;
|
---|
| 2106 | }
|
---|
| 2107 | wsum = 0.0 ;
|
---|
| 2108 | ii += izincr ;
|
---|
[1819] | 2109 | }
|
---|
[2462] | 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 | // }
|
---|
[1819] | 2171 | // }
|
---|
[2462] | 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 ;
|
---|
[1819] | 2232 | // }
|
---|
| 2233 | // }
|
---|
[2462] | 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 ;
|
---|
[1819] | 2255 |
|
---|
[2462] | 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 | // // }
|
---|
[1819] | 2287 |
|
---|
[2462] | 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 ;
|
---|
[1819] | 2311 |
|
---|
[2462] | 2312 | // // // ofs.close() ;
|
---|
| 2313 |
|
---|
[2032] | 2314 | specCol_.put( irow, newspec ) ;
|
---|
| 2315 | flagsCol_.put( irow, newflag ) ;
|
---|
[2431] | 2316 | if (regridTsys) tsysCol_.put( irow, newtsys );
|
---|
[1819] | 2317 |
|
---|
| 2318 | return ;
|
---|
| 2319 | }
|
---|
| 2320 |
|
---|
[2595] | 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 |
|
---|
[1730] | 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;
|
---|
[1391] | 2485 | }
|
---|
[1730] | 2486 |
|
---|
[2047] | 2487 | bool Scantable::getFlagtraFast(uInt whichrow)
|
---|
[1907] | 2488 | {
|
---|
| 2489 | uChar flag;
|
---|
| 2490 | Vector<uChar> flags;
|
---|
[2047] | 2491 | flagsCol_.get(whichrow, flags);
|
---|
[2012] | 2492 | flag = flags[0];
|
---|
[2047] | 2493 | for (uInt i = 1; i < flags.size(); ++i) {
|
---|
[2012] | 2494 | flag &= flags[i];
|
---|
| 2495 | }
|
---|
| 2496 | return ((flag >> 7) == 1);
|
---|
| 2497 | }
|
---|
| 2498 |
|
---|
[2811] | 2499 | std::vector<std::string> Scantable::applyBaselineTable(const std::string& bltable, const bool returnfitresult, const std::string& outbltable, const bool outbltableexists, const bool overwrite)
|
---|
[2047] | 2500 | {
|
---|
[2773] | 2501 | STBaselineTable btin = STBaselineTable(bltable);
|
---|
[2767] | 2502 |
|
---|
[2773] | 2503 | Vector<Bool> applyCol = btin.getApply();
|
---|
[2767] | 2504 | int nRowBl = applyCol.size();
|
---|
| 2505 | if (nRowBl != nrow()) {
|
---|
| 2506 | throw(AipsError("Scantable and bltable have different number of rows."));
|
---|
| 2507 | }
|
---|
| 2508 |
|
---|
| 2509 | std::vector<std::string> res;
|
---|
| 2510 | res.clear();
|
---|
| 2511 |
|
---|
| 2512 | bool outBaselineTable = ((outbltable != "") && (!outbltableexists || overwrite));
|
---|
| 2513 | bool bltableidentical = (bltable == outbltable);
|
---|
[2773] | 2514 | STBaselineTable btout = STBaselineTable(*this);
|
---|
| 2515 | ROScalarColumn<Double> tcol = ROScalarColumn<Double>(table_, "TIME");
|
---|
| 2516 | Vector<Double> timeSecCol = tcol.getColumn();
|
---|
[2767] | 2517 |
|
---|
| 2518 | for (int whichrow = 0; whichrow < nRowBl; ++whichrow) {
|
---|
| 2519 | if (applyCol[whichrow]) {
|
---|
| 2520 | std::vector<float> spec = getSpectrum(whichrow);
|
---|
| 2521 |
|
---|
[2773] | 2522 | std::vector<bool> mask = btin.getMask(whichrow); //use mask_bltable only
|
---|
[2767] | 2523 |
|
---|
[2773] | 2524 | STBaselineFunc::FuncName ftype = btin.getFunctionName(whichrow);
|
---|
| 2525 | std::vector<int> fpar = btin.getFuncParam(whichrow);
|
---|
[2767] | 2526 | std::vector<float> params;
|
---|
| 2527 | float rms;
|
---|
| 2528 | std::vector<float> resfit = doApplyBaselineTable(spec, mask, ftype, fpar, params, rms);
|
---|
| 2529 | setSpectrum(resfit, whichrow);
|
---|
| 2530 |
|
---|
[2811] | 2531 | if (returnfitresult) {
|
---|
| 2532 | res.push_back(packFittingResults(whichrow, params, rms));
|
---|
| 2533 | }
|
---|
[2767] | 2534 |
|
---|
| 2535 | if (outBaselineTable) {
|
---|
| 2536 | if (outbltableexists) {
|
---|
| 2537 | if (overwrite) {
|
---|
| 2538 | if (bltableidentical) {
|
---|
[2773] | 2539 | btin.setresult(uInt(whichrow), Vector<Float>(params), Float(rms));
|
---|
[2767] | 2540 | } else {
|
---|
[2773] | 2541 | btout.setresult(uInt(whichrow), Vector<Float>(params), Float(rms));
|
---|
[2767] | 2542 | }
|
---|
| 2543 | }
|
---|
| 2544 | } else {
|
---|
[2773] | 2545 | btout.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 2546 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 2547 | true, ftype, fpar, std::vector<float>(),
|
---|
| 2548 | getMaskListFromMask(mask), params, rms, spec.size(),
|
---|
| 2549 | 3.0, 0, 0.0, 0, std::vector<int>());
|
---|
[2767] | 2550 | }
|
---|
| 2551 | }
|
---|
| 2552 | }
|
---|
| 2553 | }
|
---|
| 2554 |
|
---|
| 2555 | if (outBaselineTable) {
|
---|
| 2556 | if (bltableidentical) {
|
---|
[2773] | 2557 | btin.save(outbltable);
|
---|
[2767] | 2558 | } else {
|
---|
[2773] | 2559 | btout.save(outbltable);
|
---|
[2767] | 2560 | }
|
---|
| 2561 | }
|
---|
| 2562 |
|
---|
| 2563 | return res;
|
---|
| 2564 | }
|
---|
| 2565 |
|
---|
[2811] | 2566 | 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)
|
---|
[2767] | 2567 | {
|
---|
| 2568 | int nRowBl = blInfoList.size();
|
---|
| 2569 | int nRowSt = nrow();
|
---|
| 2570 |
|
---|
| 2571 | std::vector<std::string> res;
|
---|
| 2572 | res.clear();
|
---|
| 2573 |
|
---|
| 2574 | bool outBaselineTable = ((outbltable != "") && (!outbltableexists || overwrite));
|
---|
| 2575 | if ((outbltable != "") && outbltableexists && !overwrite) {
|
---|
| 2576 | throw(AipsError("Cannot overwrite bltable. Set overwrite=True."));
|
---|
| 2577 | }
|
---|
| 2578 |
|
---|
[2773] | 2579 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 2580 | ROScalarColumn<Double> tcol = ROScalarColumn<Double>(table_, "TIME");
|
---|
| 2581 | Vector<Double> timeSecCol = tcol.getColumn();
|
---|
[2767] | 2582 |
|
---|
| 2583 | if (outBaselineTable && !outbltableexists) {
|
---|
| 2584 | for (int i = 0; i < nRowSt; ++i) {
|
---|
[2773] | 2585 | bt.appendbasedata(getScan(i), getCycle(i), getBeam(i), getIF(i), getPol(i),
|
---|
[2767] | 2586 | 0, timeSecCol[i]);
|
---|
[2773] | 2587 | bt.setApply(i, false);
|
---|
[2767] | 2588 | }
|
---|
| 2589 | }
|
---|
| 2590 |
|
---|
| 2591 | for (int i = 0; i < nRowBl; ++i) {
|
---|
| 2592 | int irow;
|
---|
| 2593 | STBaselineFunc::FuncName ftype;
|
---|
| 2594 | std::vector<bool> mask;
|
---|
| 2595 | std::vector<int> fpar;
|
---|
| 2596 | float clipth;
|
---|
| 2597 | int clipn;
|
---|
| 2598 | bool uself;
|
---|
| 2599 | float lfth;
|
---|
| 2600 | std::vector<int> lfedge;
|
---|
| 2601 | int lfavg;
|
---|
| 2602 | parseBlInfo(blInfoList[i], irow, ftype, fpar, mask, clipth, clipn, uself, lfth, lfedge, lfavg);
|
---|
| 2603 |
|
---|
| 2604 | if (irow < nRowSt) {
|
---|
| 2605 | std::vector<float> spec = getSpectrum(irow);
|
---|
| 2606 | std::vector<float> params;
|
---|
| 2607 | float rms;
|
---|
| 2608 | std::vector<bool> finalmask;
|
---|
| 2609 |
|
---|
| 2610 | std::vector<float> resfit = doSubtractBaseline(spec, mask, ftype, fpar, params, rms, finalmask, clipth, clipn, uself, irow, lfth, lfedge, lfavg);
|
---|
| 2611 | setSpectrum(resfit, irow);
|
---|
| 2612 |
|
---|
[2811] | 2613 | if (returnfitresult) {
|
---|
| 2614 | res.push_back(packFittingResults(irow, params, rms));
|
---|
| 2615 | }
|
---|
| 2616 |
|
---|
[2767] | 2617 | if (outBaselineTable) {
|
---|
| 2618 | Vector<Int> fparam(fpar.size());
|
---|
| 2619 | for (uInt j = 0; j < fparam.size(); ++j) {
|
---|
| 2620 | fparam[j] = (Int)fpar[j];
|
---|
| 2621 | }
|
---|
| 2622 |
|
---|
[2773] | 2623 | bt.setdata(uInt(irow),
|
---|
[2767] | 2624 | uInt(getScan(irow)), uInt(getCycle(irow)),
|
---|
| 2625 | uInt(getBeam(irow)), uInt(getIF(irow)), uInt(getPol(irow)),
|
---|
| 2626 | uInt(0), timeSecCol[irow], Bool(true), ftype, fparam,
|
---|
[2773] | 2627 | Vector<Float>(), getMaskListFromMask(finalmask), Vector<Float>(params),
|
---|
[2767] | 2628 | Float(rms), uInt(spec.size()), Float(clipth), uInt(clipn),
|
---|
| 2629 | Float(0.0), uInt(0), Vector<uInt>());
|
---|
| 2630 | }
|
---|
| 2631 |
|
---|
| 2632 | }
|
---|
| 2633 | }
|
---|
| 2634 |
|
---|
| 2635 | if (outBaselineTable) {
|
---|
[2773] | 2636 | bt.save(outbltable);
|
---|
[2767] | 2637 | }
|
---|
| 2638 |
|
---|
| 2639 | return res;
|
---|
| 2640 | }
|
---|
| 2641 |
|
---|
[2773] | 2642 | std::vector<float> Scantable::doApplyBaselineTable(std::vector<float>& spec,
|
---|
| 2643 | std::vector<bool>& mask,
|
---|
| 2644 | const STBaselineFunc::FuncName ftype,
|
---|
| 2645 | std::vector<int>& fpar,
|
---|
| 2646 | std::vector<float>& params,
|
---|
| 2647 | float&rms)
|
---|
[2767] | 2648 | {
|
---|
| 2649 | std::vector<bool> finalmask;
|
---|
| 2650 | std::vector<int> lfedge;
|
---|
| 2651 | return doSubtractBaseline(spec, mask, ftype, fpar, params, rms, finalmask, 0.0, 0, false, 0, 0.0, lfedge, 0);
|
---|
| 2652 | }
|
---|
| 2653 |
|
---|
[2774] | 2654 | std::vector<float> Scantable::doSubtractBaseline(std::vector<float>& spec,
|
---|
| 2655 | std::vector<bool>& mask,
|
---|
| 2656 | const STBaselineFunc::FuncName ftype,
|
---|
| 2657 | std::vector<int>& fpar,
|
---|
| 2658 | std::vector<float>& params,
|
---|
| 2659 | float&rms,
|
---|
| 2660 | std::vector<bool>& finalmask,
|
---|
| 2661 | float clipth,
|
---|
| 2662 | int clipn,
|
---|
| 2663 | bool uself,
|
---|
| 2664 | int irow,
|
---|
| 2665 | float lfth,
|
---|
| 2666 | std::vector<int>& lfedge,
|
---|
| 2667 | int lfavg)
|
---|
[2767] | 2668 | {
|
---|
| 2669 | if (uself) {
|
---|
| 2670 | STLineFinder lineFinder = STLineFinder();
|
---|
[2774] | 2671 | initLineFinder(lfedge, lfth, lfavg, lineFinder);
|
---|
[2767] | 2672 | std::vector<int> currentEdge;
|
---|
[2774] | 2673 | mask = getCompositeChanMask(irow, mask, lfedge, currentEdge, lineFinder);
|
---|
[2767] | 2674 | }
|
---|
| 2675 |
|
---|
| 2676 | std::vector<float> res;
|
---|
| 2677 | if (ftype == STBaselineFunc::Polynomial) {
|
---|
| 2678 | res = doPolynomialFitting(spec, mask, fpar[0], params, rms, finalmask, clipth, clipn);
|
---|
| 2679 | } else if (ftype == STBaselineFunc::Chebyshev) {
|
---|
| 2680 | res = doChebyshevFitting(spec, mask, fpar[0], params, rms, finalmask, clipth, clipn);
|
---|
| 2681 | } else if (ftype == STBaselineFunc::CSpline) {
|
---|
| 2682 | if (fpar.size() > 1) { // reading from baseline table in which pieceEdges are already calculated and stored.
|
---|
| 2683 | res = doCubicSplineFitting(spec, mask, fpar, params, rms, finalmask, clipth, clipn);
|
---|
| 2684 | } else { // usual cspline fitting by giving nPiece only. fpar will be replaced with pieceEdges.
|
---|
| 2685 | res = doCubicSplineFitting(spec, mask, fpar[0], fpar, params, rms, finalmask, clipth, clipn);
|
---|
| 2686 | }
|
---|
| 2687 | } else if (ftype == STBaselineFunc::Sinusoid) {
|
---|
| 2688 | res = doSinusoidFitting(spec, mask, fpar, params, rms, finalmask, clipth, clipn);
|
---|
| 2689 | }
|
---|
| 2690 |
|
---|
| 2691 | return res;
|
---|
| 2692 | }
|
---|
| 2693 |
|
---|
| 2694 | std::string Scantable::packFittingResults(const int irow, const std::vector<float>& params, const float rms)
|
---|
| 2695 | {
|
---|
| 2696 | // returned value: "irow:params[0],params[1],..,params[n-1]:rms"
|
---|
| 2697 | ostringstream os;
|
---|
| 2698 | os << irow << ':';
|
---|
| 2699 | for (uInt i = 0; i < params.size(); ++i) {
|
---|
| 2700 | if (i > 0) {
|
---|
| 2701 | os << ',';
|
---|
| 2702 | }
|
---|
| 2703 | os << params[i];
|
---|
| 2704 | }
|
---|
| 2705 | os << ':' << rms;
|
---|
| 2706 |
|
---|
| 2707 | return os.str();
|
---|
| 2708 | }
|
---|
| 2709 |
|
---|
| 2710 | 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)
|
---|
| 2711 | {
|
---|
| 2712 | // The baseline info to be parsed must be column-delimited string like
|
---|
| 2713 | // "0:chebyshev:5:3,5,169,174,485,487" where the elements are
|
---|
| 2714 | // row number, funcType, funcOrder, maskList, clipThreshold, clipNIter,
|
---|
| 2715 | // useLineFinder, lfThreshold, lfEdge and lfChanAvgLimit.
|
---|
| 2716 |
|
---|
| 2717 | std::vector<string> res = splitToStringList(blInfo, ':');
|
---|
| 2718 | if (res.size() < 4) {
|
---|
| 2719 | throw(AipsError("baseline info has bad format")) ;
|
---|
| 2720 | }
|
---|
| 2721 |
|
---|
| 2722 | string ftype0, fpar0, masklist0, uself0, edge0;
|
---|
| 2723 | std::vector<int> masklist;
|
---|
| 2724 |
|
---|
| 2725 | stringstream ss;
|
---|
| 2726 | ss << res[0];
|
---|
| 2727 | ss >> irow;
|
---|
| 2728 | ss.clear(); ss.str("");
|
---|
| 2729 |
|
---|
| 2730 | ss << res[1];
|
---|
| 2731 | ss >> ftype0;
|
---|
| 2732 | if (ftype0 == "poly") {
|
---|
| 2733 | ftype = STBaselineFunc::Polynomial;
|
---|
| 2734 | } else if (ftype0 == "cspline") {
|
---|
| 2735 | ftype = STBaselineFunc::CSpline;
|
---|
| 2736 | } else if (ftype0 == "sinusoid") {
|
---|
| 2737 | ftype = STBaselineFunc::Sinusoid;
|
---|
| 2738 | } else if (ftype0 == "chebyshev") {
|
---|
| 2739 | ftype = STBaselineFunc::Chebyshev;
|
---|
| 2740 | } else {
|
---|
| 2741 | throw(AipsError("invalid function type."));
|
---|
| 2742 | }
|
---|
| 2743 | ss.clear(); ss.str("");
|
---|
| 2744 |
|
---|
| 2745 | ss << res[2];
|
---|
| 2746 | ss >> fpar0;
|
---|
| 2747 | fpar = splitToIntList(fpar0, ',');
|
---|
| 2748 | ss.clear(); ss.str("");
|
---|
| 2749 |
|
---|
| 2750 | ss << res[3];
|
---|
| 2751 | ss >> masklist0;
|
---|
| 2752 | mask = getMaskFromMaskList(nchan(getIF(irow)), splitToIntList(masklist0, ','));
|
---|
| 2753 |
|
---|
| 2754 | ss << res[4];
|
---|
| 2755 | ss >> thresClip;
|
---|
| 2756 | ss.clear(); ss.str("");
|
---|
| 2757 |
|
---|
| 2758 | ss << res[5];
|
---|
| 2759 | ss >> nIterClip;
|
---|
| 2760 | ss.clear(); ss.str("");
|
---|
| 2761 |
|
---|
| 2762 | ss << res[6];
|
---|
| 2763 | ss >> uself0;
|
---|
| 2764 | if (uself0 == "true") {
|
---|
| 2765 | useLineFinder = true;
|
---|
| 2766 | } else {
|
---|
| 2767 | useLineFinder = false;
|
---|
| 2768 | }
|
---|
| 2769 | ss.clear(); ss.str("");
|
---|
| 2770 |
|
---|
| 2771 | if (useLineFinder) {
|
---|
| 2772 | ss << res[7];
|
---|
| 2773 | ss >> thresLF;
|
---|
| 2774 | ss.clear(); ss.str("");
|
---|
| 2775 |
|
---|
| 2776 | ss << res[8];
|
---|
| 2777 | ss >> edge0;
|
---|
| 2778 | edgeLF = splitToIntList(edge0, ',');
|
---|
| 2779 | ss.clear(); ss.str("");
|
---|
| 2780 |
|
---|
| 2781 | ss << res[9];
|
---|
| 2782 | ss >> avgLF;
|
---|
| 2783 | ss.clear(); ss.str("");
|
---|
| 2784 | }
|
---|
| 2785 |
|
---|
| 2786 | }
|
---|
| 2787 |
|
---|
| 2788 | std::vector<int> Scantable::splitToIntList(const std::string& s, const char delim)
|
---|
| 2789 | {
|
---|
| 2790 | istringstream iss(s);
|
---|
| 2791 | string tmp;
|
---|
| 2792 | int tmpi;
|
---|
| 2793 | std::vector<int> res;
|
---|
| 2794 | stringstream ss;
|
---|
| 2795 | while (getline(iss, tmp, delim)) {
|
---|
| 2796 | ss << tmp;
|
---|
| 2797 | ss >> tmpi;
|
---|
| 2798 | res.push_back(tmpi);
|
---|
| 2799 | ss.clear(); ss.str("");
|
---|
| 2800 | }
|
---|
| 2801 |
|
---|
| 2802 | return res;
|
---|
| 2803 | }
|
---|
| 2804 |
|
---|
| 2805 | std::vector<string> Scantable::splitToStringList(const std::string& s, const char delim)
|
---|
| 2806 | {
|
---|
| 2807 | istringstream iss(s);
|
---|
| 2808 | std::string tmp;
|
---|
| 2809 | std::vector<string> res;
|
---|
| 2810 | while (getline(iss, tmp, delim)) {
|
---|
| 2811 | res.push_back(tmp);
|
---|
| 2812 | }
|
---|
| 2813 |
|
---|
| 2814 | return res;
|
---|
| 2815 | }
|
---|
| 2816 |
|
---|
| 2817 | std::vector<bool> Scantable::getMaskFromMaskList(const int nchan, const std::vector<int>& masklist)
|
---|
| 2818 | {
|
---|
| 2819 | if (masklist.size() % 2 != 0) {
|
---|
| 2820 | throw(AipsError("masklist must have even number of elements."));
|
---|
| 2821 | }
|
---|
| 2822 |
|
---|
| 2823 | std::vector<bool> res(nchan);
|
---|
| 2824 |
|
---|
| 2825 | for (int i = 0; i < nchan; ++i) {
|
---|
| 2826 | res[i] = false;
|
---|
| 2827 | }
|
---|
| 2828 | for (uInt j = 0; j < masklist.size(); j += 2) {
|
---|
| 2829 | for (int i = masklist[j]; i <= masklist[j+1]; ++i) {
|
---|
| 2830 | res[i] = true;
|
---|
| 2831 | }
|
---|
| 2832 | }
|
---|
| 2833 |
|
---|
| 2834 | return res;
|
---|
| 2835 | }
|
---|
| 2836 |
|
---|
[2773] | 2837 | Vector<uInt> Scantable::getMaskListFromMask(const std::vector<bool>& mask)
|
---|
[2767] | 2838 | {
|
---|
[2773] | 2839 | std::vector<int> masklist;
|
---|
| 2840 | masklist.clear();
|
---|
| 2841 |
|
---|
| 2842 | for (uInt i = 0; i < mask.size(); ++i) {
|
---|
| 2843 | if (mask[i]) {
|
---|
| 2844 | if ((i == 0)||(i == mask.size()-1)) {
|
---|
| 2845 | masklist.push_back(i);
|
---|
| 2846 | } else {
|
---|
| 2847 | if ((mask[i])&&(!mask[i-1])) {
|
---|
| 2848 | masklist.push_back(i);
|
---|
| 2849 | }
|
---|
| 2850 | if ((mask[i])&&(!mask[i+1])) {
|
---|
| 2851 | masklist.push_back(i);
|
---|
| 2852 | }
|
---|
| 2853 | }
|
---|
| 2854 | }
|
---|
| 2855 | }
|
---|
| 2856 |
|
---|
| 2857 | Vector<uInt> res(masklist.size());
|
---|
| 2858 | for (uInt i = 0; i < masklist.size(); ++i) {
|
---|
| 2859 | res[i] = (uInt)masklist[i];
|
---|
| 2860 | }
|
---|
| 2861 |
|
---|
| 2862 | return res;
|
---|
| 2863 | }
|
---|
| 2864 |
|
---|
| 2865 | void Scantable::initialiseBaselining(const std::string& blfile,
|
---|
| 2866 | ofstream& ofs,
|
---|
| 2867 | const bool outLogger,
|
---|
| 2868 | bool& outTextFile,
|
---|
| 2869 | bool& csvFormat,
|
---|
| 2870 | String& coordInfo,
|
---|
| 2871 | bool& hasSameNchan,
|
---|
| 2872 | const std::string& progressInfo,
|
---|
| 2873 | bool& showProgress,
|
---|
| 2874 | int& minNRow,
|
---|
| 2875 | Vector<Double>& timeSecCol)
|
---|
| 2876 | {
|
---|
| 2877 | csvFormat = false;
|
---|
| 2878 | outTextFile = false;
|
---|
| 2879 |
|
---|
| 2880 | if (blfile != "") {
|
---|
| 2881 | csvFormat = (blfile.substr(0, 1) == "T");
|
---|
| 2882 | ofs.open(blfile.substr(1).c_str(), ios::out | ios::app);
|
---|
| 2883 | if (ofs) outTextFile = true;
|
---|
| 2884 | }
|
---|
| 2885 |
|
---|
| 2886 | coordInfo = "";
|
---|
| 2887 | hasSameNchan = true;
|
---|
| 2888 |
|
---|
| 2889 | if (outLogger || outTextFile) {
|
---|
| 2890 | coordInfo = getCoordInfo()[0];
|
---|
| 2891 | if (coordInfo == "") coordInfo = "channel";
|
---|
| 2892 | hasSameNchan = hasSameNchanOverIFs();
|
---|
| 2893 | }
|
---|
| 2894 |
|
---|
| 2895 | parseProgressInfo(progressInfo, showProgress, minNRow);
|
---|
| 2896 |
|
---|
| 2897 | ROScalarColumn<Double> tcol = ROScalarColumn<Double>(table_, "TIME");
|
---|
| 2898 | timeSecCol = tcol.getColumn();
|
---|
| 2899 | }
|
---|
| 2900 |
|
---|
| 2901 | void Scantable::finaliseBaselining(const bool outBaselineTable,
|
---|
| 2902 | STBaselineTable* pbt,
|
---|
| 2903 | const string& bltable,
|
---|
| 2904 | const bool outTextFile,
|
---|
| 2905 | ofstream& ofs)
|
---|
| 2906 | {
|
---|
| 2907 | if (outBaselineTable) {
|
---|
| 2908 | pbt->save(bltable);
|
---|
| 2909 | }
|
---|
| 2910 |
|
---|
| 2911 | if (outTextFile) ofs.close();
|
---|
| 2912 | }
|
---|
| 2913 |
|
---|
| 2914 | void Scantable::initLineFinder(const std::vector<int>& edge,
|
---|
| 2915 | const float threshold,
|
---|
| 2916 | const int chanAvgLimit,
|
---|
| 2917 | STLineFinder& lineFinder)
|
---|
| 2918 | {
|
---|
[2774] | 2919 | if ((edge.size() > 2) && (edge.size() < getIFNos().size()*2)) {
|
---|
[2773] | 2920 | throw(AipsError("Length of edge element info is less than that of IFs"));
|
---|
| 2921 | }
|
---|
| 2922 |
|
---|
| 2923 | lineFinder.setOptions(threshold, 3, chanAvgLimit);
|
---|
| 2924 | }
|
---|
| 2925 |
|
---|
| 2926 | void Scantable::polyBaseline(const std::vector<bool>& mask, int order,
|
---|
| 2927 | float thresClip, int nIterClip,
|
---|
| 2928 | bool getResidual,
|
---|
| 2929 | const std::string& progressInfo,
|
---|
| 2930 | const bool outLogger, const std::string& blfile,
|
---|
| 2931 | const std::string& bltable)
|
---|
| 2932 | {
|
---|
[2774] | 2933 | /****
|
---|
[2767] | 2934 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
[2774] | 2935 | ****/
|
---|
[2767] | 2936 |
|
---|
[2193] | 2937 | try {
|
---|
| 2938 | ofstream ofs;
|
---|
[2773] | 2939 | String coordInfo;
|
---|
| 2940 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
[2193] | 2941 | int minNRow;
|
---|
[2767] | 2942 | int nRow = nrow();
|
---|
[2773] | 2943 | std::vector<bool> chanMask, finalChanMask;
|
---|
[2767] | 2944 | float rms;
|
---|
[2773] | 2945 | bool outBaselineTable = (bltable != "");
|
---|
| 2946 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 2947 | Vector<Double> timeSecCol;
|
---|
[2767] | 2948 |
|
---|
[2773] | 2949 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 2950 | coordInfo, hasSameNchan,
|
---|
| 2951 | progressInfo, showProgress, minNRow,
|
---|
| 2952 | timeSecCol);
|
---|
[2767] | 2953 |
|
---|
[2773] | 2954 | std::vector<int> nChanNos;
|
---|
| 2955 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 2956 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
| 2957 | &Scantable::getNormalPolynomial,
|
---|
| 2958 | nChanNos);
|
---|
| 2959 |
|
---|
[2193] | 2960 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
[2767] | 2961 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
[2193] | 2962 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
[2773] | 2963 |
|
---|
| 2964 | std::vector<float> params;
|
---|
[2767] | 2965 | int nClipped = 0;
|
---|
[2773] | 2966 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
| 2967 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
| 2968 | params, rms, finalChanMask,
|
---|
| 2969 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2767] | 2970 |
|
---|
[2773] | 2971 | if (outBaselineTable) {
|
---|
| 2972 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 2973 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 2974 | true, STBaselineFunc::Polynomial, order, std::vector<float>(),
|
---|
| 2975 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 2976 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
[2767] | 2977 | } else {
|
---|
| 2978 | setSpectrum(res, whichrow);
|
---|
| 2979 | }
|
---|
| 2980 |
|
---|
[2773] | 2981 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 2982 | coordInfo, hasSameNchan, ofs, "polyBaseline()",
|
---|
| 2983 | params, nClipped);
|
---|
[2193] | 2984 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
| 2985 | }
|
---|
| 2986 |
|
---|
[2773] | 2987 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2193] | 2988 |
|
---|
| 2989 | } catch (...) {
|
---|
| 2990 | throw;
|
---|
[2047] | 2991 | }
|
---|
[2767] | 2992 |
|
---|
[2774] | 2993 | /****
|
---|
[2767] | 2994 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
| 2995 | double elapse1 = TimeEnd - TimeStart;
|
---|
| 2996 | std::cout << "poly-new : " << elapse1 << " (sec.)" << endl;
|
---|
[2774] | 2997 | ****/
|
---|
[2047] | 2998 | }
|
---|
| 2999 |
|
---|
[2773] | 3000 | void Scantable::autoPolyBaseline(const std::vector<bool>& mask, int order,
|
---|
| 3001 | float thresClip, int nIterClip,
|
---|
| 3002 | const std::vector<int>& edge,
|
---|
| 3003 | float threshold, int chanAvgLimit,
|
---|
| 3004 | bool getResidual,
|
---|
| 3005 | const std::string& progressInfo,
|
---|
| 3006 | const bool outLogger, const std::string& blfile,
|
---|
| 3007 | const std::string& bltable)
|
---|
[2047] | 3008 | {
|
---|
[2193] | 3009 | try {
|
---|
| 3010 | ofstream ofs;
|
---|
[2773] | 3011 | String coordInfo;
|
---|
| 3012 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
[2767] | 3013 | int minNRow;
|
---|
| 3014 | int nRow = nrow();
|
---|
[2773] | 3015 | std::vector<bool> chanMask, finalChanMask;
|
---|
[2767] | 3016 | float rms;
|
---|
[2773] | 3017 | bool outBaselineTable = (bltable != "");
|
---|
| 3018 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 3019 | Vector<Double> timeSecCol;
|
---|
| 3020 | STLineFinder lineFinder = STLineFinder();
|
---|
[2189] | 3021 |
|
---|
[2773] | 3022 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 3023 | coordInfo, hasSameNchan,
|
---|
| 3024 | progressInfo, showProgress, minNRow,
|
---|
| 3025 | timeSecCol);
|
---|
[2767] | 3026 |
|
---|
[2773] | 3027 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
| 3028 |
|
---|
| 3029 | std::vector<int> nChanNos;
|
---|
| 3030 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 3031 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
| 3032 | &Scantable::getNormalPolynomial,
|
---|
| 3033 | nChanNos);
|
---|
| 3034 |
|
---|
[2193] | 3035 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
[2767] | 3036 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
[2193] | 3037 | std::vector<int> currentEdge;
|
---|
[2773] | 3038 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
[2193] | 3039 |
|
---|
[2773] | 3040 | std::vector<float> params;
|
---|
[2767] | 3041 | int nClipped = 0;
|
---|
[2773] | 3042 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
| 3043 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
| 3044 | params, rms, finalChanMask,
|
---|
| 3045 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2193] | 3046 |
|
---|
[2773] | 3047 | if (outBaselineTable) {
|
---|
| 3048 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 3049 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 3050 | true, STBaselineFunc::Polynomial, order, std::vector<float>(),
|
---|
| 3051 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 3052 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
[2767] | 3053 | } else {
|
---|
| 3054 | setSpectrum(res, whichrow);
|
---|
| 3055 | }
|
---|
| 3056 |
|
---|
[2773] | 3057 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 3058 | coordInfo, hasSameNchan, ofs, "autoPolyBaseline()",
|
---|
| 3059 | params, nClipped);
|
---|
[2193] | 3060 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
[2047] | 3061 | }
|
---|
| 3062 |
|
---|
[2773] | 3063 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2767] | 3064 |
|
---|
[2193] | 3065 | } catch (...) {
|
---|
| 3066 | throw;
|
---|
[2047] | 3067 | }
|
---|
| 3068 | }
|
---|
| 3069 |
|
---|
[2773] | 3070 | void Scantable::chebyshevBaseline(const std::vector<bool>& mask, int order,
|
---|
| 3071 | float thresClip, int nIterClip,
|
---|
| 3072 | bool getResidual,
|
---|
| 3073 | const std::string& progressInfo,
|
---|
| 3074 | const bool outLogger, const std::string& blfile,
|
---|
| 3075 | const std::string& bltable)
|
---|
[2645] | 3076 | {
|
---|
[2774] | 3077 | /*
|
---|
[2767] | 3078 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
[2774] | 3079 | */
|
---|
[2767] | 3080 |
|
---|
[2645] | 3081 | try {
|
---|
| 3082 | ofstream ofs;
|
---|
[2773] | 3083 | String coordInfo;
|
---|
| 3084 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
[2645] | 3085 | int minNRow;
|
---|
| 3086 | int nRow = nrow();
|
---|
[2773] | 3087 | std::vector<bool> chanMask, finalChanMask;
|
---|
[2737] | 3088 | float rms;
|
---|
[2773] | 3089 | bool outBaselineTable = (bltable != "");
|
---|
| 3090 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 3091 | Vector<Double> timeSecCol;
|
---|
[2737] | 3092 |
|
---|
[2773] | 3093 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 3094 | coordInfo, hasSameNchan,
|
---|
| 3095 | progressInfo, showProgress, minNRow,
|
---|
| 3096 | timeSecCol);
|
---|
[2737] | 3097 |
|
---|
[2773] | 3098 | std::vector<int> nChanNos;
|
---|
| 3099 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 3100 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
| 3101 | &Scantable::getChebyshevPolynomial,
|
---|
| 3102 | nChanNos);
|
---|
| 3103 |
|
---|
[2645] | 3104 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
| 3105 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
| 3106 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
[2773] | 3107 |
|
---|
| 3108 | std::vector<float> params;
|
---|
[2645] | 3109 | int nClipped = 0;
|
---|
[2773] | 3110 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
| 3111 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
| 3112 | params, rms, finalChanMask,
|
---|
| 3113 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2645] | 3114 |
|
---|
[2773] | 3115 | if (outBaselineTable) {
|
---|
| 3116 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 3117 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 3118 | true, STBaselineFunc::Chebyshev, order, std::vector<float>(),
|
---|
| 3119 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 3120 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
[2737] | 3121 | } else {
|
---|
| 3122 | setSpectrum(res, whichrow);
|
---|
| 3123 | }
|
---|
| 3124 |
|
---|
[2773] | 3125 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 3126 | coordInfo, hasSameNchan, ofs, "chebyshevBaseline()",
|
---|
| 3127 | params, nClipped);
|
---|
[2645] | 3128 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
| 3129 | }
|
---|
| 3130 |
|
---|
[2773] | 3131 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2737] | 3132 |
|
---|
[2645] | 3133 | } catch (...) {
|
---|
| 3134 | throw;
|
---|
| 3135 | }
|
---|
[2767] | 3136 |
|
---|
[2774] | 3137 | /*
|
---|
[2767] | 3138 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
| 3139 | double elapse1 = TimeEnd - TimeStart;
|
---|
| 3140 | std::cout << "cheby : " << elapse1 << " (sec.)" << endl;
|
---|
[2774] | 3141 | */
|
---|
[2645] | 3142 | }
|
---|
| 3143 |
|
---|
[2773] | 3144 | void Scantable::autoChebyshevBaseline(const std::vector<bool>& mask, int order,
|
---|
| 3145 | float thresClip, int nIterClip,
|
---|
| 3146 | const std::vector<int>& edge,
|
---|
| 3147 | float threshold, int chanAvgLimit,
|
---|
| 3148 | bool getResidual,
|
---|
| 3149 | const std::string& progressInfo,
|
---|
| 3150 | const bool outLogger, const std::string& blfile,
|
---|
| 3151 | const std::string& bltable)
|
---|
[2767] | 3152 | {
|
---|
| 3153 | try {
|
---|
| 3154 | ofstream ofs;
|
---|
[2773] | 3155 | String coordInfo;
|
---|
| 3156 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
[2767] | 3157 | int minNRow;
|
---|
| 3158 | int nRow = nrow();
|
---|
[2773] | 3159 | std::vector<bool> chanMask, finalChanMask;
|
---|
[2767] | 3160 | float rms;
|
---|
[2773] | 3161 | bool outBaselineTable = (bltable != "");
|
---|
| 3162 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 3163 | Vector<Double> timeSecCol;
|
---|
| 3164 | STLineFinder lineFinder = STLineFinder();
|
---|
[2767] | 3165 |
|
---|
[2773] | 3166 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 3167 | coordInfo, hasSameNchan,
|
---|
| 3168 | progressInfo, showProgress, minNRow,
|
---|
| 3169 | timeSecCol);
|
---|
[2767] | 3170 |
|
---|
[2773] | 3171 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
| 3172 |
|
---|
| 3173 | std::vector<int> nChanNos;
|
---|
| 3174 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 3175 | modelReservoir = getPolynomialModelReservoir(order,
|
---|
| 3176 | &Scantable::getChebyshevPolynomial,
|
---|
| 3177 | nChanNos);
|
---|
| 3178 |
|
---|
[2767] | 3179 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
| 3180 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
| 3181 | std::vector<int> currentEdge;
|
---|
[2773] | 3182 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
[2767] | 3183 |
|
---|
[2773] | 3184 | std::vector<float> params;
|
---|
[2767] | 3185 | int nClipped = 0;
|
---|
[2773] | 3186 | std::vector<float> res = doLeastSquareFitting(sp, chanMask,
|
---|
| 3187 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
| 3188 | params, rms, finalChanMask,
|
---|
| 3189 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2767] | 3190 |
|
---|
[2773] | 3191 | if (outBaselineTable) {
|
---|
| 3192 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 3193 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 3194 | true, STBaselineFunc::Chebyshev, order, std::vector<float>(),
|
---|
| 3195 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 3196 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
[2767] | 3197 | } else {
|
---|
| 3198 | setSpectrum(res, whichrow);
|
---|
| 3199 | }
|
---|
| 3200 |
|
---|
[2773] | 3201 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 3202 | coordInfo, hasSameNchan, ofs, "autoChebyshevBaseline()",
|
---|
| 3203 | params, nClipped);
|
---|
[2767] | 3204 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
| 3205 | }
|
---|
| 3206 |
|
---|
[2773] | 3207 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2767] | 3208 |
|
---|
| 3209 | } catch (...) {
|
---|
| 3210 | throw;
|
---|
| 3211 | }
|
---|
| 3212 | }
|
---|
| 3213 |
|
---|
[2774] | 3214 | double Scantable::calculateModelSelectionCriteria(const std::string& valname,
|
---|
| 3215 | const std::string& blfunc,
|
---|
| 3216 | int order,
|
---|
| 3217 | const std::vector<bool>& inMask,
|
---|
| 3218 | int whichrow,
|
---|
| 3219 | bool useLineFinder,
|
---|
| 3220 | const std::vector<int>& edge,
|
---|
| 3221 | float threshold,
|
---|
| 3222 | int chanAvgLimit)
|
---|
[2713] | 3223 | {
|
---|
[2767] | 3224 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
| 3225 | std::vector<bool> chanMask;
|
---|
| 3226 | chanMask.clear();
|
---|
| 3227 |
|
---|
[2713] | 3228 | if (useLineFinder) {
|
---|
[2774] | 3229 | STLineFinder lineFinder = STLineFinder();
|
---|
| 3230 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
[2713] | 3231 | std::vector<int> currentEdge;
|
---|
[2774] | 3232 | chanMask = getCompositeChanMask(whichrow, inMask, edge, currentEdge, lineFinder);
|
---|
[2713] | 3233 | } else {
|
---|
[2767] | 3234 | chanMask = getCompositeChanMask(whichrow, inMask);
|
---|
[2713] | 3235 | }
|
---|
| 3236 |
|
---|
[2767] | 3237 | return doCalculateModelSelectionCriteria(valname, sp, chanMask, blfunc, order);
|
---|
[2713] | 3238 | }
|
---|
| 3239 |
|
---|
| 3240 | double Scantable::doCalculateModelSelectionCriteria(const std::string& valname, const std::vector<float>& spec, const std::vector<bool>& mask, const std::string& blfunc, int order)
|
---|
| 3241 | {
|
---|
| 3242 | int nparam;
|
---|
| 3243 | std::vector<float> params;
|
---|
[2737] | 3244 | std::vector<bool> finalChanMask;
|
---|
| 3245 | float rms;
|
---|
[2713] | 3246 | int nClipped = 0;
|
---|
| 3247 | std::vector<float> res;
|
---|
[2767] | 3248 | if (blfunc == "poly") {
|
---|
[2713] | 3249 | nparam = order + 1;
|
---|
[2767] | 3250 | res = doPolynomialFitting(spec, mask, order, params, rms, finalChanMask, nClipped);
|
---|
| 3251 | } else if (blfunc == "chebyshev") {
|
---|
| 3252 | nparam = order + 1;
|
---|
| 3253 | res = doChebyshevFitting(spec, mask, order, params, rms, finalChanMask, nClipped);
|
---|
| 3254 | } else if (blfunc == "cspline") {
|
---|
| 3255 | std::vector<int> pieceEdges;//(order+1); //order = npiece
|
---|
| 3256 | nparam = order + 3;
|
---|
| 3257 | res = doCubicSplineFitting(spec, mask, order, false, pieceEdges, params, rms, finalChanMask, nClipped);
|
---|
[2713] | 3258 | } else if (blfunc == "sinusoid") {
|
---|
| 3259 | std::vector<int> nWaves;
|
---|
| 3260 | nWaves.clear();
|
---|
| 3261 | for (int i = 0; i <= order; ++i) {
|
---|
| 3262 | nWaves.push_back(i);
|
---|
| 3263 | }
|
---|
| 3264 | nparam = 2*order + 1; // order = nwave
|
---|
[2767] | 3265 | res = doSinusoidFitting(spec, mask, nWaves, params, rms, finalChanMask, nClipped);
|
---|
[2713] | 3266 | } else {
|
---|
[2767] | 3267 | throw(AipsError("blfunc must be poly, chebyshev, cspline or sinusoid."));
|
---|
[2713] | 3268 | }
|
---|
| 3269 |
|
---|
| 3270 | double msq = 0.0;
|
---|
| 3271 | int nusedchan = 0;
|
---|
| 3272 | int nChan = res.size();
|
---|
| 3273 | for (int i = 0; i < nChan; ++i) {
|
---|
| 3274 | if (mask[i]) {
|
---|
| 3275 | msq += (double)res[i]*(double)res[i];
|
---|
| 3276 | nusedchan++;
|
---|
| 3277 | }
|
---|
| 3278 | }
|
---|
| 3279 | if (nusedchan == 0) {
|
---|
| 3280 | throw(AipsError("all channels masked."));
|
---|
| 3281 | }
|
---|
| 3282 | msq /= (double)nusedchan;
|
---|
| 3283 |
|
---|
| 3284 | nparam++; //add 1 for sigma of Gaussian distribution
|
---|
| 3285 | const double PI = 6.0 * asin(0.5); // PI (= 3.141592653...)
|
---|
| 3286 |
|
---|
| 3287 | if (valname.find("aic") == 0) {
|
---|
| 3288 | // Original Akaike Information Criterion (AIC)
|
---|
| 3289 | double aic = nusedchan * (log(2.0 * PI * msq) + 1.0) + 2.0 * nparam;
|
---|
| 3290 |
|
---|
[2767] | 3291 | // Corrected AIC by Sugiura(1978) (AICc)
|
---|
[2713] | 3292 | if (valname == "aicc") {
|
---|
| 3293 | if (nusedchan - nparam - 1 <= 0) {
|
---|
| 3294 | throw(AipsError("channel size is too small to calculate AICc."));
|
---|
| 3295 | }
|
---|
| 3296 | aic += 2.0*nparam*(nparam + 1)/(double)(nusedchan - nparam - 1);
|
---|
| 3297 | }
|
---|
| 3298 |
|
---|
| 3299 | return aic;
|
---|
| 3300 |
|
---|
| 3301 | } else if (valname == "bic") {
|
---|
| 3302 | // Bayesian Information Criterion (BIC)
|
---|
| 3303 | double bic = nusedchan * log(msq) + nparam * log((double)nusedchan);
|
---|
| 3304 | return bic;
|
---|
| 3305 |
|
---|
| 3306 | } else if (valname == "gcv") {
|
---|
| 3307 | // Generalised Cross Validation
|
---|
| 3308 | double x = 1.0 - (double)nparam / (double)nusedchan;
|
---|
| 3309 | double gcv = msq / (x * x);
|
---|
| 3310 | return gcv;
|
---|
| 3311 |
|
---|
| 3312 | } else {
|
---|
| 3313 | throw(AipsError("valname must be aic, aicc, bic or gcv."));
|
---|
| 3314 | }
|
---|
| 3315 | }
|
---|
| 3316 |
|
---|
[2767] | 3317 | double Scantable::getNormalPolynomial(int n, double x) {
|
---|
| 3318 | if (n == 0) {
|
---|
| 3319 | return 1.0;
|
---|
| 3320 | } else if (n > 0) {
|
---|
| 3321 | double res = 1.0;
|
---|
| 3322 | for (int i = 0; i < n; ++i) {
|
---|
| 3323 | res *= x;
|
---|
[2645] | 3324 | }
|
---|
[2767] | 3325 | return res;
|
---|
| 3326 | } else {
|
---|
| 3327 | if (x == 0.0) {
|
---|
| 3328 | throw(AipsError("infinity result: x=0 given for negative power."));
|
---|
| 3329 | } else {
|
---|
| 3330 | return pow(x, (double)n);
|
---|
[2645] | 3331 | }
|
---|
| 3332 | }
|
---|
| 3333 | }
|
---|
| 3334 |
|
---|
| 3335 | double Scantable::getChebyshevPolynomial(int n, double x) {
|
---|
| 3336 | if ((x < -1.0)||(x > 1.0)) {
|
---|
| 3337 | throw(AipsError("out of definition range (-1 <= x <= 1)."));
|
---|
[2713] | 3338 | } else if (x == 1.0) {
|
---|
| 3339 | return 1.0;
|
---|
| 3340 | } else if (x == 0.0) {
|
---|
| 3341 | double res;
|
---|
| 3342 | if (n%2 == 0) {
|
---|
| 3343 | if (n%4 == 0) {
|
---|
| 3344 | res = 1.0;
|
---|
| 3345 | } else {
|
---|
| 3346 | res = -1.0;
|
---|
| 3347 | }
|
---|
| 3348 | } else {
|
---|
| 3349 | res = 0.0;
|
---|
| 3350 | }
|
---|
| 3351 | return res;
|
---|
| 3352 | } else if (x == -1.0) {
|
---|
| 3353 | double res = (n%2 == 0 ? 1.0 : -1.0);
|
---|
| 3354 | return res;
|
---|
[2645] | 3355 | } else if (n < 0) {
|
---|
| 3356 | throw(AipsError("the order must be zero or positive."));
|
---|
| 3357 | } else if (n == 0) {
|
---|
| 3358 | return 1.0;
|
---|
| 3359 | } else if (n == 1) {
|
---|
| 3360 | return x;
|
---|
| 3361 | } else {
|
---|
| 3362 | double res = 0.0;
|
---|
| 3363 | for (int m = 0; m <= n/2; ++m) {
|
---|
| 3364 | double c = 1.0;
|
---|
| 3365 | if (m > 0) {
|
---|
| 3366 | for (int i = 1; i <= m; ++i) {
|
---|
| 3367 | c *= (double)(n-2*m+i)/(double)i;
|
---|
| 3368 | }
|
---|
| 3369 | }
|
---|
[2713] | 3370 | res += (m%2 == 0 ? 1.0 : -1.0)*(double)n/(double)(n-m)*pow(2.0*x, (double)(n-2*m))/2.0*c;
|
---|
[2645] | 3371 | }
|
---|
| 3372 | return res;
|
---|
| 3373 | }
|
---|
| 3374 | }
|
---|
| 3375 |
|
---|
[2773] | 3376 | std::vector<float> Scantable::doPolynomialFitting(const std::vector<float>& data,
|
---|
| 3377 | const std::vector<bool>& mask,
|
---|
| 3378 | int order,
|
---|
| 3379 | std::vector<float>& params,
|
---|
| 3380 | float& rms,
|
---|
| 3381 | std::vector<bool>& finalmask,
|
---|
| 3382 | float clipth,
|
---|
| 3383 | int clipn)
|
---|
[2645] | 3384 | {
|
---|
[2767] | 3385 | int nClipped = 0;
|
---|
| 3386 | return doPolynomialFitting(data, mask, order, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
| 3387 | }
|
---|
| 3388 |
|
---|
[2773] | 3389 | std::vector<float> Scantable::doPolynomialFitting(const std::vector<float>& data,
|
---|
| 3390 | const std::vector<bool>& mask,
|
---|
| 3391 | int order,
|
---|
| 3392 | std::vector<float>& params,
|
---|
| 3393 | float& rms,
|
---|
| 3394 | std::vector<bool>& finalMask,
|
---|
| 3395 | int& nClipped,
|
---|
| 3396 | float thresClip,
|
---|
| 3397 | int nIterClip,
|
---|
| 3398 | bool getResidual)
|
---|
[2767] | 3399 | {
|
---|
[2773] | 3400 | return doLeastSquareFitting(data, mask,
|
---|
| 3401 | getPolynomialModel(order, data.size(), &Scantable::getNormalPolynomial),
|
---|
| 3402 | params, rms, finalMask,
|
---|
| 3403 | nClipped, thresClip, nIterClip,
|
---|
| 3404 | getResidual);
|
---|
[2767] | 3405 | }
|
---|
| 3406 |
|
---|
[2773] | 3407 | std::vector<float> Scantable::doChebyshevFitting(const std::vector<float>& data,
|
---|
| 3408 | const std::vector<bool>& mask,
|
---|
| 3409 | int order,
|
---|
| 3410 | std::vector<float>& params,
|
---|
| 3411 | float& rms,
|
---|
| 3412 | std::vector<bool>& finalmask,
|
---|
| 3413 | float clipth,
|
---|
| 3414 | int clipn)
|
---|
[2767] | 3415 | {
|
---|
| 3416 | int nClipped = 0;
|
---|
| 3417 | return doChebyshevFitting(data, mask, order, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
| 3418 | }
|
---|
| 3419 |
|
---|
[2773] | 3420 | std::vector<float> Scantable::doChebyshevFitting(const std::vector<float>& data,
|
---|
| 3421 | const std::vector<bool>& mask,
|
---|
| 3422 | int order,
|
---|
| 3423 | std::vector<float>& params,
|
---|
| 3424 | float& rms,
|
---|
| 3425 | std::vector<bool>& finalMask,
|
---|
| 3426 | int& nClipped,
|
---|
| 3427 | float thresClip,
|
---|
| 3428 | int nIterClip,
|
---|
| 3429 | bool getResidual)
|
---|
[2767] | 3430 | {
|
---|
[2773] | 3431 | return doLeastSquareFitting(data, mask,
|
---|
| 3432 | getPolynomialModel(order, data.size(), &Scantable::getChebyshevPolynomial),
|
---|
| 3433 | params, rms, finalMask,
|
---|
| 3434 | nClipped, thresClip, nIterClip,
|
---|
| 3435 | getResidual);
|
---|
[2767] | 3436 | }
|
---|
| 3437 |
|
---|
[2773] | 3438 | std::vector<std::vector<double> > Scantable::getPolynomialModel(int order, int nchan, double (Scantable::*pfunc)(int, double))
|
---|
[2767] | 3439 | {
|
---|
[2773] | 3440 | // model : contains model values for computing the least-square matrix.
|
---|
| 3441 | // model.size() is nmodel and model[*].size() is nchan.
|
---|
| 3442 | // Each model element are as follows:
|
---|
| 3443 | //
|
---|
| 3444 | // (for normal polynomials)
|
---|
| 3445 | // model[0] = {1.0, 1.0, 1.0, ..., 1.0},
|
---|
| 3446 | // model[1] = {0.0, 1.0, 2.0, ..., (nchan-1)}
|
---|
| 3447 | // model[n-1] = ...,
|
---|
| 3448 | // model[n] = {0.0^n, 1.0^n, 2.0^n, ..., (nchan-1)^n}
|
---|
| 3449 | // where (0 <= n <= order)
|
---|
| 3450 | //
|
---|
| 3451 | // (for Chebyshev polynomials)
|
---|
| 3452 | // model[0] = {T0(-1), T0(2/(nchan-1)-1), T0(4/(nchan-1)-1), ..., T0(1)},
|
---|
| 3453 | // model[n-1] = ...,
|
---|
| 3454 | // model[n] = {Tn(-1), Tn(2/(nchan-1)-1), Tn(4/(nchan-1)-1), ..., Tn(1)}
|
---|
| 3455 | // where (0 <= n <= order),
|
---|
| 3456 |
|
---|
| 3457 | int nmodel = order + 1;
|
---|
| 3458 | std::vector<std::vector<double> > model(nmodel, std::vector<double>(nchan));
|
---|
| 3459 |
|
---|
| 3460 | double stretch, shift;
|
---|
| 3461 | if (pfunc == &Scantable::getChebyshevPolynomial) {
|
---|
| 3462 | stretch = 2.0/(double)(nchan - 1);
|
---|
| 3463 | shift = -1.0;
|
---|
| 3464 | } else {
|
---|
| 3465 | stretch = 1.0;
|
---|
| 3466 | shift = 0.0;
|
---|
[2645] | 3467 | }
|
---|
[2773] | 3468 |
|
---|
| 3469 | for (int i = 0; i < nmodel; ++i) {
|
---|
| 3470 | for (int j = 0; j < nchan; ++j) {
|
---|
| 3471 | model[i][j] = (this->*pfunc)(i, stretch*(double)j + shift);
|
---|
| 3472 | }
|
---|
[2645] | 3473 | }
|
---|
| 3474 |
|
---|
[2773] | 3475 | return model;
|
---|
| 3476 | }
|
---|
| 3477 |
|
---|
| 3478 | std::vector<std::vector<std::vector<double> > > Scantable::getPolynomialModelReservoir(int order,
|
---|
| 3479 | double (Scantable::*pfunc)(int, double),
|
---|
| 3480 | std::vector<int>& nChanNos)
|
---|
| 3481 | {
|
---|
| 3482 | std::vector<std::vector<std::vector<double> > > res;
|
---|
| 3483 | res.clear();
|
---|
| 3484 | nChanNos.clear();
|
---|
| 3485 |
|
---|
| 3486 | std::vector<uint> ifNos = getIFNos();
|
---|
| 3487 | for (uint i = 0; i < ifNos.size(); ++i) {
|
---|
| 3488 | int currNchan = nchan(ifNos[i]);
|
---|
| 3489 | bool hasDifferentNchan = (i == 0);
|
---|
| 3490 | for (uint j = 0; j < i; ++j) {
|
---|
| 3491 | if (currNchan != nchan(ifNos[j])) {
|
---|
| 3492 | hasDifferentNchan = true;
|
---|
| 3493 | break;
|
---|
| 3494 | }
|
---|
| 3495 | }
|
---|
| 3496 | if (hasDifferentNchan) {
|
---|
| 3497 | res.push_back(getPolynomialModel(order, currNchan, pfunc));
|
---|
| 3498 | nChanNos.push_back(currNchan);
|
---|
| 3499 | }
|
---|
| 3500 | }
|
---|
| 3501 |
|
---|
| 3502 | return res;
|
---|
| 3503 | }
|
---|
| 3504 |
|
---|
| 3505 | std::vector<float> Scantable::doLeastSquareFitting(const std::vector<float>& data,
|
---|
| 3506 | const std::vector<bool>& mask,
|
---|
| 3507 | const std::vector<std::vector<double> >& model,
|
---|
| 3508 | std::vector<float>& params,
|
---|
| 3509 | float& rms,
|
---|
| 3510 | std::vector<bool>& finalMask,
|
---|
| 3511 | int& nClipped,
|
---|
| 3512 | float thresClip,
|
---|
| 3513 | int nIterClip,
|
---|
| 3514 | bool getResidual)
|
---|
| 3515 | {
|
---|
| 3516 | int nDOF = model.size();
|
---|
[2645] | 3517 | int nChan = data.size();
|
---|
[2737] | 3518 |
|
---|
[2773] | 3519 | if (nDOF == 0) {
|
---|
| 3520 | throw(AipsError("no model data given"));
|
---|
| 3521 | }
|
---|
| 3522 | if (nChan < 2) {
|
---|
| 3523 | throw(AipsError("data size is too few"));
|
---|
| 3524 | }
|
---|
| 3525 | if (nChan != (int)mask.size()) {
|
---|
| 3526 | throw(AipsError("data and mask sizes are not identical"));
|
---|
| 3527 | }
|
---|
| 3528 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 3529 | if (nChan != (int)model[i].size()) {
|
---|
| 3530 | throw(AipsError("data and model sizes are not identical"));
|
---|
| 3531 | }
|
---|
| 3532 | }
|
---|
| 3533 |
|
---|
| 3534 | params.clear();
|
---|
| 3535 | params.resize(nDOF);
|
---|
| 3536 |
|
---|
[2737] | 3537 | finalMask.clear();
|
---|
| 3538 | finalMask.resize(nChan);
|
---|
| 3539 |
|
---|
[2773] | 3540 | std::vector<int> maskArray(nChan);
|
---|
| 3541 | int j = 0;
|
---|
[2645] | 3542 | for (int i = 0; i < nChan; ++i) {
|
---|
[2773] | 3543 | maskArray[i] = mask[i] ? 1 : 0;
|
---|
[2645] | 3544 | if (mask[i]) {
|
---|
[2773] | 3545 | j++;
|
---|
[2645] | 3546 | }
|
---|
[2737] | 3547 | finalMask[i] = mask[i];
|
---|
[2645] | 3548 | }
|
---|
| 3549 |
|
---|
[2773] | 3550 | int initNData = j;
|
---|
[2645] | 3551 | int nData = initNData;
|
---|
| 3552 |
|
---|
[2773] | 3553 | std::vector<double> z1(nChan), r1(nChan), residual(nChan);
|
---|
[2645] | 3554 | for (int i = 0; i < nChan; ++i) {
|
---|
[2773] | 3555 | z1[i] = (double)data[i];
|
---|
| 3556 | r1[i] = 0.0;
|
---|
| 3557 | residual[i] = 0.0;
|
---|
[2645] | 3558 | }
|
---|
| 3559 |
|
---|
| 3560 | for (int nClip = 0; nClip < nIterClip+1; ++nClip) {
|
---|
| 3561 | // xMatrix : horizontal concatenation of
|
---|
| 3562 | // the least-sq. matrix (left) and an
|
---|
| 3563 | // identity matrix (right).
|
---|
| 3564 | // the right part is used to calculate the inverse matrix of the left part.
|
---|
| 3565 | double xMatrix[nDOF][2*nDOF];
|
---|
| 3566 | double zMatrix[nDOF];
|
---|
| 3567 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 3568 | for (int j = 0; j < 2*nDOF; ++j) {
|
---|
| 3569 | xMatrix[i][j] = 0.0;
|
---|
| 3570 | }
|
---|
| 3571 | xMatrix[i][nDOF+i] = 1.0;
|
---|
| 3572 | zMatrix[i] = 0.0;
|
---|
| 3573 | }
|
---|
| 3574 |
|
---|
| 3575 | int nUseData = 0;
|
---|
| 3576 | for (int k = 0; k < nChan; ++k) {
|
---|
| 3577 | if (maskArray[k] == 0) continue;
|
---|
| 3578 |
|
---|
| 3579 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 3580 | for (int j = i; j < nDOF; ++j) {
|
---|
[2773] | 3581 | xMatrix[i][j] += model[i][k] * model[j][k];
|
---|
[2645] | 3582 | }
|
---|
[2773] | 3583 | zMatrix[i] += z1[k] * model[i][k];
|
---|
[2645] | 3584 | }
|
---|
| 3585 |
|
---|
| 3586 | nUseData++;
|
---|
| 3587 | }
|
---|
| 3588 |
|
---|
| 3589 | if (nUseData < 1) {
|
---|
| 3590 | throw(AipsError("all channels clipped or masked. can't execute fitting anymore."));
|
---|
| 3591 | }
|
---|
| 3592 |
|
---|
| 3593 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 3594 | for (int j = 0; j < i; ++j) {
|
---|
| 3595 | xMatrix[i][j] = xMatrix[j][i];
|
---|
| 3596 | }
|
---|
| 3597 | }
|
---|
| 3598 |
|
---|
[2773] | 3599 | std::vector<double> invDiag(nDOF);
|
---|
[2645] | 3600 | for (int i = 0; i < nDOF; ++i) {
|
---|
[2773] | 3601 | invDiag[i] = 1.0 / xMatrix[i][i];
|
---|
[2645] | 3602 | for (int j = 0; j < nDOF; ++j) {
|
---|
| 3603 | xMatrix[i][j] *= invDiag[i];
|
---|
| 3604 | }
|
---|
| 3605 | }
|
---|
| 3606 |
|
---|
| 3607 | for (int k = 0; k < nDOF; ++k) {
|
---|
| 3608 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 3609 | if (i != k) {
|
---|
| 3610 | double factor1 = xMatrix[k][k];
|
---|
[2773] | 3611 | double invfactor1 = 1.0 / factor1;
|
---|
[2645] | 3612 | double factor2 = xMatrix[i][k];
|
---|
| 3613 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
| 3614 | xMatrix[i][j] *= factor1;
|
---|
| 3615 | xMatrix[i][j] -= xMatrix[k][j]*factor2;
|
---|
[2773] | 3616 | xMatrix[i][j] *= invfactor1;
|
---|
[2645] | 3617 | }
|
---|
| 3618 | }
|
---|
| 3619 | }
|
---|
[2773] | 3620 | double invXDiag = 1.0 / xMatrix[k][k];
|
---|
[2645] | 3621 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
[2773] | 3622 | xMatrix[k][j] *= invXDiag;
|
---|
[2645] | 3623 | }
|
---|
| 3624 | }
|
---|
| 3625 |
|
---|
| 3626 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 3627 | for (int j = 0; j < nDOF; ++j) {
|
---|
| 3628 | xMatrix[i][nDOF+j] *= invDiag[j];
|
---|
| 3629 | }
|
---|
| 3630 | }
|
---|
[2773] | 3631 | //compute a vector y in which coefficients of the best-fit
|
---|
| 3632 | //model functions are stored.
|
---|
| 3633 | //in case of polynomials, y consists of (a0,a1,a2,...)
|
---|
| 3634 | //where ai is the coefficient of the term x^i.
|
---|
| 3635 | //in case of sinusoids, y consists of (a0,s1,c1,s2,c2,...)
|
---|
| 3636 | //where a0 is constant term and s* and c* are of sine
|
---|
| 3637 | //and cosine functions, respectively.
|
---|
| 3638 | std::vector<double> y(nDOF);
|
---|
[2645] | 3639 | for (int i = 0; i < nDOF; ++i) {
|
---|
[2773] | 3640 | y[i] = 0.0;
|
---|
[2645] | 3641 | for (int j = 0; j < nDOF; ++j) {
|
---|
| 3642 | y[i] += xMatrix[i][nDOF+j]*zMatrix[j];
|
---|
| 3643 | }
|
---|
[2773] | 3644 | params[i] = (float)y[i];
|
---|
[2645] | 3645 | }
|
---|
| 3646 |
|
---|
| 3647 | for (int i = 0; i < nChan; ++i) {
|
---|
| 3648 | r1[i] = y[0];
|
---|
| 3649 | for (int j = 1; j < nDOF; ++j) {
|
---|
[2773] | 3650 | r1[i] += y[j]*model[j][i];
|
---|
[2645] | 3651 | }
|
---|
| 3652 | residual[i] = z1[i] - r1[i];
|
---|
| 3653 | }
|
---|
| 3654 |
|
---|
[2737] | 3655 | double stdDev = 0.0;
|
---|
| 3656 | for (int i = 0; i < nChan; ++i) {
|
---|
| 3657 | stdDev += residual[i]*residual[i]*(double)maskArray[i];
|
---|
| 3658 | }
|
---|
| 3659 | stdDev = sqrt(stdDev/(double)nData);
|
---|
| 3660 | rms = (float)stdDev;
|
---|
| 3661 |
|
---|
[2645] | 3662 | if ((nClip == nIterClip) || (thresClip <= 0.0)) {
|
---|
| 3663 | break;
|
---|
| 3664 | } else {
|
---|
[2737] | 3665 |
|
---|
[2645] | 3666 | double thres = stdDev * thresClip;
|
---|
| 3667 | int newNData = 0;
|
---|
| 3668 | for (int i = 0; i < nChan; ++i) {
|
---|
| 3669 | if (abs(residual[i]) >= thres) {
|
---|
| 3670 | maskArray[i] = 0;
|
---|
[2737] | 3671 | finalMask[i] = false;
|
---|
[2645] | 3672 | }
|
---|
| 3673 | if (maskArray[i] > 0) {
|
---|
| 3674 | newNData++;
|
---|
| 3675 | }
|
---|
| 3676 | }
|
---|
| 3677 | if (newNData == nData) {
|
---|
| 3678 | break; //no more flag to add. iteration stops.
|
---|
| 3679 | } else {
|
---|
| 3680 | nData = newNData;
|
---|
| 3681 | }
|
---|
[2737] | 3682 |
|
---|
[2645] | 3683 | }
|
---|
| 3684 | }
|
---|
| 3685 |
|
---|
| 3686 | nClipped = initNData - nData;
|
---|
| 3687 |
|
---|
[2773] | 3688 | std::vector<float> result(nChan);
|
---|
[2645] | 3689 | if (getResidual) {
|
---|
| 3690 | for (int i = 0; i < nChan; ++i) {
|
---|
[2773] | 3691 | result[i] = (float)residual[i];
|
---|
[2645] | 3692 | }
|
---|
| 3693 | } else {
|
---|
| 3694 | for (int i = 0; i < nChan; ++i) {
|
---|
[2773] | 3695 | result[i] = (float)r1[i];
|
---|
[2645] | 3696 | }
|
---|
| 3697 | }
|
---|
| 3698 |
|
---|
| 3699 | return result;
|
---|
| 3700 | }
|
---|
| 3701 |
|
---|
[2773] | 3702 | void Scantable::cubicSplineBaseline(const std::vector<bool>& mask, int nPiece,
|
---|
| 3703 | float thresClip, int nIterClip,
|
---|
| 3704 | bool getResidual,
|
---|
| 3705 | const std::string& progressInfo,
|
---|
| 3706 | const bool outLogger, const std::string& blfile,
|
---|
| 3707 | const std::string& bltable)
|
---|
[2081] | 3708 | {
|
---|
[2774] | 3709 | /****
|
---|
[2773] | 3710 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
[2774] | 3711 | ****/
|
---|
[2773] | 3712 |
|
---|
[2193] | 3713 | try {
|
---|
| 3714 | ofstream ofs;
|
---|
[2773] | 3715 | String coordInfo;
|
---|
| 3716 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
[2193] | 3717 | int minNRow;
|
---|
[2344] | 3718 | int nRow = nrow();
|
---|
[2773] | 3719 | std::vector<bool> chanMask, finalChanMask;
|
---|
[2767] | 3720 | float rms;
|
---|
[2773] | 3721 | bool outBaselineTable = (bltable != "");
|
---|
| 3722 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 3723 | Vector<Double> timeSecCol;
|
---|
[2344] | 3724 |
|
---|
[2773] | 3725 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 3726 | coordInfo, hasSameNchan,
|
---|
| 3727 | progressInfo, showProgress, minNRow,
|
---|
| 3728 | timeSecCol);
|
---|
[2767] | 3729 |
|
---|
[2773] | 3730 | std::vector<int> nChanNos;
|
---|
| 3731 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 3732 | modelReservoir = getPolynomialModelReservoir(3,
|
---|
| 3733 | &Scantable::getNormalPolynomial,
|
---|
| 3734 | nChanNos);
|
---|
[2767] | 3735 |
|
---|
[2193] | 3736 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
[2591] | 3737 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
[2193] | 3738 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
[2773] | 3739 |
|
---|
| 3740 | std::vector<int> pieceEdges;
|
---|
| 3741 | std::vector<float> params;
|
---|
[2193] | 3742 | int nClipped = 0;
|
---|
[2773] | 3743 | std::vector<float> res = doCubicSplineLeastSquareFitting(sp, chanMask,
|
---|
| 3744 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
| 3745 | nPiece, false, pieceEdges, params, rms, finalChanMask,
|
---|
| 3746 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2591] | 3747 |
|
---|
[2773] | 3748 | if (outBaselineTable) {
|
---|
| 3749 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 3750 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 3751 | true, STBaselineFunc::CSpline, pieceEdges, std::vector<float>(),
|
---|
| 3752 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 3753 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
[2767] | 3754 | } else {
|
---|
| 3755 | setSpectrum(res, whichrow);
|
---|
| 3756 | }
|
---|
[2591] | 3757 |
|
---|
[2773] | 3758 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 3759 | coordInfo, hasSameNchan, ofs, "cubicSplineBaseline()",
|
---|
| 3760 | pieceEdges, params, nClipped);
|
---|
[2193] | 3761 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
| 3762 | }
|
---|
[2344] | 3763 |
|
---|
[2773] | 3764 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2767] | 3765 |
|
---|
[2193] | 3766 | } catch (...) {
|
---|
| 3767 | throw;
|
---|
[2012] | 3768 | }
|
---|
[2773] | 3769 |
|
---|
[2774] | 3770 | /****
|
---|
[2773] | 3771 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
| 3772 | double elapse1 = TimeEnd - TimeStart;
|
---|
| 3773 | std::cout << "cspline-new : " << elapse1 << " (sec.)" << endl;
|
---|
[2774] | 3774 | ****/
|
---|
[2012] | 3775 | }
|
---|
| 3776 |
|
---|
[2773] | 3777 | void Scantable::autoCubicSplineBaseline(const std::vector<bool>& mask, int nPiece,
|
---|
| 3778 | float thresClip, int nIterClip,
|
---|
| 3779 | const std::vector<int>& edge,
|
---|
| 3780 | float threshold, int chanAvgLimit,
|
---|
| 3781 | bool getResidual,
|
---|
| 3782 | const std::string& progressInfo,
|
---|
| 3783 | const bool outLogger, const std::string& blfile,
|
---|
| 3784 | const std::string& bltable)
|
---|
[2012] | 3785 | {
|
---|
[2193] | 3786 | try {
|
---|
| 3787 | ofstream ofs;
|
---|
[2773] | 3788 | String coordInfo;
|
---|
| 3789 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
[2767] | 3790 | int minNRow;
|
---|
| 3791 | int nRow = nrow();
|
---|
[2773] | 3792 | std::vector<bool> chanMask, finalChanMask;
|
---|
[2767] | 3793 | float rms;
|
---|
[2773] | 3794 | bool outBaselineTable = (bltable != "");
|
---|
| 3795 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 3796 | Vector<Double> timeSecCol;
|
---|
| 3797 | STLineFinder lineFinder = STLineFinder();
|
---|
[2189] | 3798 |
|
---|
[2773] | 3799 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 3800 | coordInfo, hasSameNchan,
|
---|
| 3801 | progressInfo, showProgress, minNRow,
|
---|
| 3802 | timeSecCol);
|
---|
[2767] | 3803 |
|
---|
[2773] | 3804 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
| 3805 |
|
---|
| 3806 | std::vector<int> nChanNos;
|
---|
| 3807 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 3808 | modelReservoir = getPolynomialModelReservoir(3,
|
---|
| 3809 | &Scantable::getNormalPolynomial,
|
---|
| 3810 | nChanNos);
|
---|
| 3811 |
|
---|
[2193] | 3812 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
[2591] | 3813 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
[2193] | 3814 | std::vector<int> currentEdge;
|
---|
[2773] | 3815 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
[2193] | 3816 |
|
---|
[2773] | 3817 | std::vector<int> pieceEdges;
|
---|
| 3818 | std::vector<float> params;
|
---|
[2193] | 3819 | int nClipped = 0;
|
---|
[2773] | 3820 | std::vector<float> res = doCubicSplineLeastSquareFitting(sp, chanMask,
|
---|
| 3821 | modelReservoir[getIdxOfNchan(sp.size(), nChanNos)],
|
---|
| 3822 | nPiece, false, pieceEdges, params, rms, finalChanMask,
|
---|
| 3823 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2193] | 3824 |
|
---|
[2773] | 3825 | if (outBaselineTable) {
|
---|
| 3826 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 3827 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 3828 | true, STBaselineFunc::CSpline, pieceEdges, std::vector<float>(),
|
---|
| 3829 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 3830 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
[2767] | 3831 | } else {
|
---|
| 3832 | setSpectrum(res, whichrow);
|
---|
| 3833 | }
|
---|
| 3834 |
|
---|
[2773] | 3835 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 3836 | coordInfo, hasSameNchan, ofs, "autoCubicSplineBaseline()",
|
---|
| 3837 | pieceEdges, params, nClipped);
|
---|
[2193] | 3838 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
[1907] | 3839 | }
|
---|
[2012] | 3840 |
|
---|
[2773] | 3841 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2767] | 3842 |
|
---|
[2193] | 3843 | } catch (...) {
|
---|
| 3844 | throw;
|
---|
[2012] | 3845 | }
|
---|
[1730] | 3846 | }
|
---|
[1907] | 3847 |
|
---|
[2773] | 3848 | std::vector<float> Scantable::doCubicSplineFitting(const std::vector<float>& data,
|
---|
| 3849 | const std::vector<bool>& mask,
|
---|
| 3850 | std::vector<int>& idxEdge,
|
---|
| 3851 | std::vector<float>& params,
|
---|
| 3852 | float& rms,
|
---|
| 3853 | std::vector<bool>& finalmask,
|
---|
| 3854 | float clipth,
|
---|
| 3855 | int clipn)
|
---|
[2081] | 3856 | {
|
---|
[2767] | 3857 | int nClipped = 0;
|
---|
| 3858 | return doCubicSplineFitting(data, mask, idxEdge.size()-1, true, idxEdge, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
| 3859 | }
|
---|
| 3860 |
|
---|
[2773] | 3861 | std::vector<float> Scantable::doCubicSplineFitting(const std::vector<float>& data,
|
---|
| 3862 | const std::vector<bool>& mask,
|
---|
| 3863 | int nPiece,
|
---|
| 3864 | std::vector<int>& idxEdge,
|
---|
| 3865 | std::vector<float>& params,
|
---|
| 3866 | float& rms,
|
---|
| 3867 | std::vector<bool>& finalmask,
|
---|
| 3868 | float clipth,
|
---|
| 3869 | int clipn)
|
---|
[2767] | 3870 | {
|
---|
| 3871 | int nClipped = 0;
|
---|
| 3872 | return doCubicSplineFitting(data, mask, nPiece, false, idxEdge, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
| 3873 | }
|
---|
| 3874 |
|
---|
[2773] | 3875 | std::vector<float> Scantable::doCubicSplineFitting(const std::vector<float>& data,
|
---|
| 3876 | const std::vector<bool>& mask,
|
---|
| 3877 | int nPiece,
|
---|
| 3878 | bool useGivenPieceBoundary,
|
---|
| 3879 | std::vector<int>& idxEdge,
|
---|
| 3880 | std::vector<float>& params,
|
---|
| 3881 | float& rms,
|
---|
| 3882 | std::vector<bool>& finalMask,
|
---|
| 3883 | int& nClipped,
|
---|
| 3884 | float thresClip,
|
---|
| 3885 | int nIterClip,
|
---|
| 3886 | bool getResidual)
|
---|
[2767] | 3887 | {
|
---|
[2773] | 3888 | return doCubicSplineLeastSquareFitting(data, mask,
|
---|
| 3889 | getPolynomialModel(3, data.size(), &Scantable::getNormalPolynomial),
|
---|
| 3890 | nPiece, useGivenPieceBoundary, idxEdge,
|
---|
| 3891 | params, rms, finalMask,
|
---|
| 3892 | nClipped, thresClip, nIterClip,
|
---|
| 3893 | getResidual);
|
---|
| 3894 | }
|
---|
| 3895 |
|
---|
| 3896 | std::vector<float> Scantable::doCubicSplineLeastSquareFitting(const std::vector<float>& data,
|
---|
| 3897 | const std::vector<bool>& mask,
|
---|
| 3898 | const std::vector<std::vector<double> >& model,
|
---|
| 3899 | int nPiece,
|
---|
| 3900 | bool useGivenPieceBoundary,
|
---|
| 3901 | std::vector<int>& idxEdge,
|
---|
| 3902 | std::vector<float>& params,
|
---|
| 3903 | float& rms,
|
---|
| 3904 | std::vector<bool>& finalMask,
|
---|
| 3905 | int& nClipped,
|
---|
| 3906 | float thresClip,
|
---|
| 3907 | int nIterClip,
|
---|
| 3908 | bool getResidual)
|
---|
| 3909 | {
|
---|
| 3910 | int nDOF = nPiece + 3; //number of independent parameters to solve, namely, 4+(nPiece-1).
|
---|
| 3911 | int nModel = model.size();
|
---|
| 3912 | int nChan = data.size();
|
---|
| 3913 |
|
---|
| 3914 | if (nModel != 4) {
|
---|
| 3915 | throw(AipsError("model size must be 4."));
|
---|
[2081] | 3916 | }
|
---|
[2012] | 3917 | if (nPiece < 1) {
|
---|
[2094] | 3918 | throw(AipsError("number of the sections must be one or more"));
|
---|
[2012] | 3919 | }
|
---|
[2773] | 3920 | if (nChan < 2*nPiece) {
|
---|
| 3921 | throw(AipsError("data size is too few"));
|
---|
| 3922 | }
|
---|
| 3923 | if (nChan != (int)mask.size()) {
|
---|
| 3924 | throw(AipsError("data and mask sizes are not identical"));
|
---|
| 3925 | }
|
---|
| 3926 | for (int i = 0; i < nModel; ++i) {
|
---|
| 3927 | if (nChan != (int)model[i].size()) {
|
---|
| 3928 | throw(AipsError("data and model sizes are not identical"));
|
---|
| 3929 | }
|
---|
| 3930 | }
|
---|
[2012] | 3931 |
|
---|
[2773] | 3932 | params.clear();
|
---|
| 3933 | params.resize(nPiece*nModel);
|
---|
[2767] | 3934 |
|
---|
| 3935 | finalMask.clear();
|
---|
| 3936 | finalMask.resize(nChan);
|
---|
| 3937 |
|
---|
[2344] | 3938 | std::vector<int> maskArray(nChan);
|
---|
| 3939 | std::vector<int> x(nChan);
|
---|
| 3940 | int j = 0;
|
---|
[2012] | 3941 | for (int i = 0; i < nChan; ++i) {
|
---|
[2344] | 3942 | maskArray[i] = mask[i] ? 1 : 0;
|
---|
[2012] | 3943 | if (mask[i]) {
|
---|
[2344] | 3944 | x[j] = i;
|
---|
| 3945 | j++;
|
---|
[2012] | 3946 | }
|
---|
[2767] | 3947 | finalMask[i] = mask[i];
|
---|
[2012] | 3948 | }
|
---|
[2773] | 3949 |
|
---|
[2344] | 3950 | int initNData = j;
|
---|
[2773] | 3951 | int nData = initNData;
|
---|
[2012] | 3952 |
|
---|
[2193] | 3953 | if (initNData < nPiece) {
|
---|
| 3954 | throw(AipsError("too few non-flagged channels"));
|
---|
| 3955 | }
|
---|
[2081] | 3956 |
|
---|
| 3957 | int nElement = (int)(floor(floor((double)(initNData/nPiece))+0.5));
|
---|
[2344] | 3958 | std::vector<double> invEdge(nPiece-1);
|
---|
[2767] | 3959 |
|
---|
| 3960 | if (useGivenPieceBoundary) {
|
---|
| 3961 | if ((int)idxEdge.size() != nPiece+1) {
|
---|
| 3962 | throw(AipsError("pieceEdge.size() must be equal to nPiece+1."));
|
---|
| 3963 | }
|
---|
| 3964 | } else {
|
---|
| 3965 | idxEdge.clear();
|
---|
| 3966 | idxEdge.resize(nPiece+1);
|
---|
| 3967 | idxEdge[0] = x[0];
|
---|
| 3968 | }
|
---|
[2012] | 3969 | for (int i = 1; i < nPiece; ++i) {
|
---|
[2047] | 3970 | int valX = x[nElement*i];
|
---|
[2767] | 3971 | if (!useGivenPieceBoundary) {
|
---|
| 3972 | idxEdge[i] = valX;
|
---|
| 3973 | }
|
---|
[2344] | 3974 | invEdge[i-1] = 1.0/(double)valX;
|
---|
[2012] | 3975 | }
|
---|
[2767] | 3976 | if (!useGivenPieceBoundary) {
|
---|
| 3977 | idxEdge[nPiece] = x[initNData-1]+1;
|
---|
| 3978 | }
|
---|
[2064] | 3979 |
|
---|
[2773] | 3980 | std::vector<double> z1(nChan), r1(nChan), residual(nChan);
|
---|
[2012] | 3981 | for (int i = 0; i < nChan; ++i) {
|
---|
[2773] | 3982 | z1[i] = (double)data[i];
|
---|
| 3983 | r1[i] = 0.0;
|
---|
[2344] | 3984 | residual[i] = 0.0;
|
---|
[2012] | 3985 | }
|
---|
| 3986 |
|
---|
| 3987 | for (int nClip = 0; nClip < nIterClip+1; ++nClip) {
|
---|
[2064] | 3988 | // xMatrix : horizontal concatenation of
|
---|
| 3989 | // the least-sq. matrix (left) and an
|
---|
| 3990 | // identity matrix (right).
|
---|
| 3991 | // the right part is used to calculate the inverse matrix of the left part.
|
---|
[2767] | 3992 |
|
---|
[2012] | 3993 | double xMatrix[nDOF][2*nDOF];
|
---|
| 3994 | double zMatrix[nDOF];
|
---|
| 3995 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 3996 | for (int j = 0; j < 2*nDOF; ++j) {
|
---|
| 3997 | xMatrix[i][j] = 0.0;
|
---|
| 3998 | }
|
---|
| 3999 | xMatrix[i][nDOF+i] = 1.0;
|
---|
| 4000 | zMatrix[i] = 0.0;
|
---|
| 4001 | }
|
---|
| 4002 |
|
---|
| 4003 | for (int n = 0; n < nPiece; ++n) {
|
---|
[2193] | 4004 | int nUseDataInPiece = 0;
|
---|
[2773] | 4005 | for (int k = idxEdge[n]; k < idxEdge[n+1]; ++k) {
|
---|
[2064] | 4006 |
|
---|
[2773] | 4007 | if (maskArray[k] == 0) continue;
|
---|
[2064] | 4008 |
|
---|
[2773] | 4009 | for (int i = 0; i < nModel; ++i) {
|
---|
| 4010 | for (int j = i; j < nModel; ++j) {
|
---|
| 4011 | xMatrix[i][j] += model[i][k] * model[j][k];
|
---|
| 4012 | }
|
---|
| 4013 | zMatrix[i] += z1[k] * model[i][k];
|
---|
| 4014 | }
|
---|
[2064] | 4015 |
|
---|
[2773] | 4016 | for (int i = 0; i < n; ++i) {
|
---|
| 4017 | double q = 1.0 - model[1][k]*invEdge[i];
|
---|
[2012] | 4018 | q = q*q*q;
|
---|
[2773] | 4019 | for (int j = 0; j < nModel; ++j) {
|
---|
| 4020 | xMatrix[j][i+nModel] += q * model[j][k];
|
---|
| 4021 | }
|
---|
| 4022 | for (int j = 0; j < i; ++j) {
|
---|
| 4023 | double r = 1.0 - model[1][k]*invEdge[j];
|
---|
[2012] | 4024 | r = r*r*r;
|
---|
[2773] | 4025 | xMatrix[j+nModel][i+nModel] += r*q;
|
---|
[2012] | 4026 | }
|
---|
[2773] | 4027 | xMatrix[i+nModel][i+nModel] += q*q;
|
---|
| 4028 | zMatrix[i+nModel] += q*z1[k];
|
---|
[2012] | 4029 | }
|
---|
[2064] | 4030 |
|
---|
[2193] | 4031 | nUseDataInPiece++;
|
---|
[2012] | 4032 | }
|
---|
[2193] | 4033 |
|
---|
| 4034 | if (nUseDataInPiece < 1) {
|
---|
| 4035 | std::vector<string> suffixOfPieceNumber(4);
|
---|
| 4036 | suffixOfPieceNumber[0] = "th";
|
---|
| 4037 | suffixOfPieceNumber[1] = "st";
|
---|
| 4038 | suffixOfPieceNumber[2] = "nd";
|
---|
| 4039 | suffixOfPieceNumber[3] = "rd";
|
---|
| 4040 | int idxNoDataPiece = (n % 10 <= 3) ? n : 0;
|
---|
| 4041 | ostringstream oss;
|
---|
| 4042 | oss << "all channels clipped or masked in " << n << suffixOfPieceNumber[idxNoDataPiece];
|
---|
| 4043 | oss << " piece of the spectrum. can't execute fitting anymore.";
|
---|
| 4044 | throw(AipsError(String(oss)));
|
---|
| 4045 | }
|
---|
[2012] | 4046 | }
|
---|
| 4047 |
|
---|
| 4048 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 4049 | for (int j = 0; j < i; ++j) {
|
---|
| 4050 | xMatrix[i][j] = xMatrix[j][i];
|
---|
| 4051 | }
|
---|
| 4052 | }
|
---|
| 4053 |
|
---|
[2344] | 4054 | std::vector<double> invDiag(nDOF);
|
---|
[2012] | 4055 | for (int i = 0; i < nDOF; ++i) {
|
---|
[2773] | 4056 | invDiag[i] = 1.0 / xMatrix[i][i];
|
---|
[2012] | 4057 | for (int j = 0; j < nDOF; ++j) {
|
---|
| 4058 | xMatrix[i][j] *= invDiag[i];
|
---|
| 4059 | }
|
---|
| 4060 | }
|
---|
| 4061 |
|
---|
| 4062 | for (int k = 0; k < nDOF; ++k) {
|
---|
| 4063 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 4064 | if (i != k) {
|
---|
| 4065 | double factor1 = xMatrix[k][k];
|
---|
[2773] | 4066 | double invfactor1 = 1.0 / factor1;
|
---|
[2012] | 4067 | double factor2 = xMatrix[i][k];
|
---|
| 4068 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
| 4069 | xMatrix[i][j] *= factor1;
|
---|
| 4070 | xMatrix[i][j] -= xMatrix[k][j]*factor2;
|
---|
[2773] | 4071 | xMatrix[i][j] *= invfactor1;
|
---|
[2012] | 4072 | }
|
---|
| 4073 | }
|
---|
| 4074 | }
|
---|
[2773] | 4075 | double invXDiag = 1.0 / xMatrix[k][k];
|
---|
[2012] | 4076 | for (int j = k; j < 2*nDOF; ++j) {
|
---|
[2773] | 4077 | xMatrix[k][j] *= invXDiag;
|
---|
[2012] | 4078 | }
|
---|
| 4079 | }
|
---|
| 4080 |
|
---|
| 4081 | for (int i = 0; i < nDOF; ++i) {
|
---|
| 4082 | for (int j = 0; j < nDOF; ++j) {
|
---|
| 4083 | xMatrix[i][nDOF+j] *= invDiag[j];
|
---|
| 4084 | }
|
---|
| 4085 | }
|
---|
[2767] | 4086 |
|
---|
[2012] | 4087 | //compute a vector y which consists of the coefficients of the best-fit spline curves
|
---|
| 4088 | //(a0,a1,a2,a3(,b3,c3,...)), namely, the ones for the leftmost piece and the ones of
|
---|
| 4089 | //cubic terms for the other pieces (in case nPiece>1).
|
---|
[2344] | 4090 | std::vector<double> y(nDOF);
|
---|
[2012] | 4091 | for (int i = 0; i < nDOF; ++i) {
|
---|
[2344] | 4092 | y[i] = 0.0;
|
---|
[2012] | 4093 | for (int j = 0; j < nDOF; ++j) {
|
---|
| 4094 | y[i] += xMatrix[i][nDOF+j]*zMatrix[j];
|
---|
| 4095 | }
|
---|
| 4096 | }
|
---|
| 4097 |
|
---|
[2773] | 4098 | std::vector<double> a(nModel);
|
---|
| 4099 | for (int i = 0; i < nModel; ++i) {
|
---|
| 4100 | a[i] = y[i];
|
---|
| 4101 | }
|
---|
[2012] | 4102 |
|
---|
[2344] | 4103 | int j = 0;
|
---|
[2012] | 4104 | for (int n = 0; n < nPiece; ++n) {
|
---|
[2064] | 4105 | for (int i = idxEdge[n]; i < idxEdge[n+1]; ++i) {
|
---|
[2773] | 4106 | r1[i] = 0.0;
|
---|
| 4107 | for (int j = 0; j < nModel; ++j) {
|
---|
| 4108 | r1[i] += a[j] * model[j][i];
|
---|
| 4109 | }
|
---|
[2012] | 4110 | }
|
---|
[2773] | 4111 | for (int i = 0; i < nModel; ++i) {
|
---|
| 4112 | params[j+i] = a[i];
|
---|
| 4113 | }
|
---|
| 4114 | j += nModel;
|
---|
[2012] | 4115 |
|
---|
| 4116 | if (n == nPiece-1) break;
|
---|
| 4117 |
|
---|
[2773] | 4118 | double d = y[n+nModel];
|
---|
[2064] | 4119 | double iE = invEdge[n];
|
---|
[2773] | 4120 | a[0] += d;
|
---|
| 4121 | a[1] -= 3.0 * d * iE;
|
---|
| 4122 | a[2] += 3.0 * d * iE * iE;
|
---|
| 4123 | a[3] -= d * iE * iE * iE;
|
---|
[2012] | 4124 | }
|
---|
| 4125 |
|
---|
[2344] | 4126 | //subtract constant value for masked regions at the edge of spectrum
|
---|
| 4127 | if (idxEdge[0] > 0) {
|
---|
| 4128 | int n = idxEdge[0];
|
---|
| 4129 | for (int i = 0; i < idxEdge[0]; ++i) {
|
---|
| 4130 | //--cubic extrapolate--
|
---|
| 4131 | //r1[i] = params[0] + params[1]*x1[i] + params[2]*x2[i] + params[3]*x3[i];
|
---|
| 4132 | //--linear extrapolate--
|
---|
| 4133 | //r1[i] = (r1[n+1] - r1[n])/(x1[n+1] - x1[n])*(x1[i] - x1[n]) + r1[n];
|
---|
| 4134 | //--constant--
|
---|
| 4135 | r1[i] = r1[n];
|
---|
| 4136 | }
|
---|
| 4137 | }
|
---|
[2767] | 4138 |
|
---|
[2344] | 4139 | if (idxEdge[nPiece] < nChan) {
|
---|
| 4140 | int n = idxEdge[nPiece]-1;
|
---|
| 4141 | for (int i = idxEdge[nPiece]; i < nChan; ++i) {
|
---|
| 4142 | //--cubic extrapolate--
|
---|
| 4143 | //int m = 4*(nPiece-1);
|
---|
| 4144 | //r1[i] = params[m] + params[m+1]*x1[i] + params[m+2]*x2[i] + params[m+3]*x3[i];
|
---|
| 4145 | //--linear extrapolate--
|
---|
| 4146 | //r1[i] = (r1[n-1] - r1[n])/(x1[n-1] - x1[n])*(x1[i] - x1[n]) + r1[n];
|
---|
| 4147 | //--constant--
|
---|
| 4148 | r1[i] = r1[n];
|
---|
| 4149 | }
|
---|
| 4150 | }
|
---|
| 4151 |
|
---|
| 4152 | for (int i = 0; i < nChan; ++i) {
|
---|
| 4153 | residual[i] = z1[i] - r1[i];
|
---|
| 4154 | }
|
---|
| 4155 |
|
---|
[2767] | 4156 | double stdDev = 0.0;
|
---|
| 4157 | for (int i = 0; i < nChan; ++i) {
|
---|
| 4158 | stdDev += residual[i]*residual[i]*(double)maskArray[i];
|
---|
| 4159 | }
|
---|
| 4160 | stdDev = sqrt(stdDev/(double)nData);
|
---|
| 4161 | rms = (float)stdDev;
|
---|
| 4162 |
|
---|
[2012] | 4163 | if ((nClip == nIterClip) || (thresClip <= 0.0)) {
|
---|
| 4164 | break;
|
---|
| 4165 | } else {
|
---|
| 4166 |
|
---|
| 4167 | double thres = stdDev * thresClip;
|
---|
| 4168 | int newNData = 0;
|
---|
| 4169 | for (int i = 0; i < nChan; ++i) {
|
---|
[2081] | 4170 | if (abs(residual[i]) >= thres) {
|
---|
[2012] | 4171 | maskArray[i] = 0;
|
---|
[2767] | 4172 | finalMask[i] = false;
|
---|
[2012] | 4173 | }
|
---|
| 4174 | if (maskArray[i] > 0) {
|
---|
| 4175 | newNData++;
|
---|
| 4176 | }
|
---|
| 4177 | }
|
---|
[2081] | 4178 | if (newNData == nData) {
|
---|
[2064] | 4179 | break; //no more flag to add. iteration stops.
|
---|
[2012] | 4180 | } else {
|
---|
[2081] | 4181 | nData = newNData;
|
---|
[2012] | 4182 | }
|
---|
[2767] | 4183 |
|
---|
[2012] | 4184 | }
|
---|
| 4185 | }
|
---|
| 4186 |
|
---|
[2193] | 4187 | nClipped = initNData - nData;
|
---|
| 4188 |
|
---|
[2344] | 4189 | std::vector<float> result(nChan);
|
---|
[2058] | 4190 | if (getResidual) {
|
---|
| 4191 | for (int i = 0; i < nChan; ++i) {
|
---|
[2344] | 4192 | result[i] = (float)residual[i];
|
---|
[2058] | 4193 | }
|
---|
| 4194 | } else {
|
---|
| 4195 | for (int i = 0; i < nChan; ++i) {
|
---|
[2344] | 4196 | result[i] = (float)r1[i];
|
---|
[2058] | 4197 | }
|
---|
[2012] | 4198 | }
|
---|
| 4199 |
|
---|
[2058] | 4200 | return result;
|
---|
[2012] | 4201 | }
|
---|
| 4202 |
|
---|
[2773] | 4203 | std::vector<int> Scantable::selectWaveNumbers(const std::vector<int>& addNWaves,
|
---|
| 4204 | const std::vector<int>& rejectNWaves)
|
---|
[2081] | 4205 | {
|
---|
[2773] | 4206 | std::vector<bool> chanMask;
|
---|
[2767] | 4207 | std::string fftMethod;
|
---|
| 4208 | std::string fftThresh;
|
---|
| 4209 |
|
---|
[2773] | 4210 | return selectWaveNumbers(0, chanMask, false, fftMethod, fftThresh, addNWaves, rejectNWaves);
|
---|
| 4211 | }
|
---|
| 4212 |
|
---|
| 4213 | std::vector<int> Scantable::selectWaveNumbers(const int whichrow,
|
---|
| 4214 | const std::vector<bool>& chanMask,
|
---|
| 4215 | const bool applyFFT,
|
---|
| 4216 | const std::string& fftMethod,
|
---|
| 4217 | const std::string& fftThresh,
|
---|
| 4218 | const std::vector<int>& addNWaves,
|
---|
| 4219 | const std::vector<int>& rejectNWaves)
|
---|
| 4220 | {
|
---|
| 4221 | std::vector<int> nWaves;
|
---|
[2186] | 4222 | nWaves.clear();
|
---|
| 4223 |
|
---|
| 4224 | if (applyFFT) {
|
---|
| 4225 | string fftThAttr;
|
---|
| 4226 | float fftThSigma;
|
---|
| 4227 | int fftThTop;
|
---|
[2773] | 4228 | parseFFTThresholdInfo(fftThresh, fftThAttr, fftThSigma, fftThTop);
|
---|
[2186] | 4229 | doSelectWaveNumbers(whichrow, chanMask, fftMethod, fftThSigma, fftThTop, fftThAttr, nWaves);
|
---|
| 4230 | }
|
---|
| 4231 |
|
---|
[2411] | 4232 | addAuxWaveNumbers(whichrow, addNWaves, rejectNWaves, nWaves);
|
---|
[2773] | 4233 |
|
---|
| 4234 | return nWaves;
|
---|
[2186] | 4235 | }
|
---|
| 4236 |
|
---|
[2773] | 4237 | int Scantable::getIdxOfNchan(const int nChan, const std::vector<int>& nChanNos)
|
---|
| 4238 | {
|
---|
| 4239 | int idx = -1;
|
---|
| 4240 | for (uint i = 0; i < nChanNos.size(); ++i) {
|
---|
| 4241 | if (nChan == nChanNos[i]) {
|
---|
| 4242 | idx = i;
|
---|
| 4243 | break;
|
---|
| 4244 | }
|
---|
| 4245 | }
|
---|
| 4246 |
|
---|
| 4247 | if (idx < 0) {
|
---|
| 4248 | throw(AipsError("nChan not found in nChhanNos."));
|
---|
| 4249 | }
|
---|
| 4250 |
|
---|
| 4251 | return idx;
|
---|
| 4252 | }
|
---|
| 4253 |
|
---|
[2767] | 4254 | void Scantable::parseFFTInfo(const std::string& fftInfo, bool& applyFFT, std::string& fftMethod, std::string& fftThresh)
|
---|
| 4255 | {
|
---|
| 4256 | istringstream iss(fftInfo);
|
---|
| 4257 | std::string tmp;
|
---|
| 4258 | std::vector<string> res;
|
---|
| 4259 | while (getline(iss, tmp, ',')) {
|
---|
| 4260 | res.push_back(tmp);
|
---|
| 4261 | }
|
---|
| 4262 | if (res.size() < 3) {
|
---|
| 4263 | throw(AipsError("wrong value in 'fftinfo' parameter")) ;
|
---|
| 4264 | }
|
---|
| 4265 | applyFFT = (res[0] == "true");
|
---|
| 4266 | fftMethod = res[1];
|
---|
| 4267 | fftThresh = res[2];
|
---|
| 4268 | }
|
---|
| 4269 |
|
---|
[2773] | 4270 | void Scantable::parseFFTThresholdInfo(const std::string& fftThresh, std::string& fftThAttr, float& fftThSigma, int& fftThTop)
|
---|
[2186] | 4271 | {
|
---|
| 4272 | uInt idxSigma = fftThresh.find("sigma");
|
---|
| 4273 | uInt idxTop = fftThresh.find("top");
|
---|
| 4274 |
|
---|
| 4275 | if (idxSigma == fftThresh.size() - 5) {
|
---|
| 4276 | std::istringstream is(fftThresh.substr(0, fftThresh.size() - 5));
|
---|
| 4277 | is >> fftThSigma;
|
---|
| 4278 | fftThAttr = "sigma";
|
---|
| 4279 | } else if (idxTop == 0) {
|
---|
| 4280 | std::istringstream is(fftThresh.substr(3));
|
---|
| 4281 | is >> fftThTop;
|
---|
| 4282 | fftThAttr = "top";
|
---|
| 4283 | } else {
|
---|
| 4284 | bool isNumber = true;
|
---|
| 4285 | for (uInt i = 0; i < fftThresh.size()-1; ++i) {
|
---|
| 4286 | char ch = (fftThresh.substr(i, 1).c_str())[0];
|
---|
| 4287 | if (!(isdigit(ch) || (fftThresh.substr(i, 1) == "."))) {
|
---|
| 4288 | isNumber = false;
|
---|
| 4289 | break;
|
---|
| 4290 | }
|
---|
| 4291 | }
|
---|
| 4292 | if (isNumber) {
|
---|
| 4293 | std::istringstream is(fftThresh);
|
---|
| 4294 | is >> fftThSigma;
|
---|
| 4295 | fftThAttr = "sigma";
|
---|
| 4296 | } else {
|
---|
| 4297 | throw(AipsError("fftthresh has a wrong value"));
|
---|
| 4298 | }
|
---|
| 4299 | }
|
---|
| 4300 | }
|
---|
| 4301 |
|
---|
| 4302 | 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)
|
---|
| 4303 | {
|
---|
| 4304 | std::vector<float> fspec;
|
---|
| 4305 | if (fftMethod == "fft") {
|
---|
| 4306 | fspec = execFFT(whichrow, chanMask, false, true);
|
---|
| 4307 | //} else if (fftMethod == "lsp") {
|
---|
| 4308 | // fspec = lombScarglePeriodogram(whichrow);
|
---|
| 4309 | }
|
---|
| 4310 |
|
---|
| 4311 | if (fftThAttr == "sigma") {
|
---|
| 4312 | float mean = 0.0;
|
---|
| 4313 | float mean2 = 0.0;
|
---|
| 4314 | for (uInt i = 0; i < fspec.size(); ++i) {
|
---|
| 4315 | mean += fspec[i];
|
---|
| 4316 | mean2 += fspec[i]*fspec[i];
|
---|
| 4317 | }
|
---|
| 4318 | mean /= float(fspec.size());
|
---|
| 4319 | mean2 /= float(fspec.size());
|
---|
| 4320 | float thres = mean + fftThSigma * float(sqrt(mean2 - mean*mean));
|
---|
| 4321 |
|
---|
| 4322 | for (uInt i = 0; i < fspec.size(); ++i) {
|
---|
| 4323 | if (fspec[i] >= thres) {
|
---|
| 4324 | nWaves.push_back(i);
|
---|
| 4325 | }
|
---|
| 4326 | }
|
---|
| 4327 |
|
---|
| 4328 | } else if (fftThAttr == "top") {
|
---|
| 4329 | for (int i = 0; i < fftThTop; ++i) {
|
---|
| 4330 | float max = 0.0;
|
---|
| 4331 | int maxIdx = 0;
|
---|
| 4332 | for (uInt j = 0; j < fspec.size(); ++j) {
|
---|
| 4333 | if (fspec[j] > max) {
|
---|
| 4334 | max = fspec[j];
|
---|
| 4335 | maxIdx = j;
|
---|
| 4336 | }
|
---|
| 4337 | }
|
---|
| 4338 | nWaves.push_back(maxIdx);
|
---|
| 4339 | fspec[maxIdx] = 0.0;
|
---|
| 4340 | }
|
---|
| 4341 |
|
---|
| 4342 | }
|
---|
| 4343 |
|
---|
| 4344 | if (nWaves.size() > 1) {
|
---|
| 4345 | sort(nWaves.begin(), nWaves.end());
|
---|
| 4346 | }
|
---|
| 4347 | }
|
---|
| 4348 |
|
---|
[2411] | 4349 | void Scantable::addAuxWaveNumbers(const int whichrow, const std::vector<int>& addNWaves, const std::vector<int>& rejectNWaves, std::vector<int>& nWaves)
|
---|
[2186] | 4350 | {
|
---|
[2411] | 4351 | std::vector<int> tempAddNWaves, tempRejectNWaves;
|
---|
[2767] | 4352 | tempAddNWaves.clear();
|
---|
| 4353 | tempRejectNWaves.clear();
|
---|
| 4354 |
|
---|
[2186] | 4355 | for (uInt i = 0; i < addNWaves.size(); ++i) {
|
---|
[2411] | 4356 | tempAddNWaves.push_back(addNWaves[i]);
|
---|
| 4357 | }
|
---|
| 4358 | if ((tempAddNWaves.size() == 2) && (tempAddNWaves[1] == -999)) {
|
---|
| 4359 | setWaveNumberListUptoNyquistFreq(whichrow, tempAddNWaves);
|
---|
| 4360 | }
|
---|
| 4361 |
|
---|
| 4362 | for (uInt i = 0; i < rejectNWaves.size(); ++i) {
|
---|
| 4363 | tempRejectNWaves.push_back(rejectNWaves[i]);
|
---|
| 4364 | }
|
---|
| 4365 | if ((tempRejectNWaves.size() == 2) && (tempRejectNWaves[1] == -999)) {
|
---|
| 4366 | setWaveNumberListUptoNyquistFreq(whichrow, tempRejectNWaves);
|
---|
| 4367 | }
|
---|
| 4368 |
|
---|
| 4369 | for (uInt i = 0; i < tempAddNWaves.size(); ++i) {
|
---|
[2186] | 4370 | bool found = false;
|
---|
| 4371 | for (uInt j = 0; j < nWaves.size(); ++j) {
|
---|
[2411] | 4372 | if (nWaves[j] == tempAddNWaves[i]) {
|
---|
[2186] | 4373 | found = true;
|
---|
| 4374 | break;
|
---|
| 4375 | }
|
---|
| 4376 | }
|
---|
[2411] | 4377 | if (!found) nWaves.push_back(tempAddNWaves[i]);
|
---|
[2186] | 4378 | }
|
---|
| 4379 |
|
---|
[2411] | 4380 | for (uInt i = 0; i < tempRejectNWaves.size(); ++i) {
|
---|
[2186] | 4381 | for (std::vector<int>::iterator j = nWaves.begin(); j != nWaves.end(); ) {
|
---|
[2411] | 4382 | if (*j == tempRejectNWaves[i]) {
|
---|
[2186] | 4383 | j = nWaves.erase(j);
|
---|
| 4384 | } else {
|
---|
| 4385 | ++j;
|
---|
| 4386 | }
|
---|
| 4387 | }
|
---|
| 4388 | }
|
---|
| 4389 |
|
---|
| 4390 | if (nWaves.size() > 1) {
|
---|
| 4391 | sort(nWaves.begin(), nWaves.end());
|
---|
| 4392 | unique(nWaves.begin(), nWaves.end());
|
---|
| 4393 | }
|
---|
| 4394 | }
|
---|
| 4395 |
|
---|
[2411] | 4396 | void Scantable::setWaveNumberListUptoNyquistFreq(const int whichrow, std::vector<int>& nWaves)
|
---|
| 4397 | {
|
---|
[2767] | 4398 | int val = nWaves[0];
|
---|
| 4399 | int nyquistFreq = nchan(getIF(whichrow))/2+1;
|
---|
| 4400 | nWaves.clear();
|
---|
| 4401 | if (val > nyquistFreq) { // for safety, at least nWaves contains a constant; CAS-3759
|
---|
| 4402 | nWaves.push_back(0);
|
---|
[2411] | 4403 | }
|
---|
[2767] | 4404 | while (val <= nyquistFreq) {
|
---|
| 4405 | nWaves.push_back(val);
|
---|
| 4406 | val++;
|
---|
| 4407 | }
|
---|
[2411] | 4408 | }
|
---|
| 4409 |
|
---|
[2773] | 4410 | void Scantable::sinusoidBaseline(const std::vector<bool>& mask, const std::string& fftInfo,
|
---|
| 4411 | const std::vector<int>& addNWaves,
|
---|
| 4412 | const std::vector<int>& rejectNWaves,
|
---|
| 4413 | float thresClip, int nIterClip,
|
---|
| 4414 | bool getResidual,
|
---|
| 4415 | const std::string& progressInfo,
|
---|
| 4416 | const bool outLogger, const std::string& blfile,
|
---|
| 4417 | const std::string& bltable)
|
---|
[2186] | 4418 | {
|
---|
[2774] | 4419 | /****
|
---|
[2773] | 4420 | double TimeStart = mathutil::gettimeofday_sec();
|
---|
[2774] | 4421 | ****/
|
---|
[2773] | 4422 |
|
---|
[2193] | 4423 | try {
|
---|
| 4424 | ofstream ofs;
|
---|
[2773] | 4425 | String coordInfo;
|
---|
| 4426 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
| 4427 | int minNRow;
|
---|
| 4428 | int nRow = nrow();
|
---|
| 4429 | std::vector<bool> chanMask, finalChanMask;
|
---|
| 4430 | float rms;
|
---|
| 4431 | bool outBaselineTable = (bltable != "");
|
---|
| 4432 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 4433 | Vector<Double> timeSecCol;
|
---|
[2012] | 4434 |
|
---|
[2773] | 4435 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 4436 | coordInfo, hasSameNchan,
|
---|
| 4437 | progressInfo, showProgress, minNRow,
|
---|
| 4438 | timeSecCol);
|
---|
[2012] | 4439 |
|
---|
[2773] | 4440 | bool applyFFT;
|
---|
| 4441 | std::string fftMethod, fftThresh;
|
---|
| 4442 | parseFFTInfo(fftInfo, applyFFT, fftMethod, fftThresh);
|
---|
[2012] | 4443 |
|
---|
[2193] | 4444 | std::vector<int> nWaves;
|
---|
[2773] | 4445 | std::vector<int> nChanNos;
|
---|
| 4446 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 4447 | if (!applyFFT) {
|
---|
| 4448 | nWaves = selectWaveNumbers(addNWaves, rejectNWaves);
|
---|
| 4449 | modelReservoir = getSinusoidModelReservoir(nWaves, nChanNos);
|
---|
| 4450 | }
|
---|
[2012] | 4451 |
|
---|
[2193] | 4452 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
[2767] | 4453 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
[2193] | 4454 | chanMask = getCompositeChanMask(whichrow, mask);
|
---|
[2773] | 4455 | std::vector<std::vector<double> > model;
|
---|
| 4456 | if (applyFFT) {
|
---|
| 4457 | nWaves = selectWaveNumbers(whichrow, chanMask, true, fftMethod, fftThresh,
|
---|
| 4458 | addNWaves, rejectNWaves);
|
---|
| 4459 | model = getSinusoidModel(nWaves, sp.size());
|
---|
| 4460 | } else {
|
---|
| 4461 | model = modelReservoir[getIdxOfNchan(sp.size(), nChanNos)];
|
---|
| 4462 | }
|
---|
[2186] | 4463 |
|
---|
[2767] | 4464 | std::vector<float> params;
|
---|
| 4465 | int nClipped = 0;
|
---|
[2773] | 4466 | std::vector<float> res = doLeastSquareFitting(sp, chanMask, model,
|
---|
| 4467 | params, rms, finalChanMask,
|
---|
| 4468 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2767] | 4469 |
|
---|
[2773] | 4470 | if (outBaselineTable) {
|
---|
| 4471 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 4472 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 4473 | true, STBaselineFunc::Sinusoid, nWaves, std::vector<float>(),
|
---|
| 4474 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 4475 | thresClip, nIterClip, 0.0, 0, std::vector<int>());
|
---|
[2767] | 4476 | } else {
|
---|
| 4477 | setSpectrum(res, whichrow);
|
---|
[2186] | 4478 | }
|
---|
[2193] | 4479 |
|
---|
[2773] | 4480 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 4481 | coordInfo, hasSameNchan, ofs, "sinusoidBaseline()",
|
---|
| 4482 | params, nClipped);
|
---|
[2193] | 4483 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
[2186] | 4484 | }
|
---|
| 4485 |
|
---|
[2773] | 4486 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2767] | 4487 |
|
---|
[2193] | 4488 | } catch (...) {
|
---|
| 4489 | throw;
|
---|
[1931] | 4490 | }
|
---|
[2773] | 4491 |
|
---|
[2774] | 4492 | /****
|
---|
[2773] | 4493 | double TimeEnd = mathutil::gettimeofday_sec();
|
---|
| 4494 | double elapse1 = TimeEnd - TimeStart;
|
---|
| 4495 | std::cout << "sinusoid-old : " << elapse1 << " (sec.)" << endl;
|
---|
[2774] | 4496 | ****/
|
---|
[1907] | 4497 | }
|
---|
| 4498 |
|
---|
[2773] | 4499 | void Scantable::autoSinusoidBaseline(const std::vector<bool>& mask, const std::string& fftInfo,
|
---|
| 4500 | const std::vector<int>& addNWaves,
|
---|
| 4501 | const std::vector<int>& rejectNWaves,
|
---|
| 4502 | float thresClip, int nIterClip,
|
---|
| 4503 | const std::vector<int>& edge,
|
---|
| 4504 | float threshold, int chanAvgLimit,
|
---|
| 4505 | bool getResidual,
|
---|
| 4506 | const std::string& progressInfo,
|
---|
| 4507 | const bool outLogger, const std::string& blfile,
|
---|
| 4508 | const std::string& bltable)
|
---|
[2012] | 4509 | {
|
---|
[2193] | 4510 | try {
|
---|
| 4511 | ofstream ofs;
|
---|
[2773] | 4512 | String coordInfo;
|
---|
| 4513 | bool hasSameNchan, outTextFile, csvFormat, showProgress;
|
---|
| 4514 | int minNRow;
|
---|
| 4515 | int nRow = nrow();
|
---|
| 4516 | std::vector<bool> chanMask, finalChanMask;
|
---|
| 4517 | float rms;
|
---|
| 4518 | bool outBaselineTable = (bltable != "");
|
---|
| 4519 | STBaselineTable bt = STBaselineTable(*this);
|
---|
| 4520 | Vector<Double> timeSecCol;
|
---|
| 4521 | STLineFinder lineFinder = STLineFinder();
|
---|
[2012] | 4522 |
|
---|
[2773] | 4523 | initialiseBaselining(blfile, ofs, outLogger, outTextFile, csvFormat,
|
---|
| 4524 | coordInfo, hasSameNchan,
|
---|
| 4525 | progressInfo, showProgress, minNRow,
|
---|
| 4526 | timeSecCol);
|
---|
[2012] | 4527 |
|
---|
[2773] | 4528 | initLineFinder(edge, threshold, chanAvgLimit, lineFinder);
|
---|
[2012] | 4529 |
|
---|
[2773] | 4530 | bool applyFFT;
|
---|
| 4531 | string fftMethod, fftThresh;
|
---|
| 4532 | parseFFTInfo(fftInfo, applyFFT, fftMethod, fftThresh);
|
---|
[2012] | 4533 |
|
---|
[2193] | 4534 | std::vector<int> nWaves;
|
---|
[2773] | 4535 | std::vector<int> nChanNos;
|
---|
| 4536 | std::vector<std::vector<std::vector<double> > > modelReservoir;
|
---|
| 4537 | if (!applyFFT) {
|
---|
| 4538 | nWaves = selectWaveNumbers(addNWaves, rejectNWaves);
|
---|
| 4539 | modelReservoir = getSinusoidModelReservoir(nWaves, nChanNos);
|
---|
| 4540 | }
|
---|
[2186] | 4541 |
|
---|
[2193] | 4542 | for (int whichrow = 0; whichrow < nRow; ++whichrow) {
|
---|
[2767] | 4543 | std::vector<float> sp = getSpectrum(whichrow);
|
---|
[2193] | 4544 | std::vector<int> currentEdge;
|
---|
[2773] | 4545 | chanMask = getCompositeChanMask(whichrow, mask, edge, currentEdge, lineFinder);
|
---|
| 4546 | std::vector<std::vector<double> > model;
|
---|
| 4547 | if (applyFFT) {
|
---|
| 4548 | nWaves = selectWaveNumbers(whichrow, chanMask, true, fftMethod, fftThresh,
|
---|
| 4549 | addNWaves, rejectNWaves);
|
---|
| 4550 | model = getSinusoidModel(nWaves, sp.size());
|
---|
[2193] | 4551 | } else {
|
---|
[2773] | 4552 | model = modelReservoir[getIdxOfNchan(sp.size(), nChanNos)];
|
---|
[2012] | 4553 | }
|
---|
[2193] | 4554 |
|
---|
| 4555 | std::vector<float> params;
|
---|
| 4556 | int nClipped = 0;
|
---|
[2773] | 4557 | std::vector<float> res = doLeastSquareFitting(sp, chanMask, model,
|
---|
| 4558 | params, rms, finalChanMask,
|
---|
| 4559 | nClipped, thresClip, nIterClip, getResidual);
|
---|
[2193] | 4560 |
|
---|
[2773] | 4561 | if (outBaselineTable) {
|
---|
| 4562 | bt.appenddata(getScan(whichrow), getCycle(whichrow), getBeam(whichrow),
|
---|
| 4563 | getIF(whichrow), getPol(whichrow), 0, timeSecCol[whichrow],
|
---|
| 4564 | true, STBaselineFunc::Sinusoid, nWaves, std::vector<float>(),
|
---|
| 4565 | getMaskListFromMask(finalChanMask), params, rms, sp.size(),
|
---|
| 4566 | thresClip, nIterClip, threshold, chanAvgLimit, currentEdge);
|
---|
[2767] | 4567 | } else {
|
---|
| 4568 | setSpectrum(res, whichrow);
|
---|
| 4569 | }
|
---|
| 4570 |
|
---|
[2773] | 4571 | outputFittingResult(outLogger, outTextFile, csvFormat, chanMask, whichrow,
|
---|
| 4572 | coordInfo, hasSameNchan, ofs, "autoSinusoidBaseline()",
|
---|
| 4573 | params, nClipped);
|
---|
[2193] | 4574 | showProgressOnTerminal(whichrow, nRow, showProgress, minNRow);
|
---|
[2012] | 4575 | }
|
---|
| 4576 |
|
---|
[2773] | 4577 | finaliseBaselining(outBaselineTable, &bt, bltable, outTextFile, ofs);
|
---|
[2767] | 4578 |
|
---|
[2193] | 4579 | } catch (...) {
|
---|
| 4580 | throw;
|
---|
[2047] | 4581 | }
|
---|
| 4582 | }
|
---|
| 4583 |
|
---|
[2773] | 4584 | std::vector<float> Scantable::doSinusoidFitting(const std::vector<float>& data,
|
---|
| 4585 | const std::vector<bool>& mask,
|
---|
| 4586 | const std::vector<int>& waveNumbers,
|
---|
| 4587 | std::vector<float>& params,
|
---|
| 4588 | float& rms,
|
---|
| 4589 | std::vector<bool>& finalmask,
|
---|
| 4590 | float clipth,
|
---|
| 4591 | int clipn)
|
---|
[2081] | 4592 | {
|
---|
[2767] | 4593 | int nClipped = 0;
|
---|
| 4594 | return doSinusoidFitting(data, mask, waveNumbers, params, rms, finalmask, nClipped, clipth, clipn);
|
---|
| 4595 | }
|
---|
| 4596 |
|
---|
[2773] | 4597 | std::vector<float> Scantable::doSinusoidFitting(const std::vector<float>& data,
|
---|
| 4598 | const std::vector<bool>& mask,
|
---|
| 4599 | const std::vector<int>& waveNumbers,
|
---|
| 4600 | std::vector<float>& params,
|
---|
| 4601 | float& rms,
|
---|
| 4602 | std::vector<bool>& finalMask,
|
---|
| 4603 | int& nClipped,
|
---|
| 4604 | float thresClip,
|
---|
| 4605 | int nIterClip,
|
---|
| 4606 | bool getResidual)
|
---|
[2767] | 4607 | {
|
---|
[2773] | 4608 | return doLeastSquareFitting(data, mask,
|
---|
| 4609 | getSinusoidModel(waveNumbers, data.size()),
|
---|
| 4610 | params, rms, finalMask,
|
---|
| 4611 | nClipped, thresClip, nIterClip,
|
---|
| 4612 | getResidual);
|
---|
| 4613 | }
|
---|
| 4614 |
|
---|
| 4615 | std::vector<std::vector<std::vector<double> > > Scantable::getSinusoidModelReservoir(const std::vector<int>& waveNumbers,
|
---|
| 4616 | std::vector<int>& nChanNos)
|
---|
| 4617 | {
|
---|
| 4618 | std::vector<std::vector<std::vector<double> > > res;
|
---|
| 4619 | res.clear();
|
---|
| 4620 | nChanNos.clear();
|
---|
| 4621 |
|
---|
| 4622 | std::vector<uint> ifNos = getIFNos();
|
---|
| 4623 | for (uint i = 0; i < ifNos.size(); ++i) {
|
---|
| 4624 | int currNchan = nchan(ifNos[i]);
|
---|
| 4625 | bool hasDifferentNchan = (i == 0);
|
---|
| 4626 | for (uint j = 0; j < i; ++j) {
|
---|
| 4627 | if (currNchan != nchan(ifNos[j])) {
|
---|
| 4628 | hasDifferentNchan = true;
|
---|
| 4629 | break;
|
---|
| 4630 | }
|
---|
| 4631 | }
|
---|
| 4632 | if (hasDifferentNchan) {
|
---|
| 4633 | res.push_back(getSinusoidModel(waveNumbers, currNchan));
|
---|
| 4634 | nChanNos.push_back(currNchan);
|
---|
| 4635 | }
|
---|
[2047] | 4636 | }
|
---|
[2773] | 4637 |
|
---|
| 4638 | return res;
|
---|
| 4639 | }
|
---|
| 4640 |
|
---|
| 4641 | std::vector<std::vector<double> > Scantable::getSinusoidModel(const std::vector<int>& waveNumbers, int nchan)
|
---|
| 4642 | {
|
---|
| 4643 | // model : contains elemental values for computing the least-square matrix.
|
---|
| 4644 | // model.size() is nmodel and model[*].size() is nchan.
|
---|
| 4645 | // Each model element are as follows:
|
---|
| 4646 | // model[0] = {1.0, 1.0, 1.0, ..., 1.0},
|
---|
| 4647 | // model[2n-1] = {sin(nPI/L*x[0]), sin(nPI/L*x[1]), ..., sin(nPI/L*x[nchan])},
|
---|
| 4648 | // model[2n] = {cos(nPI/L*x[0]), cos(nPI/L*x[1]), ..., cos(nPI/L*x[nchan])},
|
---|
| 4649 | // where (1 <= n <= nMaxWavesInSW),
|
---|
| 4650 | // or,
|
---|
| 4651 | // model[2n-1] = {sin(wn[n]PI/L*x[0]), sin(wn[n]PI/L*x[1]), ..., sin(wn[n]PI/L*x[nchan])},
|
---|
| 4652 | // model[2n] = {cos(wn[n]PI/L*x[0]), cos(wn[n]PI/L*x[1]), ..., cos(wn[n]PI/L*x[nchan])},
|
---|
| 4653 | // where wn[n] denotes waveNumbers[n] (1 <= n <= waveNumbers.size()).
|
---|
| 4654 |
|
---|
[2081] | 4655 | std::vector<int> nWaves; // sorted and uniqued array of wave numbers
|
---|
| 4656 | nWaves.reserve(waveNumbers.size());
|
---|
| 4657 | copy(waveNumbers.begin(), waveNumbers.end(), back_inserter(nWaves));
|
---|
| 4658 | sort(nWaves.begin(), nWaves.end());
|
---|
| 4659 | std::vector<int>::iterator end_it = unique(nWaves.begin(), nWaves.end());
|
---|
| 4660 | nWaves.erase(end_it, nWaves.end());
|
---|
| 4661 |
|
---|
| 4662 | int minNWaves = nWaves[0];
|
---|
| 4663 | if (minNWaves < 0) {
|
---|
[2058] | 4664 | throw(AipsError("wave number must be positive or zero (i.e. constant)"));
|
---|
| 4665 | }
|
---|
[2081] | 4666 | bool hasConstantTerm = (minNWaves == 0);
|
---|
[2773] | 4667 | int nmodel = nWaves.size() * 2 - (hasConstantTerm ? 1 : 0); //number of parameters to solve.
|
---|
[2047] | 4668 |
|
---|
[2773] | 4669 | std::vector<std::vector<double> > model(nmodel, std::vector<double>(nchan));
|
---|
[2767] | 4670 |
|
---|
[2773] | 4671 | if (hasConstantTerm) {
|
---|
| 4672 | for (int j = 0; j < nchan; ++j) {
|
---|
| 4673 | model[0][j] = 1.0;
|
---|
[2047] | 4674 | }
|
---|
| 4675 | }
|
---|
| 4676 |
|
---|
[2081] | 4677 | const double PI = 6.0 * asin(0.5); // PI (= 3.141592653...)
|
---|
[2773] | 4678 | double stretch0 = 2.0*PI/(double)(nchan-1);
|
---|
[2081] | 4679 |
|
---|
| 4680 | for (uInt i = (hasConstantTerm ? 1 : 0); i < nWaves.size(); ++i) {
|
---|
[2773] | 4681 | int sidx = hasConstantTerm ? 2*i-1 : 2*i;
|
---|
| 4682 | int cidx = sidx + 1;
|
---|
| 4683 | double stretch = stretch0*(double)nWaves[i];
|
---|
[2081] | 4684 |
|
---|
[2773] | 4685 | for (int j = 0; j < nchan; ++j) {
|
---|
| 4686 | model[sidx][j] = sin(stretch*(double)j);
|
---|
| 4687 | model[cidx][j] = cos(stretch*(double)j);
|
---|
[2047] | 4688 | }
|
---|
[2012] | 4689 | }
|
---|
| 4690 |
|
---|
[2773] | 4691 | return model;
|
---|
[2012] | 4692 | }
|
---|
| 4693 |
|
---|
[2773] | 4694 | std::vector<bool> Scantable::getCompositeChanMask(int whichrow,
|
---|
| 4695 | const std::vector<bool>& inMask)
|
---|
[2047] | 4696 | {
|
---|
[2186] | 4697 | std::vector<bool> mask = getMask(whichrow);
|
---|
| 4698 | uInt maskSize = mask.size();
|
---|
[2410] | 4699 | if (inMask.size() != 0) {
|
---|
| 4700 | if (maskSize != inMask.size()) {
|
---|
| 4701 | throw(AipsError("mask sizes are not the same."));
|
---|
| 4702 | }
|
---|
| 4703 | for (uInt i = 0; i < maskSize; ++i) {
|
---|
| 4704 | mask[i] = mask[i] && inMask[i];
|
---|
| 4705 | }
|
---|
[2047] | 4706 | }
|
---|
| 4707 |
|
---|
[2186] | 4708 | return mask;
|
---|
[2047] | 4709 | }
|
---|
| 4710 |
|
---|
[2773] | 4711 | std::vector<bool> Scantable::getCompositeChanMask(int whichrow,
|
---|
| 4712 | const std::vector<bool>& inMask,
|
---|
| 4713 | const std::vector<int>& edge,
|
---|
| 4714 | std::vector<int>& currEdge,
|
---|
| 4715 | STLineFinder& lineFinder)
|
---|
[2047] | 4716 | {
|
---|
[2773] | 4717 | std::vector<uint> ifNos = getIFNos();
|
---|
[2774] | 4718 | if ((edge.size() > 2) && (edge.size() < ifNos.size()*2)) {
|
---|
[2773] | 4719 | throw(AipsError("Length of edge element info is less than that of IFs"));
|
---|
[2047] | 4720 | }
|
---|
| 4721 |
|
---|
[2774] | 4722 | uint idx = 0;
|
---|
| 4723 | if (edge.size() > 2) {
|
---|
| 4724 | int ifVal = getIF(whichrow);
|
---|
| 4725 | bool foundIF = false;
|
---|
| 4726 | for (uint i = 0; i < ifNos.size(); ++i) {
|
---|
| 4727 | if (ifVal == (int)ifNos[i]) {
|
---|
| 4728 | idx = 2*i;
|
---|
| 4729 | foundIF = true;
|
---|
| 4730 | break;
|
---|
| 4731 | }
|
---|
[2773] | 4732 | }
|
---|
[2774] | 4733 | if (!foundIF) {
|
---|
| 4734 | throw(AipsError("bad IF number"));
|
---|
| 4735 | }
|
---|
[2773] | 4736 | }
|
---|
| 4737 |
|
---|
| 4738 | currEdge.clear();
|
---|
| 4739 | currEdge.resize(2);
|
---|
| 4740 | currEdge[0] = edge[idx];
|
---|
| 4741 | currEdge[1] = edge[idx+1];
|
---|
| 4742 |
|
---|
[2047] | 4743 | lineFinder.setData(getSpectrum(whichrow));
|
---|
[2773] | 4744 | lineFinder.findLines(getCompositeChanMask(whichrow, inMask), currEdge, whichrow);
|
---|
[2047] | 4745 |
|
---|
| 4746 | return lineFinder.getMask();
|
---|
| 4747 | }
|
---|
| 4748 |
|
---|
| 4749 | /* for cspline. will be merged once cspline is available in fitter (2011/3/10 WK) */
|
---|
[2773] | 4750 | void Scantable::outputFittingResult(bool outLogger,
|
---|
| 4751 | bool outTextFile,
|
---|
| 4752 | bool csvFormat,
|
---|
| 4753 | const std::vector<bool>& chanMask,
|
---|
| 4754 | int whichrow,
|
---|
| 4755 | const casa::String& coordInfo,
|
---|
| 4756 | bool hasSameNchan,
|
---|
| 4757 | ofstream& ofs,
|
---|
| 4758 | const casa::String& funcName,
|
---|
| 4759 | const std::vector<int>& edge,
|
---|
| 4760 | const std::vector<float>& params,
|
---|
| 4761 | const int nClipped)
|
---|
[2186] | 4762 | {
|
---|
[2047] | 4763 | if (outLogger || outTextFile) {
|
---|
| 4764 | float rms = getRms(chanMask, whichrow);
|
---|
| 4765 | String masklist = getMaskRangeList(chanMask, whichrow, coordInfo, hasSameNchan);
|
---|
[2081] | 4766 | std::vector<bool> fixed;
|
---|
| 4767 | fixed.clear();
|
---|
[2047] | 4768 |
|
---|
| 4769 | if (outLogger) {
|
---|
| 4770 | LogIO ols(LogOrigin("Scantable", funcName, WHERE));
|
---|
[2773] | 4771 | ols << formatPiecewiseBaselineParams(edge, params, fixed, rms, nClipped,
|
---|
| 4772 | masklist, whichrow, false, csvFormat) << LogIO::POST ;
|
---|
[2047] | 4773 | }
|
---|
| 4774 | if (outTextFile) {
|
---|
[2773] | 4775 | ofs << formatPiecewiseBaselineParams(edge, params, fixed, rms, nClipped,
|
---|
| 4776 | masklist, whichrow, true, csvFormat) << flush;
|
---|
[2047] | 4777 | }
|
---|
| 4778 | }
|
---|
| 4779 | }
|
---|
| 4780 |
|
---|
[2773] | 4781 | /* for poly/chebyshev/sinusoid. */
|
---|
| 4782 | void Scantable::outputFittingResult(bool outLogger,
|
---|
| 4783 | bool outTextFile,
|
---|
| 4784 | bool csvFormat,
|
---|
| 4785 | const std::vector<bool>& chanMask,
|
---|
| 4786 | int whichrow,
|
---|
| 4787 | const casa::String& coordInfo,
|
---|
| 4788 | bool hasSameNchan,
|
---|
| 4789 | ofstream& ofs,
|
---|
| 4790 | const casa::String& funcName,
|
---|
| 4791 | const std::vector<float>& params,
|
---|
| 4792 | const int nClipped)
|
---|
[2186] | 4793 | {
|
---|
[2047] | 4794 | if (outLogger || outTextFile) {
|
---|
| 4795 | float rms = getRms(chanMask, whichrow);
|
---|
| 4796 | String masklist = getMaskRangeList(chanMask, whichrow, coordInfo, hasSameNchan);
|
---|
[2081] | 4797 | std::vector<bool> fixed;
|
---|
| 4798 | fixed.clear();
|
---|
[2047] | 4799 |
|
---|
| 4800 | if (outLogger) {
|
---|
| 4801 | LogIO ols(LogOrigin("Scantable", funcName, WHERE));
|
---|
[2773] | 4802 | ols << formatBaselineParams(params, fixed, rms, nClipped,
|
---|
| 4803 | masklist, whichrow, false, csvFormat) << LogIO::POST ;
|
---|
[2047] | 4804 | }
|
---|
| 4805 | if (outTextFile) {
|
---|
[2773] | 4806 | ofs << formatBaselineParams(params, fixed, rms, nClipped,
|
---|
| 4807 | masklist, whichrow, true, csvFormat) << flush;
|
---|
[2047] | 4808 | }
|
---|
| 4809 | }
|
---|
| 4810 | }
|
---|
| 4811 |
|
---|
[2189] | 4812 | void Scantable::parseProgressInfo(const std::string& progressInfo, bool& showProgress, int& minNRow)
|
---|
[2186] | 4813 | {
|
---|
[2189] | 4814 | int idxDelimiter = progressInfo.find(",");
|
---|
| 4815 | if (idxDelimiter < 0) {
|
---|
| 4816 | throw(AipsError("wrong value in 'showprogress' parameter")) ;
|
---|
| 4817 | }
|
---|
| 4818 | showProgress = (progressInfo.substr(0, idxDelimiter) == "true");
|
---|
| 4819 | std::istringstream is(progressInfo.substr(idxDelimiter+1));
|
---|
| 4820 | is >> minNRow;
|
---|
| 4821 | }
|
---|
| 4822 |
|
---|
| 4823 | void Scantable::showProgressOnTerminal(const int nProcessed, const int nTotal, const bool showProgress, const int nTotalThreshold)
|
---|
| 4824 | {
|
---|
| 4825 | if (showProgress && (nTotal >= nTotalThreshold)) {
|
---|
[2186] | 4826 | int nInterval = int(floor(double(nTotal)/100.0));
|
---|
| 4827 | if (nInterval == 0) nInterval++;
|
---|
| 4828 |
|
---|
[2193] | 4829 | if (nProcessed % nInterval == 0) {
|
---|
[2189] | 4830 | printf("\r"); //go to the head of line
|
---|
[2186] | 4831 | printf("\x1b[31m\x1b[1m"); //set red color, highlighted
|
---|
[2189] | 4832 | printf("[%3d%%]", (int)(100.0*(double(nProcessed+1))/(double(nTotal))) );
|
---|
| 4833 | printf("\x1b[39m\x1b[0m"); //set default attributes
|
---|
[2186] | 4834 | fflush(NULL);
|
---|
| 4835 | }
|
---|
[2193] | 4836 |
|
---|
[2186] | 4837 | if (nProcessed == nTotal - 1) {
|
---|
| 4838 | printf("\r\x1b[K"); //clear
|
---|
| 4839 | fflush(NULL);
|
---|
| 4840 | }
|
---|
[2193] | 4841 |
|
---|
[2186] | 4842 | }
|
---|
| 4843 | }
|
---|
| 4844 |
|
---|
| 4845 | std::vector<float> Scantable::execFFT(const int whichrow, const std::vector<bool>& inMask, bool getRealImag, bool getAmplitudeOnly)
|
---|
| 4846 | {
|
---|
| 4847 | std::vector<bool> mask = getMask(whichrow);
|
---|
| 4848 |
|
---|
| 4849 | if (inMask.size() > 0) {
|
---|
| 4850 | uInt maskSize = mask.size();
|
---|
| 4851 | if (maskSize != inMask.size()) {
|
---|
| 4852 | throw(AipsError("mask sizes are not the same."));
|
---|
| 4853 | }
|
---|
| 4854 | for (uInt i = 0; i < maskSize; ++i) {
|
---|
| 4855 | mask[i] = mask[i] && inMask[i];
|
---|
| 4856 | }
|
---|
| 4857 | }
|
---|
| 4858 |
|
---|
| 4859 | Vector<Float> spec = getSpectrum(whichrow);
|
---|
| 4860 | mathutil::doZeroOrderInterpolation(spec, mask);
|
---|
| 4861 |
|
---|
| 4862 | FFTServer<Float,Complex> ffts;
|
---|
| 4863 | Vector<Complex> fftres;
|
---|
| 4864 | ffts.fft0(fftres, spec);
|
---|
| 4865 |
|
---|
| 4866 | std::vector<float> res;
|
---|
| 4867 | float norm = float(2.0/double(spec.size()));
|
---|
| 4868 |
|
---|
| 4869 | if (getRealImag) {
|
---|
| 4870 | for (uInt i = 0; i < fftres.size(); ++i) {
|
---|
| 4871 | res.push_back(real(fftres[i])*norm);
|
---|
| 4872 | res.push_back(imag(fftres[i])*norm);
|
---|
| 4873 | }
|
---|
| 4874 | } else {
|
---|
| 4875 | for (uInt i = 0; i < fftres.size(); ++i) {
|
---|
| 4876 | res.push_back(abs(fftres[i])*norm);
|
---|
| 4877 | if (!getAmplitudeOnly) res.push_back(arg(fftres[i]));
|
---|
| 4878 | }
|
---|
| 4879 | }
|
---|
| 4880 |
|
---|
| 4881 | return res;
|
---|
| 4882 | }
|
---|
| 4883 |
|
---|
| 4884 |
|
---|
| 4885 | float Scantable::getRms(const std::vector<bool>& mask, int whichrow)
|
---|
| 4886 | {
|
---|
[2591] | 4887 | /****
|
---|
[2737] | 4888 | double ms1TimeStart, ms1TimeEnd;
|
---|
[2591] | 4889 | double elapse1 = 0.0;
|
---|
| 4890 | ms1TimeStart = mathutil::gettimeofday_sec();
|
---|
| 4891 | ****/
|
---|
| 4892 |
|
---|
[2012] | 4893 | Vector<Float> spec;
|
---|
| 4894 | specCol_.get(whichrow, spec);
|
---|
| 4895 |
|
---|
[2591] | 4896 | /****
|
---|
| 4897 | ms1TimeEnd = mathutil::gettimeofday_sec();
|
---|
| 4898 | elapse1 = ms1TimeEnd - ms1TimeStart;
|
---|
| 4899 | std::cout << "rm1 : " << elapse1 << " (sec.)" << endl;
|
---|
| 4900 | ****/
|
---|
| 4901 |
|
---|
[2737] | 4902 | return (float)doGetRms(mask, spec);
|
---|
| 4903 | }
|
---|
| 4904 |
|
---|
| 4905 | double Scantable::doGetRms(const std::vector<bool>& mask, const Vector<Float>& spec)
|
---|
| 4906 | {
|
---|
| 4907 | double mean = 0.0;
|
---|
| 4908 | double smean = 0.0;
|
---|
[2012] | 4909 | int n = 0;
|
---|
[2047] | 4910 | for (uInt i = 0; i < spec.nelements(); ++i) {
|
---|
[2012] | 4911 | if (mask[i]) {
|
---|
[2737] | 4912 | double val = (double)spec[i];
|
---|
| 4913 | mean += val;
|
---|
| 4914 | smean += val*val;
|
---|
[2012] | 4915 | n++;
|
---|
| 4916 | }
|
---|
| 4917 | }
|
---|
| 4918 |
|
---|
[2737] | 4919 | mean /= (double)n;
|
---|
| 4920 | smean /= (double)n;
|
---|
[2012] | 4921 |
|
---|
| 4922 | return sqrt(smean - mean*mean);
|
---|
| 4923 | }
|
---|
| 4924 |
|
---|
[2641] | 4925 | std::string Scantable::formatBaselineParamsHeader(int whichrow, const std::string& masklist, bool verbose, bool csvformat) const
|
---|
[2012] | 4926 | {
|
---|
[2641] | 4927 | if (verbose) {
|
---|
| 4928 | ostringstream oss;
|
---|
[2012] | 4929 |
|
---|
[2641] | 4930 | if (csvformat) {
|
---|
| 4931 | oss << getScan(whichrow) << ",";
|
---|
| 4932 | oss << getBeam(whichrow) << ",";
|
---|
| 4933 | oss << getIF(whichrow) << ",";
|
---|
| 4934 | oss << getPol(whichrow) << ",";
|
---|
| 4935 | oss << getCycle(whichrow) << ",";
|
---|
| 4936 | String commaReplacedMasklist = masklist;
|
---|
| 4937 | string::size_type pos = 0;
|
---|
| 4938 | while (pos = commaReplacedMasklist.find(","), pos != string::npos) {
|
---|
| 4939 | commaReplacedMasklist.replace(pos, 1, ";");
|
---|
| 4940 | pos++;
|
---|
| 4941 | }
|
---|
| 4942 | oss << commaReplacedMasklist << ",";
|
---|
| 4943 | } else {
|
---|
| 4944 | oss << " Scan[" << getScan(whichrow) << "]";
|
---|
| 4945 | oss << " Beam[" << getBeam(whichrow) << "]";
|
---|
| 4946 | oss << " IF[" << getIF(whichrow) << "]";
|
---|
| 4947 | oss << " Pol[" << getPol(whichrow) << "]";
|
---|
| 4948 | oss << " Cycle[" << getCycle(whichrow) << "]: " << endl;
|
---|
| 4949 | oss << "Fitter range = " << masklist << endl;
|
---|
| 4950 | oss << "Baseline parameters" << endl;
|
---|
| 4951 | }
|
---|
[2012] | 4952 | oss << flush;
|
---|
[2641] | 4953 |
|
---|
| 4954 | return String(oss);
|
---|
[2012] | 4955 | }
|
---|
| 4956 |
|
---|
[2641] | 4957 | return "";
|
---|
[2012] | 4958 | }
|
---|
| 4959 |
|
---|
[2641] | 4960 | std::string Scantable::formatBaselineParamsFooter(float rms, int nClipped, bool verbose, bool csvformat) const
|
---|
[2012] | 4961 | {
|
---|
[2641] | 4962 | if (verbose) {
|
---|
| 4963 | ostringstream oss;
|
---|
[2012] | 4964 |
|
---|
[2641] | 4965 | if (csvformat) {
|
---|
| 4966 | oss << rms << ",";
|
---|
| 4967 | if (nClipped >= 0) {
|
---|
| 4968 | oss << nClipped;
|
---|
| 4969 | }
|
---|
| 4970 | } else {
|
---|
| 4971 | oss << "Results of baseline fit" << endl;
|
---|
| 4972 | oss << " rms = " << setprecision(6) << rms << endl;
|
---|
| 4973 | if (nClipped >= 0) {
|
---|
| 4974 | oss << " Number of clipped channels = " << nClipped << endl;
|
---|
| 4975 | }
|
---|
| 4976 | for (int i = 0; i < 60; ++i) {
|
---|
| 4977 | oss << "-";
|
---|
| 4978 | }
|
---|
[2193] | 4979 | }
|
---|
[2131] | 4980 | oss << endl;
|
---|
[2094] | 4981 | oss << flush;
|
---|
[2641] | 4982 |
|
---|
| 4983 | return String(oss);
|
---|
[2012] | 4984 | }
|
---|
| 4985 |
|
---|
[2641] | 4986 | return "";
|
---|
[2012] | 4987 | }
|
---|
| 4988 |
|
---|
[2186] | 4989 | std::string Scantable::formatBaselineParams(const std::vector<float>& params,
|
---|
| 4990 | const std::vector<bool>& fixed,
|
---|
| 4991 | float rms,
|
---|
[2193] | 4992 | int nClipped,
|
---|
[2186] | 4993 | const std::string& masklist,
|
---|
| 4994 | int whichrow,
|
---|
| 4995 | bool verbose,
|
---|
[2641] | 4996 | bool csvformat,
|
---|
[2186] | 4997 | int start, int count,
|
---|
| 4998 | bool resetparamid) const
|
---|
[2047] | 4999 | {
|
---|
[2064] | 5000 | int nParam = (int)(params.size());
|
---|
[2047] | 5001 |
|
---|
[2064] | 5002 | if (nParam < 1) {
|
---|
| 5003 | return(" Not fitted");
|
---|
| 5004 | } else {
|
---|
| 5005 |
|
---|
| 5006 | ostringstream oss;
|
---|
[2641] | 5007 | oss << formatBaselineParamsHeader(whichrow, masklist, verbose, csvformat);
|
---|
[2064] | 5008 |
|
---|
| 5009 | if (start < 0) start = 0;
|
---|
| 5010 | if (count < 0) count = nParam;
|
---|
| 5011 | int end = start + count;
|
---|
| 5012 | if (end > nParam) end = nParam;
|
---|
| 5013 | int paramidoffset = (resetparamid) ? (-start) : 0;
|
---|
| 5014 |
|
---|
| 5015 | for (int i = start; i < end; ++i) {
|
---|
| 5016 | if (i > start) {
|
---|
[2047] | 5017 | oss << ",";
|
---|
| 5018 | }
|
---|
[2064] | 5019 | std::string sFix = ((fixed.size() > 0) && (fixed[i]) && verbose) ? "(fixed)" : "";
|
---|
[2641] | 5020 | if (csvformat) {
|
---|
| 5021 | oss << params[i] << sFix;
|
---|
| 5022 | } else {
|
---|
| 5023 | oss << " p" << (i+paramidoffset) << sFix << "= " << right << setw(13) << setprecision(6) << params[i];
|
---|
| 5024 | }
|
---|
[2047] | 5025 | }
|
---|
[2064] | 5026 |
|
---|
[2641] | 5027 | if (csvformat) {
|
---|
| 5028 | oss << ",";
|
---|
[2644] | 5029 | } else {
|
---|
| 5030 | oss << endl;
|
---|
[2641] | 5031 | }
|
---|
| 5032 | oss << formatBaselineParamsFooter(rms, nClipped, verbose, csvformat);
|
---|
[2064] | 5033 |
|
---|
| 5034 | return String(oss);
|
---|
[2047] | 5035 | }
|
---|
| 5036 |
|
---|
| 5037 | }
|
---|
| 5038 |
|
---|
[2641] | 5039 | 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
|
---|
[2012] | 5040 | {
|
---|
[2064] | 5041 | int nOutParam = (int)(params.size());
|
---|
| 5042 | int nPiece = (int)(ranges.size()) - 1;
|
---|
[2012] | 5043 |
|
---|
[2064] | 5044 | if (nOutParam < 1) {
|
---|
| 5045 | return(" Not fitted");
|
---|
| 5046 | } else if (nPiece < 0) {
|
---|
[2641] | 5047 | return formatBaselineParams(params, fixed, rms, nClipped, masklist, whichrow, verbose, csvformat);
|
---|
[2064] | 5048 | } else if (nPiece < 1) {
|
---|
| 5049 | return(" Bad count of the piece edge info");
|
---|
| 5050 | } else if (nOutParam % nPiece != 0) {
|
---|
| 5051 | return(" Bad count of the output baseline parameters");
|
---|
| 5052 | } else {
|
---|
| 5053 |
|
---|
| 5054 | int nParam = nOutParam / nPiece;
|
---|
| 5055 |
|
---|
| 5056 | ostringstream oss;
|
---|
[2641] | 5057 | oss << formatBaselineParamsHeader(whichrow, masklist, verbose, csvformat);
|
---|
[2064] | 5058 |
|
---|
[2641] | 5059 | if (csvformat) {
|
---|
| 5060 | for (int i = 0; i < nPiece; ++i) {
|
---|
| 5061 | oss << ranges[i] << "," << (ranges[i+1]-1) << ",";
|
---|
| 5062 | oss << formatBaselineParams(params, fixed, rms, 0, masklist, whichrow, false, csvformat, i*nParam, nParam, true);
|
---|
| 5063 | }
|
---|
| 5064 | } else {
|
---|
| 5065 | stringstream ss;
|
---|
| 5066 | ss << ranges[nPiece] << flush;
|
---|
| 5067 | int wRange = ss.str().size() * 2 + 5;
|
---|
[2064] | 5068 |
|
---|
[2641] | 5069 | for (int i = 0; i < nPiece; ++i) {
|
---|
| 5070 | ss.str("");
|
---|
| 5071 | ss << " [" << ranges[i] << "," << (ranges[i+1]-1) << "]";
|
---|
| 5072 | oss << left << setw(wRange) << ss.str();
|
---|
| 5073 | oss << formatBaselineParams(params, fixed, rms, 0, masklist, whichrow, false, csvformat, i*nParam, nParam, true);
|
---|
[2644] | 5074 | //oss << endl;
|
---|
[2641] | 5075 | }
|
---|
[2012] | 5076 | }
|
---|
[2064] | 5077 |
|
---|
[2641] | 5078 | oss << formatBaselineParamsFooter(rms, nClipped, verbose, csvformat);
|
---|
[2064] | 5079 |
|
---|
| 5080 | return String(oss);
|
---|
[2012] | 5081 | }
|
---|
| 5082 |
|
---|
| 5083 | }
|
---|
| 5084 |
|
---|
[2047] | 5085 | bool Scantable::hasSameNchanOverIFs()
|
---|
[2012] | 5086 | {
|
---|
[2047] | 5087 | int nIF = nif(-1);
|
---|
| 5088 | int nCh;
|
---|
| 5089 | int totalPositiveNChan = 0;
|
---|
| 5090 | int nPositiveNChan = 0;
|
---|
[2012] | 5091 |
|
---|
[2047] | 5092 | for (int i = 0; i < nIF; ++i) {
|
---|
| 5093 | nCh = nchan(i);
|
---|
| 5094 | if (nCh > 0) {
|
---|
| 5095 | totalPositiveNChan += nCh;
|
---|
| 5096 | nPositiveNChan++;
|
---|
[2012] | 5097 | }
|
---|
| 5098 | }
|
---|
| 5099 |
|
---|
[2047] | 5100 | return (totalPositiveNChan == (nPositiveNChan * nchan(0)));
|
---|
[2012] | 5101 | }
|
---|
| 5102 |
|
---|
[2047] | 5103 | std::string Scantable::getMaskRangeList(const std::vector<bool>& mask, int whichrow, const casa::String& coordInfo, bool hasSameNchan, bool verbose)
|
---|
[2012] | 5104 | {
|
---|
[2427] | 5105 | if (mask.size() <= 0) {
|
---|
| 5106 | throw(AipsError("The mask elements should be > 0"));
|
---|
[2012] | 5107 | }
|
---|
[2047] | 5108 | int IF = getIF(whichrow);
|
---|
| 5109 | if (mask.size() != (uInt)nchan(IF)) {
|
---|
[2012] | 5110 | throw(AipsError("Number of channels in scantable != number of mask elements"));
|
---|
| 5111 | }
|
---|
| 5112 |
|
---|
[2047] | 5113 | if (verbose) {
|
---|
[2012] | 5114 | LogIO logOs(LogOrigin("Scantable", "getMaskRangeList()", WHERE));
|
---|
| 5115 | logOs << LogIO::WARN << "The current mask window unit is " << coordInfo;
|
---|
| 5116 | if (!hasSameNchan) {
|
---|
[2047] | 5117 | logOs << endl << "This mask is only valid for IF=" << IF;
|
---|
[2012] | 5118 | }
|
---|
| 5119 | logOs << LogIO::POST;
|
---|
| 5120 | }
|
---|
| 5121 |
|
---|
| 5122 | std::vector<double> abcissa = getAbcissa(whichrow);
|
---|
[2047] | 5123 | std::vector<int> edge = getMaskEdgeIndices(mask);
|
---|
| 5124 |
|
---|
[2012] | 5125 | ostringstream oss;
|
---|
| 5126 | oss.setf(ios::fixed);
|
---|
| 5127 | oss << setprecision(1) << "[";
|
---|
[2047] | 5128 | for (uInt i = 0; i < edge.size(); i+=2) {
|
---|
[2012] | 5129 | if (i > 0) oss << ",";
|
---|
[2047] | 5130 | oss << "[" << (float)abcissa[edge[i]] << "," << (float)abcissa[edge[i+1]] << "]";
|
---|
[2012] | 5131 | }
|
---|
| 5132 | oss << "]" << flush;
|
---|
| 5133 |
|
---|
| 5134 | return String(oss);
|
---|
| 5135 | }
|
---|
| 5136 |
|
---|
[2047] | 5137 | std::vector<int> Scantable::getMaskEdgeIndices(const std::vector<bool>& mask)
|
---|
[2012] | 5138 | {
|
---|
[2427] | 5139 | if (mask.size() <= 0) {
|
---|
| 5140 | throw(AipsError("The mask elements should be > 0"));
|
---|
[2012] | 5141 | }
|
---|
| 5142 |
|
---|
[2047] | 5143 | std::vector<int> out, startIndices, endIndices;
|
---|
| 5144 | int maskSize = mask.size();
|
---|
[2012] | 5145 |
|
---|
[2047] | 5146 | startIndices.clear();
|
---|
| 5147 | endIndices.clear();
|
---|
| 5148 |
|
---|
| 5149 | if (mask[0]) {
|
---|
| 5150 | startIndices.push_back(0);
|
---|
[2012] | 5151 | }
|
---|
[2047] | 5152 | for (int i = 1; i < maskSize; ++i) {
|
---|
| 5153 | if ((!mask[i-1]) && mask[i]) {
|
---|
| 5154 | startIndices.push_back(i);
|
---|
| 5155 | } else if (mask[i-1] && (!mask[i])) {
|
---|
| 5156 | endIndices.push_back(i-1);
|
---|
| 5157 | }
|
---|
[2012] | 5158 | }
|
---|
[2047] | 5159 | if (mask[maskSize-1]) {
|
---|
| 5160 | endIndices.push_back(maskSize-1);
|
---|
| 5161 | }
|
---|
[2012] | 5162 |
|
---|
[2047] | 5163 | if (startIndices.size() != endIndices.size()) {
|
---|
| 5164 | throw(AipsError("Inconsistent Mask Size: bad data?"));
|
---|
| 5165 | }
|
---|
| 5166 | for (uInt i = 0; i < startIndices.size(); ++i) {
|
---|
| 5167 | if (startIndices[i] > endIndices[i]) {
|
---|
| 5168 | throw(AipsError("Mask start index > mask end index"));
|
---|
[2012] | 5169 | }
|
---|
| 5170 | }
|
---|
| 5171 |
|
---|
[2047] | 5172 | out.clear();
|
---|
| 5173 | for (uInt i = 0; i < startIndices.size(); ++i) {
|
---|
| 5174 | out.push_back(startIndices[i]);
|
---|
| 5175 | out.push_back(endIndices[i]);
|
---|
| 5176 | }
|
---|
| 5177 |
|
---|
[2012] | 5178 | return out;
|
---|
| 5179 | }
|
---|
| 5180 |
|
---|
[2791] | 5181 | void Scantable::setTsys(const std::vector<float>& newvals, int whichrow) {
|
---|
| 5182 | Vector<Float> tsys(newvals);
|
---|
| 5183 | if (whichrow > -1) {
|
---|
| 5184 | if (tsysCol_.shape(whichrow) != tsys.shape())
|
---|
| 5185 | throw(AipsError("Given Tsys values are not of the same shape"));
|
---|
| 5186 | tsysCol_.put(whichrow, tsys);
|
---|
| 5187 | } else {
|
---|
| 5188 | tsysCol_.fillColumn(tsys);
|
---|
| 5189 | }
|
---|
| 5190 | }
|
---|
| 5191 |
|
---|
[2161] | 5192 | vector<float> Scantable::getTsysSpectrum( int whichrow ) const
|
---|
| 5193 | {
|
---|
| 5194 | Vector<Float> tsys( tsysCol_(whichrow) ) ;
|
---|
| 5195 | vector<float> stlTsys ;
|
---|
| 5196 | tsys.tovector( stlTsys ) ;
|
---|
| 5197 | return stlTsys ;
|
---|
| 5198 | }
|
---|
[2012] | 5199 |
|
---|
[2591] | 5200 | vector<uint> Scantable::getMoleculeIdColumnData() const
|
---|
| 5201 | {
|
---|
| 5202 | Vector<uInt> molIds(mmolidCol_.getColumn());
|
---|
| 5203 | vector<uint> res;
|
---|
| 5204 | molIds.tovector(res);
|
---|
| 5205 | return res;
|
---|
| 5206 | }
|
---|
[2012] | 5207 |
|
---|
[2591] | 5208 | void Scantable::setMoleculeIdColumnData(const std::vector<uint>& molids)
|
---|
| 5209 | {
|
---|
| 5210 | Vector<uInt> molIds(molids);
|
---|
| 5211 | Vector<uInt> arr(mmolidCol_.getColumn());
|
---|
| 5212 | if ( molIds.nelements() != arr.nelements() )
|
---|
| 5213 | throw AipsError("The input data size must be the number of rows.");
|
---|
| 5214 | mmolidCol_.putColumn(molIds);
|
---|
[1907] | 5215 | }
|
---|
[2591] | 5216 |
|
---|
| 5217 |
|
---|
[2789] | 5218 | void Scantable::dropXPol()
|
---|
| 5219 | {
|
---|
| 5220 | if (npol() <= 2) {
|
---|
| 5221 | return;
|
---|
| 5222 | }
|
---|
| 5223 | if (!selector_.empty()) {
|
---|
| 5224 | throw AipsError("Can only operate with empty selection");
|
---|
| 5225 | }
|
---|
| 5226 | std::string taql = "SELECT FROM $1 WHERE POLNO IN [0,1]";
|
---|
| 5227 | Table tab = tableCommand(taql, table_);
|
---|
| 5228 | table_ = tab;
|
---|
| 5229 | table_.rwKeywordSet().define("nPol", Int(2));
|
---|
| 5230 | originalTable_ = table_;
|
---|
| 5231 | attach();
|
---|
[2591] | 5232 | }
|
---|
[2789] | 5233 |
|
---|
| 5234 | }
|
---|
[1819] | 5235 | //namespace asap
|
---|