Essays about: "Coloring"

Showing result 1 - 5 of 43 essays containing the word Coloring.

1. 1. Techno-Economic Analysis of Dye Separation in Textile Recycling

   University essay from Lunds universitet/Avdelningen för Teknisk vattenresurslära

   Author : David Lundberg; [2024]
   Keywords : Dye; Membrane filtration; Electrocoagulation; Techno-economic analysis; Pre-feasibility study; Technology and Engineering;

   Abstract : This study determines the technical and economic feasibility of separating dye from a process filtrate in industrial textile recycling using electrocoagulation or sequences of membrane filtration with microfiltration, ultrafiltration, nanofiltration and reverse osmosis. The lower requirements for treating this stream, compared to previously researched dyehouse effluents, left treatments not good enough for dyehouses viable for this process filtrate. READ MORE

3. 2. Image Colorization Based on Deep Learning

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Tao Deng; [2023]
   Keywords : Image colorization; Deep Learning; Convolutional Neural Network; Generative Adversarial Network; Färgläggning av bilder; djupinlärning; Konvolutionella Neurala Nätverk; Generativa Adversariella Nätverk;

   Abstract : With the development of artificial intelligence, there is a clear trend to combine computer technology with traditional industries. In recent years, with the development of digital media technology, many methods for coloring gray-scale images have been proposed. READ MORE

4. 3. Comparing Quantum Annealing and Simulated Annealing when Solving the Graph Coloring Problem

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Nora Odelius; Isak Reinholdsson; [2023]
   Keywords : Quantum Computing; Quantum Annealing; Simulated Annealing; Graph Coloring Problem; Kvantberäkningar; Quantum Annealing; Simulated Annealing; Graffärgningsproblemet;

   Abstract : Quantum annealing (QA) is an optimization process in quantum computing similar to the probabilistic metaheuristic simulated annealing (SA). The QA process involves encoding an optimization problem into an energy landscape, which it then traverses in search for the point of minimal energy representing the global optimal state. READ MORE

5. 4. Reinforcement learning for improved local search : Applied to the graph coloring problem

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Adrian Salamon; Klara Sandström; [2023]
   Keywords : ;

   Abstract : The graph coloring problem (GCP) is an important combinatorial optimization problem (COP) with various applications and a simple formulation: to assign colors to vertices in a graph such that no adjacent vertices share a color. The GCP is NP-hard, and in order to solve it within a reasonable time frame, heuristic local search (LS) based algorithms are commonly used. READ MORE

6. 5. Discrete Flower Pollination Algorithm for the Graph Coloring Problem

   University essay from KTH/Datavetenskap

   Author : Samuel Falk; Erik Nordlöf; [2022]
   Keywords : ;

   Abstract : The graph coloring problem (GCP) is a famous NP-hard problem applicable to many real-world problems. The Flower Pollination Algorithm (FPA) is a relatively recently developed algorithm based on the pollination-behaviors of flowers. It has seen great results in single- and multi-objective optimization in continuous search spaces. READ MORE