Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho.

Slides:



Advertisements
Similar presentations
Segmentation by Morphological Watersheds
Advertisements

MASTERS THESIS By: Rahul Suresh
Medical Image Registration Kumar Rajamani. Registration Spatial transform that maps points from one image to corresponding points in another image.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Clustering & image segmentation Goal::Identify groups of pixels that go together Segmentation.
電腦視覺 Computer and Robot Vision I Chapter2: Binary Machine Vision: Thresholding and Segmentation Instructor: Shih-Shinh Huang 1.
Image Indexing and Retrieval using Moment Invariants Imran Ahmad School of Computer Science University of Windsor – Canada.
Segmentation and Region Detection Defining regions in an image.
Content Based Image Clustering and Image Retrieval Using Multiple Instance Learning Using Multiple Instance Learning Xin Chen Advisor: Chengcui Zhang Department.
EE 7730 Image Segmentation.
Thresholding Otsu’s Thresholding Method Threshold Detection Methods Optimal Thresholding Multi-Spectral Thresholding 6.2. Edge-based.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Segmentation Divide the image into segments. Each segment:
Effective gradient-free methods for inverse problems Jyri Leskinen FiDiPro DESIGN project.
PGA – Parallel Genetic Algorithm Hsuan Lee. Reference  E Cantú-Paz, A Survey on Parallel Genetic Algorithm, Calculateurs Paralleles, Reseaux et Systems.
Image Segmentation Using Region Growing and Shrinking
CS292 Computational Vision and Language Segmentation and Region Detection.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Brain segmentation and Phase unwrapping in MRI data ECE 738 Project JongHoon Lee.
כמה מהתעשייה? מבנה הקורס השתנה Computer vision.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
Genetic Algorithm.
06 - Boundary Models Overview Edge Tracking Active Contours Conclusion.
Graph-based Segmentation. Main Ideas Convert image into a graph Vertices for the pixels Vertices for the pixels Edges between the pixels Edges between.
Slides are based on Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Soft Computing Lecture 18 Foundations of genetic algorithms (GA). Using of GA.
Hierarchical Distributed Genetic Algorithm for Image Segmentation Hanchuan Peng, Fuhui Long*, Zheru Chi, and Wanshi Siu {fhlong, phc,
Digital Image Processing CSC331
Chapter 8 The k-Means Algorithm and Genetic Algorithm.
GENETIC ALGORITHMS FOR THE UNSUPERVISED CLASSIFICATION OF SATELLITE IMAGES Ankush Khandelwal( ) Vaibhav Kedia( )
Fuzzy Genetic Algorithm
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
Genetic Algorithms Siddhartha K. Shakya School of Computing. The Robert Gordon University Aberdeen, UK
Chapter 10 Image Segmentation.
EECS 274 Computer Vision Segmentation by Clustering II.
Derivative Free Optimization G.Anuradha. Contents Genetic Algorithm Simulated Annealing Random search method Downhill simplex method.
ELeaRNT: Evolutionary Learning of Rich Neural Network Topologies Authors: Slobodan Miletic 3078/2010 Nikola Jovanovic 3077/2010
Genetic Algorithms Przemyslaw Pawluk CSE 6111 Advanced Algorithm Design and Analysis
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
Image Segmentation in Color Space By Anisa Chaudhary.
Probabilistic Algorithms Evolutionary Algorithms Simulated Annealing.
Image Segmentation by Histogram Thresholding Venugopal Rajagopal CIS 581 Instructor: Longin Jan Latecki.
Learning to Detect Faces A Large-Scale Application of Machine Learning (This material is not in the text: for further information see the paper by P.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
Region Detection Defining regions of an image Introduction All pixels belong to a region Object Part of object Background Find region Constituent pixels.
Detecting False Captioning Using Common Sense Reasoning James Byrd.
Image Segmentation Nitin Rane. Image Segmentation Introduction Thresholding Region Splitting Region Labeling Statistical Region Description Application.
EVOLUTIONARY SYSTEMS AND GENETIC ALGORITHMS NAME: AKSHITKUMAR PATEL STUDENT ID: GRAD POSITION PAPER.
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Graph-based Segmentation
Course : T Computer Vision
Machine Vision ENT 273 Lecture 4 Hema C.R.
Genetic Algorithms.
Object-based Classification
COMP 9517 Computer Vision Segmentation 7/2/2018 COMP 9517 S2, 2017.
Computer Vision Lecture 13: Image Segmentation III
DIGITAL SIGNAL PROCESSING
VOLUMETRIC SEGMENTATION USING GENETIC ALGORITHM
UZAKTAN ALGIILAMA UYGULAMALARI Segmentasyon Algoritmaları
Mean Shift Segmentation
Computer Vision Lecture 12: Image Segmentation II
Chapter 4 Beyond Classical Search
R-CNN region By Ilia Iofedov 11/11/2018 BGU, DNN course 2016.
Evolving Logical-Linear Edge Detector with Evolutionary Algorithms
IT472 Digital Image Processing
Image Segmentation Using Region Growing and Shrinking
Coevolutionary Automated Software Correction
Presentation transcript:

Grid-Based Genetic Algorithm Approach to Colour Image Segmentation Marco Gallotta Keri Woods Supervised by Audrey Mbogho

Image Segmentation Identifying and extracting distinct, homogeneous regions from an image Simplifies the image for further processing:  shape recognition, medical imaging, face detection

Image Segmentation Problem: How do we segment the following?  Each petal as a region?  Stigma as a region?  Group flowers as single region?  Segment the background?

Human Segmentation Segmentation by human candidates Results confirm no single solution

Genetic Algorithms Optimisation technique that works on large search spaces Biological evolution

Genetic Algorithms: Chromosome Chromosome encodes a potential solution Contains parameters The chromosome is optimised using:  mutation crossover

Genetic Algorithms: Fitness Fitness function evaluates an individual and assigns a numerical value Used to select fittest individuals for next iteration Crucial in producing good results

Grid Computing A system that coordinates resources that are not subject to centralized control Dedicated and non-dedicated resources Multiple organisations pooling their unused resources Lots of computing power

Grid Computing

Problem: Segmentation Segmentation of great importance No general method of image segmentation Wide variety of images Parameters need to be tuned to get optimal results

Problem: Genetic Algorithms Segmentation involves much uncertainty GA cope well with uncertainty Alter parameters to optimise segmentation results

Problem: Computating Requirements Image segmentation and genetic algorithms computationally intensive Combined VERY computationally expensive Solution?  Work harder  Work smarter  Get help

Problem: GA For The Grid Genetic algorithms easily parallelisable Grid supplies “free” computational resources

Problem: Research Existing Techniques Edge detection Histogram thresholding Watershed Region based techniques Clustering techniques Model based techniques Many others

Segmentation Method Implemented Chose to implement:  Watershed  Region Growing  Region Merging

Watershed Transformation Calculate a gradient magnitude image Consider this as a topographic surface Consider dropping water at each pixel and observing where the trickle ends Pixels with the same end point form a region

Watershed Transformation (a) Example gradient magnitude image (b) The two regions that are identified

Watershed Transformation: Example

Region Growing Start off with small regions and grow them Each iteration considers all pixels neighbouring the regions Pixel with the minimum δ is added to the region This continues until all pixels are assigned to a region

Region Growing The above method requires manual seeds To automate we introduce a threshold T If the minimum δ exceeds T then a new region is created Start with an arbitrary pixel as the first region and iterate as above

Region Growing: Example

Region Merging Initially each pixel a region Adjacent regions merged if criteria met Continue until no regions meet criteria

Merging Criterion Merge if fusion factor less than scale parameter Fusion factor: change in heterogeneity if regions merged Heterogeneity: colour, compactness, smoothness Scale parameter controls size of resulting regions

Region Merging: Example

Segmentation Results Berkeley Segmentation Dataset Watershed fastest Performance results: SegmentationTime (seconds) Region Growing Watershed Transformation Region Merging

Segmentation Results

All successful but different results Effect of scale parameter on region merging  Large scale parameter => large regions

Segmentation Results: Effect of Scale Parameter

Segmentation Results [Can get some results off website at

Genetic Algorithm Modify parameters of region merging algorithm Scale parameter, weights of components of heterogeneity

GA: Fitness Function Drives evolution of chromosomes Evaluate quality of segmentation Unsupervised segmentation  No external information  Properties of image itself How much colour within each region varies Low fitness = good segmentation

GA: Fitness Function For each region standard deviation multiplied by area Sum all regions Add 1 Multiply by number of regions

Genetic Algorithm Results Inconclusive Sometimes improvement

Genetic Algorithm Results GA with segmentation very computationally intensive Unable to explore full potential Extremely slow Therefore grid

Parallel Genetic Algorithms Two common models:  master-slave (left)‏  Island model (right)‏

Grid Computing + Genetic Algorithms With the Grid, communication between nodes is expensive (“impossible” in a true Grid)‏ Even with communication, building a topology for the Island model is difficult All existing research has used the master-slave model

Grid Model Our model uses ideas from both master-slave and Island models Root node (dedicated resource) stores a super population No direct communication between sub-nodes

Grid Model: Results We were heavily restricted in testing and could only test with eight nodes Tests showed the communication overhead had negligible impact as fitness function increased in complexity Results were positive when testing on simple problems Unsuccessful at migrating the segmentation algorithm to the Grid

Conclusion Experimented with 3 segmentation algorithms Selected region merging for our genetic algorithm solution Genetic algorithm provides potential for improvement but results inconclusive Grid computing showed positive results however limited resources did not allow for thorough testing

Future Work: Grid As we only tested on a small Grid, we never had scalability issues Most Grids are very large and having a single root node is a bottleneck The next stage is to test out a hierarchical model

Future Work: GA Watershed with genetic algorithm Investigate different fitness functions Genetic programming to evolve fitness function  Train for each desired application

Questions ?