A Neighborhood Impact Driven K-Medoid Clustering and Fuzzy Logic Blended Approach for High Density Impulse Noise Detection and Removal
Bibliographic record
Abstract
In the field of image processing, removing impulse noise has been regarded as one of the most important tasks, primarily because of the noise pattern it presents. Existing filters used the effect of only those non-noisy pixels which were present inside the specified windows ignoring the effect of the non-noisy pixels present in the surrounding windows. So, the least distant non-noisy pixels in the present window as well as in the surrounding windows may have an influence on the present window's noisy pixels. Hence, considering the above factors, in this paper, a two-step technique named KMDCIFF (K-medoid clustering identified fuzzy filter) is proposed for removing impulse noise from digital images. In the proposed KMDCIFF algorithm, the first step is noise detection using K-medoid clustering, followed by a fuzzy logic-acquainted noise reduction strategy that utilizes the least distant local and non-local non-noisy pixels for removal operation. The detection process involves the application of K-medoid clustering on all 5×5 windows produced by centering each pixel of the considered image. In order to remove noise, a 7×7 window is constructed with each detected noisy pixel in the center. Analyzing the impact of the least distant local and non-local pixel on each noisy pixel, the same is replaced by an estimated pixel’s intensity value obtained from the most influential non-noisy pixels. KMDCIFF is evaluated using well-known metrics for diverse types of images. At a high noise density of 80%, KMDCIFF exhibited significant peak-signal-to-noise-ratios (PSNRs) of 26.97 dB and 29.67 dB and structural similarity indexes (SSIMs) of 0.8045 and 0.9288 on random and fixed valued impulse noise impacted Lena image, respectively. Comparing the results of the contemporary study to those of previous studies of a similar kind in this sector, the results are unswervingly astounding.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".