Skip to Main content Skip to Navigation
Conference papers

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

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.
Document type :
Conference papers
Complete list of metadata

https://hal-mines-paristech.archives-ouvertes.fr/hal-00658922
Contributor : Bibliothèque Mines Paristech <>
Submitted on : Wednesday, January 11, 2012 - 3:49:06 PM
Last modification on : Thursday, September 24, 2020 - 4:38:04 PM

Identifiers

Citation

Vincent Morard, Petr Dokládal, Etienne Decencière. Linear openings in arbitrary orientation in O(1) per pixel. 36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011, May 2011, Prague, Czech Republic. pp.Article number 5946767, Pages 1457-1460, ⟨10.1109/ICASSP.2011.5946767⟩. ⟨hal-00658922⟩

Share

Metrics

Record views

455