0 Up votes0 Down votes

76 views44 pagesImage Segmentation
concept for Digital Image Processing
Engineering Students of Electronics

Sep 06, 2013

© Attribution Non-Commercial (BY-NC)

PPT, PDF, TXT or read online from Scribd

Image Segmentation
concept for Digital Image Processing
Engineering Students of Electronics

Attribution Non-Commercial (BY-NC)

76 views

Image Segmentation
concept for Digital Image Processing
Engineering Students of Electronics

Attribution Non-Commercial (BY-NC)

- Morphological Image Compositing
- International Journal of Engineering Research and Development (IJERD)
- ProencaAlexandreIrisSegmentationIEE
- Segmentation
- Optimal Feature Set for Automatic Detection and Classification of Underwater Objects in SAS Images
- [IJCST-V6I4P11]:Anjali S
- Image Processing - Ch 10 - Image Segmentation
- 05583370
- Cluster Analysis (K-means)
- FUZZY BASED GRAPH CUT CLASSIFICATION OF HYPER-SPECTRAL IMAGE
- Program Detailat
- Jordan1996_516.pdf
- Goal Evaluation of Segmentation Algorithms for Traffic Sign Recognition
- Video Objects Detection Using Spatial and Temporal Segmentation
- Structure Detection Ges i
- v5-39
- A New Algorithm for Character Segmentation of License Plate
- cut paper
- Unsupervised 3D Segmentation Bio Signals
- 06235871

You are on page 1of 44

Image Segmentation

Segmentation divides an image into its constituent regions or objects. Segmentation of images is a difficult task in image processing. Still under research. Segmentation allows to extract objects in images. Segmentation is unsupervised learning. Model based object extraction, e.g., template matching, is supervised learning.

After a successful segmenting the image, the contours of objects can be extracted using edge detection and/or border following techniques. Shape of objects can be described. Based on shape, texture, and color objects can be identified. Image segmentation techniques are extensively used in similarity searches, e.g.: http://elib.cs.berkeley.edu/photos/blobworld/

Segmentation Algorithms

Segmentation algorithms are based on one of two basic properties of color, gray values, or texture: discontinuity and similarity. First category is to partition an image based on abrupt changes in intensity, such as edges in an image. Second category are based on partitioning an image into regions that are similar according to a predefined criteria. Histogram thresholding approach falls under this category.

Domain

spaces

spatial domain (row-column (rc) space) histogram spaces color space texture space other complex feature space

1. Each image point is mapped to a point in a color space, e.g.: Color(i, j) = (R (i, j), G(i, j), B(i, j)) It is many to one mapping. 2. The points in the color space are grouped to clusters. 3. The clusters are then mapped back to regions in the image.

Examples

Original pictures segmented pictures

The objects can be distinguished by assigning an arbitrary pixel value or average pixel value to the pixels belonging to the same clusters.

Homework 8: Implement in Matlab and test on some example images the clustering in the color space. Use Euclidean distance in RGB color space. You can use k-means, PAM, or some other clustering algorithm. Links to k-means, PAM, data normalization

Segmentation by Thresholding

Suppose that the gray-level histogram corresponds to an image f(x,y) composed of dark objects on the light background, in such a way that object and background pixels have gray levels grouped into two dominant modes. One obvious way to extract the objects from the background is to select a threshold T that separates these modes. Then any point (x,y) for which f(x,y) < T is called an object point, otherwise, the point is called a background point.

Histogram

Segmented Image

In Matlab histograms for images can be constructed using the imhist command.

I = imread('pout.tif');

figure, imshow(I);

figure, imhist(I) %look at the hist to get a threshold, e.g., 110 BW=roicolor(I, 110, 255); % makes a binary image figure, imshow(BW) % all pixels in (110, 255) will be 1 and white % the rest is 0 which is black

roicolor returns a region of interest selected as those pixels in I that match the values in the gray level interval. BW is a binary image with 1's where the values of I match the values of the interval.

