HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

One-Dimensional Openings, Granulometries and Component Trees in O(1) Per Pixel

Abstract : We introduce a new, efficient and adaptable algorithm to compute openings, granulometries and the component tree for one-dimensional (1-D) signals. The algorithm requires only one scan of the signal, runs in place in per pixel, and supports any scalar data precision (integer or floating-point data). The algorithm is applied to two-dimensional images along straight lines, in arbitrary orientations. Oriented size distributions can thus be efficiently computed, and textures characterized. Extensive benchmarks are reported. They show that the proposed algorithm allows computing 1-D openings faster than existing algorithms for data precisions higher than 8 bits, and remains competitive with respect to the algorithm proposed by Van Droogenbroeck when dealing with 8-bit images. When computing granulometries, the new algorithm runs faster than any other method of the state of the art. Moreover, it allows efficient computation of 1-D component trees.
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download

Contributor : Petr Dokladal Connect in order to contact the contributor
Submitted on : Monday, November 4, 2013 - 2:26:08 PM
Last modification on : Wednesday, November 17, 2021 - 12:27:12 PM
Long-term archiving on: : Friday, April 7, 2017 - 8:32:52 PM


Files produced by the author(s)



Vincent Morard, Petr Dokládal, Etienne Decencière. One-Dimensional Openings, Granulometries and Component Trees in O(1) Per Pixel. IEEE Journal of Selected Topics in Signal Processing, IEEE, 2012, 6 (7), pp.840-848. ⟨10.1109/JSTSP.2012.2201694⟩. ⟨hal-00879627⟩



Record views


Files downloads