Rank filters with adaptive length

Takis Kasparis; Qurban Memon; Revathi Koteeswaran

doi:10.1117/12.179291

Rank filters with adaptive length

Takis Kasparis, Qurban Memon, Revathi Koteeswaran

Research output: Contribution to journal › Conference article › peer-review

Abstract

In this paper rank filters of adaptive length will be presented. The filtering objective of these filters is the suppression of impulsive noise while preserving as much image detail as possible, and also high computational efficiency. In the proposed scheme the window size and shape are adaptively adjusted based on the amount of impulsive noise in an initial starting window. Using smaller windows increases the computational efficiency. To further improve the computational efficiency, median data blocks are used. The loss of image detail is prevented by an adaptive algorithm. Filtering examples demonstrating noise suppression, detail preservation, and computational efficiency are presented.

Original language	English
Pages (from-to)	256-266
Number of pages	11
Journal	Proceedings of SPIE - The International Society for Optical Engineering
Volume	2239
DOIs	https://doi.org/10.1117/12.179291
Publication status	Published - Jun 24 1994
Externally published	Yes
Event	Visual Information Processing III 1994 - Orlando, United States Duration: Apr 4 1994 → Apr 8 1994

ASJC Scopus subject areas

Electronic, Optical and Magnetic Materials
Condensed Matter Physics
Computer Science Applications
Applied Mathematics
Electrical and Electronic Engineering

Access to Document

10.1117/12.179291

Cite this

@article{0529d0ceed1941bfb8e8c22e8e627a18,

title = "Rank filters with adaptive length",

abstract = "In this paper rank filters of adaptive length will be presented. The filtering objective of these filters is the suppression of impulsive noise while preserving as much image detail as possible, and also high computational efficiency. In the proposed scheme the window size and shape are adaptively adjusted based on the amount of impulsive noise in an initial starting window. Using smaller windows increases the computational efficiency. To further improve the computational efficiency, median data blocks are used. The loss of image detail is prevented by an adaptive algorithm. Filtering examples demonstrating noise suppression, detail preservation, and computational efficiency are presented.",

author = "Takis Kasparis and Qurban Memon and Revathi Koteeswaran",

note = "Publisher Copyright: {\textcopyright} 1994 SPIE.; Visual Information Processing III 1994 ; Conference date: 04-04-1994 Through 08-04-1994",

year = "1994",

month = jun,

day = "24",

doi = "10.1117/12.179291",

language = "English",

volume = "2239",

pages = "256--266",

journal = "Proceedings of SPIE - The International Society for Optical Engineering",

issn = "0277-786X",

publisher = "SPIE",

}

TY - JOUR

T1 - Rank filters with adaptive length

AU - Kasparis, Takis

AU - Memon, Qurban

AU - Koteeswaran, Revathi

PY - 1994/6/24

Y1 - 1994/6/24

N2 - In this paper rank filters of adaptive length will be presented. The filtering objective of these filters is the suppression of impulsive noise while preserving as much image detail as possible, and also high computational efficiency. In the proposed scheme the window size and shape are adaptively adjusted based on the amount of impulsive noise in an initial starting window. Using smaller windows increases the computational efficiency. To further improve the computational efficiency, median data blocks are used. The loss of image detail is prevented by an adaptive algorithm. Filtering examples demonstrating noise suppression, detail preservation, and computational efficiency are presented.

AB - In this paper rank filters of adaptive length will be presented. The filtering objective of these filters is the suppression of impulsive noise while preserving as much image detail as possible, and also high computational efficiency. In the proposed scheme the window size and shape are adaptively adjusted based on the amount of impulsive noise in an initial starting window. Using smaller windows increases the computational efficiency. To further improve the computational efficiency, median data blocks are used. The loss of image detail is prevented by an adaptive algorithm. Filtering examples demonstrating noise suppression, detail preservation, and computational efficiency are presented.

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

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

U2 - 10.1117/12.179291

DO - 10.1117/12.179291

M3 - Conference article

AN - SCOPUS:85076903679

SN - 0277-786X

VL - 2239

SP - 256

EP - 266

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

T2 - Visual Information Processing III 1994

Y2 - 4 April 1994 through 8 April 1994

ER -

Rank filters with adaptive length

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this