Adaptive noise smoothing algorithm based on nonstationary correlation assumption

Sung Cheol Park, Gi Kang

Research output: Contribution to journalConference article

Abstract

Various noise smoothing algorithms based on the nonstationary image model have been proposed. In most conventional nonstationary image models, however, the pixels are assumed to be uncorrelated to each other in order not to increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that the image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean square error filter. The justification for the proposed image model is presented and the effectiveness of the proposed algorithm is demonstrated experimentally.

Original languageEnglish
Pages (from-to)355-359
Number of pages5
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume1
Publication statusPublished - 2001 Dec 1

Fingerprint

Covariance matrix
Mean square error
Fast Fourier transforms
Pixels

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

@article{4561ea3ed8d94eef92baf9b7abfd6a0c,
title = "Adaptive noise smoothing algorithm based on nonstationary correlation assumption",
abstract = "Various noise smoothing algorithms based on the nonstationary image model have been proposed. In most conventional nonstationary image models, however, the pixels are assumed to be uncorrelated to each other in order not to increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that the image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean square error filter. The justification for the proposed image model is presented and the effectiveness of the proposed algorithm is demonstrated experimentally.",
author = "Park, {Sung Cheol} and Gi Kang",
year = "2001",
month = "12",
day = "1",
language = "English",
volume = "1",
pages = "355--359",
journal = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
issn = "1058-6393",
publisher = "IEEE Computer Society",

}

Adaptive noise smoothing algorithm based on nonstationary correlation assumption. / Park, Sung Cheol; Kang, Gi.

In: Conference Record of the Asilomar Conference on Signals, Systems and Computers, Vol. 1, 01.12.2001, p. 355-359.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Adaptive noise smoothing algorithm based on nonstationary correlation assumption

AU - Park, Sung Cheol

AU - Kang, Gi

PY - 2001/12/1

Y1 - 2001/12/1

N2 - Various noise smoothing algorithms based on the nonstationary image model have been proposed. In most conventional nonstationary image models, however, the pixels are assumed to be uncorrelated to each other in order not to increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that the image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean square error filter. The justification for the proposed image model is presented and the effectiveness of the proposed algorithm is demonstrated experimentally.

AB - Various noise smoothing algorithms based on the nonstationary image model have been proposed. In most conventional nonstationary image models, however, the pixels are assumed to be uncorrelated to each other in order not to increase the computational burden too much. As a result, some detailed information is lost in the filtered results. In this paper, we propose a computationally feasible adaptive noise smoothing algorithm which considers the nonstationary correlation characteristics of images. We assume that the image has a nonstationary mean and can be segmented into subimages which have individually different stationary correlations. Taking advantage of the special structure of the covariance matrix that results from the proposed image model, we derive a computationally efficient FFT-based adaptive linear minimum mean square error filter. The justification for the proposed image model is presented and the effectiveness of the proposed algorithm is demonstrated experimentally.

UR - http://www.scopus.com/inward/record.url?scp=0035574871&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035574871&partnerID=8YFLogxK

M3 - Conference article

VL - 1

SP - 355

EP - 359

JO - Conference Record of the Asilomar Conference on Signals, Systems and Computers

JF - Conference Record of the Asilomar Conference on Signals, Systems and Computers

SN - 1058-6393

ER -