Abstract
We present here a new solution to a problem which is commonly encountered in applied image analysis: the problem of extracting linear features from an image. Examples of linear features are fibres, fractures and object boundaries. Such features, though linear, are usually not straight — in general they are curved.
A standard morphological tool for extraction of dark linear features is the minimum of straight-line closings. If the linear features are light in colour, the dual, a maximum of straight-line openings, may be used. This approach, however, is not robust to curvature in the linear features, especially if they are narrow.
In this paper we present an efficient algorithm inspired by local shortest-paths which is robust to curvature. This approach yields filters which are morphological closings or openings. Examples show the effect of the new method.
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
M. Buckley and J. Yang. Regularised shortest paths extraction. Pattern Recognition Letters, 18:621–629, 1997.
E. Dijkstra. A note on two problems in connexion with graph. Numerische Mathematik, 1:269–271, 1959.
A. Gruen and H. Li. Road extraction from aerial and satellite images by dynamic programming. ISPRS Journal of Photogrammetry and Remote Sensing, 50(4):11–20, 1995.
B. Rosen and L. Vincent. Morphological image processing techniques applied to detection of correlogram tracks. U.S. Navy Journal of Underwater Acoustics, 44(2):571–586, April 1994.
P. Salembier and J. Serra. Flat zone filtering, connected operators and filters by reconstruction. IEEE Transactions on Image Processing, 3(8):1153–1160, August 1995.
P. Soille. Grey scale convex hulls: definitions, implementations and applications. In Mathematical Morphology and its Applications to Image and Signal Processing, volume 12 of Computational Imaging and Vision, pages 83–90, Amsterdam, June 1998. Kluwer. Proceedings of ISMM’98.
P. Soille, E. Breen, and R. Jones. Recursive implementation of erosions and dilations along discrete lines at arbitrary angles. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18(5):562–567, May 1996.
P. Soille and H. Talbot. Directional morphological filtering. Submitted.
L. Vincent. Morphological grayscale reconstruction in image analysis: Applications and efficient algorithms. IEEE Transactions on Image Processing, 22(2):176–201, 1993.
L. Vincent. Minimal path algorithms for the robust detection of linear features in images. In Mathematical Morphology and its Applications to Image and Signal processing, volume 12 of Computational Imaging and Vision, pages 331–338, Amsterdam, June 1998. Kluwer. Proceedings for ISMM’98.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Kluwer Academic/Plenum Publishers
About this chapter
Cite this chapter
Buckley, M., Talbot, H. (2002). Flexible Linear Openings and Closings. In: Goutsias, J., Vincent, L., Bloomberg, D.S. (eds) Mathematical Morphology and its Applications to Image and Signal Processing. Computational Imaging and Vision, vol 18. Springer, Boston, MA. https://doi.org/10.1007/0-306-47025-X_13
Download citation
DOI: https://doi.org/10.1007/0-306-47025-X_13
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-7862-4
Online ISBN: 978-0-306-47025-7
eBook Packages: Springer Book Archive