Digital halftoning
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Digital Image Processing
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Compaction of Symbolic Layout Using Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Cooperative Model for Genetic Operators to Improve GAs
ICIIS '99 Proceedings of the 1999 International Conference on Information Intelligence and Systems
Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
Evolutionary Computation
Muiltiobjective optimization using nondominated sorting in genetic algorithms
Evolutionary Computation
An overview of evolutionary algorithms in multiobjective optimization
Evolutionary Computation
| Hi-index | 0.00 |
A halftoning technique that uses a simple GA has proven to be very effective to generate high quality halftone images. Recently, the two major drawbacks of this conventional halftoning technique with GAs, i.e. it uses a substantial amount of computer memory and processing time, have been overcome by using an improved GA (GA-SRM) that applies genetic operators in parallel putting them in a cooperative-competitive stand with each other. The halftoning problem is a true multiobjective optimization problem. However, so far, the GA based halftoning techniques have treated the problem as a single objective optimization problem. In this work, the improved GA-SRM is extended to a multiobjective optimization GA to generate simultaneously halftone images with various combinations of gray level and spatial resolution. Simulation results verify that the proposed scheme can effectively generate several high quality images simultaneously in a single run reducing even further the overall processing time.