AIMech AI

Non-local means

Algorithms AIMech:NonLocalMeans DRAFT
A classical image-denoising algorithm that estimates each pixel by a normalized average of observed pixel values, assigning exponential similarity weights from Gaussian-weighted distances between their surrounding observed patches. The candidate pixels may span the image or a chosen finite search window.
Identity Notes & Concept Scope At the actual merged cohort338 base 09cd8b8d5cc8b6d4098c149cbdea12e797468811, the 2026-10-15 current collection covers all 751 native and 442 AIO record identity fields and byte hashes, plus all 909 main and 393 nested frontier objects mechanically. Four ignored-inclusive, hidden-inclusive, case-insensitive whole-word searches retain 13654 occurrences in 1679 exact content groups. Root read all 29 non-domain candidate-bearing contents and all 19 selected current frontier objects; 1145 NLM-domain-only groups were mechanically separated, not manually read as complete bodies. The 22 NLM catalog/namespace groups refer to the National Library of Medicine, while seven candidate-bearing groups preserve existing source leads or research notes. Same-team context audit reads 35 maintained-record matching strings, 13 current definitions and matching windows in 55 long groups among the 505 context-only groups; its scope is attributed, not exhaustive manual reading. No candidate normalized identity collision was found. This is bounded current identity clearance, not ontology-wide semantic exhaustion. Original patch-distance weighted pixel denoising is distinct from the maintained learned residual NonLocalBlock and fixed-prior MAP IteratedWienerFilter. No NLM alias is added because the abbreviation has substantial unrelated catalog/domain use. Resolve existing owner238 using Buades et al. 2005; its Wang et al. 2018 URL remains discovery provenance. The related ExponentialFunction mapping identifies the weight-kernel relationship, not equivalence of the whole algorithm.

Claims & Grounded Evidence

5 Claims
Mechanism #nonlocal-pixel-estimate
Given an observed noisy image v, estimate each pixel i as a weighted sum of observed pixel values v(j). Candidate pixels can range over the whole image, so repeated structures away from i can contribute. The method obtains its weights from the observed image rather than requiring a separately trained encoder, value embedding or residual neural block.
Mechanism #patch-geometry-distance
Compare fixed-size square neighborhoods centered on i and j using their vectors of observed gray values. Their squared difference is weighted spatially by a Gaussian kernel with positive scale a. This patch comparison includes surrounding configuration rather than only the two central intensities; visually different neighborhoods can receive different weights even when their center values agree.
Mechanism #normalized-exponential-weights
For h>0, form the unnormalized similarity k(i,j)=exp(−d_a(i,j)^2/h^2), where d_a is the Gaussian-weighted patch distance, and set w(i,j)=k(i,j)/sum_j k(i,j) over the candidate set. The normalizer sums the same kernels used in the numerator. Increasing h reduces the decay with patch distance. This coherent normalization follows the correctly indexed continuous formula and the explicitly required unit-sum weights; the discrete denominator’s printed index discrepancy is retained in the limitations.
Mechanism #adaptive-convex-average
For a finite nonempty candidate set, finite observed values and h>0, the normalized nonnegative weights produce a convex average of candidate pixel values. The result lies between their minimum and maximum and preserves a constant image. These are direct consequences of normalization, not unbiasedness guarantees. The coefficients depend on the observed patches, so the complete image-to-image denoiser is generally nonlinear despite its weighted-sum output.
Scope #finite-search-and-direct-work
The source restricts the candidate search for practical computation: its displayed experiments use a 21x21 search window and 7x7 similarity patches. It states approximately 49x441xN^2 direct work for an N-by-N image. More generally, direct patch comparison scales with the number of output pixels, candidate pixels per query and patch samples; searching every image pixel is quadratic in image pixel count at fixed patch size. The particular windows and parameters are experimental choices, not the definition of every non-local means implementation.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:ExponentialFunction
Exponential Function
related_match The original patch-similarity kernel necessarily evaluates the scalar exponential exp(−d_a(i,j)^2/h^2), supporting a component-level relationship to the pinned Exponential Function. This does not equate the whole denoising algorithm with a scalar function or assert that it is an exponential activation layer.

Evidence Sources & Primary Literature

1 Source
Source ID Publication / Document Type / Access Reference & Checksum
buades2005
Antoni Buades, Bartomeu Coll, Jean-Michel Morel
primary paper
full_text
ID: doi:10.1109/CVPR.2005.38
sha256:6c5d67f2ad36…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-15T11:08:12Z
Updated: 2026-10-15T11:08:12Z
Source File: data/curated/NonLocalMeans.yaml