You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/pages/html/Abstract.html
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -131,7 +131,7 @@ <h1>Abstract<a class="headerlink" href="#abstract" title="Link to this heading">
131
131
<dt>Aim</dt><dd><p>This library aims to detect peaks in both a 1-dimensional vector and 2-dimensional arrays (images) without making any assumption on the peak shape or baseline noise.
132
132
To make sure that peaks can be detected across global and local heights, and in noisy data, multiple pre-processing and denoising methods are implemented or utilized.</p>
133
133
</dd>
134
-
<dt>Results</dt><dd><p>Three peak-detection methods are incorporated into this package, namely <em>Topology</em>, <em>Mask</em> and <em>Peakdetect</em>. The peaks can be ranked with among others <strong>persistence</strong> scores. The pre-processing approaches are among others, <strong>denoising</strong> methods, <strong>interpolation</strong> and <strong>smoothing</strong>, <strong>resizing</strong> and <strong>normalizing</strong> methods. In addition we implemented various plots to easily intepretate the results, such as the conversion of 2d-images to <strong>3d-mesh</strong> plots, <strong>persistence</strong> plot, and <strong>peak detection</strong> plots.</p>
134
+
<dt>Results</dt><dd><p>Three peak-detection methods are incorporated into this package, namely <em>Topology</em>, <em>Mask</em> and <em>Peakdetect</em>. The peaks can be ranked with among others <strong>persistence</strong> scores. The pre-processing approaches are among others, <strong>denoising</strong> methods, <strong>interpolation</strong> and <strong>smoothing</strong>, <strong>resizing</strong> and <strong>normalizing</strong> methods. In addition various plots are implemented to easily intepretate the results, such as the conversion of 2d-images to <strong>3d-mesh</strong> plots, <strong>persistence</strong> plot, and <strong>peak detection</strong> plots.</p>
135
135
</dd>
136
136
</dl>
137
137
<p>[1] Peak detection. Data Analysis and Signal Processing in Chromatography, <aclass="reference external" href="https://doi.org/10.1016/S0922-3487(98)80027-0">https://doi.org/10.1016/S0922-3487(98)80027-0</a>, Volume 21, 1998, Pages 183-190</p>
Copy file name to clipboardExpand all lines: docs/pages/html/Caerus.html
+2-2Lines changed: 2 additions & 2 deletions
Original file line number
Diff line number
Diff line change
@@ -139,14 +139,14 @@ <h1>Caerus<a class="headerlink" href="#caerus" title="Link to this heading"><
139
139
<p>This method works only for one-dimensional data.</p>
140
140
<sectionid="stock-market-data">
141
141
<h2>Stock market data<aclass="headerlink" href="#stock-market-data" title="Link to this heading"></a></h2>
142
-
<p>For <strong>caerus</strong> method, we can set the minimum percentage (minperc) parameter to declare a starting position with window relevant.
142
+
<p>For the <strong>Caerus</strong> method, the minimum percentage (minperc) parameter can be set to declare a starting position with window relevant.
143
143
The window size is used to determine whether there is an increase in percentage. start location + window.
144
144
The use of smaller window sizes (eg 50) are able to pickup better local-minima, whereas Larger window sizes (eg 1000) will more stress on global minma.
145
145
The default value for minperc is set to 5 and window size is set to 50.</p>
Copy file name to clipboardExpand all lines: docs/pages/html/Denoise.html
+14-3Lines changed: 14 additions & 3 deletions
Original file line number
Diff line number
Diff line change
@@ -139,8 +139,19 @@
139
139
<h1>Denoise<aclass="headerlink" href="#denoise" title="Link to this heading"></a></h1>
140
140
<p>Images can be corrupted by noise. To suppress and improve the image analysis various filtering techniques have been developed.
141
141
Denoising the image is very usefull before the detection of peaks using <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.findpeaks.findpeaks.preprocessing" title="findpeaks.findpeaks.findpeaks.preprocessing"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.findpeaks.findpeaks.preprocessing()</span></code></a>.
142
-
In <codeclass="docutils literal notranslate"><spanclass="pre">findpeaks</span></code> we incorporated some well-known filtering methods: <em>Frost</em> via <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.filters.frost.frost_filter" title="findpeaks.filters.frost.frost_filter"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.filters.frost.frost_filter()</span></code></a>, <em>Lee</em> via <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.filters.lee.lee_filter" title="findpeaks.filters.lee.lee_filter"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.filters.lee.lee_filter()</span></code></a>, and <em>Kuan</em> via <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.filters.kuan.kuan_filter" title="findpeaks.filters.kuan.kuan_filter"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.filters.kuan.kuan_filter()</span></code></a>, but also other methods such as <em>fastnl</em>, <em>bilateral</em>, <em>mean</em> via <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.filters.mean.mean_filter" title="findpeaks.filters.mean.mean_filter"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.filters.mean.mean_filter()</span></code></a> and <em>median</em> via <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.filters.median.median_filter" title="findpeaks.filters.median.median_filter"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.filters.median.median_filter()</span></code></a> filters.
143
-
Some of the methods are adopted from <codeclass="docutils literal notranslate"><spanclass="pre">pyradar</span></code> [1], for which the code is refactored and rewritten for Python 3. Other methods are adopted from <codeclass="docutils literal notranslate"><spanclass="pre">python-opencv</span></code>.</p>
142
+
In <codeclass="docutils literal notranslate"><spanclass="pre">findpeaks</span></code> well-known filtering methods are implemented:</p>
<p>Some of the methods are adopted from <codeclass="docutils literal notranslate"><spanclass="pre">pyradar</span></code> [1], for which the code is refactored and rewritten for Python 3. Other methods are adopted from <codeclass="docutils literal notranslate"><spanclass="pre">python-opencv</span></code>.</p>
144
155
<p>It is generally known that noise can follow various distributions, and requires different approaches to effectly reduce the noise.</p>
145
156
<tableclass="docutils align-center" id="id1">
146
157
<caption><spanclass="caption-text">Noise distributions</span><aclass="headerlink" href="#id1" title="Link to this table"></a></caption>
@@ -152,7 +163,7 @@ <h1>Denoise<a class="headerlink" href="#denoise" title="Link to this heading">
152
163
<p><em>SAR</em> images are affected by <em>speckle</em> noise that inherently exists in and which degrades the image quality.
153
164
It is caused by the back-scatter waves from multiple distributed targets. It is locally strong and it increases the mean Grey level of local area.
154
165
Reducing the noise enhances the resolution but tends to decrease the spatial resolution too.</p>
155
-
<p>Lets demonstrate the denoising by example. First we will import the example data:</p>
166
+
<p>Lets demonstrate the denoising by example. First import the example data:</p>
<p>Some of the explanations of <strong>topology</strong>, and <strong>persitent homology</strong> are gathered from various sources on the internet (articles, stackoverflow, blog pages, and git pages), and combined on this page.
134
-
All references are depicted at the bottom of the page. Note that all examples are made with <codeclass="docutils literal notranslate"><spanclass="pre">findpeaks</span></code>.
135
-
The function with docstrings for the topology method can be found here <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.stats.topology" title="findpeaks.stats.topology"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.stats.topology()</span></code></a>.</p>
136
-
<sectionid="topology">
133
+
<sectionid="topology">
137
134
<h1>Topology<aclass="headerlink" href="#topology" title="Link to this heading"></a></h1>
138
-
<p>Topological data analysis (TDA) applies methods of topology in data analysis and found many applications in data science[1].
135
+
<p>Topological data analysis applies methods of topology in data analysis and found many applications in data science[1].
139
136
TDA builds upon the observation that data often possesses a certain intrinsic shape such as the shape of a point cloud, the shape of a signal or the shape of a geometric object.
140
137
Persistent homology is probably the most prominent tool in TDA that gives us the means to describe and quantify topological properties of these shapes [1].</p>
138
+
<p>All references are depicted at the bottom of the page. Note that all examples are made with <codeclass="docutils literal notranslate"><spanclass="pre">findpeaks</span></code>.
139
+
The function with docstrings for the topology method can be found here <aclass="reference internal" href="findpeaks.findpeaks.html#findpeaks.stats.topology" title="findpeaks.stats.topology"><codeclass="xref py py-func docutils literal notranslate"><spanclass="pre">findpeaks.stats.topology()</span></code></a>.</p>
141
140
<sectionid="persistent-homology">
142
141
<h2>Persistent Homology<aclass="headerlink" href="#persistent-homology" title="Link to this heading"></a></h2>
143
142
<p>In computational topology the idea of persistent homology leads to an efficient – fast as sorting numbers – solution.
0 commit comments