lecture11 - CAP5415 Computer Vision Spring 2003 Khurram...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
1 CAP5415 Computer Vision Spring 2003 Khurram Hassan-Shafique Finding Connected Components Scan the binary image left to right top to bottom If there is an unlabeled pixel p with a value of ‘1’ assign a new label to it Recursively check the neighbors of pixel p and assign the same label if they are unlabeled with a value of ‘1’. Stop when all the pixels with value ‘1’ have been labeled.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 Finding Connected Components (Sequential Algorithm 4-connectivity) Scan the binary image left to right top to bottom If an unlabelled pixel has a value of 1, assign a new label to it according to the following rules. Determine equivalence classes of labels. In the second pass, assign the same label to all elements in an equivalence class. L 0 0 1 0 0 L L L 0 1 0 L M L M L 1 L L L 0 1 0 (Set L=M ) Rules for 8-connectivity L 0 0 0 0 1 0 0 0 0 (Set L=M ) L L L 0 0 0 1 0 0 0 L L L 0 0 0 1 0 0 0 L L L 0 0 0 1 0 0 0 L L L 0 0 0 1 0 * * L M L M L * * 1 * *
Background image of page 2
3 Fitting Choose a parametric object/some objects to represent a set of tokens
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 06/12/2011 for the course CAP 5415 taught by Professor Staff during the Fall '08 term at University of Central Florida.

Page1 / 8

lecture11 - CAP5415 Computer Vision Spring 2003 Khurram...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online