h1 - Only use foreground pixels in your path. 1 1 1 1 1 1 1...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CMPEN/EE455: Digital Image Processing I Fall 2009 Written Homework #1 assigned: 24 August 2009 due: 3PM Friday 11 September in EE East homework slot student problem solutions, available from “imageprocessingplace.com.” 4. Consider the binary-valued image below. Answer the following questions: (a) label all connected components, using 4-connectivity. (b) repeat (a) for 8-connectivity. (c) give the shortest 8-path from the pixel in the upper left corner to the pixel in the upper right corner.
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Only use foreground pixels in your path. 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 5. Consider the image below and the set V = { 6 , 7 , 8 , 9 } . Mark all the four and eight (maximal) connected components. 1 1 1 2 3 4 3 2 8 4 9 2 1 3 3 2 6 1 9 2 1 2 3 2 2 8 9 2 3 4 3 7 2 2 2 2 3 3 8 2 2 2 8 2 3 6 3 2 2 2 2 8 8 3 3 2 2 2 2 2 3 4 3 2 6. G&W 2.19. (See Sect. 2.6.2.)...
View Full Document

Ask a homework question - tutors are online