mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-27 15:01:08 +00:00
07e991d553
* ci(pre-commit): Add pep8-naming to `pre-commit` hooks (#7038) * refactor: Fix naming conventions (#7038) * Update arithmetic_analysis/lu_decomposition.py Co-authored-by: Christian Clauss <cclauss@me.com> * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * refactor(lu_decomposition): Replace `NDArray` with `ArrayLike` (#7038) * chore: Fix naming conventions in doctests (#7038) * fix: Temporarily disable project euler problem 104 (#7069) * chore: Fix naming conventions in doctests (#7038) Co-authored-by: Christian Clauss <cclauss@me.com> Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
123 lines
4.6 KiB
Python
123 lines
4.6 KiB
Python
import cv2
|
||
import numpy as np
|
||
|
||
from digital_image_processing.filters.convolve import img_convolve
|
||
from digital_image_processing.filters.sobel_filter import sobel_filter
|
||
|
||
PI = 180
|
||
|
||
|
||
def gen_gaussian_kernel(k_size, sigma):
|
||
center = k_size // 2
|
||
x, y = np.mgrid[0 - center : k_size - center, 0 - center : k_size - center]
|
||
g = (
|
||
1
|
||
/ (2 * np.pi * sigma)
|
||
* np.exp(-(np.square(x) + np.square(y)) / (2 * np.square(sigma)))
|
||
)
|
||
return g
|
||
|
||
|
||
def canny(image, threshold_low=15, threshold_high=30, weak=128, strong=255):
|
||
image_row, image_col = image.shape[0], image.shape[1]
|
||
# gaussian_filter
|
||
gaussian_out = img_convolve(image, gen_gaussian_kernel(9, sigma=1.4))
|
||
# get the gradient and degree by sobel_filter
|
||
sobel_grad, sobel_theta = sobel_filter(gaussian_out)
|
||
gradient_direction = np.rad2deg(sobel_theta)
|
||
gradient_direction += PI
|
||
|
||
dst = np.zeros((image_row, image_col))
|
||
|
||
"""
|
||
Non-maximum suppression. If the edge strength of the current pixel is the largest
|
||
compared to the other pixels in the mask with the same direction, the value will be
|
||
preserved. Otherwise, the value will be suppressed.
|
||
"""
|
||
for row in range(1, image_row - 1):
|
||
for col in range(1, image_col - 1):
|
||
direction = gradient_direction[row, col]
|
||
|
||
if (
|
||
0 <= direction < 22.5
|
||
or 15 * PI / 8 <= direction <= 2 * PI
|
||
or 7 * PI / 8 <= direction <= 9 * PI / 8
|
||
):
|
||
w = sobel_grad[row, col - 1]
|
||
e = sobel_grad[row, col + 1]
|
||
if sobel_grad[row, col] >= w and sobel_grad[row, col] >= e:
|
||
dst[row, col] = sobel_grad[row, col]
|
||
|
||
elif (PI / 8 <= direction < 3 * PI / 8) or (
|
||
9 * PI / 8 <= direction < 11 * PI / 8
|
||
):
|
||
sw = sobel_grad[row + 1, col - 1]
|
||
ne = sobel_grad[row - 1, col + 1]
|
||
if sobel_grad[row, col] >= sw and sobel_grad[row, col] >= ne:
|
||
dst[row, col] = sobel_grad[row, col]
|
||
|
||
elif (3 * PI / 8 <= direction < 5 * PI / 8) or (
|
||
11 * PI / 8 <= direction < 13 * PI / 8
|
||
):
|
||
n = sobel_grad[row - 1, col]
|
||
s = sobel_grad[row + 1, col]
|
||
if sobel_grad[row, col] >= n and sobel_grad[row, col] >= s:
|
||
dst[row, col] = sobel_grad[row, col]
|
||
|
||
elif (5 * PI / 8 <= direction < 7 * PI / 8) or (
|
||
13 * PI / 8 <= direction < 15 * PI / 8
|
||
):
|
||
nw = sobel_grad[row - 1, col - 1]
|
||
se = sobel_grad[row + 1, col + 1]
|
||
if sobel_grad[row, col] >= nw and sobel_grad[row, col] >= se:
|
||
dst[row, col] = sobel_grad[row, col]
|
||
|
||
"""
|
||
High-Low threshold detection. If an edge pixel’s gradient value is higher
|
||
than the high threshold value, it is marked as a strong edge pixel. If an
|
||
edge pixel’s gradient value is smaller than the high threshold value and
|
||
larger than the low threshold value, it is marked as a weak edge pixel. If
|
||
an edge pixel's value is smaller than the low threshold value, it will be
|
||
suppressed.
|
||
"""
|
||
if dst[row, col] >= threshold_high:
|
||
dst[row, col] = strong
|
||
elif dst[row, col] <= threshold_low:
|
||
dst[row, col] = 0
|
||
else:
|
||
dst[row, col] = weak
|
||
|
||
"""
|
||
Edge tracking. Usually a weak edge pixel caused from true edges will be connected
|
||
to a strong edge pixel while noise responses are unconnected. As long as there is
|
||
one strong edge pixel that is involved in its 8-connected neighborhood, that weak
|
||
edge point can be identified as one that should be preserved.
|
||
"""
|
||
for row in range(1, image_row):
|
||
for col in range(1, image_col):
|
||
if dst[row, col] == weak:
|
||
if 255 in (
|
||
dst[row, col + 1],
|
||
dst[row, col - 1],
|
||
dst[row - 1, col],
|
||
dst[row + 1, col],
|
||
dst[row - 1, col - 1],
|
||
dst[row + 1, col - 1],
|
||
dst[row - 1, col + 1],
|
||
dst[row + 1, col + 1],
|
||
):
|
||
dst[row, col] = strong
|
||
else:
|
||
dst[row, col] = 0
|
||
|
||
return dst
|
||
|
||
|
||
if __name__ == "__main__":
|
||
# read original image in gray mode
|
||
lena = cv2.imread(r"../image_data/lena.jpg", 0)
|
||
# canny edge detection
|
||
canny_dst = canny(lena)
|
||
cv2.imshow("canny", canny_dst)
|
||
cv2.waitKey(0)
|