Skip to Main content Skip to Navigation
Journal articles

GPU Implementation of Linear Morphological Openings with Arbitrary Angle

Abstract : Linear morphological openings and closings are important non-linear operators from mathematical morphology. In practical applications, many different orientations of digital line segments must typically be considered. In this paper, we (1) review efficient sequential as well as parallel algorithms for the computation of linear openings and closings, (2) compare the performance of CPU implementations of four state-of-the-art algorithms, (3) describe GPU implementations of two recent efficient algorithms allowing arbitrary orientation of the line segments, (4) propose, as the main contribution, an efficient and optimized GPU implementation of linear openings, and (5) compare the performance of all implementations on real images from various applications. From our experimental results, it turned out that the proposed GPU implementation is suitable for applications with large, industrial images, running under severe timing constraints.
Document type :
Journal articles
Complete list of metadata

Cited literature [40 references]  Display  Hide  Download
Contributor : Eva Dokladalova Connect in order to contact the contributor
Submitted on : Friday, May 31, 2013 - 4:01:40 PM
Last modification on : Saturday, January 15, 2022 - 3:57:37 AM
Long-term archiving on: : Tuesday, September 3, 2013 - 9:35:51 AM


Files produced by the author(s)



Pavel Karas, Vincent Morard, Jan Bartovsky, Thierry Grandpierre, Eva Dokladalova, et al.. GPU Implementation of Linear Morphological Openings with Arbitrary Angle. Journal of Real-Time Image Processing, Springer Verlag, 2015, 10 (1), pp.27-41. ⟨10.1007/s11554-012-0248-7⟩. ⟨hal-00680904⟩



Record views


Files downloads