Contrast Enhancement of Images Using Meta-Heuristic Algorithm
Bibliographic record
Abstract
One of the most important processes in image processing is image enhancement, which aims to enhance image contrast and quality of information. Due to the lack of adequate conventional image enhancement and the challenge of mean shift, intelligence-based image enhancement systems are becoming an essential requirement in image processing. This paper proposes a new approach for enhancing low contrast images utilizing a modified measure and integrating a new Chaotic Crow Search (CCS) and Krill Herd (KH) Optimization-based metaheuristic algorithm. Crow Search Algorithm is a cutting-edge meta-heuristic optimization technique. Chaotic maps are incorporated into the Crow Search Method in this work to improve its global optimization. The new Chaotic Crow Search Algorithm depends on chaotic sequences to replace a random location in the search space and the crow's recognition factor. Based on a new fitness function, Krill Herd optimization is utilized to optimize the tunable parameter. The fitness function requires different primary objective functions that use the image's edge, entropy, grey level co-occurrence matrix (GLCM) contrast, and GLCM energy for increased visual, contrast, and other descriptive information. The results proved that the suggested approach outperforms all-new methods in terms of contrast, edge details, and structural similarity, both subjectively and statistically.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".