Fast Algorithm for Morphological Filters

Research output: Contribution to journalConference article

9 Citations (Scopus)

Abstract

In surface metrology, morphological filters, which evolved from the envelope filtering system (E-system) work well for functional prediction of surface finish in the analysis of surfaces in contact. The naive algorithms are time consuming, especially for areal data, and not generally adopted in real practice. A fast algorithm is proposed based on the alpha shape. The hull obtained by rolling the alpha ball is equivalent to the morphological opening/closing in theory. The algorithm depends on Delaunay triangulation with time complexity O(nlogn). In comparison to the naive algorithms it generates the opening and closing envelope without combining dilation and erosion. Edge distortion is corrected by reflective padding for open profiles/surfaces. Spikes in the sample data are detected and points interpolated to prevent singularities. The proposed algorithm works well both for morphological profile and area filters. Examples are presented to demonstrate the validity and superiority on efficiency of this algorithm over the naive algorithm.

LanguageEnglish
Article number012001
JournalJournal of Physics: Conference Series
Volume311
Issue number1
DOIs
Publication statusPublished - 2011

Fingerprint

filters
closing
envelopes
triangulation
profiles
spikes
metrology
erosion
balls
predictions

Cite this

@article{7c439cf96d3f4c2e8e36be9fbb447a0d,
title = "Fast Algorithm for Morphological Filters",
abstract = "In surface metrology, morphological filters, which evolved from the envelope filtering system (E-system) work well for functional prediction of surface finish in the analysis of surfaces in contact. The naive algorithms are time consuming, especially for areal data, and not generally adopted in real practice. A fast algorithm is proposed based on the alpha shape. The hull obtained by rolling the alpha ball is equivalent to the morphological opening/closing in theory. The algorithm depends on Delaunay triangulation with time complexity O(nlogn). In comparison to the naive algorithms it generates the opening and closing envelope without combining dilation and erosion. Edge distortion is corrected by reflective padding for open profiles/surfaces. Spikes in the sample data are detected and points interpolated to prevent singularities. The proposed algorithm works well both for morphological profile and area filters. Examples are presented to demonstrate the validity and superiority on efficiency of this algorithm over the naive algorithm.",
author = "Shan Lou and Xiangqian Jiang and Scott, {Paul J.}",
year = "2011",
doi = "10.1088/1742-6596/311/1/012001",
language = "English",
volume = "311",
journal = "Journal of Physics: Conference Series",
issn = "1742-6588",
publisher = "IOP Publishing Ltd.",
number = "1",

}

Fast Algorithm for Morphological Filters. / Lou, Shan; Jiang, Xiangqian; Scott, Paul J.

In: Journal of Physics: Conference Series, Vol. 311, No. 1, 012001, 2011.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Fast Algorithm for Morphological Filters

AU - Lou, Shan

AU - Jiang, Xiangqian

AU - Scott, Paul J.

PY - 2011

Y1 - 2011

N2 - In surface metrology, morphological filters, which evolved from the envelope filtering system (E-system) work well for functional prediction of surface finish in the analysis of surfaces in contact. The naive algorithms are time consuming, especially for areal data, and not generally adopted in real practice. A fast algorithm is proposed based on the alpha shape. The hull obtained by rolling the alpha ball is equivalent to the morphological opening/closing in theory. The algorithm depends on Delaunay triangulation with time complexity O(nlogn). In comparison to the naive algorithms it generates the opening and closing envelope without combining dilation and erosion. Edge distortion is corrected by reflective padding for open profiles/surfaces. Spikes in the sample data are detected and points interpolated to prevent singularities. The proposed algorithm works well both for morphological profile and area filters. Examples are presented to demonstrate the validity and superiority on efficiency of this algorithm over the naive algorithm.

AB - In surface metrology, morphological filters, which evolved from the envelope filtering system (E-system) work well for functional prediction of surface finish in the analysis of surfaces in contact. The naive algorithms are time consuming, especially for areal data, and not generally adopted in real practice. A fast algorithm is proposed based on the alpha shape. The hull obtained by rolling the alpha ball is equivalent to the morphological opening/closing in theory. The algorithm depends on Delaunay triangulation with time complexity O(nlogn). In comparison to the naive algorithms it generates the opening and closing envelope without combining dilation and erosion. Edge distortion is corrected by reflective padding for open profiles/surfaces. Spikes in the sample data are detected and points interpolated to prevent singularities. The proposed algorithm works well both for morphological profile and area filters. Examples are presented to demonstrate the validity and superiority on efficiency of this algorithm over the naive algorithm.

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

U2 - 10.1088/1742-6596/311/1/012001

DO - 10.1088/1742-6596/311/1/012001

M3 - Conference article

VL - 311

JO - Journal of Physics: Conference Series

T2 - Journal of Physics: Conference Series

JF - Journal of Physics: Conference Series

SN - 1742-6588

IS - 1

M1 - 012001

ER -