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

Research output: Contribution to journalArticle

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.

Bibliographical metadata

Original languageEnglish
Pages (from-to)517-521
Number of pages5
JournalPattern Recognition Letters
Volume13
Issue number7
DOIs
Publication statusPublished - Jul 1992