Your SlideShare is downloading. ×
0
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Image segmentation using a genetic algorithm and hierarchical local search
Upcoming SlideShare
Loading in...5
×

Thanks for flagging this SlideShare!

Oops! An error has occurred.

×
Saving this for later? Get the SlideShare app to save on your phone or tablet. Read anywhere, anytime – even offline.
Text the download link to your phone
Standard text messaging rates apply

Image segmentation using a genetic algorithm and hierarchical local search

1,606

Published on

This paper proposes a hybrid genetic algorithm to perform image segmentation based on applying the q-state Potts spin glass model to a grayscale image. First, the image is converted to a set of …

This paper proposes a hybrid genetic algorithm to perform image segmentation based on applying the q-state Potts spin glass model to a grayscale image. First, the image is converted to a set of weights for a q-state spin glass and then a steady-state genetic algorithm is used to evolve candidate segmented images until a suitable candidate solution is found. To speed up the convergence to an adequate solution, hierarchical local search is used on each evaluated solution. The results show that the hybrid genetic algorithm with hierarchical local search is able to efficiently perform image segmentation. The necessity of hierarchical search for these types of problems is also clearly demonstrated.

Published in: Technology, Business
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total Views
1,606
On Slideshare
0
From Embeds
0
Number of Embeds
4
Actions
Shares
0
Downloads
62
Comments
0
Likes
0
Embeds 0
No embeds

Report content
Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
No notes for slide