Basic Global Thresholding: 1)Select an initial estimate for T 2)Segment the image using T. This will produce two groups of pixels. G1 consisting of all pixels with gray level values >T and G2 consisting of pixels with values <=T. 3)Compute the average gray level values mean1 and mean2 for the pixels in regions G1 and G2. 4)Compute a new threshold value T=(1/2)(mean1 +mean2) 5)Repeat steps 2 through 4 until difference in T in successive iterations is smaller than a predefined parameter T0.

Segmented Image

Basic Adaptive Thresholding: Images having uneven illumination makes it difficult to segment using histogram, this approach is to divide the original image into sub images and use the thresholding process to each of the sub images.

Multimodal Histogram

If there are three or more dominant modes in the image histogram, the histogram has to be partitioned by multiple thresholds. Multilevel thresholding classifies a point (x,y) as belonging to one object class if T1 < (x,y) <= T2, to the other object class if f(x,y) > T2 and to the background if f(x,y) <= T1.

A method based on Discrete Curve Evolution to find thresholds in the histogram.

The histogram is treated as a polyline and is simplified until a few vertices remain. Thresholds are determined by vertices that are local minima.

It yields a sequence: P=P0, ..., Pm Pi+1 is obtained from Pi by deleting the vertices of Pi that have minimal relevance measure

v w v

>

u

Multimodal Histogram

Histogram of lena

Segmented Image

Image after segmentation we get a outline of her face, hat, shadow etc

Histogram

Segmented Image

The goal of Image Segmentation is to find regions that represent objects or meaningful parts of objects. Major problems of image segmentation are result of noise in the image. An image domain X must be segmented in N different regions R(1),,R(N) The segmentation rule is a logical predicate of the form P(R)

Introduction

Image segmentation with respect to predicate P partitions the image X into subregions R(i), i=1,,N such that

X = i=1,..N U R(i) R(i) R(j) = 0 for I j P(R(i)) = TRUE for i = 1,2,,N P(R(i) U R(j)) = FALSE for i j

Introduction

The segmentation property is a logical predicate of the form P(R,x,t) x is a feature vector associated with region R t is a set of parameters (usually thresholds). A simple segmentation rule has the form: P(R) : I(r,c) < T for all (r,c) in R

Introduction

In the case of color images the feature vector x can be three RGB image components (R(r,c),G(r,c),B(r,c)) A simple segmentation rule may have the form: P(R) : (R(r,c) <T(R)) && (G(r,c)<T(G))&& (B(r,c) < T(B))

A simple approach to image segmentation is to start from some pixels (seeds) representing distinct image regions and to grow them, until they cover the entire image For region growing we need a rule describing a growth mechanism and a rule checking the homogeneity of the regions after each growth step

Region Growing

The growth mechanism at each stage k and for each region Ri(k), i = 1,,N, we check if there are unclassified pixels in the 8-neighbourhood of each pixel of the region border Before assigning such a pixel x to a region Ri(k),we check if the region homogeneity: P(Ri(k) U {x}) = TRUE , is valid

The arithmetic mean m and standard deviation std of a region R having n =|R| pixels:

1 m( R ) I ( r , c ) n ( r ,c )R

1 2 std ( R) ( I ( r , c ) m ( R )) n 1 ( r ,c )R

The predicate P: |m(R1) m(R2)| < k*min{std(R1), std(R2)}, is used to decide if the merging of the two regions R1, R2 is allowed, i.e., if |m(R1) m(R2)| < k*min{std(R1), std(R2)}, two regions R1, R2 are merged.

Split

The opposite approach to region growing is region splitting. It is a top-down approach and it starts with the assumption that the entire image is homogeneous If this is not true, the image is split into four sub images This splitting procedure is repeated recursively until we split the image into homogeneous regions

Split

If the original image is square N x N, having dimensions that are powers of 2(N = 2n): All regions produced but the splitting algorithm are squares having dimensions M x M , where M is a power of 2 as well. Since the procedure is recursive, it produces an image representation that can be described by a tree whose nodes have four sons each Such a tree is called a Quadtree.

Split

Quadtree

R0

R1 R0 R3 R1

R2

R00

R01

R02

