casacore
Loading...
Searching...
No Matches
LatticeStatistics.h
Go to the documentation of this file.
1// # LatticeStatistics.h: generate statistics from a Lattice
2// # Copyright (C) 1996,1997,1998,1999,2000,2001,2002,2003
3// # Associated Universities, Inc. Washington DC, USA.
4// #
5// # This library is free software; you can redistribute it and/or modify it
6// # under the terms of the GNU Library General Public License as published by
7// # the Free Software Foundation; either version 2 of the License, or (at your
8// # option) any later version.
9// #
10// # This library is distributed in the hope that it will be useful, but WITHOUT
11// # ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12// # FITNESS FOR A PARTICULAR PURPOSE. See the GNU Library General Public
13// # License for more details.
14// #
15// # You should have received a copy of the GNU Library General Public License
16// # along with this library; if not, write to the Free Software Foundation,
17// # Inc., 675 Massachusetts Ave, Cambridge, MA 02139, USA.
18// #
19// # Correspondence concerning AIPS++ should be addressed as follows:
20// # Internet email: casa-feedback@nrao.edu.
21// # Postal address: AIPS++ Project Office
22// # National Radio Astronomy Observatory
23// # 520 Edgemont Road
24// # Charlottesville, VA 22903-2475 USA
25
26#ifndef LATTICES_LATTICESTATISTICS_H
27#define LATTICES_LATTICESTATISTICS_H
29#include <casacore/casa/aips.h>
30#include <casacore/casa/Arrays/Array.h>
31#include <casacore/casa/Containers/Block.h>
32#include <casacore/casa/Arrays/Vector.h>
33#include <casacore/casa/Containers/Record.h>
34#include <casacore/lattices/LatticeMath/LatticeStatsBase.h>
35#include <casacore/lattices/LatticeMath/TiledCollapser.h>
36#include <casacore/lattices/LatticeMath/TiledCollapser.h>
37#include <casacore/lattices/LEL/LatticeExprNode.h>
38#include <casacore/lattices/LatticeMath/LatticeStatsDataProvider.h>
39#include <casacore/lattices/LatticeMath/MaskedLatticeStatsDataProvider.h>
40#include <casacore/scimath/Mathematics/NumericTraits.h>
41#include <casacore/casa/Utilities/DataType.h>
42#include <casacore/casa/BasicSL/String.h>
43#include <casacore/casa/Logging/LogIO.h>
44#include <casacore/scimath/StatsFramework/FitToHalfStatisticsData.h>
45#include <casacore/scimath/StatsFramework/StatisticsData.h>
46#include <casacore/scimath/StatsFramework/StatisticsAlgorithm.h>
47#include <casacore/scimath/StatsFramework/StatisticsAlgorithmFactory.h>
49#include <vector>
50#include <list>
52namespace casacore { // # NAMESPACE CASACORE - BEGIN
54// # Forward Declarations
55template <class T>
56class MaskedLattice;
57template <class T>
58class SubLattice;
59template <class T>
60class TempLattice;
61class IPosition;
62
63#include <casacore/casa/iosstrfwd.h>
64
65// <summary>
66// Compute and display various statistics from a lattice
67// </summary>
68// <use visibility=export>
69// <reviewed reviewer="" date="yyyy/mm/dd" tests="" demos="">
70// </reviewed>
71// <prerequisite>
72// <li> <linkto class=LatticeStatsBase>LatticeStatsBase</linkto>
73// <li> <linkto class=MaskedLattice>MaskedLattice</linkto>
74// </prerequisite>
75
76// <etymology>
77// This is a class designed to display and retrieve statistics from lattices
78// </etymology>
79
80// <synopsis>
81// This class enable you to display and/or retrieve statistics evaluated over
82// specified regions of a lattice. The dimension of the region is arbitrary, but
83// the size of each dimension is always the shape of the corresponding lattice axis.
84// The statistics are displayed as a function of location of the axes not
85// used to evaluate the statistics over. The axes which you evaluate the statistics
86// over are called the cursor axes, the others are called the display axes.
87//
88// For example, consider a lattice cube (call the axes xyz or [0,1,2]). You could
89// display statistics from xy planes (cursor axes [0,1]) as a function of z (display
90// axes [2]). Or you could retrieve statistics from the z axis (cursor axes [2])
91// for each [x,y] location (display axes [0,1]).
92//
93// This class inherits from <linkto class="LatticeStatsBase">LatticeStatsBase</linkto>
94// This base class provides an <src>enum</src> defining allowed statistics types and a
95// helper function to convert between a <src>String</src> and a
96// <src>Vector<Int></src> describing the desired statistics to plot.
97// An example is shown below.
98//
99// This class can list, plot and retrieve statistics. When it lists statistics,
100// it always lists all the available statistics. When you plot statistics,
101// you must specify which ones you would like to see.
102//
103// This class generates a "storage lattice" into which it writes the accumulated
104// statistical sums. It is from this storage lattice that the plotting and retrieval
105// arrays are drawn. The storage lattice is either in core or on disk
106// depending upon its size (if > 10% of memory given by .aipsrc system.resources.memory
107// then it goes into a disk-based PagedArray). If on disk, the
108// storage lattice is deleted when the <src>LatticeStatistics</src> class
109// object destructs. However, currently, if the process is terminated ungracefully,
110// the storage lattice will be left over.
111// </synopsis>
112//
113// <note role=tip>
114// This class has a few virtual functions; they are not part of a nice general
115// polymorphic interface; rather they have specialized functionality. The idea
116// of these is that you can derive a class from LatticeStatistics, such as
117// <linkto class="ImageStatistics">ImageStatistics</linkto> which provides
118// you with a little more information when displaying/logging the
119// statistics (such as world coordinates)
120// The virtual functions are
121// <ul>
122// <li> <src>getBeamArea</src> can be used to return the synthesized beam
123// area so that the FLUX statistic can be computed
124// <li> <src>listStats</src> is used to list the statistics to the logger
125// <li> <src>getLabelsM</src> find the X-axis label and the title label
126// for the plotting.
127// </ul>
128// </note>
129//
130// <note role=tip>
131// If you ignore return error statuses from the functions that set the
132// state of the class, the internal status of the class is set to bad.
133// This means it will just keep on returning error conditions until you
134// explicitly recover the situation. A message describing the last
135// error condition can be recovered with function errorMessage.
136// </note>
137
138// <example>
139// <srcBlock>
141//
142// PagedImage<Float> inImage(inName);
143//
145//
146// LogOrigin or("myClass", "myFunction(...)", WHERE);
147// LogIO os(or);
148// LatticeStatistics<Float> stats(SubImage<FLoat>(inImage), os);
149//
151//
152// Vector<Int> cursorAxes(2)
153// cursorAxes(0) = 1;
154// cursorAxes(1) = 2;
155// if (!stats.setAxes(cursorAxes)) return 1;
156//
158//
159// if (!stats.setList(True)) return 1;
160// String device = "/xs";
161// Vector<Int> nxy(2);
162// nxy(0) = 1;
163// nxy(1) = 1;
164// Vector<Int> statsToPlot = LatticeStatsBase::toStatisticTypes("mean,rms,sigma");
165// if (!stats.setPlotting(statsToPlot, device, nxy)) return 1;
166//
168//
169// if (!stats.display ()) return 1;
170//
172//
173// Array<Double> sum;
174// if (!stats.getStatistic(sum, LatticeStatsBase::SUM)) return 1;
175//
176// </srcBlock>
177// In this example, a <src>PagedImage</src> is constructed (which isA
178// MaskedLattice) with . We set the cursor axes
179// to be the y and z axes, we specify to list the statistics if we plot them,
180// and we ask to plot the mean, standard deviation, and root mean square of each
181// yz plane as a function of x location on the PGPLOT device "/xs" with
182// 1 subplot per page (there will be only one in this case). After the
183// plotting and listing, we also retrieve the sum of the selected pixels
184// as a function of x location into an array.
185// </example>
186
187// <motivation>
188// The generation of statistical information from a lattice is a basic
189// and necessary capability.
190// </motivation>
191
192// <todo asof="1996/11/26">
193// <li> Implement plotting for complex lattices
194// <li> Retrieve statistics at specified location of display axes
195// </todo>
196
197template <class T>
199 public:
201
202 // Constructor takes the lattice and a <src>LogIO</src> object for logging.
203 // You can specify whether you want to see progress meters or not.
204 // You can force the storage lattice to be disk based, otherwise
205 // the decision for core or disk is taken for you.
206 // If <src>clone</src> is True, the input lattice will be cloned, so the caller
207 // can make changes to the input lattice, but the statistics will reflect the
208 // lattice as it was at construction. If False, a reference to the input lattice
209 // is used, and so the caller shouldn't make changes to the input lattice between
210 // construction and calling statistics computation methods, unless it calls setNewLattice()
211 // to update the changed lattice. Obviously, cloning the lattice impacts performance
212 // and memory usage.
213 LatticeStatistics(const MaskedLattice<T>& lattice, LogIO& os, Bool showProgress = True,
214 Bool forceDisk = False, Bool clone = True);
215
216 // Constructor takes the lattice only. In the absence of a logger you get no messages.
217 // This includes error messages and potential listing of the statistics.
218 // You can specify whether you want to see progress meters or not.
219 // You can force the storage lattice to be disk based, otherwise
220 // the decision for core or disk is taken for you.
221 LatticeStatistics(const MaskedLattice<T>& lattice, Bool showProgress = True,
222 Bool forceDisk = False, Bool clone = True);
223
224 // Copy constructor. Copy semantics are followed. Therefore any storage lattice
225 // that has already been created for <src>other</src> is copied to <src>*this</src>
227
228 // Destructor
230
231 // Assignment operator. Deletes any storage lattice associated with
232 // the object being assigned to and copies any storage lattice that has
233 // already been created for "other".
235
236 // Set the cursor axes (0 relative). A return value of <src>False</src>
237 // indicates you have asked for an invalid axis. The default state of the class
238 // is to set the cursor axes to all axes in the lattice.
239 Bool setAxes(const Vector<Int>& cursorAxes);
240
241 // You may specify a pixel intensity range as either one for which
242 // all pixels in that range are included or one for which all pixels
243 // in that range are excluded. One or the other of <src>include</src>
244 // and <src>exclude</src> must therefore be a zero length vector if you
245 // call this function. If you are setting an <src>include</src>
246 // range, then if you set <src>setMinMaxToInclude=True</src>, the
247 // minimum and maximum values that this class returns will always be
248 // the minimum and maximum of the <src>include</src> range, respectively.
249 // A return value of <src>False</src> indicates that
250 // you have given both an <src>include</src> and an <src>exclude</src>
251 // range. A vector of length 1 for <src>include</src> and/or <src>exclude</src>
252 // means that the range will be set to (say for <src>include</src>)
253 // <src>-abs(include(0))</src> to <src>abs(include(0))</src>. A return value
254 // of <src>False</src> indicates that both an inclusion and exclusion
255 // range were given or that the internal state of the class is bad. If you don't
256 // call this function, the default state of the class is to include all pixels.
257 Bool setInExCludeRange(const Vector<T>& include, const Vector<T>& exclude,
258 Bool setMinMaxToInclude = False);
259
260 // This function allows you to control whether the statistics are written to
261 // the output stream if you are also making a plot. A return value of
262 // <src>False</src> indicates that the internal state of the class is bad.
263 // If you have created the <src>LatticeStatistics</src> object without
264 // a <src>LogIO</src> object, you won't see any listings, but no error
265 // conditions will be generated. The default state of the class is to
266 // not list the output when making a plot.
267 Bool setList(const Bool& doList);
268
269 // Display the statistics by listing and/or plotting them. If you don't call
270 // this function then you won't see anything ! A return value of <src>False</src>
271 // indicates an invalid plotting device, or that the internal state of the class is bad.
272
274
275 Bool getLayerStats(String& stats, Double area, Int zAxis = -1, Int zLayer = -1, Int hAxis = -1,
276 Int hLayer = -1);
277
278 typedef std::pair<String, String> stat_element;
279 typedef std::list<stat_element> stat_list;
280 Bool getLayerStats(stat_list& stats, Double area, Int zAxis = -1, Int zLayer = -1, Int hAxis = -1,
281 Int hLayer = -1);
282
283 // Return the display axes. The returned vector will be valid only if <src>setAxes</src>
284 // has been called, or if one of the active "display" or "get*" methods has been called.
286
287 // Recover the desired Statistic into an array. If you choose to use
288 // the T version, be aware that the values in the AccumType version of the
289 // Array may not be representable in the T version (e.g. large values for
290 // SumSq). The shape of the
291 // array is the shape of the display axes (e.g. if the shape of the lattice is
292 // [nx,ny,nz] and you ask for the mean of the y axis the shape of the returned
293 // array would be [nx,nz]. A returned array of zero shape indicates that there
294 // were no good values. A return value of <src>False</src>
295 // indicates that the internal state of the class is bad.
296 // <group>
298 Bool dropDeg = True);
300 Bool dropDeg = True);
301 // </group>
302
303 // Recover position of min and max. Only works if there are no
304 // display axes (i.e. statistics found over entire image), otherwise,
305 // the returned values are resized to 0 shape. A return
306 // value of <src>False</src> indicates that the internal state of
307 // the class is bad.
309
310 // This function gets a vector containing all the statistics
311 // for a given location. If <src>posInLattice=True</src> then
312 // the location is a location in the input lattice. Any
313 // positions on the display axes are ignored. Otherwise, you
314 // should just give locations for the display axes only.
315 // Use can use the enum in class LatticeStatsBase to find out
316 // which locations in the vector contain which statistics.
317 // A returned vector of zero shape indicates that there
318 // were no good values. A return value of <src>False</src>
319 // indicates that the internal state of the class is bad.
320 Bool getStats(Vector<AccumType>&, const IPosition& pos, const Bool posInLattice = False);
321
322 // Reset argument error condition. If you specify invalid arguments to
323 // one of the above <src>set</src> functions, an internal flag will be set which will
324 // prevent the work functions from doing anything (should you have chosen
325 // to ignore the Boolean return values of the <src>set</src> functions).
326 // This function allows you to reset that internal state to good.
328
329 // Get full lattice min and max only. Returns False if no unmasked data, else returns True.
330 // Honours any include or exclude range if set.
331 Bool getFullMinMax(T& dataMin, T& dataMax);
332
333 // Recover last error message
334 String errorMessage() const { return error_p; };
335
336 // Set a new MaskedLattice object. A return value of <src>False</src> indicates the
337 // lattice had an invalid type or that the internal state of the class is bad.
338 // If <src>clone</src> is True, the input lattice will be cloned, so the caller
339 // can make changes to the input lattice, but the statistics will reflect the
340 // lattice as it was at construction. If False, a reference to the input lattice
341 // is used, and so the caller shouldn't make changes to the input lattice between
342 // construction and calling statistics computation methods, unless it calls setNewLattice()
343 // to update the changed lattice. Obviously, cloning the lattice impacts performance
344 // and memory usage.
346
347 // Did we construct with a logger ?
348 Bool hasLogger() const { return haveLogger_p; };
349
350 // The configure methods return True if reconfiguration is actually
351 // necessary (ie if the underlying storage lattice needs to be recomputed).
352 // If no reconfiguration is necessary, False is returned.
353
354 // configure to use biweight algorithm.
356
357 // configure object to use Classical Statistics
358 // The time, t_x, it takes to compute classical statistics using algorithm x, can
359 // be modeled by
360 // t_x = n_sets*(a_x + b_x*n_el)
361 // where n_sets is the number of independent sets of data to compute stats on,
362 // each containing n_el number of elements. a_x is the time it takes to compute
363 // stats a a single set of data, and b_x is the time it takes to accumulate
364 // a single point.
365 // The old algorithm was developed in the early history of the project, I'm guessing
366 // by Neil Kileen, while the new algorithm was developed in 2015 by Dave Mehringer
367 // as part of the stats framework project. The old algorithm is faster in the regime
368 // of large n_sets and small n_el, while the new algorithm is faster in the
369 // regime of small n_sets and large n_el.
370 // If one always wants to use one of these algorithms, that algorithm's coefficients
371 // should be set to 0, while setting the other algorithm's coefficients to positive
372 // values. Note that it's the relative, not the absolute, values of these
373 // coeffecients that is important
374 // The version that takes no parameters uses the default values of the coefficients;
375 // <group>
377
379 // </group>
380
381 // configure to use fit to half algorithm.
385 AccumType centerValue = 0);
386
387 // configure to use hinges-fences algorithm
389
390 // configure to use Chauvenet's criterion
391 Bool configureChauvenet(Double zscore = -1, Int maxIterations = -1);
392
393 // <group>
394 // The force* methods are really only for testing. They in general shouldn't
395 // be called in production code. The last one to be called will be the one to
396 // be attempted to be used.
398
400
402 // </group>
403
405
406 // get number of iterations associated with Chauvenet criterion algorithm
407 std::map<String, uInt> getChauvenetNiter() const { return _chauvIters; }
408
409 // should quantile-like stats (median, quartiles, medabsdevmed) be computed?
410 // When the stats framework is used, It is better to set this before computing
411 // any statistics, to avoid unnecessary duplicate creations of the
412 // stats algorithm objects. Unnecessary recreation of these is a performance
413 // bottleneck for iterative stats algorithms (eg Chauvenet), especially for
414 // large images (CAS-10947/10948).
416
417 protected:
422
423 // doRobust means that when the storage lattice is generated, the
424 // robust statistics are generated as well
425
430 //
431 // Virtual Functions. See implementation to figure it all out !
432
433 // FIXME The indirect dependence of this class on ImageInterface related
434 // issues (eg flux density) breaks encapsulation. All the ImageInterface related code should be
435 // encapsulated in ImageStatistics. Unfortunately, that requires significantly
436 // more time than I have atm. A return value of False means that the object in
437 // question cannot compute flux density values. The default implementation returns False.
438 virtual Bool _canDoFlux() const { return False; }
439
441 ThrowCc("Logic Error: This object cannot compute flux density");
442 }
443
444 virtual void listMinMax(ostringstream& osMin, ostringstream& osMax, Int oWidth, DataType type);
445
446 //
447
448 // List the statistics to the logger. The implementation here
449 // is adequate for all lattices. See ImageStatistics for an
450 // example of where extra information is provided. hasBeam is
451 // the return value of getBeamArea. If it is true, that means
452 // that the FLUX statistics will be available in the storage
453 // lattice. dPos is the location of the start of the cursor in the
454 // storage image for this row. stats(j,i) is the statistics matrix.
455 // for the jth point and the ith statistic.
456 // The return value is False if something goes wrong !
457 // Have a look at the implementation to see what you really
458 // have to do.
459 virtual Bool listStats(Bool hasBeam, const IPosition& dPos, const Matrix<AccumType>& ord);
460 virtual Bool listLayerStats(const Matrix<AccumType>& ord, ostringstream& rslt, Int zLayer);
461
462 // Given a location in the storage lattice, convert those locations on the
463 // non-statistics axis (the last one) and optionally account for the
464 // lattice subsectioning
465 IPosition locInLattice(const IPosition& storagePosition, Bool relativeToParent = True) const;
466
467 // Non-virtual functions
468 //
469 // set stream manipulators
470 void setStream(std::ostream& os, Int oPrec);
471
472 // get the storage lattice shape
473 inline IPosition _storageLatticeShape() const { return pStoreLattice_p->shape(); }
474
476 const Array<AccumType>& sum);
477
479 Bool posInLattice);
480
481 // convert a position in the input lattice to the corresponding
482 // position in the stats storage lattice. The number of elements
483 // in storagePos will not be changed and only the first N elements
484 // will be modified where N = the number of elements in latticePos.
485 // <src>storagePos</src> must therefore have at least as many elements
486 // as <src>latticePos</src>. Returns False if
487 //<src>latticePos</src> is inconsistent with the input lattice.
488 void _latticePosToStoragePos(IPosition& storagePos, const IPosition& latticePos);
489
491
492 private:
498
500 std::shared_ptr<const MaskedLattice<T>> _inLatPtrMgr;
501
502 std::shared_ptr<TempLattice<AccumType>> pStoreLattice_p;
506
509
512
514 std::map<String, uInt> _chauvIters;
515
517
518 // unset means let the code decide
519 std::unique_ptr<LatticeStatsAlgorithm> _latticeStatsAlgortihm;
520
522 // coefficients from timings run on PagedImages on
523 // etacarinae.cv.nrao.edu (dmehring's development
524 // machine)
525 _aOld = 4.7e-7;
526 _bOld = 2.3e-8;
527 _aNew = 1.6e-5;
528 _bNew = 1.5e-8;
529 }
530
531 // Summarize the statistics found over the entire lattice
532 virtual void summStats();
533
534 virtual void displayStats(AccumType nPts, AccumType sum, AccumType median, AccumType medAbsDevMed,
535 AccumType quartile, AccumType sumSq, AccumType mean, AccumType var,
536 AccumType rms, AccumType sigma, AccumType dMin, AccumType dMax,
537 AccumType q1, AccumType q3);
538
539 // Calculate statistic from storage lattice and return in an array
541 Bool dropDeg);
542
543 template <class U, class V>
545 std::shared_ptr<StatisticsAlgorithm<AccumType, U, V>> statsAlg,
546 uInt64 knownNpts, AccumType knownMin, AccumType knownMax) const;
547
548 template <class U, class V>
551 std::shared_ptr<StatisticsAlgorithm<AccumType, U, V>> statsAlg) const;
552
553 // Find the median per cursorAxes chunk
555
556 // Create a new storage lattice
558
559 // Given a location in the lattice and a statistic type, work
560 // out where to put it in the storage lattice
563
564 // Find min and max of good data in arrays specified by pointers
565 void minMax(Bool& none, AccumType& dMin, AccumType& dMax, const Vector<AccumType>& d,
566 const Vector<AccumType>& n) const;
567
568 // Retrieve a statistic from the storage lattice and return in an array
570 const LatticeStatsBase::StatisticsTypes type, const Bool dropDeg);
571
572 // Retrieve a statistic from the storage lattice at the specified
573 // location and return in an array
575 const Bool posInLattice);
576
577 // Find the shape of slice from the statistics lattice at one
578 // spatial pixel
580
581 // See if there were some valid points found in the storage lattice
583
584 // Stretch min and max by 5%
585 void stretchMinMax(AccumType& dMin, AccumType& dMax) const;
586
588 MaskedLatticeStatsDataProvider<T>& maskedLattDP) const;
589
590 void _doStatsLoop(uInt nsets, std::shared_ptr<LattStatsProgress> progressMeter);
591
592 void _computeStatsUsingArrays(std::shared_ptr<LattStatsProgress> progressMeter,
593 const IPosition& cursorShape);
594
596 Slicer& slicer,
597 std::shared_ptr<LattStatsProgress> progressMeter,
598 uInt nsets);
599
601
603 std::vector<std::shared_ptr<StatisticsAlgorithm<AccumType, typename Array<T>::const_iterator,
605 T& overallMin, T& overallMax, IPosition& arrayShape, std::vector<Array<T>>& dataArray,
606 std::vector<Array<Bool>>& maskArray, std::vector<IPosition>& curPos, uInt nthreads,
607 Bool isChauv, Bool isMasked, Bool isReal, std::shared_ptr<const DataRanges> range);
608
609 void _fillStorageLattice(T currentMin, T currentMax, const IPosition& curPos,
610 const StatsData<AccumType>& stats, Bool doQuantiles, AccumType q1 = 0,
611 AccumType q3 = 0);
612
613 inline static AccumType _mean(const AccumType& sum, const AccumType& npts) {
614 return npts <= 0 ? 0 : sum / npts;
615 }
616
617 inline static AccumType _rms(const AccumType& sumsq, const AccumType& npts) {
618 return npts <= 0 ? 0 : sqrt(sumsq / npts);
619 }
620
621 void _updateMinMaxPos(T& overallMin, T& overallMax, T currentMin, T currentMax,
622 const IPosition& minPos, const IPosition& maxPos, Bool atStart);
623};
624
625// # Declare extern templates for often used types.
626extern template class LatticeStatistics<Float>;
627
628} // namespace casacore
629
630#ifndef CASACORE_NO_AUTO_TEMPLATES
631#include <casacore/lattices/LatticeMath/LatticeStatistics.tcc>
632#endif // # CASACORE_NO_AUTO_TEMPLATES
633#endif
#define ThrowCc(m)
Definition Error.h:96
ConstIteratorSTL const_iterator
Definition Array.h:808
USE_DATA
which section of data to use, greater than or less than the center value
CENTER
choice of center point based on the corresponding statistics from the entire distribution of data,...
Bool retrieveStorageStatistic(Vector< AccumType > &slice, const IPosition &pos, const Bool posInLattice)
Retrieve a statistic from the storage lattice at the specified location and return in an array.
Bool someGoodPoints()
See if there were some valid points found in the storage lattice.
LatticeStatistics< T > & operator=(const LatticeStatistics< T > &other)
Assignment operator.
void _fillStorageLattice(T currentMin, T currentMax, const IPosition &curPos, const StatsData< AccumType > &stats, Bool doQuantiles, AccumType q1=0, AccumType q3=0)
IPosition locInStorageLattice(const IPosition &latticePosition, LatticeStatsBase::StatisticsTypes type) const
Given a location in the lattice and a statistic type, work out where to put it in the storage lattice...
Bool getLayerStats(String &stats, Double area, Int zAxis=-1, Int zLayer=-1, Int hAxis=-1, Int hLayer=-1)
std::map< String, uInt > _chauvIters
Bool doRobust_p
doRobust means that when the storage lattice is generated, the robust statistics are generated as wel...
Bool configureHingesFences(Double f)
configure to use hinges-fences algorithm
static AccumType _mean(const AccumType &sum, const AccumType &npts)
virtual Bool listLayerStats(const Matrix< AccumType > &ord, ostringstream &rslt, Int zLayer)
void forceAllowCodeDecideWhichAlgortihmToUse()
Vector< Int > displayAxes() const
Return the display axes.
virtual ~LatticeStatistics()
Destructor.
virtual Bool _computeFlux(Array< AccumType > &flux, const Array< AccumType > &npts, const Array< AccumType > &sum)
Bool configureClassical(Double aOld, Double bOld, Double aNew, Double bNew)
void setStream(std::ostream &os, Int oPrec)
Non-virtual functions.
void setComputeQuantiles(Bool b)
should quantile-like stats (median, quartiles, medabsdevmed) be computed?
Bool display()
Display the statistics by listing and/or plotting them.
std::list< stat_element > stat_list
virtual void summStats()
Summarize the statistics found over the entire lattice.
void _computeQuantiles(AccumType &median, AccumType &medAbsDevMed, AccumType &q1, AccumType &q3, std::shared_ptr< StatisticsAlgorithm< AccumType, U, V > > statsAlg, uInt64 knownNpts, AccumType knownMin, AccumType knownMax) const
StatisticsAlgorithmFactory< AccumType, const T *, const Bool * > _saf
Bool setAxes(const Vector< Int > &cursorAxes)
Set the cursor axes (0 relative).
std::unique_ptr< LatticeStatsAlgorithm > _latticeStatsAlgortihm
unset means let the code decide
Bool retrieveStorageStatistic(Array< AccumType > &slice, const LatticeStatsBase::StatisticsTypes type, const Bool dropDeg)
Retrieve a statistic from the storage lattice and return in an array.
NumericTraits< T >::PrecisionType AccumType
StatisticsData::ALGORITHM _getAlgorithm() const
const MaskedLattice< T > * pInLattice_p
Bool configureFitToHalf(FitToHalfStatisticsData::CENTER centerType=FitToHalfStatisticsData::CMEAN, FitToHalfStatisticsData::USE_DATA useData=FitToHalfStatisticsData::LE_CENTER, AccumType centerValue=0)
configure to use fit to half algorithm.
void resetError()
Reset argument error condition.
Bool getFullMinMax(T &dataMin, T &dataMax)
Get full lattice min and max only.
std::shared_ptr< TempLattice< AccumType > > pStoreLattice_p
Bool configureBiweight(Int maxIter, Double c)
The configure methods return True if reconfiguration is actually necessary (ie if the underlying stor...
virtual Bool _computeFlux(Quantum< AccumType > &flux, AccumType sum, const IPosition &pos, Bool posInLattice)
static AccumType _rms(const AccumType &sumsq, const AccumType &npts)
Bool setList(const Bool &doList)
This function allows you to control whether the statistics are written to the output stream if you ar...
Bool getMinMaxPos(IPosition &minPos, IPosition &maxPos)
Recover position of min and max.
void _computeStatsUsingArrays(std::shared_ptr< LattStatsProgress > progressMeter, const IPosition &cursorShape)
Bool setInExCludeRange(const Vector< T > &include, const Vector< T > &exclude, Bool setMinMaxToInclude=False)
You may specify a pixel intensity range as either one for which all pixels in that range are included...
IPosition locInLattice(const IPosition &storagePosition, Bool relativeToParent=True) const
Given a location in the storage lattice, convert those locations on the non-statistics axis (the last...
String errorMessage() const
Recover last error message.
Bool setNewLattice(const MaskedLattice< T > &lattice, Bool clone=True)
Set a new MaskedLattice object.
void _configureDataProviders(LatticeStatsDataProvider< T > &lattDP, MaskedLatticeStatsDataProvider< T > &maskedLattDP) const
Bool configureChauvenet(Double zscore=-1, Int maxIterations=-1)
configure to use Chauvenet's criterion
void stretchMinMax(AccumType &dMin, AccumType &dMax) const
Stretch min and max by 5%.
std::map< String, uInt > getChauvenetNiter() const
get number of iterations associated with Chauvenet criterion algorithm
void forceUseStatsFrameworkUsingDataProviders()
The force* methods are really only for testing.
IPosition statsSliceShape() const
Find the shape of slice from the statistics lattice at one spatial pixel.
LatticeStatistics(const MaskedLattice< T > &lattice, Bool showProgress=True, Bool forceDisk=False, Bool clone=True)
Constructor takes the lattice only.
Bool hasLogger() const
Did we construct with a logger ?
virtual Bool listStats(Bool hasBeam, const IPosition &dPos, const Matrix< AccumType > &ord)
List the statistics to the logger.
Bool calculateStatistic(Array< AccumType > &slice, LatticeStatsBase::StatisticsTypes type, Bool dropDeg)
Calculate statistic from storage lattice and return in an array.
std::shared_ptr< const MaskedLattice< T > > _inLatPtrMgr
Bool getStats(Vector< AccumType > &, const IPosition &pos, const Bool posInLattice=False)
This function gets a vector containing all the statistics for a given location.
LatticeStatistics(const LatticeStatistics< T > &other)
Copy constructor.
void _updateMinMaxPos(T &overallMin, T &overallMax, T currentMin, T currentMax, const IPosition &minPos, const IPosition &maxPos, Bool atStart)
void _latticePosToStoragePos(IPosition &storagePos, const IPosition &latticePos)
convert a position in the input lattice to the corresponding position in the stats storage lattice.
virtual Bool _canDoFlux() const
Virtual Functions.
virtual void listMinMax(ostringstream &osMin, ostringstream &osMax, Int oWidth, DataType type)
LatticeStatistics(const MaskedLattice< T > &lattice, LogIO &os, Bool showProgress=True, Bool forceDisk=False, Bool clone=True)
Constructor takes the lattice and a LogIO object for logging.
virtual void displayStats(AccumType nPts, AccumType sum, AccumType median, AccumType medAbsDevMed, AccumType quartile, AccumType sumSq, AccumType mean, AccumType var, AccumType rms, AccumType sigma, AccumType dMin, AccumType dMax, AccumType q1, AccumType q3)
Bool getStatistic(Array< AccumType > &stat, LatticeStatsBase::StatisticsTypes type, Bool dropDeg=True)
Recover the desired Statistic into an array.
IPosition _cursorShapeForArrayMethod(uInt64 setSize) const
std::pair< String, String > stat_element
IPosition _storageLatticeShape() const
get the storage lattice shape
Bool configureClassical()
configure object to use Classical Statistics The time, t_x, it takes to compute classical statistics ...
void _doComputationUsingArrays(std::vector< std::shared_ptr< StatisticsAlgorithm< AccumType, typename Array< T >::const_iterator, Array< Bool >::const_iterator > > > &sa, T &overallMin, T &overallMax, IPosition &arrayShape, std::vector< Array< T > > &dataArray, std::vector< Array< Bool > > &maskArray, std::vector< IPosition > &curPos, uInt nthreads, Bool isChauv, Bool isMasked, Bool isReal, std::shared_ptr< const DataRanges > range)
Bool getLayerStats(stat_list &stats, Double area, Int zAxis=-1, Int zLayer=-1, Int hAxis=-1, Int hLayer=-1)
void generateRobust()
Find the median per cursorAxes chunk.
Bool getConvertedStatistic(Array< T > &stat, LatticeStatsBase::StatisticsTypes type, Bool dropDeg=True)
void minMax(Bool &none, AccumType &dMin, AccumType &dMax, const Vector< AccumType > &d, const Vector< AccumType > &n) const
Find min and max of good data in arrays specified by pointers.
void _computeStatsUsingLattDataProviders(LatticeStepper &stepper, SubLattice< T > subLat, Slicer &slicer, std::shared_ptr< LattStatsProgress > progressMeter, uInt nsets)
void _computeQuantilesForStatsFramework(StatsData< AccumType > &stats, AccumType &q1, AccumType &q3, std::shared_ptr< StatisticsAlgorithm< AccumType, U, V > > statsAlg) const
void _doStatsLoop(uInt nsets, std::shared_ptr< LattStatsProgress > progressMeter)
Bool generateStorageLattice()
Create a new storage lattice.
virtual Quantum< AccumType > _flux(Bool &, AccumType, Double) const
StatisticsTypes
This enum StatisticTypes is provided for use with the LatticeStatistics<T>::setPlotting function.
Data provider which allows stats framework to iterate through an unmasked lattice.
Data provider which allows stats framework to iterate through a masked lattice.
Char PrecisionType
Higher precision type (Float->Double).
Provides a single interface for creation of stats algorithm objects.
Base class of statistics algorithm class hierarchy.
ALGORITHM
implemented algorithms
String: the storage and methods of handling collections of characters.
Definition String.h:355
For temporary backward namespace compatibility, use casa as alias for casacore.
Definition mainpage.dox:28
const Bool False
Definition aipstype.h:42
LatticeExprNode mean(const LatticeExprNode &expr)
LatticeExprNode sum(const LatticeExprNode &expr)
unsigned int uInt
Definition aipstype.h:49
LatticeExprNode sqrt(const LatticeExprNode &expr)
int Int
Definition aipstype.h:48
bool Bool
Define the standard types used by Casacore.
Definition aipstype.h:40
const Bool True
Definition aipstype.h:41
double Double
Definition aipstype.h:53
LatticeExprNode median(const LatticeExprNode &expr)
RecordInterface * clone() const override
Make a copy of this object.
Definition Polynomial.h:125
unsigned long long uInt64
Definition aipsxtype.h:37
TableExprNode rms(const TableExprNode &array)
Definition ExprNode.h:1430