Transcript

  • 1. Image Segmentation using a Genetic Algorithm and Hierarchical Local Search Mark W. Hauschild, Sanjiv Bhatia, and Martin Pelikan Missouri Estimation of Distribution Algorithms Laboratory (MEDAL) Department of Mathematics and Computer Science University of Missouri, St. Louis, MO martin@martinpelikan.net http://medal-lab.orgM. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 2. Motivation Image segmentation important in image processing. Often used as a preliminary step. Can emphasize boundaries between objects. Locate distinct objects in images. Image segmentation is challenging Difficult to succeed across diverse images. Even a relatively small image has a large number of points. Large number of locally optimal segmentations. Ideally want it done automatically. The purpose of this paper Use Potts spin glass model to define image segmentation as optimization problem. Use a steady-state genetic algorithm with hierarchical local search to solve the problem.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 3. Outline Image segmentation as Potts spin glass. Algorithm Steady-state genetic algorithm. Crossover operator. Hierarchical local search. Experiments. Conclusions and future work.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 4. q-state Potts Model Origin in physics. Spins arranged on a 2D or 3D lattice. Each spin sj can have up to q states. Edges have weights that define relationships between neighboring spins. Energy defined as E=− Ji,j δ(si , sj ) , i,j where δ(si , sj ) = 1 if si = sj , and δ(si , sj ) = 0 if si = sj . Usual task is to minimize the total energy of the system. To minimize energy, neighboring spins si and sj should be equal if Ji,j > 0; otherwise the spins should be different (ideally). Larger Ji,j values are more important than smaller.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 5. Mapping Image Segmentation to Potts model Each pixel corresponds to one spin. The value of the spin defines the pixel’s segment. Map grayscale image to a set of couplings {Ji,j } between neighboring pixels: ∆i,j Ji,j = 1 − , θ∆avg where ∆i,j is absolute difference between neighbors, ∆avg is average difference between all neighbors in the image, θ = 1 controls sensitivity to changes in intensity. Small differences between neighbors imply a large coupling (meaning that the neighbors should be in the same segment). Large differences between neighbors imply a small coupling (meaning that the neighbors should be in different segments).M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 6. Mapping Image Segmentation to Potts model Image segmentation using Potts model Number q of states in Potts model = number of segments. Each pixel’s state defines its segment. Minimizing energy corresponds to segmentation so that similar neighbors belong to the same segment (and dissimilar neighbors belong to different segments). Can apply any optimizer (e.g. simple genetic algorithm). But naive implementations won’t work too well High dimensionality. Large number of local optima.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 7. Genetic Algorithm Representation Segmentations represented by strings. One character for each pixel in the image (long strings). Each character can take q values (q=number of segments). Steady-state hybrid GA with small population. Initial population of strings represents random segmentations. Each iteration selects two random parents from population. Parents are combined using crossover to create new string. Local search used to improve the resulting string. Candidate replaces the worst parent if it’s better.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 8. Algorithm Two details left to discuss: Crossover operator. Local search and hierarchical local search.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 9. Crossover Operator Creates new segmentation c from segmentations a and b. Select randomly rectangular region. c takes content of rectangular region from a. c takes the rest from b. Selecting rectangular region Picks a random pixel for center of region to swap. Size of swap region for image of size x × y is x/2 × y/2. Other scenarios possible.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 10. Transforming Solutions for Crossover Similar segmentations have often different strings (renaming segments produces extremely different strings). Image a Image b Crossover without transforming parents leads to poor results because of excessive disruption and ineffective juxtaposition. Resolution: Transform parents by renumbering segments Calculate conditional probabilities that a segment i in parent a is represented by segment j in parent b for all i and j. Use greedy algorithm to renumber each segment in parent a to the most likely segment it represents in b.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 11. Difficulties with Simple Local Search Problems have large number of variables in each solution. Advantageous to use local search to speed optimization up. First attempted to use bit-flip hill climbing (HC) Would get stuck at poor local optimum, even for images where each segment consisted of a single color (easy to segment). Led to actual degradation of performance.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 12. Difficulties with Simple Local Search: Illustration Initial image Random segmentation Segmentation after bit-flip HCM. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 13. Hierarchical Local Search Developed hierarchical local search to tackle this challenge. Start with simple bit-flip hill climbing. Treat each connected segment as one variable (character). Each iteration Try to change each connected segment (connected region of pixels assigned 1 segment number) to another color. Accept the best change (if improvement). Terminate when no more improvement possible. Regions increase in size (regions merge over time). Implementation can be done efficiently. Important: Deals with the problem of simple HC, leading to a much more efficient search for good segmentations.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 14. Steps of Hierarchical Local Search Step = 1 Step = 50 Step = 100 Step = 143M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 15. Demonstration of Importance of Hierarchical LS g = 1, no LS g = 100, no LS g = 1000, no LS g = 1, DHC g = 100, DHC g = 1000, DHC g = 1, HLS g = 100, HLS g = 1000, HLSM. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 16. Experimental Setup Number of segments set to q = 4. Population size set to N = 50. Input images converted to 8-bit grayscale for 256 distinct gray levels before generating the weight matrix. Two different digital images were examined House image of size 150 × 100 pixels. Dog image of size 160 × 128 pixels. For each image: Find final resulting segmented image using hybrid GA. Examine image after coloring regions based on average color of that region in original image. Compare the results to meanshift segmentation.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 17. House Image using Hybrid GA Initial image Segmented image Average colorM. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 18. House Image using Mean-Shift Segmentation Intermediate Final, 17 colorsM. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 19. Dog Image using Hybrid GA Initial image Segmented image Average colorM. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 20. Dog Image using Mean-Shift Segmentation Intermediate Final, 26 colorsM. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 21. Conclusions Described a hybrid GA to perform image segmentation. Hierarchical local search proposed to improve efficiency. Transformation used to lower disruption due to crossover. Resulting hybrid GA was able to efficiently segment images. Results also show the necessity of hierarchical local search where simple bit-flip local search actually led to performance degradation.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search
  • 22. Acknowledgments Support was provided by NSF grants ECS-0547013 and IIS-1115352. ITS at the University of Missouri in St. Louis. University of Missouri Bioinformatics Consortium.M. Hauschild, S. Bhatia and M. Pelikan Image Segmentation using GA and Hierarchical Local Search

×