R04

Split

Splitting techniques disadvantage, they create regions that may be adjacent and homogeneous, but not merged. Split and Merge method is an iterative algorithm that includes both splitting and merging at each iteration:

Split / Merge

If a region R is inhomogeneous (P(R)= False) then is split into four sub regions If two adjacent regions Ri,Rj are homogeneous (P(Ri U Rj) = TRUE), they are merged The algorithm stops when no further splitting or merging is possible

Split / Merge

The split and merge algorithm produces more compact regions than the pure splitting algorithm

Applications

3D Imaging : A basic task in 3-D image processing is the segmentation of an image which classifies voxels/pixels into objects or groups. 3-D image segmentation makes it possible to create 3-D rendering for multiple objects and perform quantitative analysis for the size, density and other parameters of detected objects. Several applications in the field of Medicine like magnetic resonance imaging (MRI).

- Morphological Image CompositingUploaded byShobdo Bondhu
- International Journal of Engineering Research and Development (IJERD)Uploaded byIJERD
- ProencaAlexandreIrisSegmentationIEEUploaded byanon_447732652
- SegmentationUploaded byzgxfsbjbn
- Optimal Feature Set for Automatic Detection and Classification of Underwater Objects in SAS ImagesUploaded byrakarak
- [IJCST-V6I4P11]:Anjali SUploaded byEighthSenseGroup
- Image Processing - Ch 10 - Image SegmentationUploaded byDoi Thay
- 05583370Uploaded byMekaTron
- Cluster Analysis (K-means)Uploaded bytotonibm
- FUZZY BASED GRAPH CUT CLASSIFICATION OF HYPER-SPECTRAL IMAGEUploaded byIJSTE
- Program DetailatUploaded byJoshua Woods
- Jordan1996_516.pdfUploaded byDeni Chan
- Goal Evaluation of Segmentation Algorithms for Traffic Sign RecognitionUploaded byAhmad Kurniawan Cah Bansel
- Video Objects Detection Using Spatial and Temporal SegmentationUploaded byIjsrnet Editorial
- Structure Detection Ges iUploaded byjimakosjp
- v5-39Uploaded byjecuzens
- A New Algorithm for Character Segmentation of License PlateUploaded byNguyễn Trung Hưng
- cut paperUploaded byjigs2k2
- Unsupervised 3D Segmentation Bio SignalsUploaded bysankaushik
- 06235871Uploaded bykmchisti
- URISA Journal Volume 20 No. 1 2008Uploaded byURISA- The Association for GIS Professionals
- siglUploaded byCS & IT
- 1701.00198Uploaded byalvin
- Wagstaff Constutil 06Uploaded byDamnik Jain
- K-MEANS AND D-STREAM ALGORITHM IN HEALTHCAREUploaded byInternational Jpurnal Of Technical Research And Applications
- Kurian-Lucrative Method for License Plate Recognition.pdfUploaded byFrancis Junior
- 00192473Uploaded byKranthirekha Chennaboina
- SPE-165374-Global Model for Failure Prediction for Rod Pump Artificial Lift SystemsUploaded byBrenda Rojas Cardozo
- Computational Journalism 2016 Week 3: Algorithmic FilteringUploaded byJonathan Stray
- Weed MappingUploaded byrphmi

