Q 3(a) [6 Marks] Explain, in detail, how the Hough Transform can be used to isolate the line in the noisy binary image illustrated in Figure Q3. Discuss the issues relating to the robustness of your technique. What are the limiting factors to your approach? Figure Q3: Binary image segment with noise. Q 3(b) [3 Marks] Outline the operation of the Circular Hough transform for Single Circle of known radius (r), clearly indicating how robustness is achieved. Q 3(c) [3 Marks] Detail the operation of the Circular Hough Transform (CHT) for Multiple similar circles of known radius (r). Q 3(d) [4 Marks] Outline the key stages in implementing a one-dimensional Chamfer based distance transform. Q 3(e) [3 Marks] Outline how we can employ Bandstop and Bandpass based image processing based filtering in Fourier domain. Clearly indicate how these approaches relate to the Twodimensional Discrete Fourier Transform Power spectrum. Q 3(f) [6 Marks] One of the key issues with K-Means clustering is that if the initial partitions are not chosen carefully enough it may converge to a local minimum rather than the global minimum solution. Outline a possible solution to this issue. Outline any disadvantages to your proposed solution