Question B.4 a) Consider the 5«5 binary (1-bit) image shown in Figure 7, with black (Intensity value equal to 0) and whi

[answerhappygod]

Question B 4 A Consider The 5 5 Binary 1 Bit Image Shown In Figure 7 With Black Intensity Value Equal To 0 And Whi 1 (36.13 KiB) Viewed 22 times

Question B 4 A Consider The 5 5 Binary 1 Bit Image Shown In Figure 7 With Black Intensity Value Equal To 0 And Whi 2 (33.41 KiB) Viewed 22 times

Question B.4 a) Consider the 5«5 binary (1-bit) image shown in Figure 7, with black (Intensity value equal to 0) and white intensity value equal to 1) pixels. The borders and grey lines are for visualisation purposes only. Figure 7 When answering the following questions, you may either sketch your answer or refer to pixels by their coordinates use matrix notation, giving row then column index with origin at the top left). 8) Which pixels are 4 neighbours of the pixel at position (4,41? [1 mark] 1) Which pixels are 4-adjacent to the pixel at position (4.4 [1 mark) HI) Which pixels are 8-neighbours of the pixel at position (4,47 [1 mark) Which pixels are 8-adjacent to the plael at position (4.41 [1 mark] What is the connected component of the pixel at the centre of the bottom row(position (5.3)) using 4-adjacency? (4 marks vi What is the connected component of pixet (5.3) using & adjacency? [4 marks] QUESTION CONTINUES ON THE NEXT PAGE 11 SEE NEXT PAGE b) Consider Figure 3.A, 8.8 and 8.C below: Figure 8.A Figure 8.8 Figure 8C The Canny edge detection algorithm is applied to Figure 8.A. 1) Figure 8.8 is the gradient magnitude of Figure 8.A as produced by the Canny algorithm. Name the processing steps used to generate Figure 8.B. [2 marks] ) Figure 8C was obtained by applying non- maxima suppression to Figure 8.8. Describe how Figure 8C is generated and why it is part of the Canny algorithm. 14 marks
Question B.3 Split image into 8x8 blocks Huffman Coding Quanti DCT coefficients RLE Compression Colour Space Transformation Down-camole Chrome a Discrete Cosine Transform (DCT Figure 5 a) Figure 5 indicates seven steps that form a simple PEG compression algorithm List the steps in order and briefly describe how each contributes to the overall compression of the image [10 maries] 11) Describe the meaning of the terms "lossy" and lossless in the context of image compression and indicate which of the steps above are lossy and which are lossless [4 marks] b) Figure 6 contains a 4x4 3-bit image (the black borders and grid lines are for visualization purposes only and the numbers indicate the prel values) 3 7 6 2 2376 Figure 6 QUESTION CONTINUES ON THE NEXT PAGE SEE NEXT PAGE SCCYBOSO 11 Figure 6 exhibits 'coding redundancy. Please explain what is meant by this term and why this is the case for Figure 6. [3 marks) 10 Huffman codes are variable length codes'. Explain what this term means and why this can reduce coding redundancy [1 mark] 1) Compute a Huffman code for Figure 6. 15 marks] 1 What is the compression ratio achieved when this code is used to encode the image? How close is it to the limit suggested by Shannon's theorem? [2 marks]