RGB Color Cluster and Graph Coloring Algorithm for Partial Color Blind Correction
| Autor: | Latifah R. Mengko Tati, Qori Utama Dody, Prahasta Gandasubrata Andika, Nur Azhar Tauhid, Mengko Richard |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
business.industry
Computer science ComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION 0211 other engineering and technologies Pattern recognition Color blind 02 engineering and technology 020303 mechanical engineering & transports 0203 mechanical engineering lcsh:TA1-2040 021105 building & construction Cluster (physics) RGB color model Artificial intelligence Graph coloring lcsh:Engineering (General). Civil engineering (General) business ComputingMethodologies_COMPUTERGRAPHICS |
| Zdroj: | MATEC Web of Conferences, Vol 255, p 01002 (2019) |
| ISSN: | 2261-236X |
| DOI: | 10.1051/matecconf/201925501002 |
| Popis: | Partial color blindness is an anomaly occurring to 5-8% of the world's population. Color correction using re-coloring algorithm usually can be used to help partial color blindness patient. One of the existing re-coloring techniques is to use the RGB color cluster technique and combine it by utilizing the brute force algorithm to perform color tracing for correcting the color. It has massive time and memory complexity. This research aims to create a correction technique for color blind people using RGB Color Cluster combined with Graph Coloring Algorithm. The first process is to get the RGB color cluster for color blind subject. After getting RGB color cluster from the subject then the image which want to be corrected is grouped based on RGB color cluster. The threshold of color grouping in image is done by utilizing the upper and lower bound values of the RGB color cluster. After the cluster is grouped, then we can represent neighbourhood between the colors by utilizing graph. The adjacent color group will be a neighbour. The next process is color re-coloring using graph coloring algorithm. In graph coloring algorithm, same color group is prohibited to become neighbour. In this research, graph coloring algorithm is used to prevent 2 colors that are look almost similar for become neighbours because it will cause the subject cannot distinguish it. Re-coloring is done by increasing and decreasing the color intensity of a set of colors. This technique succeeds in decreasing the complexity of the brute force algorithm from O(N4) to O(2N2) where the first N2 is the complexity of building the cluster group and the second N2 is the complexity of the re- coloring. In addition, the color of the object becomes more natural because Re-coloring is based on color group not pixel based. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|