Академический Документы
Профессиональный Документы
Культура Документы
IMAGE SEGMENTATION
Xiaoheng Yang Nakajima Lab, Titech October 29, 2004
CONTENTS
Problem Preview
Segmentation subdivides an image into it constitute s regions or objects. The level to which the subdivision is carried depends on the problem being solved. That is, segmentation should stop when the objects of interests in an application have been isolated. Image segmentation algorithms generally are based on one of two basic properties of intensity values: discontinuity and similarity.
Detection of Discontinuities
Thresholding
3.1 3.2 3.3 3.4 3.5 3.6 Foundation The Role of Illumination Basic Global Thresholding Basic Adaptive Threshloding Optimal Global and Adaptive Thresholding Use of Boundary Characteristics for Histogram Improvement and Local Thresholding 3.7 Thresholds Based on Several Variables
The most common way to look for discontinuities is to run a mask through the image.
R = wi zi
i
Region-Based Segmentation
4.1 Basic Formulation 4.2 Region Growing 4.3 Region Splitting and Merging
| R | T
Figure.2
Edge detection algorithms typically are followed by linking procedures to assemble edge pixels into meaningful edges. (for example, breaks caused by noise.)
2.1 Local Processing Criteria: the strength of the response of the gradient operator / the direction of the gradient vector A point in the predefined neighborhood is linked to the pixel if both magnitude and direction criteria are satisfied. 2.2 Global Processing via Hough Transform Computational attractiveness Approach based on the Hough transform is as follow: a. Compute the gradient of an image and threshold it to obtain a binary image. b. Specify subdivisions in the plane c. d. Examine the counts of the accumulator cells for high pixel concentrations. Examine the relationship between pixels in a chosen cell.
2.3 Global Processing via Graph-Theoretic Techniques This representation provides a rugged approach that performs well in the presence of noise. Some terms used here Graph G = ( N , U )
Figure.4 Figure.3
Figure.6. 3.5 Optimal Global and Adaptive Thresholding Figure.5 A method for estimating thresholds that produce the minimum average segmentation error PDF ( probability density function ) 3.6 Use of Boundary Characteristics for Histogram Improvement and Local Thresholding The chances of selecting a good threshold are enhanced considerably if the histogram peaks are tall, narrow, symmetric, and separated by deep valleys. One approach for improving the shape of histogram is to consider only those pixels that lie on or near the edges between objects and the background.
Thresholding
3.1 Foundation
T = T [ x, y, p( x, y ), f ( x, y)]
Classification for threshold: local, global, dynamic or adaptive 3.2 The Role of Illumination The image resulting from poor illumination could be quite difficult to segment. 3.3 Basic Global Thresholding The success of this method depends entirely on how well the histogram can be partitioned. Heuristic approach based on visual inspection of the histogram. 3.4 Basic Adaptive Threshloding Issues: how to subdivide the image and how to estimate the threshold for each resulting subimage
Figure.7
Region-Based Segmentation
The objective of segmentation is to partition an image into regions. 4.1 Basic Formulation 4.2 Region Growing Region growing is a procedure that groups pixels or subregions into larger regions based on predefined criteria. Seed region 4.3 Region Splitting and Merging
Figure.8
Segmentation by watersheds embodies many of the concepts of the other three approaches and, as such, often produces more stable segmentation results, including continuous segmentation boundaries. 5.1 Basic Concepts The concept of watersheds is based on visualizing an image in three dimensions: two spatial coordinates versus gray levels.
Figure.12
Figure.13 Figure.10
6
5.3 Watershed Segmentation Algorithm
Reference: Digital Image Processing, Rafael C. Gonzalez & Richard E. Woods, second edition 2002, Prentice Hall
Figure.11 5.4 The Use of Markers Problem: oversegmentation