MétaCan
Menu
Back to cohort
Record W2048387430 · doi:10.1155/s1024123x04110016

New filtering technique for the impulsive noise reduction in color images

2004· article· en· W2048387430 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueMathematical Problems in Engineering · 2004
Typearticle
Languageen
FieldComputer Science
TopicImage and Signal Denoising Methods
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsMedian filterNoise reductionReduction (mathematics)Noise (video)Impulse noiseFilter (signal processing)Artificial intelligencePixelImage (mathematics)Computer visionSalt-and-pepper noiseAlgorithmComputer scienceMathematicsImage noiseValue noisePattern recognition (psychology)Image processing

Abstract

fetched live from OpenAlex

We present a novel approach to the problem of impulsive noise reduction for colorimages. The new image‐filtering technique is based on the maximization of the similarities between pixels in the filtering window. Themethod is able to remove the noise component, while adapting itself to the local image structure. In this way, the proposed algorithm eliminates impulsive noise while preserving edges and fine image details. Since the algorithm can be considered as a modification of the vector median filter driven by fuzzy membership functions, it is fast, computationally efficient, and easy to implement. Experimental results indicate that the new method is superior, in terms of performance, to algorithms commonly used for impulsive noise reduction.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.308
Threshold uncertainty score0.408

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.016
GPT teacher head0.261
Teacher spread0.246 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it