A Multi-objective Invasive Weed Optimization Method for Segmentation of Distress Images
Bibliographic record
Abstract
Image segmentation is one of the fundamental stages in computer vision applications. Several meta-heuristics have been applied to solve the segmentation problems by extending the Otsu and entropy functions. However, no single-objective function can optimally handle the diversity of information in images besides the multimodality issues of gray-level images. This paper presents a self-adaptive multi-objective optimization-based method for the detection of crack images in reinforced concrete bridges. The proposed method combines the flexibility of information theory functions in addition to the invasive weed optimization algorithm for bi-level thresholding. The capabilities of the proposed method are demonstrated through comparisons with singleobjective optimization-based methods, conventional segmentation methods, multi-objective genetic algorithm-based method, multi-objective particle swarmbased method and multi-objective harmony search-based method. The proposed method outperformed the previously-mentioned segmentation methods, whereas the average values of mean-squared error, peak signal to noise ratio and structural similarity index are equal to 0.0784, 11.4831 and 0.9921, respectively.
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.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".