[37] | 1 | //#---------------------------------------------------------------------------
|
---|
| 2 | //# MathUtilities.cc: General math operations
|
---|
| 3 | //#---------------------------------------------------------------------------
|
---|
| 4 | //# Copyright (C) 2004
|
---|
[125] | 5 | //# ATNF
|
---|
[37] | 6 | //#
|
---|
| 7 | //# This program is free software; you can redistribute it and/or modify it
|
---|
| 8 | //# under the terms of the GNU General Public License as published by the Free
|
---|
| 9 | //# Software Foundation; either version 2 of the License, or (at your option)
|
---|
| 10 | //# any later version.
|
---|
| 11 | //#
|
---|
| 12 | //# This program is distributed in the hope that it will be useful, but
|
---|
| 13 | //# WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | //# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General
|
---|
| 15 | //# Public License for more details.
|
---|
| 16 | //#
|
---|
| 17 | //# You should have received a copy of the GNU General Public License along
|
---|
| 18 | //# with this program; if not, write to the Free Software Foundation, Inc.,
|
---|
| 19 | //# 675 Massachusetts Ave, Cambridge, MA 02139, USA.
|
---|
| 20 | //#
|
---|
| 21 | //# Correspondence concerning this software should be addressed as follows:
|
---|
| 22 | //# Internet email: Malte.Marquarding@csiro.au
|
---|
| 23 | //# Postal address: Malte Marquarding,
|
---|
| 24 | //# Australia Telescope National Facility,
|
---|
| 25 | //# P.O. Box 76,
|
---|
| 26 | //# Epping, NSW, 2121,
|
---|
| 27 | //# AUSTRALIA
|
---|
| 28 | //#
|
---|
| 29 | //# $Id:
|
---|
| 30 | //#---------------------------------------------------------------------------
|
---|
| 31 |
|
---|
[125] | 32 | #include <casa/aips.h>
|
---|
[176] | 33 | #include <casa/Arrays/Vector.h>
|
---|
[1373] | 34 | #include <casa/Arrays/Slice.h>
|
---|
[137] | 35 | #include <casa/Arrays/MaskedArray.h>
|
---|
[136] | 36 | #include <casa/Arrays/MaskArrMath.h>
|
---|
[465] | 37 | #include <casa/Arrays/VectorSTLIterator.h>
|
---|
[136] | 38 | #include <casa/BasicSL/String.h>
|
---|
[1373] | 39 | #include <scimath/Mathematics/MedianSlider.h>
|
---|
[37] | 40 |
|
---|
[125] | 41 | #include "MathUtils.h"
|
---|
| 42 |
|
---|
| 43 | using namespace casa;
|
---|
| 44 |
|
---|
[829] | 45 | float mathutil::statistics(const String& which,
|
---|
[996] | 46 | const MaskedArray<Float>& data)
|
---|
[136] | 47 | {
|
---|
| 48 | String str(which);
|
---|
| 49 | str.upcase();
|
---|
| 50 | if (str.contains(String("MIN"))) {
|
---|
[829] | 51 | return min(data);
|
---|
[136] | 52 | } else if (str.contains(String("MAX"))) {
|
---|
| 53 | return max(data);
|
---|
| 54 | } else if (str.contains(String("SUMSQ"))) {
|
---|
| 55 | return sumsquares(data);
|
---|
| 56 | } else if (str.contains(String("SUM"))) {
|
---|
| 57 | return sum(data);
|
---|
| 58 | } else if (str.contains(String("MEAN"))) {
|
---|
| 59 | return mean(data);
|
---|
| 60 | } else if (str.contains(String("VAR"))) {
|
---|
[829] | 61 | return variance(data);
|
---|
[136] | 62 | } else if (str.contains(String("STDDEV"))) {
|
---|
| 63 | return stddev(data);
|
---|
| 64 | } else if (str.contains(String("AVDEV"))) {
|
---|
| 65 | return avdev(data);
|
---|
| 66 | } else if (str.contains(String("RMS"))) {
|
---|
| 67 | uInt n = data.nelementsValid();
|
---|
| 68 | return sqrt(sumsquares(data)/n);
|
---|
| 69 | } else if (str.contains(String("MED"))) {
|
---|
| 70 | return median(data);
|
---|
| 71 | }
|
---|
[996] | 72 | return 0.0;
|
---|
[136] | 73 | }
|
---|
[176] | 74 |
|
---|
[829] | 75 |
|
---|
[209] | 76 | void mathutil::replaceMaskByZero(Vector<Float>& data, const Vector<Bool>& mask)
|
---|
[176] | 77 | {
|
---|
| 78 | for (uInt i=0; i<data.nelements(); i++) {
|
---|
| 79 | if (!mask[i]) data[i] = 0.0;
|
---|
| 80 | }
|
---|
| 81 | }
|
---|
[382] | 82 |
|
---|
| 83 |
|
---|
[829] | 84 | std::vector<std::string> mathutil::tovectorstring(const Vector<String>& in)
|
---|
[382] | 85 | {
|
---|
[465] | 86 | std::vector<std::string> out;
|
---|
| 87 | VectorSTLIterator<String> it(in);
|
---|
| 88 | for (uInt i=0; it != in.end(); ++it,++i) {
|
---|
| 89 | out.push_back(*it);
|
---|
| 90 | }
|
---|
| 91 | return out;
|
---|
| 92 | }
|
---|
| 93 |
|
---|
[829] | 94 | Vector<String> mathutil::toVectorString(const std::vector<std::string>& in)
|
---|
[465] | 95 | {
|
---|
| 96 | Vector<String> out(in.size());
|
---|
| 97 | uInt i=0;
|
---|
| 98 | std::vector<std::string>::const_iterator it;
|
---|
| 99 | for (it=in.begin();it != in.end();++it,++i) {
|
---|
| 100 | out[i] = casa::String(*it);
|
---|
| 101 | }
|
---|
| 102 | return out;
|
---|
| 103 | }
|
---|
[1325] | 104 |
|
---|
| 105 | void mathutil::hanning(Vector<Float>& out, Vector<Bool>& outmask,
|
---|
| 106 | const Vector<Float>& in, const Vector<Bool>& mask,
|
---|
| 107 | Bool relaxed, Bool ignoreOther) {
|
---|
| 108 | Vector< Vector<Float> > weights(8);
|
---|
| 109 | Vector<Float> vals(3);
|
---|
| 110 | vals = 0.0;weights[0] = vals;// FFF
|
---|
| 111 | vals[0] = 1.0; vals[1] = 0.0; vals[2] = 0.0; weights[1] = vals;// TFF
|
---|
| 112 | vals[0] = 0.0; vals[1] = 1.0; vals[2] = 0.0; weights[2] = vals;// FTF
|
---|
| 113 | vals[0] = 1.0/3.0; vals[1] = 2.0/3.0; vals[2] = 0.0; weights[3] = vals;// TTF
|
---|
| 114 | vals[0] = 0.0; vals[1] = 0.0; vals[2] = 1.0;weights[4] = vals;// FFT
|
---|
| 115 | vals[0] = 0.5; vals[1] = 0.0; vals[2] = 0.5; weights[5] = vals;// TFT
|
---|
| 116 | vals[0] = 0.0; vals[1] = 2.0/3.0; vals[2] = 1.0/3.0; weights[6] = vals;// FTT
|
---|
| 117 | vals[0] = 0.25; vals[1] = 0.5; vals[2] = 0.25; weights[7] = vals;// TTT
|
---|
| 118 | // Chris' case
|
---|
| 119 | Vector<Bool> weighted(8);
|
---|
| 120 | if (relaxed) {
|
---|
| 121 | weighted = False;
|
---|
| 122 | weighted[7] = True;
|
---|
| 123 |
|
---|
| 124 | } else {
|
---|
| 125 | weighted = True;
|
---|
| 126 | weighted[0] = False;
|
---|
| 127 | }
|
---|
| 128 |
|
---|
| 129 | out.resize(in.nelements());
|
---|
| 130 | outmask.resize(mask.nelements());
|
---|
| 131 | // make special case for first and last
|
---|
| 132 | /// ...here
|
---|
| 133 | // loop from 1..n-2
|
---|
| 134 | out.resize(in.nelements());
|
---|
| 135 | out[0] = in[0];out[out.nelements()-1] = in[in.nelements()-1];
|
---|
| 136 | outmask.resize(mask.nelements());
|
---|
| 137 | outmask = False;
|
---|
| 138 | uInt m;Vector<Float>* w;
|
---|
| 139 | for (uInt i=1; i < out.nelements()-1;++i) {
|
---|
| 140 | m = mask[i-1] + 2*mask[i] + 4*mask[i+1];
|
---|
| 141 | w = &(weights[m]);
|
---|
| 142 | if (weighted[m]) {
|
---|
| 143 | out[i] = (*w)[0]*in[i-1] + (*w)[1]*in[i] + (*w)[2]*in[i+1];
|
---|
| 144 | outmask[i] = True;
|
---|
| 145 | } else { // mask it
|
---|
| 146 | out[i] = in[i];//use arbitrary value
|
---|
| 147 | outmask[i] = False;
|
---|
| 148 | }
|
---|
| 149 | }
|
---|
| 150 | }
|
---|
[1373] | 151 |
|
---|
| 152 |
|
---|
| 153 | void mathutil::runningMedian(Vector<Float>& out, Vector<Bool>& outflag,
|
---|
| 154 | const Vector<Float>& in, const Vector<Bool>& flag,
|
---|
| 155 | float width)
|
---|
| 156 | {
|
---|
| 157 | Int hwidth = Int(width+0.5);
|
---|
| 158 | Int fwidth = hwidth*2+1;
|
---|
| 159 | out.resize(in.nelements());
|
---|
| 160 | outflag.resize(flag.nelements());
|
---|
| 161 | MedianSlider ms(hwidth);
|
---|
| 162 | Slice sl(0, fwidth-1);
|
---|
| 163 | Float medval = ms.add(const_cast<Vector<Float>& >(in)(sl),
|
---|
| 164 | const_cast<Vector<Bool>& >(flag)(sl));
|
---|
| 165 | uInt n = in.nelements();
|
---|
| 166 | for (uInt i=hwidth; i<(n-hwidth); ++i) {
|
---|
| 167 | // add data value
|
---|
[1382] | 168 | out[i] = ms.add(in[i+hwidth], flag[i+hwidth]);
|
---|
[1373] | 169 | outflag[i] = (ms.nval() == 0);
|
---|
| 170 | }
|
---|
| 171 | // replicate edge values from fisrt value with full width of values
|
---|
| 172 | for (uInt i=0;i<hwidth;++i) {
|
---|
| 173 | out[i] = out[hwidth];
|
---|
| 174 | outflag[i] = outflag[hwidth];
|
---|
| 175 | out[n-1-i] = out[n-1-hwidth];
|
---|
| 176 | outflag[n-1-i] = outflag[n-1-hwidth];
|
---|
| 177 | }
|
---|
| 178 | }
|
---|