Add files via upload

tutorial/chap5.html

@@ -244,7 +244,7 @@ <h4>5.4 <span class="Heading">A second example of digital image segmentation</sp
 
 <p><img src="images/coinsbettizero.gif" align="center" height="400" alt="barcode"/></p>
 
-<p>The pure cubical complex <span class="SimpleMath">M</span> has the correct number of path components, namely <span class="SimpleMath">25</span>, but its path components are very much subsets of the regions in the image corresponding to coins. The complex <span class="SimpleMath">M</span> can be thickened repeatedly, subject to no two path components being allowed to merge, in order to obtain a morerealistic image segmentation with path components corresponding closely to coins. The is done in the follow commands which use a makeshift function <code class="code">Basins(L)</code> available <span class="URL"><a href="tutex/basins.g">here</a></span>. The commands essentially implement the watershed segmentation algorithm using the language of filtered complexes.</p>
+<p>The pure cubical complex <span class="SimpleMath">M</span> has the correct number of path components, namely <span class="SimpleMath">25</span>, but its path components are very much subsets of the regions in the image corresponding to coins. The complex <span class="SimpleMath">M</span> can be thickened repeatedly, subject to no two path components being allowed to merge, in order to obtain a more realistic image segmentation with path components corresponding more closely to coins. This is done in the follow commands which use a makeshift function <code class="code">Basins(L)</code> available <span class="URL"><a href="tutex/basins.g">here</a></span>. The commands essentially implement the watershed segmentation algorithm using the language of filtered complexes.</p>
 
 
 <div class="example"><pre>

tutorial/chap5.txt

@@ -196,8 +196,8 @@
   25,  but  its  path  components  are very much subsets of the regions in the
   image  corresponding  to  coins.  The complex M can be thickened repeatedly,
   subject to no two path components being allowed to merge, in order to obtain
-  a  morerealistic  image  segmentation  with  path  components  corresponding
-  closely  to  coins. The is done in the follow commands which use a makeshift
+  a  more realistic image segmentation with path components corresponding more
+  closely  to coins. This is done in the follow commands which use a makeshift
   function Basins(L) available here (tutex/basins.g). The commands essentially
   implement  the  watershed  segmentation  algorithm  using  the  language  of
   filtered complexes.

tutorial/chap5_mj.html

@@ -247,7 +247,7 @@ <h4>5.4 <span class="Heading">A second example of digital image segmentation</sp
 
 <p><img src="images/coinsbettizero.gif" align="center" height="400" alt="barcode"/></p>
 
-<p>The pure cubical complex <span class="SimpleMath">\(M\)</span> has the correct number of path components, namely <span class="SimpleMath">\(25\)</span>, but its path components are very much subsets of the regions in the image corresponding to coins. The complex <span class="SimpleMath">\(M\)</span> can be thickened repeatedly, subject to no two path components being allowed to merge, in order to obtain a morerealistic image segmentation with path components corresponding closely to coins. The is done in the follow commands which use a makeshift function <code class="code">Basins(L)</code> available <span class="URL"><a href="tutex/basins.g">here</a></span>. The commands essentially implement the watershed segmentation algorithm using the language of filtered complexes.</p>
+<p>The pure cubical complex <span class="SimpleMath">\(M\)</span> has the correct number of path components, namely <span class="SimpleMath">\(25\)</span>, but its path components are very much subsets of the regions in the image corresponding to coins. The complex <span class="SimpleMath">\(M\)</span> can be thickened repeatedly, subject to no two path components being allowed to merge, in order to obtain a more realistic image segmentation with path components corresponding more closely to coins. This is done in the follow commands which use a makeshift function <code class="code">Basins(L)</code> available <span class="URL"><a href="tutex/basins.g">here</a></span>. The commands essentially implement the watershed segmentation algorithm using the language of filtered complexes.</p>
 
 
 <div class="example"><pre>