update text for valley detection in topology method

erdogant · Aug 26, 2021 · 519e35f · 519e35f
1 parent ba29db8
commit 519e35f
Show file tree

Hide file tree

Showing 8 changed files with 21 additions and 9 deletions.
diff --git a/docs/pages/doctrees/Topology.doctree b/docs/pages/doctrees/Topology.doctree
diff --git a/docs/pages/doctrees/environment.pickle b/docs/pages/doctrees/environment.pickle
diff --git a/docs/pages/doctrees/findpeaks.findpeaks.doctree b/docs/pages/doctrees/findpeaks.findpeaks.doctree
diff --git a/docs/pages/html/Topology.html b/docs/pages/html/Topology.html
@@ -415,7 +415,7 @@ <h2>One-dimensional<a class="headerlink" href="#one-dimensional" title="Permalin
 <h2>Two-dimensional<a class="headerlink" href="#two-dimensional" title="Permalink to this headline">¶</a></h2>
 <p>The 2d-detection peaks persistent homology for 2D images runs through the same function as the 1d-vector.
 The implementation uses a union-find data structure instead of the more efficient implemention used for one-dimensional data.
-However, there is a differences in the pre-processing steps. Both peaks and valleys are detected with the topology method. The detection of valleys is however by first negating the input image and then finding the “peaks”. The valleys are stored in the output as negative values.</p>
+However, there is a differences in the pre-processing steps. Both peaks and valleys are detected with the topology method. The valleys are stored in the output as negative values.</p>
 <p>The initialization with contains many variables for which only <em>limit</em> is applicable for the <strong>topology</strong> method for <em>2d-peak</em> detection.
 However, there are few parameters that can be used to control the pre-processing steps, such as:</p>
 <blockquote>

diff --git a/docs/pages/html/_sources/Topology.rst.txt b/docs/pages/html/_sources/Topology.rst.txt
@@ -245,7 +245,7 @@ Two-dimensional
 
 The 2d-detection peaks persistent homology for 2D images runs through the same function as the 1d-vector.
 The implementation uses a union-find data structure instead of the more efficient implemention used for one-dimensional data.
-However, there is a differences in the pre-processing steps. Both peaks and valleys are detected with the topology method. The detection of valleys is however by first negating the input image and then finding the "peaks". The valleys are stored in the output as negative values.
+However, there is a differences in the pre-processing steps. Both peaks and valleys are detected with the topology method. The valleys are stored in the output as negative values.
 
 The initialization with contains many variables for which only *limit* is applicable for the **topology** method for *2d-peak* detection.
 However, there are few parameters that can be used to control the pre-processing steps, such as:

diff --git a/docs/pages/html/findpeaks.findpeaks.html b/docs/pages/html/findpeaks.findpeaks.html
diff --git a/docs/pages/html/searchindex.js b/docs/pages/html/searchindex.js
diff --git a/docs/source/Topology.rst b/docs/source/Topology.rst
@@ -245,7 +245,7 @@ Two-dimensional
 
 The 2d-detection peaks persistent homology for 2D images runs through the same function as the 1d-vector.
 The implementation uses a union-find data structure instead of the more efficient implemention used for one-dimensional data.
-However, there is a differences in the pre-processing steps. Both peaks and valleys are detected with the topology method. The detection of valleys is however by first negating the input image and then finding the "peaks". The valleys are stored in the output as negative values.
+However, there is a differences in the pre-processing steps. Both peaks and valleys are detected with the topology method. The valleys are stored in the output as negative values.
 
 The initialization with contains many variables for which only *limit* is applicable for the **topology** method for *2d-peak* detection.
 However, there are few parameters that can be used to control the pre-processing steps, such as: