An image is simply an array of arrays of arrays of RGB values. For example, here is a 3 X 2 image consisting of a red and green pixel in the top row, a blue and white pixel in the middle row, and two black pixels in the bottom row:
[[[255,0,0], [0,255,0]],[[0,0,255], [255,255,255]], [[0,0,0], [0,0,0]]]
We can remove the red components of an image using the following function in Python:
def remove_red(image):
num_rows = len(image)
num_columns = len(image[0])
for row in (0, num_rows):
for column in (0, num_columns):
green = image[row][column][1]
blue = image[row][column][2]
image[row][column] = [0, green, blue]
return None
It is possible to improve the performance for the remove_red function by modifying it to perform the work on the different pixels concurrently instead of following the ordering given by the loops. Could the same be done for the problem of implementing a function that returns a list of n pseudorandom numbers generated using a linear congruential generator? Why or why not?
Required minimum 1 page