A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels

Marcel van Herk

doi:10.1016/0167-8655(92)90069-C

A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels

Marcel van Herk^*

^*Corresponding author for this work

Division of Cancer Sciences (L5)

Netherlands Cancer Institute

Research output: Contribution to journal › Article › peer-review

Abstract

A new algorithm is presented for local maximum and minimum filters requiring only 6 comparisons per pixel independent of kernel size. The algorithm is based on separability and a combination of block recursive series which are evaluated forwards and backwards.

Original language	English
Pages (from-to)	517-521
Number of pages	5
Journal	Pattern Recognition Letters
Volume	13
Issue number	7
DOIs	https://doi.org/10.1016/0167-8655(92)90069-C
Publication status	Published - Jul 1992

Keywords

local maximum and minimum
Mathematical morphology
recursive filters
separability

Access to Document

10.1016/0167-8655(92)90069-C

Cite this

@article{434b6e226aa042079906446906d85174,

title = "A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels",

abstract = "A new algorithm is presented for local maximum and minimum filters requiring only 6 comparisons per pixel independent of kernel size. The algorithm is based on separability and a combination of block recursive series which are evaluated forwards and backwards.",

keywords = "local maximum and minimum, Mathematical morphology, recursive filters, separability",

author = "{van Herk}, Marcel",

year = "1992",

month = jul,

doi = "10.1016/0167-8655(92)90069-C",

language = "English",

volume = "13",

pages = "517--521",

journal = "Pattern Recognition Letters",

issn = "0167-8655",

publisher = "Elsevier BV",

number = "7",

}

TY - JOUR

T1 - A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels

AU - van Herk, Marcel

PY - 1992/7

Y1 - 1992/7

N2 - A new algorithm is presented for local maximum and minimum filters requiring only 6 comparisons per pixel independent of kernel size. The algorithm is based on separability and a combination of block recursive series which are evaluated forwards and backwards.

AB - A new algorithm is presented for local maximum and minimum filters requiring only 6 comparisons per pixel independent of kernel size. The algorithm is based on separability and a combination of block recursive series which are evaluated forwards and backwards.

KW - local maximum and minimum

KW - Mathematical morphology

KW - recursive filters

KW - separability

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

U2 - 10.1016/0167-8655(92)90069-C

DO - 10.1016/0167-8655(92)90069-C

M3 - Article

AN - SCOPUS:0001189475

SN - 0167-8655

VL - 13

SP - 517

EP - 521

JO - Pattern Recognition Letters

JF - Pattern Recognition Letters

IS - 7

ER -

A fast algorithm for local minimum and maximum filters on rectangular and octagonal kernels

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this