Hough transform (Image Processing)

You are required to write a program that can read a text file that contains a binary image (consists of 1’s and 0’s) and list down the equations for all the lines that exist in the image. A sample of the test file would be as follows: 10 20 00000000000000000000 00000000000000000000 00001111111000000000 00000000001000000000 00000000001000000000 00000000001000000001 00000000001000000010 00000000000000000100 00000000000000001000 00000000000000010000 The first line of the file contains two numbers: the number of rows and the number of columns. The second and subsequent lines should contain the binary image. The line points are specified with a 1. In the example above, there exist three different lines. Therefore, the program should produce three different equations. The program should take the following parameters from the user: a) ©© b) ©© c) The number of points required to be considered as a line To test your program, create two binary images that contain several lines. For each image, run your program, at least, three times. For each time, try a different combination of ©©, ©© and the number of points required. At the end, you should have six different test results. You are required to submit the following: a) A small write up that explains your program. b) A print out of the source code. c) A print out of the test images. d) A screenshot of the output produced when running your program with the test images. e) A softcopy of your program.