- PhD MPhil BrochureUploaded bynaveednad2003556
- Naveed ResumeUploaded bynaveednad2003556
- Quite SleepUploaded bynaveednad2003556
- Basic Concept of GPSUploaded bynaveednad2003556
- the Advantages and Disadvantages of FIFO MehtodUploaded bynaveednad2003556
- ABAPUploaded byNethra Mahadev
- CWE Clerks IV AdvtUploaded byvinothrengaraj
- CAT 2014 AdvertisementUploaded byTushar Gupta
- How to Become a Great FinisherUploaded bynaveednad2003556
- Postal MtsUploaded bynaveednad2003556
- ASIC Power Groid AnalysisUploaded byNilesh Ingale
- Employment News Men Jun 2014 Final CopyUploaded bynaveednad2003556
- ECE Adhoc Advt. MAy 2014Uploaded bynaveednad2003556
- Invisible ManUploaded byAyush Kumar
- Agriculture Last Ranks 2013-14Uploaded byVinay Reddy
- Good java j2ee interview questionsUploaded byyrnchowdary
- Approved Annual Programme 2014Uploaded byrockeygreat
- Sbi Recruitment of Assistants Clerical CadreUploaded byAnonymous xdetBXSaot
- IBPS PO4 CLK 4 RRB 3 CalenderUploaded bySreejith Sundar Palavila
- App Faculty Recruitment14Uploaded bynaveednad2003556
- BER and SNRUploaded byshervinsh
- Cryptanalysis of Hummingbird-1Uploaded bynaveednad2003556
- The Hummingbird-2 Lightweight Authenticated Encryption AlgorithmUploaded bynaveednad2003556
- Enhanced FPGA Implementation of the Hummingbird Cryptographic AlgorithmUploaded bynaveednad2003556
- Efficient Implementation of Hummingbird Cryptographic Algorithm on a Reconfigurable PlatformUploaded bynaveednad2003556
- Efficient Implementation of Hummingbird Cryptographic Algorithm on a Reconfigurable PlatformUploaded bynaveednad2003556
- Dataflow Modeling and Design for Cognitive Radio NetworksUploaded bynaveednad2003556
- FCI Corrigendum_new1Uploaded bynaveednad2003556
- 2-Lecture Notes Lesson3 6Uploaded bykstu1112
- Instructions to the Candidates vro vraUploaded bynaveednad2003556

- Math Detective® A1Uploaded byNelaAlamos
- Alg 2 - Investigation 1.9.docUploaded byByron Adriano Pullutasig
- 4A Singapore Math 4a- TextbookUploaded bybrcrao
- building assessment into instructionUploaded byapi-258858426
- S Q L - NOTESUploaded bykumars_ddd
- Tco, Npv, Eva, Irr, Roi - Getting the Terms RightUploaded byVINOD DAMODARAN
- 2016 Gate Official (1)Uploaded byPrakash Chandra
- Assignment 2 Stats 2010Uploaded byPriyank Khemka
- Analytical Formulae for Radar Cross Section of Flat Plates in Near Field and Normal IncidenceUploaded bytongel
- Derman Lectures SummaryUploaded byPranay Pankaj
- AndrewMacro.odtUploaded byAlperen Akça
- Chapter 2 StrainUploaded byMaipenrai Memee
- Budget Constraint - Wikipedia, The Free EncyclopediaUploaded byIputu Dwiasta
- lecture1-flood routing.pdfUploaded byMuaz Mushtaq
- Urbanomic Document UFD017Uploaded byfrederick
- C++ variadic functions and templatesUploaded byOdailson Cavalcante de Oliveira
- CHAPTER_1and2_METROLOGY_ADAMA.ppt.pdfUploaded byramptech
- flassessUploaded byboporo
- 253544 Tttemplet ForPeriodica Paper PublicationsUploaded byShams Khattak
- Método de ArandelasUploaded byDaniela García Sissa
- Uncertainty Slope Intercept of Least Squares FitUploaded byPerfectKey21
- CYK Algorithm & CFL ReachabilityUploaded byamit_g
- tugas 1 lawasUploaded byAngga Pradana
- 9603A Course Outline 2014Uploaded byd590203003
- Statistical Methodology (TQM Report)Uploaded byCherilyn ZerochiiDomo
- Concerning the Investigation of the State of Aether in Magnetic Fields by Albert EinsteinUploaded byθεωρία Aπόφασις
- Steady State Rolling and Dynamic Response of a Tire at Low FrequencyUploaded byPatran
- civil engineering ExamUploaded bytOM
- 2D Frame - 3 Elements and 4 NodesUploaded byAnanto Yusuf W
- Atmospheric Modeling Data Assimilation and PredictabilityUploaded byJoao de Mattos

## Much more than documents.

Discover everything Scribd has to offer, including books and audiobooks from major publishers.

Cancel anytime.