Skip to content

Commit 30db85e

Browse files
committed
typo correction and quiz
1 parent 0091ca0 commit 30db85e

File tree

3 files changed

+14
-3
lines changed

3 files changed

+14
-3
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -57,7 +57,7 @@ A math-first approach to learning computer vision in Python. The repository will
5757
- [Contour Retrieval and Approximation](edgedetect/edgedetect.html#contour-retrieval-and-approximation)
5858
- [Canny Edge Detector](edgedetect/edgedetect.html#canny-edge-detector)
5959
- [Edge Thinning](edgedetect/edgedetect.html#edge-thinning)
60-
- [Hysterisis Thresholding](edgedetect/edgedetect.html#hysterisis-thresholding)
60+
- [Hysteresis Thresholding](edgedetect/edgedetect.html#hysteresis-thresholding)
6161
- References and learn-by-building modules
6262

6363
## Future chapters

edgedetect/edgedetect.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -332,7 +332,7 @@ I said it's a multi-stage procedure, because the technique as described in his o
332332
2. Compute gradient magnitudes and angles
333333
3. Apply non-maximum suppression (NMS)
334334
- Suppress close-by edges that are non-maximal, leaving only local maxima as edges
335-
4. Track edge by hysterisis
335+
4. Track edge by hysteresis
336336
- Suppress all other edges that are weak and not connected to strong edges and link the edges
337337

338338
Step (1) and (2) in the procedure above can be achieved using code we've written so far in our Sobel Operator scripts. We use the Sobel mask filters to compute $G_x$ and $G_y$, respectively the gradient component in each orientation. We then compute the gradient magnitude and the angle $\theta$:
@@ -356,7 +356,7 @@ The output of step (3) is a binary image with thin edges.
356356

357357
The code[^13] demonstrates how you would code such an NMS for the purpose of canny edge detection.
358358

359-
## Hysterisis Thresholding
359+
## Hysteresis Thresholding
360360
The final step of this multi-stage algorithm decides which among all edges are really edges and which of them are not. It accomplishes this using two threshold values, specified when we call the `cv2.Canny()` function:
361361

362362
```py

quiz.md

+11
Original file line numberDiff line numberDiff line change
@@ -32,3 +32,14 @@
3232
- [ ] RETR_OUTER, CHAIN_APPROX_SIMPLE
3333
- [ ] RETR_OUTER, CHAIN_APPROX_NONE
3434
- [ ] RETR_LIST, CHAIN_APPROX_NONE
35+
36+
6. The function call cv2.Canny(img, 50, 180) will determine which of the intensity gradients as definite edges?
37+
- [ ] 40
38+
- [ ] 100
39+
- [ ] 200
40+
41+
7. Which of the following is NOT part of the Canny Edge procedure?
42+
- [ ] Compute gradient in each direction
43+
- [ ] Suppress edges that are non-maximal
44+
- [ ] Discard pixels that are more likely noise than true edges
45+
- [ ] Retrieve only the extreme outer contours from the edges

0 commit comments

Comments
 (0)