1 / 27

Image Segmentation Region growing & Contour following

Image Segmentation Region growing & Contour following. Hyeun-gu Choi Advisor: Dr. Harvey Rhody Center for Imaging Science. Background. Definition of image segmentation Subdivides an image into its constituent parts or objects. Region growing Based on similarity of gray-level values

casper
Télécharger la présentation

Image Segmentation Region growing & Contour following

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Image SegmentationRegion growing & Contour following Hyeun-gu Choi Advisor: Dr. Harvey Rhody Center for Imaging Science

  2. Background • Definition of image segmentation • Subdivides an image into its constituent parts or objects. • Region growing • Based on similarity of gray-level values • Contour following • Based on discontinuity of gray-level values Hyeun-gu Choi

  3. Detection of discontinuity • Gradient operators - First derivative(Sobel) • Zero value - constant gray level • Positive value - transition from dark region to light region • Negative value - transition from light region to dark region Hyeun-gu Choi

  4. Detection of discontinuity • Gradient operators - Second derivative (Laplacian) • Positive value - dark region • Negative value - light region • This operator is good for deciding whether a pixel is on the dark or light side of an edge. Hyeun-gu Choi

  5. Application of these operators(1) • Threshold Selection Based on Boundary Characteristics T: Threshold value s(x,y): result image Hyeun-gu Choi

  6. Examples of derivative operator Original image with background picture Segmented image without background by Sobel and Laplacian operator Hyeun-gu Choi

  7. Results of derivative operator Original image Segmented image Original image Segmented image Selected threshold values are around 70. Too small values of threshold mean small change of gray level and too big threshold value may gives noise. Hyeun-gu Choi

  8. Segmentation by thresholding • Simple Global Thresholding • Simply select a threshold value between peak values from a histogram plot and set zero below than threshold and set 255 greater than threshold. • Disadvantage: lost a lot of data information and there is no guarantee of grouped (well-separated) histogram. Hyeun-gu Choi

  9. Segmentation by thresholding • Multiple Thresholding • Select useful region by selecting two thresholds • Simple and very good results • Disadvantage - No guarantee for grouped histogram. Not good for automated system because user should decide threshold value Hyeun-gu Choi

  10. Examples of multiple thresholding(2) Original spin density image Enhanced image by histogram equalization Segmented image (CSF tissue) 70 - 230 * CSF (Cerebrospinal fluid) Hyeun-gu Choi

  11. Examples of multiple thresholding Noise Th = 83~255 Th = 0~82 Hyeun-gu Choi

  12. Label Region algorithm • Basic Concept • Scan through an image pixel by pixel • Compare the gray value of center pixel with those of top and left pixels. • If compared gray values are the same, those pixels are categorized to one group. • After scanning all pixels, pixels with the same gray level value will be grouped. • Disadvantage - Very vulnerable to noise. Hyeun-gu Choi

  13. LabelRegionalgorithm Original image Result of label region algorithm Modified label region algorithm Modified label region algorithm has some margin. That is, when pixel values are compared, only if pixel value difference is bigger than some value, the algorithm classify the pixel to new class. Modified algorithm is less vulnerable to noise. Hyeun-gu Choi

  14. Hough Transform(1) y b b = -xia+yi xi,yi b` xj,yj b = -xja+yj x a a` • Consider a point (xi , yi). General equation for this point is yi = axi + b or b = -xia+yi • If two points (xi, yi) and (xj, yj) are on the same line two points have an intersection in parameter space (ab plane). xy plane Parameter space Hyeun-gu Choi

  15. Hough Transform y   x • Problem - Both slope and intercept approach infinity as the line approaches the vertical. • Solution - change to  plane yi = axi + b x cos + y sin =  Normal representation of a line Hyeun-gu Choi

  16. Hough Transform • Subdivision of the parameter space into so- called accumulator cells and counting intersection points. • Intersection point with a  value and a  value means two data points are on the same line with  and .  max (x1, y1) (x2, y2) min  min max Quantization of the  plane into cells. Hyeun-gu Choi

  17. Hough Transform Four dots in xy plane Result of Hough Transform 2 3 1 1 3 2 Four dots in parameter space Intersections found by accumulation cell Hyeun-gu Choi

  18. Hough Transform • Disadvantage of Hough Transform • Vulnerable to noise • Difficult to find lines in complicated images • Difficult to change the shape which looking for • Line : y = ax + b • Circle : (x-C1)2 + (y-C2)2 = C3  3Dim parameter space • Long processing time • About 25 minutes for 192 x 128 size image by Pentium 166MHz, 48Mbyte RAM Hyeun-gu Choi

  19. Hough Transform Found diagonal lines because diagonal direction has a lot of data points Original image Gradient image Gradient image in parameter space Found intersections Hyeun-gu Choi

  20. Hough Transform Original image Gradient image Thresholded image threshold Histogram of original image Hyeun-gu Choi

  21. Hough Transform Thresholded image Found lines Gradient image in parameter space Found intersections Hyeun-gu Choi

  22. Graphic User Interface (Widget) • A graphic user interface is created for demonstration of segmentation methods in IDL (Interactive Data Language). • Widget interface is consisted of five image windows and one plot window. • 11 full down main menus. • Advantage - Easy to organize many algorithms and easy to modify. Hyeun-gu Choi

  23. Graphic User Interface (Widget) Hyeun-gu Choi

  24. Graphic User Interface (Widget) • Main menus and sub menus • Files • New - Get an new image. • Save Image • Switch - User can switch two windows • Filter • High pass, low pass, unsharp, laplacian, vertical edges, horizontal edges, sobel, median, and custom. • Arithmetic - Add and subtract two windows. Hyeun-gu Choi

  25. Graphic User Interface (Widget) • Add Noise • Label Region • Label region (IDL library) and Modified label region • Histogram • Histogram of source window, Histogram equalization, one threshold, and two thresholds • Color table - Emphasize the processed image. Hyeun-gu Choi

  26. Graphic User Interface (Widget) • Hough • Manual - User can choose intersections by clicking in parameter space. • Auto - Computer do the whole process. • Zoom - Zoom in an image with several magnification (2x, 3x, 4x). • Done - Finish the interface. Hyeun-gu Choi

  27. Reference • (1) Gonzalez, Rafael C. and Woods, Richard E.[1992] “Digital Image Processing” Addison-Wesley Publishing Company • (2) Lynn M. Fletcher, John B. Barsotti, Joseph P. Hornak [1993] “A Multispectral Analysis of Brain Tissues” Magnetic Resonance in Medicine 29:623-630 Hyeun-gu Choi

More Related