1 / 7

Relaxation Labeling Processes for the Four Colors Problem

Relaxation Labeling Processes for the Four Colors Problem. computational and biological vision. Final project Presented by Yinon Yamin & Asi Sayag. The Four Colors Problem. Color a map with four colors Neighbor Regions colored differently Example map:. Applying the Relaxation Labeling.

claudette-haiden
Download Presentation

Relaxation Labeling Processes for the Four Colors Problem

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. Relaxation Labeling Processes for the Four Colors Problem computational and biological vision Final project Presented by Yinon Yamin & Asi Sayag

  2. The Four Colors Problem • Color a map with four colors • Neighbor Regions colored differently • Example map:

  3. Applying the Relaxation Labeling Objects = regions Labels = four colors Compatibility function = Next iteration calculation :

  4. Preprocessing • Graph representation is needed • G={V,E} s.t. V={map regions} E={(i,j) | i  adj(j)} • Example of preprocessing:

  5. First implemention results The result is ambiguous

  6. The Tie Problem • Tie Breaking Mechanism • What is the Tie-Problem? • How does the TBM solves the problem?

  7. Results with TBM The result is unambiguous

More Related