Lesson plan

Average with limited data validity

In image analysis, the average with limited data validity is an image filter for feature-preserving noise removal, consisting in a smoothing filter that only involves pixels satisfying some validity criterion. If some feature of noise elements is known, it is possible to use it to define a criterion to detect invalid pixels, and selectively smooth only invalid pixels using data coming only from valid pixels, thus avoiding to affect other features of the image. Possible criteria are: * based on image intensity, by defining an interval [I_{min}, I_{max}] of invalid data, with the filter only modifying pixels in that interval and only averaging data from other pixels from its neighbourhood that are valid, i.e. their intensity does not fall in the same interval. For instance, given a pixel (x,y) of invalid data, its convolution kernel h becomes :: h_{ij} = \begin{cases} 1 \quad I_{x+i,y+j} \notin [I_{min}, I_{max}] \\ 0 \quad \text{otherwise} \end{cases} : This approach allows to effectively remove extraneous elements that have different intensity from the rest of the image, with blurring limited to valid parts of the image which share intensity values with the extraneous elements, or portions of edges that were previously covered by such extraneous artefacts.…

Back to article

Article summary

In image analysis, the average with limited data validity is an image filter for feature-preserving noise removal, consisting in a smoothing filter that only involves pixels satisfying some validity criterion. If some feature of noise elements is known, it is possible to use it to define a criterion to detect invalid pixels, and selectively smooth only invalid pixels using data coming only from valid pixels, thus avoiding to affect other features of the image. Possible criteria are: * based on image intensity, by defining an interval [I_{min}, I_{max}] of invalid data, with the filter only modifying pixels in that interval and only averaging data from other pixels from its neighbourhood that are valid, i.e. their intensity does not fall in the same interval. For instance, given a pixel (x,y) of invalid data, its convolution kernel h becomes :: h_{ij} = \begin{cases} 1 \quad I_{x+i,y+j} \notin [I_{min}, I_{max}] \\ 0 \quad \text{otherwise} \end{cases} : This approach allows to effectively remove extraneous elements that have different intensity from the rest of the image, with blurring limited to valid parts of the image which share intensity values with the extraneous elements, or portions of edges that were previously covered by such extraneous artefacts.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.