2022-11-13 15:13:43 +01:00
|
|
|
|
import numpy as np
|
|
|
|
|
import numpy.typing as npt
|
|
|
|
|
from matplotlib import pyplot as plt
|
|
|
|
|
import cv2
|
|
|
|
|
import uz_framework.image as uz_image
|
|
|
|
|
import uz_framework.text as uz_text
|
|
|
|
|
|
2022-11-14 19:02:29 +01:00
|
|
|
|
##############################################
|
|
|
|
|
# EXCERCISE 1: Exercise 1: Image derivatives #
|
|
|
|
|
##############################################
|
2022-11-13 15:13:43 +01:00
|
|
|
|
|
|
|
|
|
def ex1():
|
|
|
|
|
#one_a()
|
2022-11-14 16:25:21 +01:00
|
|
|
|
#one_b()
|
|
|
|
|
#one_c()
|
|
|
|
|
one_d()
|
2022-11-13 15:13:43 +01:00
|
|
|
|
|
|
|
|
|
def one_a() -> None:
|
|
|
|
|
"""
|
|
|
|
|
Follow the equations above and derive the equations used to compute first and
|
|
|
|
|
second derivatives with respect to y: Iy(x, y), Iyy(x, y), as well as the mixed derivative
|
|
|
|
|
Ixy(x, y)
|
|
|
|
|
"""
|
|
|
|
|
|
2022-11-14 16:25:21 +01:00
|
|
|
|
def one_b() -> None:
|
2022-11-13 15:13:43 +01:00
|
|
|
|
"""
|
|
|
|
|
Implement a function that computes the derivative of a 1-D Gaussian kernel
|
|
|
|
|
Implement the function gaussdx(sigma) that works the same as function gauss
|
|
|
|
|
from the previous assignment. Don’t forget to normalize the kernel. Be careful as
|
|
|
|
|
the derivative is an odd function, so a simple sum will not do. Instead normalize the
|
|
|
|
|
kernel by dividing the values such that the sum of absolute values is 1. Effectively,
|
|
|
|
|
you have to divide each value by sum(abs(gx(x))).
|
|
|
|
|
"""
|
2022-11-13 18:36:38 +01:00
|
|
|
|
sigmas = [0.5, 1, 2]
|
|
|
|
|
for sigma in sigmas:
|
|
|
|
|
kernel = uz_image.gaussdx(sigma)
|
|
|
|
|
print(kernel)
|
2022-11-13 15:13:43 +01:00
|
|
|
|
|
2022-11-14 16:25:21 +01:00
|
|
|
|
def one_c() -> None:
|
2022-11-13 15:13:43 +01:00
|
|
|
|
"""
|
|
|
|
|
The properties of the filter can be analyzed by using an impulse response function.
|
|
|
|
|
This is performed as a convolution of the filter with a Dirac delta function. The
|
|
|
|
|
discrete version of the Dirac function is constructed as a finite image that has all
|
|
|
|
|
elements set to 0 except the central element, which is set to a high value (e.g. 1).
|
|
|
|
|
Generate a 1-D Gaussian kernel G and a Gaussian derivative kernel D.
|
|
|
|
|
What happens if you apply the following operations to the impulse image?
|
|
|
|
|
(a) First convolution with G and then convolution with GT
|
|
|
|
|
(b) First convolution with G and then convolution with DT
|
|
|
|
|
(c) First convolution with D and then convolution with GT
|
|
|
|
|
(d) First convolution with GT and then convolution with D.
|
|
|
|
|
(e) First convolution with DT and then convolution with G.
|
|
|
|
|
Is the order of operations important? Display the images of the impulse responses
|
|
|
|
|
for different combinations of operations.
|
|
|
|
|
"""
|
|
|
|
|
impulse = uz_image.generate_dirac_impulse(50)
|
|
|
|
|
gauss = np.array([uz_image.get_gaussian_kernel(3)])
|
|
|
|
|
gaussdx = np.array([uz_image.gaussdx(3)])
|
|
|
|
|
|
2022-11-13 18:36:38 +01:00
|
|
|
|
# Becouse CV2 applies the correlation instead of convolution, we need to flip the kernels
|
|
|
|
|
gauss = np.flip(gauss, axis=1)
|
|
|
|
|
gaussdx = np.flip(gaussdx, axis=1)
|
|
|
|
|
|
|
|
|
|
|
2022-11-13 15:13:43 +01:00
|
|
|
|
fig, axs = plt.subplots(2, 3)
|
|
|
|
|
|
|
|
|
|
# Plot impulse only
|
|
|
|
|
axs[0, 0].imshow(impulse, cmap='gray')
|
|
|
|
|
axs[0, 0].set_title('Impulse')
|
|
|
|
|
|
|
|
|
|
# Plot impulse after convolution with G and GT
|
|
|
|
|
g_gt_impulse = impulse.copy()
|
|
|
|
|
g_gt_impulse = cv2.filter2D(g_gt_impulse, cv2.CV_64F, gauss)
|
|
|
|
|
g_gt_impulse = cv2.filter2D(g_gt_impulse, cv2.CV_64F, gauss.T)
|
2022-11-13 18:36:38 +01:00
|
|
|
|
axs[1, 0].imshow(g_gt_impulse, cmap='gray')
|
|
|
|
|
axs[1, 0].set_title('impulse * G * GT')
|
|
|
|
|
|
|
|
|
|
# Plot impulse after convolution with G and DT
|
|
|
|
|
g_dt_impulse = impulse.copy()
|
|
|
|
|
g_dt_impulse = cv2.filter2D(g_dt_impulse, cv2.CV_64F, gauss)
|
|
|
|
|
g_dt_impulse = cv2.filter2D(g_dt_impulse, cv2.CV_64F, gaussdx.T)
|
|
|
|
|
axs[0, 1].imshow(g_dt_impulse, cmap='gray')
|
|
|
|
|
axs[0, 1].set_title('impulse * G * DT')
|
|
|
|
|
|
|
|
|
|
# Plot impulse after convolution with D and GT
|
|
|
|
|
d_gt_impulse = impulse.copy()
|
|
|
|
|
d_gt_impulse = cv2.filter2D(d_gt_impulse, cv2.CV_64F, gaussdx)
|
|
|
|
|
d_gt_impulse = cv2.filter2D(d_gt_impulse, cv2.CV_64F, gauss.T)
|
|
|
|
|
axs[0, 2].imshow(d_gt_impulse, cmap='gray')
|
|
|
|
|
axs[0, 2].set_title('impulse * D * GT')
|
|
|
|
|
|
|
|
|
|
# Plot impulse after convolution with GT and D
|
|
|
|
|
gt_d_impulse = impulse.copy()
|
|
|
|
|
gt_d_impulse = cv2.filter2D(gt_d_impulse, cv2.CV_64F, gauss.T)
|
|
|
|
|
gt_d_impulse = cv2.filter2D(gt_d_impulse, cv2.CV_64F, gaussdx)
|
|
|
|
|
axs[1, 1].imshow(gt_d_impulse, cmap='gray')
|
|
|
|
|
axs[1, 1].set_title('impulse * GT * D')
|
|
|
|
|
|
|
|
|
|
# Plot impulse after convolution with DT and G
|
|
|
|
|
dt_g_impulse = impulse.copy()
|
|
|
|
|
dt_g_impulse = cv2.filter2D(dt_g_impulse, cv2.CV_64F, gaussdx.T)
|
|
|
|
|
dt_g_impulse = cv2.filter2D(dt_g_impulse, cv2.CV_64F, gauss)
|
|
|
|
|
axs[1, 2].imshow(dt_g_impulse, cmap='gray')
|
|
|
|
|
axs[1, 2].set_title('impulse * DT * G')
|
2022-11-13 15:13:43 +01:00
|
|
|
|
|
|
|
|
|
plt.show()
|
|
|
|
|
|
2022-11-14 16:25:21 +01:00
|
|
|
|
|
|
|
|
|
def one_d() -> None:
|
|
|
|
|
"""
|
|
|
|
|
Implement a function that uses functions gauss and gaussdx to compute both
|
|
|
|
|
partial derivatives of a given image with respect to x and with respect to y.
|
|
|
|
|
Similarly, implement a function that returns partial second order derivatives of a
|
|
|
|
|
given image.
|
|
|
|
|
Additionally, implement the function gradient_magnitude that accepts a grayscale
|
|
|
|
|
image I and returns both derivative magnitudes and derivative angles. Magnitude
|
|
|
|
|
is calculated as m(x, y) = sqrt(Ix(x,y)^2 + Iy(x, y)^2) and angles are calculated as
|
|
|
|
|
φ(x, y) = arctan(Iy(x, y)/Ix(x, y))
|
|
|
|
|
Hint: Use function np.arctan2 to avoid division by zero for calculating the arctangent function.
|
|
|
|
|
Use all the implemented functions on the same image and display the results in the
|
|
|
|
|
same window.
|
|
|
|
|
"""
|
|
|
|
|
|
|
|
|
|
museum = uz_image.imread_gray('./images/museum.jpg', uz_image.ImageType.float64)
|
|
|
|
|
|
|
|
|
|
museum_x, museum_y = uz_image.derive_image_first_order(museum, 1)
|
|
|
|
|
(museum_xx, museum_xy) , (_, museum_yy) = uz_image.derive_image_second_order(museum, 1)
|
|
|
|
|
derivative_magnitude, derivative_angle = uz_image.gradient_magnitude(museum, 1)
|
|
|
|
|
|
|
|
|
|
fig, axs = plt.subplots(2, 4)
|
|
|
|
|
fig.suptitle('Museum')
|
|
|
|
|
|
|
|
|
|
axs[0,0].imshow(museum, cmap='gray')
|
|
|
|
|
axs[0,0].set_title('Original')
|
|
|
|
|
axs[0, 1].imshow(museum_x, cmap='gray')
|
|
|
|
|
axs[0, 1].set_title('I_x')
|
|
|
|
|
axs[0, 2].imshow(museum_y, cmap='gray')
|
|
|
|
|
axs[0, 2].set_title('I_y')
|
|
|
|
|
axs[1, 0].imshow(museum_xx, cmap='gray')
|
|
|
|
|
axs[1, 0].set_title('I_xx')
|
|
|
|
|
axs[1, 1].imshow(museum_xy, cmap='gray')
|
|
|
|
|
axs[1, 1].set_title('I_xy')
|
|
|
|
|
axs[1, 2].imshow(museum_yy, cmap='gray')
|
|
|
|
|
axs[1, 2].set_title('I_yy')
|
|
|
|
|
axs[0, 3].imshow(derivative_magnitude, cmap='gray')
|
|
|
|
|
axs[0, 3].set_title('I_mag')
|
|
|
|
|
axs[1, 3].imshow(derivative_angle, cmap='gray')
|
|
|
|
|
axs[1, 3].set_title('I_dir')
|
|
|
|
|
|
|
|
|
|
plt.show()
|
|
|
|
|
|
2022-11-14 19:02:29 +01:00
|
|
|
|
############################################
|
|
|
|
|
# EXCERCISE 2: Exercise 1: Edges in images #
|
|
|
|
|
############################################
|
|
|
|
|
|
|
|
|
|
def ex2():
|
2022-11-15 09:24:34 +01:00
|
|
|
|
#two_a()
|
2022-11-14 19:02:29 +01:00
|
|
|
|
two_b()
|
2022-11-15 09:24:34 +01:00
|
|
|
|
two_c()
|
2022-11-14 19:02:29 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def two_a():
|
|
|
|
|
"""
|
|
|
|
|
Firstly, create a function findedges that accepts an image I, and the parameters
|
|
|
|
|
sigma and theta.
|
|
|
|
|
The function should create a binary matrix Ie that only keeps pixels higher than
|
|
|
|
|
threshold theta:
|
|
|
|
|
Ie(x, y) =
|
|
|
|
|
1 ; Imag(x, y) ≥ ϑ
|
|
|
|
|
0 ; otherwise (6)
|
|
|
|
|
Test the function with the image museum.png and display the results for different
|
|
|
|
|
values of the parameter theta. Can you set the parameter so that all the edges in
|
|
|
|
|
the image are clearly visible?
|
|
|
|
|
"""
|
|
|
|
|
|
2022-11-14 21:19:36 +01:00
|
|
|
|
SIGMA = 0.2
|
|
|
|
|
THETA = 0.16
|
2022-11-14 19:02:29 +01:00
|
|
|
|
museum = uz_image.imread_gray('./images/museum.jpg', uz_image.ImageType.float64)
|
|
|
|
|
museum_edges = uz_image.find_edges_primitive(museum, SIGMA, THETA)
|
|
|
|
|
plt.imshow(museum_edges, cmap='gray')
|
|
|
|
|
plt.show()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def two_b():
|
|
|
|
|
"""
|
|
|
|
|
Using magnitude produces only a first approximation of detected edges. Unfortunately,
|
|
|
|
|
these are often wide and we would like to only return edges one pixel wide.
|
|
|
|
|
Therefore, you will implement non-maxima suppression based on the image derivative magnitudes and angles.
|
|
|
|
|
Iterate through all the pixels and for each search its
|
|
|
|
|
8-neighborhood. Check the neighboring pixels parallel to the gradient direction and
|
|
|
|
|
set the current pixel to 0 if it is not the largest in the neighborhood (based on
|
|
|
|
|
derivative magnitude). You only need to compute the comparison to actual pixels,
|
|
|
|
|
interpolating to more accuracy is not required.
|
|
|
|
|
"""
|
2022-11-15 09:24:34 +01:00
|
|
|
|
SIGMA = 1
|
2022-11-16 16:58:43 +01:00
|
|
|
|
THETA = 0.10
|
2022-11-14 19:02:29 +01:00
|
|
|
|
|
|
|
|
|
museum = uz_image.imread_gray('./images/museum.jpg', uz_image.ImageType.float64)
|
|
|
|
|
museum_edges = uz_image.find_edges_nms(museum, SIGMA, THETA)
|
|
|
|
|
plt.imshow(museum_edges, cmap='gray')
|
|
|
|
|
plt.show()
|
|
|
|
|
|
2022-11-15 09:24:34 +01:00
|
|
|
|
def two_c():
|
|
|
|
|
"""
|
|
|
|
|
The final step of Canny’s algorithm is edge tracking by hysteresis.
|
|
|
|
|
Add the final step after performing non-maxima suppression along edges. Hysteresis
|
|
|
|
|
uses two thresholds tlow < thigh, keeps all pixels above thigh and discards all pixels
|
|
|
|
|
below tlow. The pixels between the thresholds are kept only if they are connected to
|
|
|
|
|
a pixel above thigh.
|
|
|
|
|
Hint: Since we are looking for connected components containing at least one pixel
|
|
|
|
|
above thigh, you could use something like cv2.connectedComponentsWithStats to
|
|
|
|
|
extract them. Try to avoid explicit for loops as much as possible
|
|
|
|
|
"""
|
|
|
|
|
SIGMA = 1
|
2022-11-16 16:58:43 +01:00
|
|
|
|
THETA = 0.10
|
2022-11-15 09:24:34 +01:00
|
|
|
|
T_LOW = 0.04
|
|
|
|
|
T_HIGH = 0.16
|
|
|
|
|
|
|
|
|
|
museum = uz_image.imread_gray('./images/museum.jpg', uz_image.ImageType.float64)
|
|
|
|
|
|
|
|
|
|
connected = uz_image.find_edges_canny(museum, SIGMA, THETA, T_LOW, T_HIGH)
|
|
|
|
|
|
|
|
|
|
plt.imshow(connected, cmap='gray')
|
|
|
|
|
plt.show()
|
|
|
|
|
|
|
|
|
|
############################################
|
|
|
|
|
# EXCERCISE 2: Exercise 1: Edges in images #
|
|
|
|
|
############################################
|
|
|
|
|
def ex3():
|
2022-11-15 10:46:07 +01:00
|
|
|
|
#three_a()
|
2022-11-15 23:31:05 +01:00
|
|
|
|
#three_b()
|
2022-11-15 09:24:34 +01:00
|
|
|
|
#three_c()
|
2022-11-16 12:55:08 +01:00
|
|
|
|
#three_d()
|
2022-11-16 16:58:43 +01:00
|
|
|
|
#three_e()
|
|
|
|
|
three_f()
|
2022-11-15 09:24:34 +01:00
|
|
|
|
|
|
|
|
|
def three_a():
|
|
|
|
|
"""
|
|
|
|
|
Create an accumulator array defined by the resolution on ρ and ϑ values. Calculate the
|
|
|
|
|
sinusoid that represents all the lines that pass through some nonzero point.
|
|
|
|
|
Increment the corresponding cells in the accumulator array. Experiment with different
|
|
|
|
|
positions of the nonzero point to see how the sinusoid changes. You can set
|
|
|
|
|
the number of accumulator bins on each axis to 300 to begin with.
|
|
|
|
|
"""
|
|
|
|
|
|
|
|
|
|
x_y_values = np.array([[10, 10], [30, 60], [50, 20], [80, 90]])
|
|
|
|
|
|
|
|
|
|
fig, axs = plt.subplots(2, 2)
|
|
|
|
|
fig.suptitle('Trasformation of points into hugh space')
|
|
|
|
|
|
|
|
|
|
for i in range(0, 4):
|
|
|
|
|
accumulator = uz_image.hough_transform_a_point(x_y_values[i][0], x_y_values[i][1], 300)
|
|
|
|
|
axs[i // 2, i % 2].imshow(accumulator)
|
|
|
|
|
axs[i // 2, i % 2].set_title(f'x = {x_y_values[i][0]}, y = {x_y_values[i][1]}')
|
|
|
|
|
|
|
|
|
|
plt.show()
|
|
|
|
|
|
2022-11-15 10:46:07 +01:00
|
|
|
|
def three_b():
|
|
|
|
|
"""
|
|
|
|
|
Implement the function hough_find_lines that accepts a binary image, the number
|
|
|
|
|
of bins for ϑ and ρ (allow the possibility of them being different) and a threshold.
|
|
|
|
|
Create an accumulator matrix A for the parameter space (ρ, ϑ). Parameter ϑ is
|
|
|
|
|
defined in the interval from −π/2 to π/2, ρ is defined on the interval from −D to
|
|
|
|
|
D, where D is the length of the image diagonal. For each nonzero pixel in the image,
|
|
|
|
|
generate a curve in the (ρ, ϑ) space by using the equation (7) for all possible values
|
|
|
|
|
of ϑ and increase the corresponding cells in A. Display the accumulator matrix. Test
|
|
|
|
|
the method on your own synthetic images ((e.g. 100 × 100 black image, with two
|
|
|
|
|
white pixels at (10, 10) and (10, 20)).
|
|
|
|
|
Finally, test your function on two synthetic images oneline.png and rectangle.png. First, you should obtain an edge map for each image using either your
|
|
|
|
|
function findedges or some inbuilt function. Run your implementation of the Hough
|
|
|
|
|
algorithm on the resulting edge maps.
|
|
|
|
|
"""
|
|
|
|
|
SIGMA = 1
|
|
|
|
|
THETA = 0.02
|
|
|
|
|
T_LOW = 0.04
|
|
|
|
|
T_HIGH = 0.16
|
|
|
|
|
|
|
|
|
|
synthetic_image = np.zeros((100, 100))
|
|
|
|
|
synthetic_image[10, 10] = 1
|
|
|
|
|
synthetic_image[10, 20] = 1
|
|
|
|
|
|
|
|
|
|
oneline_image = uz_image.imread_gray('./images/oneline.png', uz_image.ImageType.float64)
|
|
|
|
|
rectangle_image = uz_image.imread_gray('./images/rectangle.png', uz_image.ImageType.float64)
|
|
|
|
|
|
|
|
|
|
oneline_image_edges = uz_image.find_edges_canny(oneline_image, SIGMA, THETA, T_LOW, T_HIGH)
|
|
|
|
|
rectangle_image_edges = uz_image.find_edges_canny(rectangle_image, SIGMA, THETA, T_LOW, T_HIGH)
|
|
|
|
|
|
|
|
|
|
fig, axs = plt.subplots(3, 3)
|
|
|
|
|
|
|
|
|
|
axs[0, 0].imshow(synthetic_image, cmap='gray')
|
|
|
|
|
axs[0, 0].set_title('Synthetic image')
|
|
|
|
|
axs[2, 0].imshow(uz_image.hough_find_lines(synthetic_image, 200, 200, 0.2))
|
|
|
|
|
axs[0, 1].imshow(oneline_image, cmap='gray')
|
|
|
|
|
axs[0, 1].set_title('Oneline image')
|
|
|
|
|
axs[1, 1].imshow(oneline_image_edges, cmap='gray')
|
|
|
|
|
axs[0, 2].imshow(rectangle_image, cmap='gray')
|
|
|
|
|
axs[0, 2].set_title('Rectangle image')
|
|
|
|
|
axs[1, 2].imshow(rectangle_image_edges, cmap='gray')
|
|
|
|
|
axs[1, 0].set_visible(False)
|
|
|
|
|
axs[2, 1].imshow(uz_image.hough_find_lines(oneline_image_edges, 200, 200, 0.2))
|
|
|
|
|
axs[2, 2].imshow(uz_image.hough_find_lines(rectangle_image_edges, 200, 200, 0.2))
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
plt.show()
|
2022-11-14 19:02:29 +01:00
|
|
|
|
|
2022-11-14 16:25:21 +01:00
|
|
|
|
|
2022-11-15 23:31:05 +01:00
|
|
|
|
def three_c():
|
|
|
|
|
"""
|
|
|
|
|
The sinusoids don’t usually intersect in only one point, resulting in more than one detected line.
|
|
|
|
|
Implement a function named nonmaxima_suppression_box that checks
|
|
|
|
|
the neighborhood of each pixel and set it to 0 if it is not the maximum value in the
|
|
|
|
|
neighborhood (only consider 8-neighborhood). If more neighbouring pixels have the
|
|
|
|
|
maximum value, keep only one.
|
|
|
|
|
"""
|
|
|
|
|
SIGMA = 1
|
|
|
|
|
THETA = 0.02
|
|
|
|
|
T_LOW = 0.04
|
|
|
|
|
T_HIGH = 0.16
|
|
|
|
|
|
|
|
|
|
synthetic_image = np.zeros((100, 100))
|
|
|
|
|
synthetic_image[10, 10] = 1
|
|
|
|
|
synthetic_image[10, 20] = 1
|
|
|
|
|
|
|
|
|
|
oneline_image = uz_image.imread_gray('./images/oneline.png', uz_image.ImageType.float64)
|
|
|
|
|
rectangle_image = uz_image.imread_gray('./images/rectangle.png', uz_image.ImageType.float64)
|
|
|
|
|
|
|
|
|
|
oneline_image_edges = uz_image.find_edges_canny(oneline_image, SIGMA, THETA, T_LOW, T_HIGH)
|
|
|
|
|
rectangle_image_edges = uz_image.find_edges_canny(rectangle_image, SIGMA, THETA, T_LOW, T_HIGH)
|
|
|
|
|
|
|
|
|
|
synthetic_image_hough = uz_image.hough_find_lines(synthetic_image, 200, 200, 0.2)
|
|
|
|
|
oneline_image_hough = uz_image.hough_find_lines(oneline_image_edges, 200, 200, 0.2)
|
|
|
|
|
rectangle_image_hough = uz_image.hough_find_lines(rectangle_image_edges, 200, 200, 0.2)
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
fig, axs = plt.subplots(4, 3)
|
|
|
|
|
|
|
|
|
|
axs[0, 0].imshow(synthetic_image, cmap='gray')
|
|
|
|
|
axs[0, 0].set_title('Synthetic image')
|
|
|
|
|
axs[2, 0].imshow(synthetic_image_hough)
|
|
|
|
|
axs[0, 1].imshow(oneline_image, cmap='gray')
|
|
|
|
|
axs[0, 1].set_title('Oneline image')
|
|
|
|
|
axs[1, 1].imshow(oneline_image_edges, cmap='gray')
|
|
|
|
|
axs[0, 2].imshow(rectangle_image, cmap='gray')
|
|
|
|
|
axs[0, 2].set_title('Rectangle image')
|
|
|
|
|
axs[1, 2].imshow(rectangle_image_edges, cmap='gray')
|
|
|
|
|
axs[1, 0].set_visible(False)
|
|
|
|
|
axs[2, 1].imshow(oneline_image_hough)
|
|
|
|
|
axs[2, 2].imshow(rectangle_image_hough)
|
|
|
|
|
axs[3, 0].imshow(uz_image.nonmaxima_suppression_box(synthetic_image_hough))
|
|
|
|
|
axs[3, 1].imshow(uz_image.nonmaxima_suppression_box(oneline_image_hough))
|
|
|
|
|
axs[3, 2].imshow(uz_image.nonmaxima_suppression_box(rectangle_image_hough))
|
|
|
|
|
|
|
|
|
|
plt.show()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def three_d():
|
|
|
|
|
"""
|
|
|
|
|
Search the parameter space and extract all the parameter pairs (ρ, ϑ) whose corresponding accumulator cell value isgreater than a specified threshold threshold.
|
|
|
|
|
Draw the lines that correspond to the parameter pairs using the draw_line function
|
|
|
|
|
that you can find in the supplementary material.
|
|
|
|
|
"""
|
|
|
|
|
|
|
|
|
|
SIGMA = 1
|
|
|
|
|
THETA = 0.02
|
|
|
|
|
T_LOW = 0.04
|
|
|
|
|
T_HIGH = 0.16
|
2022-11-16 12:55:08 +01:00
|
|
|
|
N_BINS_RHO = 720
|
|
|
|
|
N_BINS_THETA = 720
|
2022-11-15 23:31:05 +01:00
|
|
|
|
|
|
|
|
|
synthetic_image = np.zeros((100, 100))
|
|
|
|
|
synthetic_image[10, 10] = 1
|
|
|
|
|
synthetic_image[10, 20] = 1
|
|
|
|
|
|
|
|
|
|
oneline_image = uz_image.imread_gray('./images/oneline.png', uz_image.ImageType.float64)
|
|
|
|
|
rectangle_image = uz_image.imread_gray('./images/rectangle.png', uz_image.ImageType.float64)
|
2022-11-16 12:55:08 +01:00
|
|
|
|
print('[+] Images loaded')
|
2022-11-15 23:31:05 +01:00
|
|
|
|
|
|
|
|
|
oneline_image_edges = uz_image.find_edges_canny(oneline_image, SIGMA, THETA, T_LOW, T_HIGH)
|
|
|
|
|
rectangle_image_edges = uz_image.find_edges_canny(rectangle_image, SIGMA, THETA, T_LOW, T_HIGH)
|
2022-11-16 12:55:08 +01:00
|
|
|
|
print('[+] Edges detected')
|
2022-11-15 23:31:05 +01:00
|
|
|
|
|
2022-11-16 12:55:08 +01:00
|
|
|
|
synthetic_image_hough = uz_image.hough_find_lines(synthetic_image, N_BINS_THETA, N_BINS_RHO, 0.2)
|
|
|
|
|
oneline_image_hough = uz_image.hough_find_lines(oneline_image_edges, N_BINS_THETA, N_BINS_RHO, 0.2)
|
|
|
|
|
rectangle_image_hough = uz_image.hough_find_lines(rectangle_image_edges, N_BINS_THETA, N_BINS_RHO , 0.2)
|
|
|
|
|
print('[+] Hugh lines drawn')
|
2022-11-15 23:31:05 +01:00
|
|
|
|
|
|
|
|
|
synthetic_image_hough_nonmax = uz_image.nonmaxima_suppression_box(synthetic_image_hough)
|
|
|
|
|
oneline_image_hough_nonmax = uz_image.nonmaxima_suppression_box(oneline_image_hough)
|
|
|
|
|
rectangle_image_hough_nonmax = uz_image.nonmaxima_suppression_box(rectangle_image_hough)
|
2022-11-16 12:55:08 +01:00
|
|
|
|
print('[+] Nonmaxima suppression applied')
|
2022-11-15 23:31:05 +01:00
|
|
|
|
|
|
|
|
|
fig, axs = plt.subplots(1, 3)
|
|
|
|
|
|
2022-11-16 12:55:08 +01:00
|
|
|
|
|
|
|
|
|
def select_best_pairs(image_line_params: npt.NDArray[np.float64], n =10):
|
|
|
|
|
image_line_params = np.array(image_line_params)
|
|
|
|
|
# Sorts just kth element so every eleement before kth element is lower than kth element
|
|
|
|
|
# and every element after kth element is higher than kth element
|
|
|
|
|
partition = np.argpartition(image_line_params, kth=len(image_line_params) - n - 1, axis=0)[-n:]
|
|
|
|
|
image_line_params = image_line_params[partition.T[0]]
|
|
|
|
|
return image_line_params
|
|
|
|
|
|
|
|
|
|
# Plot synthetic image
|
|
|
|
|
axs[0].imshow(synthetic_image, cmap='gray')
|
|
|
|
|
neighbour_pairs = uz_image.retrieve_hough_pairs(synthetic_image, synthetic_image_hough_nonmax, np.max(synthetic_image_hough_nonmax)*0.99, N_BINS_THETA, N_BINS_RHO)
|
2022-11-15 23:31:05 +01:00
|
|
|
|
for neighbour in neighbour_pairs:
|
2022-11-16 12:55:08 +01:00
|
|
|
|
xs, ys = uz_image.get_line_to_plot(neighbour[0], neighbour[1], synthetic_image.shape[0], synthetic_image.shape[1])
|
2022-11-15 23:31:05 +01:00
|
|
|
|
axs[0].plot(xs, ys, 'r', linewidth=0.7)
|
|
|
|
|
|
2022-11-16 12:55:08 +01:00
|
|
|
|
# Plot oneline image
|
|
|
|
|
axs[1].imshow(oneline_image, cmap='gray')
|
|
|
|
|
neighbour_pairs = uz_image.retrieve_hough_pairs(oneline_image, oneline_image_hough_nonmax, np.max(oneline_image_hough_nonmax)*0.5, N_BINS_THETA, N_BINS_RHO)
|
|
|
|
|
for neighbour in neighbour_pairs:
|
|
|
|
|
xs, ys = uz_image.get_line_to_plot(neighbour[0], neighbour[1], oneline_image.shape[0], oneline_image.shape[1])
|
|
|
|
|
axs[1].plot(xs, ys, 'r', linewidth=0.7)
|
|
|
|
|
|
|
|
|
|
# Plot rectangle image
|
|
|
|
|
axs[2].imshow(rectangle_image, cmap='gray')
|
|
|
|
|
neighbour_pairs = uz_image.retrieve_hough_pairs(rectangle_image, rectangle_image_hough_nonmax, np.max(rectangle_image_hough_nonmax)*0.35, N_BINS_THETA, N_BINS_RHO)
|
|
|
|
|
best_paris = select_best_pairs(neighbour_pairs)
|
|
|
|
|
|
|
|
|
|
for neighbour in best_paris:
|
|
|
|
|
xs, ys = uz_image.get_line_to_plot(neighbour[0], neighbour[1], rectangle_image.shape[0], rectangle_image.shape[1])
|
|
|
|
|
axs[2].plot(xs, ys, 'r', linewidth=0.7)
|
|
|
|
|
|
|
|
|
|
plt.show()
|
|
|
|
|
|
|
|
|
|
def three_e():
|
|
|
|
|
"""
|
|
|
|
|
Read the image from files bricks.jpg and pier.jpg. Change the image to grayscale
|
|
|
|
|
and detect edges. Then detect lines using your algorithm. As the results will likely
|
|
|
|
|
depend on the number of pixels that vote for specific cell and this depends on the
|
|
|
|
|
size of the image and the resolution of the accumulator, try sorting the pairs by
|
|
|
|
|
their corresponding cell values in descending order and only select the top n = 10
|
|
|
|
|
lines. Display the results and experiment with parameters of Hough algorithm as
|
|
|
|
|
well as the edge detection algorithm, e.g. try changing the number of cells in the
|
|
|
|
|
accumulator or σ parameter in edge detection to obtain results that are similar or
|
|
|
|
|
better to the ones shown on the image below
|
|
|
|
|
"""
|
|
|
|
|
SIGMA = 1
|
|
|
|
|
THETA = 0.02
|
|
|
|
|
T_LOW = 0.04
|
|
|
|
|
T_HIGH = 0.16
|
|
|
|
|
N_BINS_RHO = 360
|
|
|
|
|
N_BINS_THETA = 360
|
|
|
|
|
|
|
|
|
|
bricks_image_gray= uz_image.imread_gray('./images/bricks.jpg', uz_image.ImageType.float64)
|
|
|
|
|
pier_image_gray = uz_image.imread_gray('./images/pier.jpg', uz_image.ImageType.float64)
|
|
|
|
|
bricks_image_coloured = uz_image.imread('./images/bricks.jpg', uz_image.ImageType.float64)
|
|
|
|
|
pier_image_coloured = uz_image.imread('./images/pier.jpg', uz_image.ImageType.float64)
|
|
|
|
|
print('[+] Images loaded')
|
|
|
|
|
|
2022-11-16 16:58:43 +01:00
|
|
|
|
bricks_image_edges = uz_image.find_edges_canny(bricks_image_gray, SIGMA, THETA+0.04, T_LOW, T_HIGH)
|
2022-11-16 12:55:08 +01:00
|
|
|
|
pier_image_edges = uz_image.find_edges_canny(pier_image_gray, SIGMA, THETA, T_LOW, T_HIGH)
|
|
|
|
|
print('[+] Edges detected')
|
|
|
|
|
|
|
|
|
|
bricks_image_hough = uz_image.hough_find_lines(bricks_image_edges, N_BINS_THETA, N_BINS_RHO, 0.2)
|
|
|
|
|
pier_image_hough = uz_image.hough_find_lines(pier_image_edges, N_BINS_THETA, N_BINS_RHO, 0.2)
|
|
|
|
|
print('[+] Hugh lines drawn')
|
|
|
|
|
|
|
|
|
|
bricks_image_hough_nonmax = uz_image.nonmaxima_suppression_box(bricks_image_hough)
|
|
|
|
|
pier_image_hough_nonmax = uz_image.nonmaxima_suppression_box(pier_image_hough)
|
|
|
|
|
print('[+] Nonmaxima suppression applied')
|
|
|
|
|
|
|
|
|
|
bricks_image_line_params = uz_image.retrieve_hough_pairs(bricks_image_gray, bricks_image_hough_nonmax, np.max(bricks_image_hough_nonmax)*0.8, N_BINS_THETA, N_BINS_RHO)
|
|
|
|
|
pier_image_line_params = uz_image.retrieve_hough_pairs(pier_image_gray, pier_image_hough_nonmax, np.max(pier_image_hough_nonmax)*0.8, N_BINS_THETA, N_BINS_RHO)
|
|
|
|
|
print('[+] Hough pairs retrieved')
|
|
|
|
|
|
|
|
|
|
def select_best_pairs(image_line_params: npt.NDArray[np.float64], n =10):
|
|
|
|
|
image_line_params = np.array(image_line_params)
|
|
|
|
|
# Sorts just kth element so every eleement before kth element is lower than kth element
|
|
|
|
|
# and every element after kth element is higher than kth element
|
|
|
|
|
partition = np.argpartition(image_line_params, kth=len(image_line_params) - n - 1, axis=0)[-n:]
|
|
|
|
|
image_line_params = image_line_params[partition.T[0]]
|
|
|
|
|
return image_line_params
|
|
|
|
|
|
|
|
|
|
bricks_image_line_params = select_best_pairs(bricks_image_line_params)
|
|
|
|
|
pier_image_line_params = select_best_pairs(pier_image_line_params)
|
|
|
|
|
print('[+] Best pairs selected')
|
|
|
|
|
|
|
|
|
|
fig, axs = plt.subplots(5, 2)
|
|
|
|
|
|
|
|
|
|
# Plot grayscale images
|
|
|
|
|
axs[0, 0].imshow(bricks_image_gray, cmap='gray')
|
|
|
|
|
axs[0, 0].set(title='bricks.jpg')
|
|
|
|
|
axs[0, 1].imshow(pier_image_gray, cmap='gray')
|
|
|
|
|
axs[0, 1].set(title='pier.jpg')
|
|
|
|
|
|
|
|
|
|
# Plot images with canny edges detected
|
|
|
|
|
axs[1, 0].imshow(bricks_image_edges, cmap='gray')
|
|
|
|
|
axs[1, 1].imshow(pier_image_edges, cmap='gray')
|
|
|
|
|
|
|
|
|
|
# Plot images in hough space
|
|
|
|
|
axs[2, 0].imshow(bricks_image_hough)
|
|
|
|
|
axs[2, 1].imshow(pier_image_hough)
|
|
|
|
|
|
|
|
|
|
# Plot images in hough space after nonmax suppression
|
|
|
|
|
axs[3, 0].imshow(bricks_image_hough_nonmax)
|
|
|
|
|
axs[3, 1].imshow(pier_image_hough_nonmax)
|
|
|
|
|
|
|
|
|
|
# Plot coloured images with lines drawn
|
|
|
|
|
axs[4, 0].imshow(bricks_image_coloured)
|
|
|
|
|
for param in bricks_image_line_params:
|
|
|
|
|
xs, ys = uz_image.get_line_to_plot(param[0], param[1], bricks_image_coloured.shape[0], bricks_image_coloured.shape[1])
|
|
|
|
|
axs[4, 0].plot(xs, ys, 'r', linewidth=0.7)
|
2022-11-15 23:31:05 +01:00
|
|
|
|
|
2022-11-16 12:55:08 +01:00
|
|
|
|
axs[4, 1].imshow(pier_image_coloured)
|
|
|
|
|
for param in pier_image_line_params:
|
|
|
|
|
xs, ys = uz_image.get_line_to_plot(param[0], param[1], pier_image_coloured.shape[0], pier_image_coloured.shape[1])
|
|
|
|
|
axs[4, 1].plot(xs, ys, 'r', linewidth=0.7)
|
2022-11-15 23:31:05 +01:00
|
|
|
|
|
2022-11-16 12:55:08 +01:00
|
|
|
|
plt.show()
|
2022-11-16 16:58:43 +01:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
def three_f():
|
|
|
|
|
"""
|
|
|
|
|
A problem of the Hough transform is that we need a new dimension for
|
|
|
|
|
each additional parameter in the model, which makes the execution slow for more
|
|
|
|
|
complex models. We can avoid such parameters if we can reduce the parameter
|
|
|
|
|
space, e.g. by introducing domain knowledge. Recall from the previous exercise that
|
|
|
|
|
we can get the local gradient angle besides its magnitude. This angle is perpendicular
|
|
|
|
|
to the edge and can be used to limit the scope of the parameter ϑ for a specific edge
|
|
|
|
|
point. We therefore do not have to increase the values of the cells of the entire range
|
|
|
|
|
of ϑ (calculate multiple values of ρ), but can use the local angle and only work with
|
|
|
|
|
a single (ρ, ϑ) pair for each edge point.
|
|
|
|
|
Copy your implementation of the line detector to a new function and modify the
|
|
|
|
|
algorithm so that it also accepts the matrix of edge angles. Note that the angle values
|
|
|
|
|
were probably calculated using the np.arctan2(dy, dx) function that returns the
|
|
|
|
|
values between wider range. You have to adjust the angles so that they are within
|
|
|
|
|
the [−π/2, π/2] interval. Test the modified function on several images and compare
|
|
|
|
|
the results with the original implementation.
|
|
|
|
|
"""
|
|
|
|
|
rectangle_image = uz_image.imread_gray('./images/rectangle.png', uz_image.ImageType.float64)
|
|
|
|
|
|
|
|
|
|
image_with_edges_n, derivative_magnitude_n, gradient_angles_n, hough_image_n, hough_image_nms_n, pairs_n, best_pairs_n = uz_image.find_lines_in_image_naive(
|
|
|
|
|
rectangle_image
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
image_with_edges_i, derivative_magnitude_i, gradient_angles_i, hough_image_i, hough_image_nms_i, pairs_i, best_pairs_i = uz_image.find_lines_in_image_improved(
|
|
|
|
|
rectangle_image
|
|
|
|
|
)
|
|
|
|
|
|
|
|
|
|
fig, axs = plt.subplots(2, 2)
|
|
|
|
|
|
|
|
|
|
axs[0, 0].imshow(hough_image_n)
|
|
|
|
|
axs[0, 0].set(title='normal')
|
|
|
|
|
axs[0, 1].imshow(image_with_edges_i)
|
|
|
|
|
axs[0, 1].set(title='normal')
|
|
|
|
|
|
|
|
|
|
axs[1, 0].imshow(rectangle_image, cmap='gray')
|
|
|
|
|
for param in best_pairs_n:
|
|
|
|
|
xs, ys = uz_image.get_line_to_plot(param[0], param[1], rectangle_image.shape[0], rectangle_image.shape[1])
|
|
|
|
|
axs[1, 0].plot(xs, ys, 'r', linewidth=0.7)
|
|
|
|
|
|
|
|
|
|
axs[1,1].imshow(rectangle_image, cmap='gray')
|
|
|
|
|
for param in best_pairs_i:
|
|
|
|
|
xs, ys = uz_image.get_line_to_plot(param[0], param[1], rectangle_image.shape[0], rectangle_image.shape[1])
|
|
|
|
|
axs[1, 1].plot(xs, ys, 'r', linewidth=0.7)
|
|
|
|
|
|
|
|
|
|
plt.show()
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
2022-11-13 15:13:43 +01:00
|
|
|
|
# ######## #
|
|
|
|
|
# SOLUTION #
|
|
|
|
|
# ######## #
|
|
|
|
|
|
|
|
|
|
def main():
|
2022-11-14 19:02:29 +01:00
|
|
|
|
#ex1()
|
2022-11-15 09:24:34 +01:00
|
|
|
|
#ex2()
|
2022-11-16 16:58:43 +01:00
|
|
|
|
#ex3()
|
2022-11-13 15:13:43 +01:00
|
|
|
|
|
|
|
|
|
if __name__ == '__main__':
|
|
|
|
|
main()
|