utilisation of contour criteria in micro-segmentation of sar.ppt

Hierarchical Segmentation of Polarimetric SAR Images Jean-Marie Beaulieu Computer Science Department Laval University Ridha Touzi Canada Centre for Remote Sensing Natural Resources Canada HIERARCHICAL SEGMENTATION BY STEP-WISE OPTIMISATION * Hierarchical Image Segmentation As a maximum likelihood estimation problem Segmentation of polarimetric images Segment sizes – shape constraints Results Hierarchical Segmentation of Polarimetric SAR Images Image Segmentation is the division of the image plane into regions Two basic questions: 1- What kind of regions do we want ? 2- How can we obtain them ? Homogeneous regions Segment similarity Algorithm design A hierarchical segmentation begins with an initial partition P0 (with N segments) and then sequentially merges these segments. Segment tree level n+1 level n level n-1 Sequence of segment merges. 1) need a partition of the image 2) need statistical parameters 3) need an image probability model xi are conditionally independent SEGMENTATION AS MAXIMUM LIKELIHOOD ESTIMATION Given an image The segmentation problem is to find the partition that maximizes the likelihood.Global search – too many possible partitions.  is derived from statistics calculated over a segment s. the likelihood of is The maximum likelihood increases with the number of segments number of segments Can't find the optimum partition with k segments, PkToo many, except for P1 and Pnxn. Hierarchical segmentation  ? get Pk from Pk+1 by merging 2 segments. Stepwise optimization examine each adjacent segment pair merge the pair that minimizes the criterion Merging criterion:  merge the 2 segments producing the smallest  decrease of the maximum likelihood (stepwise optimization) number of segments Sub-optimum within hierarchical merging framework. Criterion ? cost of merging 2 segments Log likelihood form Summation inside region minimize Multi-channel image – 3 complex elements each element ha