Abstract
Path openings are morphological operators that are used to preserve long, thin, and curved structures in images. They have the ability to adapt to local image structures, which allows them to detect lines that are not perfectly straight. They are applicable in extracting cracks, roads, and more. Although path openings are very efficient to implement for binary images, the greyscale case is more problematic. This study provides an analysis of the main existing greyscale algorithm, and shows that although its time complexity can be quadratic in the number of pixels, this is optimal in terms of the output (if the full opening transform is created). Also, it is shown that under many circumstances the worst-case running time is much less than quadratic. Finally, a new algorithm is provided, which has the same time complexity, but is simpler, faster in practice and more amenable to parallelization.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Appleton, B., Talbot, H.: Efficient Path Openings and Closings. In: Ronse, C., Najman, L., Decencière, E. (eds.) Mathematical Morphology: 40 Years On, Computational Imaging and Vision, vol. 30, pp. 33–42. Springer Netherlands (2005)
Bismuth, V., Vaillant, R., Talbot, H., Najman, L.: Curvilinear Structure Enhancement with the Polygonal Path Image - Application to Guide-Wire Segmentation in X-Ray Fluoroscopy. In: Ayache, N., Delingette, H., Golland, P., Mori, K. (eds.) MICCAI 2012, Part II. LNCS, vol. 7511, pp. 9–16. Springer, Heidelberg (2012)
Cokelaer, F., Talbot, H., Chanussot, J.: Efficient Robust d-Dimensional Path Operators. IEEE J. Sel. Top. Signal. Process. 6(7), 830–839 (2012)
Heijmans, H., Buckley, M., Talbot, H.: Path Openings and Closings. J. Math. Imaging Vis. 22(2), 107–119 (2005)
Kahn, A.B.: Topological Sorting of Large Networks. Commun. ACM 5(11), 558–562 (1962)
Luengo Hendriks, C.L.: Constrained and dimensionality-independent path openings. IEEE Trans. Image Process. 19(6), 1587–1595 (2010)
Morard, V., Decencière, E., Dokladal, P.: Geodesic Attributes Thinnings and Thickenings. In: Soille, P., Pesaresi, M., Ouzounis, G.K. (eds.) ISMM 2011. LNCS, vol. 6671, pp. 200–211. Springer, Heidelberg (2011)
Morard, V., Dokládal, P., Decencière, E.: Linear openings in arbitrary orientation in O(1) per pixel. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 1457–1460. IEEE (2011b)
Morard, V., Dokládal, P., Decencière, E.: One-Dimensional Openings, Granulometries and Component Trees in O(1) Per Pixel. IEEE J. Sel. Top. Signal. Process. 6(7), 840–848 (2012)
Morard, V., Dokládal, P., Decencière, E.: Parsimonious Path Openings and Closings. IEEE Trans. Image Process. 23(4), 1543–1555 (2014)
Talbot, H., Appleton, B.: Efficient complete and incomplete path openings and closings. Image Vis. Comput. 25(4), 416–425 (2007)
Valero, S., Chanussot, J., Benediktsson, J.A., Talbot, H., Waske, B.: Advanced directional mathematical morphology for the detection of the road network in very high resolution remote sensing images. Pattern Recognit. Lett. 31(10), 1120–1127 (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
van de Gronde, J.J., Schubert, H.R., Roerdink, J.B.T.M. (2015). Fast Computation of Greyscale Path Openings. In: Benediktsson, J., Chanussot, J., Najman, L., Talbot, H. (eds) Mathematical Morphology and Its Applications to Signal and Image Processing. ISMM 2015. Lecture Notes in Computer Science(), vol 9082. Springer, Cham. https://doi.org/10.1007/978-3-319-18720-4_52
Download citation
DOI: https://doi.org/10.1007/978-3-319-18720-4_52
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-18719-8
Online ISBN: 978-3-319-18720-4
eBook Packages: Computer ScienceComputer Science (R0)