Skip to content

Commit 759a4ea

Browse files
authored
Fix typo: "felzenswalb" -> "felzenszwalb" (#204)
1 parent f591b2e commit 759a4ea

File tree

1 file changed

+2
-2
lines changed

1 file changed

+2
-2
lines changed

docs/src/pkgs/segmentation/index.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -91,7 +91,7 @@ segments = seeded_region_growing(img, seeds)
9191
DocTestSetup = nothing
9292
```
9393

94-
Now let's segment this image using felzenszwalb algorithm. `felzenswalb` only needs a single parameter `k` which controls the size of segments. Larger `k` will result in bigger segments. Using `k=5` to `k=500` generally gives good results.
94+
Now let's segment this image using felzenszwalb algorithm. `felzenszwalb` only needs a single parameter `k` which controls the size of segments. Larger `k` will result in bigger segments. Using `k=5` to `k=500` generally gives good results.
9595

9696
```jldoctest
9797
julia> using Images, ImageSegmentation
@@ -253,7 +253,7 @@ Segmented Image with:
253253
| 0.2 | ![tree_seg3](assets/tree_seg3.jpg) | 79.96% |
254254

255255

256-
#### Felzenswalb's Region Merging Algorithm
256+
#### Felzenszwalb's Region Merging Algorithm
257257

258258
This algorithm operates on a Region Adjacency Graph (RAG). Each pixel/region is a node in the graph and adjacent pixels/regions have edges between them with weight measuring the dissimilarity between pixels/regions. The algorithm repeatedly merges similar regions till we get the final segmentation. It efficiently computes oversegmented “superpixels” in an image. The function can be directly called with an image (the implementation internally creates a RAG of the image first and then proceeds).
259259

0 commit comments

Comments
 (0)