Linear openings in arbitrary orientation in O(1) per pixel

Linear opening figure

References

Vincent Morard, Petr Dokladal, Etienne Decencière,
Centre de Morphologie Mathématique
Mathématiques et Systèmes, MINES ParisTech;
35, rue Saint-Honoré, 77305 Fontainebleau CEDEX - France


bib html

Abstract

Openings constitute one of the fundamental operators in mathematical morphology. They can be applied to a wide range of applications, including noise reduction and feature extraction and enhancement. In this paper, we introduce a new, efficient and adaptable algorithm to compute one dimensional openings along discrete lines, in arbitrary orientation. The complexity of this algorithm is linear with respect to the number of pixels of the image. More interestingly, the average complexity per pixel is constant, with respect to the size of the opening.operators, based on REGSE, yield the best detection for our application.


Paper

paper Linear opening

Presentation

presentation linear opening in constant time

Conference information and copyrights

International Conference on Acoustics, Speech, and Signal Processing (ICASSP), May, 2011 Prague, Czech Republic. IEEE