A fast method for computing the output of rank order filters within arbitrarily shaped windows

Research output: Contribution to conferencePaper

3 Citations (Scopus)

Abstract

Rank order filters are used in a multitude of image processing tasks. Their application can range from simple preprocessing tasks which aim to reduce/remove noise, to more complex problems where such filters can be used to detect and segment image features. There is, therefore, a need to develop fast algorithms to compute the output of this class of filter. A number of methods for efficiently computing the output of specific rank order filters have been proposed [1]. For example, numerous fast algorithms exist that can be used for calculating the output of the median filter. Fast algorithms for calculating morphological erosions and dilations - which are also a special case of the more general rank order filter - have also been proposed. In this paper we present an extension of a recently introduced method for computing fast morphological operators to the more general case of rank order filters. Using our method, we are able to efficiently compute any rank, using any arbitrarily shaped window, such that it is possible to quickly compute the output of any rank order filter. We demonstrate the usefulness and efficiency of our technique by implementing a fast method for computing a recent generalisation of the morphological Hit-or-Miss Transform which makes it more robust in the presence of noise. We also compare the speed and efficiency of this routine with similar techniques that have been proposed in the literature.
LanguageEnglish
Pages1668-1672
Number of pages5
Publication statusPublished - 2011
Event 19th European Signal Processing Conference -EUSIPCO 2011 - Barcelona, Spain
Duration: 29 Aug 20112 Sep 2011

Conference

Conference 19th European Signal Processing Conference -EUSIPCO 2011
CountrySpain
CityBarcelona
Period29/08/112/09/11

Fingerprint

Median filters
Erosion
Image processing
Mathematical transformations

Keywords

  • rank order filters
  • image processing tasks
  • fast algorithms
  • morphological erosions
  • fast morphological operators

Cite this

Murray, P., & Marshall, S. (2011). A fast method for computing the output of rank order filters within arbitrarily shaped windows. 1668-1672. Paper presented at 19th European Signal Processing Conference -EUSIPCO 2011, Barcelona, Spain.
Murray, Paul ; Marshall, Stephen. / A fast method for computing the output of rank order filters within arbitrarily shaped windows. Paper presented at 19th European Signal Processing Conference -EUSIPCO 2011, Barcelona, Spain.5 p.
@conference{40b5d00aefbd4f98ad4d8212ded9e980,
title = "A fast method for computing the output of rank order filters within arbitrarily shaped windows",
abstract = "Rank order filters are used in a multitude of image processing tasks. Their application can range from simple preprocessing tasks which aim to reduce/remove noise, to more complex problems where such filters can be used to detect and segment image features. There is, therefore, a need to develop fast algorithms to compute the output of this class of filter. A number of methods for efficiently computing the output of specific rank order filters have been proposed [1]. For example, numerous fast algorithms exist that can be used for calculating the output of the median filter. Fast algorithms for calculating morphological erosions and dilations - which are also a special case of the more general rank order filter - have also been proposed. In this paper we present an extension of a recently introduced method for computing fast morphological operators to the more general case of rank order filters. Using our method, we are able to efficiently compute any rank, using any arbitrarily shaped window, such that it is possible to quickly compute the output of any rank order filter. We demonstrate the usefulness and efficiency of our technique by implementing a fast method for computing a recent generalisation of the morphological Hit-or-Miss Transform which makes it more robust in the presence of noise. We also compare the speed and efficiency of this routine with similar techniques that have been proposed in the literature.",
keywords = "rank order filters, image processing tasks, fast algorithms, morphological erosions, fast morphological operators",
author = "Paul Murray and Stephen Marshall",
year = "2011",
language = "English",
pages = "1668--1672",
note = "19th European Signal Processing Conference -EUSIPCO 2011 ; Conference date: 29-08-2011 Through 02-09-2011",

}

Murray, P & Marshall, S 2011, 'A fast method for computing the output of rank order filters within arbitrarily shaped windows' Paper presented at 19th European Signal Processing Conference -EUSIPCO 2011, Barcelona, Spain, 29/08/11 - 2/09/11, pp. 1668-1672.

A fast method for computing the output of rank order filters within arbitrarily shaped windows. / Murray, Paul; Marshall, Stephen.

2011. 1668-1672 Paper presented at 19th European Signal Processing Conference -EUSIPCO 2011, Barcelona, Spain.

Research output: Contribution to conferencePaper

TY - CONF

T1 - A fast method for computing the output of rank order filters within arbitrarily shaped windows

AU - Murray, Paul

AU - Marshall, Stephen

PY - 2011

Y1 - 2011

N2 - Rank order filters are used in a multitude of image processing tasks. Their application can range from simple preprocessing tasks which aim to reduce/remove noise, to more complex problems where such filters can be used to detect and segment image features. There is, therefore, a need to develop fast algorithms to compute the output of this class of filter. A number of methods for efficiently computing the output of specific rank order filters have been proposed [1]. For example, numerous fast algorithms exist that can be used for calculating the output of the median filter. Fast algorithms for calculating morphological erosions and dilations - which are also a special case of the more general rank order filter - have also been proposed. In this paper we present an extension of a recently introduced method for computing fast morphological operators to the more general case of rank order filters. Using our method, we are able to efficiently compute any rank, using any arbitrarily shaped window, such that it is possible to quickly compute the output of any rank order filter. We demonstrate the usefulness and efficiency of our technique by implementing a fast method for computing a recent generalisation of the morphological Hit-or-Miss Transform which makes it more robust in the presence of noise. We also compare the speed and efficiency of this routine with similar techniques that have been proposed in the literature.

AB - Rank order filters are used in a multitude of image processing tasks. Their application can range from simple preprocessing tasks which aim to reduce/remove noise, to more complex problems where such filters can be used to detect and segment image features. There is, therefore, a need to develop fast algorithms to compute the output of this class of filter. A number of methods for efficiently computing the output of specific rank order filters have been proposed [1]. For example, numerous fast algorithms exist that can be used for calculating the output of the median filter. Fast algorithms for calculating morphological erosions and dilations - which are also a special case of the more general rank order filter - have also been proposed. In this paper we present an extension of a recently introduced method for computing fast morphological operators to the more general case of rank order filters. Using our method, we are able to efficiently compute any rank, using any arbitrarily shaped window, such that it is possible to quickly compute the output of any rank order filter. We demonstrate the usefulness and efficiency of our technique by implementing a fast method for computing a recent generalisation of the morphological Hit-or-Miss Transform which makes it more robust in the presence of noise. We also compare the speed and efficiency of this routine with similar techniques that have been proposed in the literature.

KW - rank order filters

KW - image processing tasks

KW - fast algorithms

KW - morphological erosions

KW - fast morphological operators

M3 - Paper

SP - 1668

EP - 1672

ER -

Murray P, Marshall S. A fast method for computing the output of rank order filters within arbitrarily shaped windows. 2011. Paper presented at 19th European Signal Processing Conference -EUSIPCO 2011, Barcelona, Spain.