Rank filters with adaptive length

Takis Kasparis; Qurban A. Memon; Revathi Koteeswaran

doi:10.1117/12.179291

24 June 1994 Rank filters with adaptive length

Takis Kasparis, Qurban A. Memon, Revathi Koteeswaran

Proceedings Volume 2239, Visual Information Processing III; (1994) https://doi.org/10.1117/12.179291
Event: SPIE's International Symposium on Optical Engineering and Photonics in Aerospace Sensing, 1994, Orlando, FL, United States

Abstract

In this paper rank filters of adaptive length are 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.

Citation Download Citation

Takis Kasparis, Qurban A. Memon, and Revathi Koteeswaran "Rank filters with adaptive length", Proc. SPIE 2239, Visual Information Processing III, (24 June 1994); https://doi.org/10.1117/12.179291

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available