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

Slides:



Advertisements
Similar presentations
Hough Transforms CSE 6367 – Computer Vision Vassilis Athitsos University of Texas at Arlington.
Advertisements

Chapter 3 Image Enhancement in the Spatial Domain.
Digital Image Processing
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Face Recognition and Biometric Systems 2005/2006 Filters.
Segmentation (2): edge detection
Biomedical Image Analysis Rangaraj M. Rangayyan Ch. 5 Detection of Regions of Interest: Sections , Presentation March 3rd 2005 Jukka Parviainen.
Chapter 10 Image Segmentation.
Machinen Vision and Dig. Image Analysis 1 Prof. Heikki Kälviäinen CT50A6100 Lectures 8&9: Image Segmentation Professor Heikki Kälviäinen Machine Vision.
Text Detection in Video Min Cai Background  Video OCR: Text detection, extraction and recognition  Detection Target: Artificial text  Text.
Digital Image Processing
Chapter 10 Image Segmentation.
The Segmentation Problem
Robust estimation Problem: we want to determine the displacement (u,v) between pairs of images. We are given 100 points with a correlation score computed.
Hough Transform (Section 10.2) CS474/67. Edge Linking and Boundary Detection Edge detection does not yield connected boundaries. Edge linking and boundary.
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
Chapter 10: Image Segmentation
Neighborhood Operations
Spatial-based Enhancements Lecture 3 prepared by R. Lathrop 10/99 updated 10/03 ERDAS Field Guide 6th Ed. Ch 5: ;
Hough Transform on the GPU Presented by Javier Garcia November 29, 2010.
Segmentation Lucia Ballerini Digital Image Processing Lecture 8 Course book reading: GW 10.
Medical Image Analysis Image Enhancement Figures come from the textbook: Medical Image Analysis, by Atam P. Dhawan, IEEE Press, 2003.
Edge Linking & Boundary Detection
Lecture 16 Image Segmentation 1.The basic concepts of segmentation 2.Point, line, edge detection 3.Thresh holding 4.Region-based segmentation 5.Segmentation.
Topic 10 - Image Analysis DIGITAL IMAGE PROCESSING Course 3624 Department of Physics and Astronomy Professor Bob Warwick.
HOUGH TRANSFORM Presentation by Sumit Tandon
Chap. 9: Image Segmentation Jen-Chang Liu, Motivation Segmentation subdivides an image into its constituent regions or objects Example: 生物細胞在影像序列中的追蹤.
© by Yu Hen Hu 1 ECE533 Digital Image Processing Image Segmentation.
Digital Image Processing Chapter 9: Morphological Image Processing 5 September 2007 Digital Image Processing Chapter 9: Morphological Image Processing.
Digital Image Processing Lecture 5: Neighborhood Processing: Spatial Filtering Prof. Charlene Tsai.
Mestrado em Ciência de Computadores Mestrado Integrado em Engenharia de Redes e Sistemas Informáticos VC 14/15 – TP8 Segmentation Miguel Tavares Coimbra.
Image Segmentation and Morphological Processing Digital Image Processing in Life- Science Aviad Baram
Chapter 10 Image Segmentation.
AdeptSight Image Processing Tools Lee Haney January 21, 2010.
Chapter 10, Part II Edge Linking and Boundary Detection The methods discussed in the previous section yield pixels lying only on edges. This section.
Digital Image Processing & Pattern Analysis (CSCE 563) Image Segmentation Prof. Amr Goneid Department of Computer Science & Engineering The American University.
Image Processing Segmentation 1.Process of partitioning a digital image into multiple segments (sets of pixels). 2. Clustering pixels into salient image.
Chapter 10, Part I.  Segmentation subdivides an image into its constituent regions or objects.  Image segmentation methods are generally based on two.
CS654: Digital Image Analysis Lecture 25: Hough Transform Slide credits: Guillermo Sapiro, Mubarak Shah, Derek Hoiem.
EE 4780 Edge Detection.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Edge Detection and Geometric Primitive Extraction Jinxiang Chai.
Course 8 Contours. Def: edge list ---- ordered set of edge point or fragments. Def: contour ---- an edge list or expression that is used to represent.
Digital Image Processing Lecture 5: Neighborhood Processing: Spatial Filtering March 9, 2004 Prof. Charlene Tsai.
October 16, 2014Computer Vision Lecture 12: Image Segmentation II 1 Hough Transform The Hough transform is a very general technique for feature detection.
主講者 : 陳建齊. Outline & Content 1. Introduction 2. Thresholding 3. Edge-based segmentation 4. Region-based segmentation 5. conclusion 2.
Hough transform and geometric transform
Image Segmentation Image segmentation (segmentace obrazu)
1 Mathematic Morphology used to extract image components that are useful in the representation and description of region shape, such as boundaries extraction.
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities May 2, 2005 Prof. Charlene Tsai.
Digital Image Processing Lecture 17: Segmentation: Canny Edge Detector & Hough Transform Prof. Charlene Tsai.
Machine Vision Edge Detection Techniques ENT 273 Lecture 6 Hema C.R.
Thresholding Foundation:. Thresholding In A: light objects in dark background To extract the objects: –Select a T that separates the objects from the.
Digital Image Processing CSC331
Chapter 10: Image Segmentation The whole is equal to the sum of its parts. Euclid The whole is greater than the sum of its parts. Max Wertheimer.
Digital Image Processing CCS331 Relationships of Pixel 1.
Over the recent years, computer vision has started to play a significant role in the Human Computer Interaction (HCI). With efficient object tracking.
Primitive graphic objects
Medical Image Analysis
Chapter 10 Image Segmentation
Miguel Tavares Coimbra
Digital Image Processing Lecture 16: Segmentation: Detection of Discontinuities Prof. Charlene Tsai.
Detection of discontinuity using
Image Segmentation – Edge Detection
Finding Lines in Images
Fitting Curve Models to Edges
ECE 692 – Advanced Topics in Computer Vision
Digital Image Processing
Hough Transform COMP 4900C Winter 2008.
Introduction to Artificial Intelligence Lecture 22: Computer Vision II
Presentation transcript:

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

