计算机视觉讲解.pptVIP

Algorithm 2 (line following) i) Set a window across the line draw. ii) Adjust the window size and position, such that the distance from window boundaries to the draw equal a preset width (e.g.2 pixel wide). iii) Set the center of the window be a skeleton point. iv) Move window forward. If no branch junction is met, go to step ii). v) If a branch junction is met, use BFS method, move window to one of the branch, go to step ii). vi) If window moves to the end of a line or branch, and the queque of BFS is empty, stop. —— One pass method, fast —— Relink problem at branches. Course 3 Binary Image Course 3 Binary Image Binary Images have only two gray levels: “1” and “0”, i.e., black / white. —— save memory —— fast processing —— many features of an intensity image appear in binary form, e.g. edge, contour, … —— human can understand binary line drawings. 1. Neighbors/path/connectivity (1) Neighbors of a pixel a. 4-neighbors: the upper, lower, left and right neighbor pixels of a pixel. b. 8-neighbors: the 4-neighbors pixels plus the diagonal neighbors. 4-neighbor 8-neighbor ? [i-1,j] ? [i,j-1] [i,j] [i,j+1] ? [i+1,j] ? [i-1,j-1] [i-1,j] [i-1,j+1] [i,j-1] [i,j] [i,j+1] [i+1,j-1] [i-1,j] [i+1,j+1] (2) Path A path form pixel to the pixel is a sequence of pixel indices: where the pixel is a neighbor of pixel for all . ——4 path if 4-neighbor is used ——8 path if 8-neighbor is used (3) Connectivity: A pixel is said to be connected to if there is a path from to consisting of pixels of . Connected component: A set of pixels in which each pixel is connected to all other pixels of the set. ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ? ?