计算机觉课件4.ppt

Course 4 Regions * * Course 4. Regions Def. of Region: A set of connected image pixels, with similar properties. similar gray level similar color similar texture so on …… Region may be separated adjacent overlapped included Important principle of region process: ——homogeneity predicate (value similarity) ——special proximity 1. Region Representation 1) Array representation: Given a region R in image S, Its array representation A is: — same as binary image representation — often be used as a mask over intensity image to select the region for proper processing.? 2) Pyramids representation Pyramid representation of a NxN image (N=2k) contains k layers of reduced image. Each pixel in an upper layer image corresponds to 4 pixels in the lower layer image, i.e., Pixels value of upper layer image can be obtained by ——averaging the corresponding pixels of lower layer image, or ——subsampling (e.g. choose upper-left pixel value) 3) Quad Tree (Quad =4) Children: if a region S is partitioned into 4 sub region, in quad tree, each sub region node is call a child of the node of the original region. 4 3 2 1 S 1 2 3 4 Color of node: Algorithm: Set an image as a region, and represents it as a node in quad tree (0-level) Split the region into 4 subregions, and represent them in 4 child nodes. Check the color of each child node: ——if color is black or white, set node as “leaf node”, no further splitting. ——if color is gray, go to step b). d) Stop if all nodes are either black or white. 4) Region Adjacency Graph: —— Emphasize the adjacency of regions —— node: region —— link: common boundary between regions. 5) Picture Tree: —— Emphasize region inclusion within another region. —— Recursively split an image into regions, and the process stops when no region can be furthe