5.8.98Hyeun-gu Choi 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

5.8.98Hyeun-gu Choi 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

5.8.98Hyeun-gu Choi 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.

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

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

5.8.98Hyeun-gu Choi Results of derivative operator 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. Original imageSegmented image Original imageSegmented image

5.8.98Hyeun-gu Choi 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.

5.8.98Hyeun-gu Choi 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

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

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

5.8.98Hyeun-gu Choi 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.

5.8.98Hyeun-gu Choi Label Region algorithm 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. Original image

5.8.98Hyeun-gu Choi Hough Transform (1) Consider a point (x i, y i ). General equation for this point is y i = ax i + b or b = -x i a+y i If two points (x i, y i ) and (x j, y j ) are on the same line two points have an intersection in parameter space (ab plane). x i,y i x j,y j x y a b b = -x i a+y i b = -x j a+y j a` b` xy plane Parameter space

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

5.8.98Hyeun-gu Choi 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 . Hough Transform  max  max    min  min Quantization of the  plane into cells. (x 1, y 1 ) (x 2, y 2 )

5.8.98Hyeun-gu Choi Hough Transform Four dots in xy plane Result of Hough Transform Four dots in parameter space Intersections found by accumulation cell

5.8.98Hyeun-gu Choi 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-C 1 ) 2 + (y-C 2 ) 2 = C 3  3Dim parameter space –Long processing time About 25 minutes for 192 x 128 size image by Pentium 166MHz, 48Mbyte RAM Hough Transform

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

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

5.8.98Hyeun-gu Choi Gradient image in parameter space Found intersections Found linesThresholded image Hough Transform

5.8.98Hyeun-gu Choi 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.

5.8.98Hyeun-gu Choi Graphic User Interface (Widget)

5.8.98Hyeun-gu Choi 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. Graphic User Interface (Widget)

5.8.98Hyeun-gu Choi –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. Graphic User Interface (Widget)

5.8.98Hyeun-gu Choi –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. Graphic User Interface (Widget)

5.8.98Hyeun-gu Choi 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: