summaryrefslogtreecommitdiff
path: root/content/posts/binarisation-introduction
diff options
context:
space:
mode:
authorNick White <git@njw.name>2019-10-22 12:54:15 +0100
committerNick White <git@njw.name>2019-10-22 12:54:15 +0100
commitf6e832fb93aa6a2e6b23cfc080326530162d2dd8 (patch)
treee6ae992225449c0b13fd3f76ef003b0df3f3fffd /content/posts/binarisation-introduction
parentcc14e475618b7743e8d698d3e395f0b0acbb37e7 (diff)
Make clear that Otsu is widely used
Diffstat (limited to 'content/posts/binarisation-introduction')
-rw-r--r--content/posts/binarisation-introduction/index.md8
1 files changed, 4 insertions, 4 deletions
diff --git a/content/posts/binarisation-introduction/index.md b/content/posts/binarisation-introduction/index.md
index 005f2ee..a5c07cc 100644
--- a/content/posts/binarisation-introduction/index.md
+++ b/content/posts/binarisation-introduction/index.md
@@ -44,10 +44,10 @@ threshold number for everything. However sadly that is not the case, and
the variances can be significantly greater for historical documents.
There are various algorithms to find an appropriate threshold number for
-a given page. A particularly well-known and reasonable one is called the
-[Otsu algorithm](https://en.wikipedia.org/wiki/Otsu%27s_method). This
-works by splitting the pixels in the image into two classes, one for
-background and one for foreground, with the threshold calculated to
+a given page. A particularly well-known and commonly used one is called
+the [Otsu algorithm](https://en.wikipedia.org/wiki/Otsu%27s_method).
+This works by splitting the pixels in the image into two classes, one
+for background and one for foreground, with the threshold calculated to
minimise the "spread" of both classes. Spread here means how much
variation in pixel intensity there is, so by trying to minimise the
spread for each class, the threshold aims to find two clusters of