Back to search

Hosted by Utah State University Libraries

Fixed Pattern Noise Non-Uniformity Correction Through K-Means Clustering

Abstract

dc:description.abstract

Imagery obtained with poorly calibrated sensors is often corrupted with fixed pattern noise. Fixed pattern noise presents itself through a non-uniform distribution and therefore is hard to target in noise removal. Traditional noise removal techniques assume that the noise is uniformly distributed and subsequently produces inadequate corrections. Noise correction methods that target fixed pattern noise rely on dynamically identifying present noise and adjust correction values appropriately using nearby information or general assumptions about the image’s composition. If noise identification is not accurate, the correction values will also suffer from low accuracy. Inaccurate correction values can affect the imagery’s quality, and in some cases, produce a corrected image worse off than an uncorrected image. The proposed algorithm utilizes local and global information to find more accurate correction values on a row-by-row basis. This paper will also introduce a standard dataset and evaluation metrics for comparison against other established non-uniformity correction methods.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
Hosted by Utah State University Libraries

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Imperial, Andres
Contributors dc:contributor
  • John Edwards
  • Nicholas S. Flann
  • Mario Harper

Subjects

dc:subject × 6

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Utah State University
Base URL
digitalcommons.usu.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Imperial, Andres. Fixed Pattern Noise Non-Uniformity Correction Through K-Means Clustering. Thesis thesis, Hosted by Utah State University Libraries, https://digitalcommons.usu.edu/etd/8112