/
PoldiPeakSearch.h
137 lines (105 loc) · 4.92 KB
/
PoldiPeakSearch.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
#ifndef MANTID_SINQ_POLDIPEAKSEARCH_H_
#define MANTID_SINQ_POLDIPEAKSEARCH_H_
#include "MantidSINQ/DllConfig.h"
#include "MantidKernel/System.h"
#include "MantidKernel/Unit.h"
#include "MantidKernel/V2D.h"
#include "MantidAPI/Algorithm.h"
#include "MantidDataObjects/Workspace2D.h"
#include "MantidSINQ/PoldiUtilities/UncertainValue.h"
#include "MantidSINQ/PoldiUtilities/PoldiPeak.h"
#include "MantidSINQ/PoldiUtilities/PoldiPeakCollection.h"
namespace Mantid {
namespace Poldi {
/** PoldiPeakSearch :
This Algorithm performs a peak search in POLDI auto-correlation data. It's a
direct
translation from the original POLDI analysis software.
@author Michael Wedel, Paul Scherrer Institut - SINQ
@date 28/02/2014
Copyright © 2014 PSI-MSS
This file is part of Mantid.
Mantid is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
Mantid is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
File change history is stored at: <https://github.com/mantidproject/mantid>
Code Documentation is available at: <http://doxygen.mantidproject.org>
*/
class MANTID_SINQ_DLL PoldiPeakSearch : public API::Algorithm {
public:
PoldiPeakSearch();
~PoldiPeakSearch() override {}
int version() const override { return 1; }
const std::string name() const override { return "PoldiPeakSearch"; }
/// Summary of algorithms purpose
const std::string summary() const override {
return "This algorithm finds the peaks in a POLDI auto-correlation "
"spectrum.";
}
const std::string category() const override { return "SINQ\\Poldi"; }
protected:
MantidVec getNeighborSums(MantidVec correlationCounts) const;
std::list<MantidVec::const_iterator>
findPeaks(MantidVec::const_iterator begin, MantidVec::const_iterator end);
std::list<MantidVec::const_iterator>
findPeaksRecursive(MantidVec::const_iterator begin,
MantidVec::const_iterator end) const;
std::list<MantidVec::const_iterator> mapPeakPositionsToCorrelationData(
std::list<MantidVec::const_iterator> peakPositions,
MantidVec::const_iterator baseDataStart,
MantidVec::const_iterator originalDataStart) const;
UncertainValue
getBackgroundWithSigma(std::list<MantidVec::const_iterator> peakPositions,
const MantidVec &correlationCounts) const;
MantidVec getBackground(std::list<MantidVec::const_iterator> peakPositions,
const MantidVec &correlationCounts) const;
bool distanceToPeaksGreaterThanMinimum(
std::list<MantidVec::const_iterator> peakPositions,
MantidVec::const_iterator point) const;
size_t getNumberOfBackgroundPoints(
std::list<MantidVec::const_iterator> peakPositions,
const MantidVec &correlationCounts) const;
double getMedianFromSortedVector(MantidVec::const_iterator begin,
MantidVec::const_iterator end) const;
double getSn(MantidVec::const_iterator begin,
MantidVec::const_iterator end) const;
double
minimumPeakHeightFromBackground(UncertainValue backgroundWithSigma) const;
double getTransformedCenter(double value,
const Kernel::Unit_sptr &unit) const;
std::vector<PoldiPeak_sptr>
getPeaks(const MantidVec::const_iterator &baseListStart,
const MantidVec::const_iterator &baseListEnd,
std::list<MantidVec::const_iterator> peakPositions,
const MantidVec &xData, const Kernel::Unit_sptr &unit) const;
double getFWHMEstimate(const MantidVec::const_iterator &baseListStart,
const MantidVec::const_iterator &baseListEnd,
MantidVec::const_iterator peakPosition,
const MantidVec &xData) const;
void setErrorsOnWorkspace(DataObjects::Workspace2D_sptr correlationWorkspace,
double error) const;
void setMinimumDistance(int newMinimumDistance);
void setMinimumPeakHeight(double newMinimumPeakHeight);
void setMaximumPeakNumber(int newMaximumPeakNumber);
static bool vectorElementGreaterThan(MantidVec::const_iterator first,
MantidVec::const_iterator second);
bool isLessThanMinimum(PoldiPeak_sptr peak);
int m_minimumDistance;
int m_doubleMinimumDistance;
double m_minimumPeakHeight;
int m_maximumPeakNumber;
PoldiPeakCollection_sptr m_peaks;
private:
void init() override;
void exec() override;
};
} // namespace Poldi
} // namespace Mantid
#endif /* MANTID_SINQ_POLDIPEAKSEARCH_H_ */