Abstract
Path openings and closings are algebraic morphological operators using families of thin and oriented structuring elements that are not necessarily perfectly straight. These operators are naturally translation invariant and can be used in filtering applications instead of operators based on the more standard families of straight line structuring elements. They give similar results to area or attribute-based operators but with more flexibility in the constraints.
Trivial implementations of this idea using actual supreme or infima of morphological operators with paths as structuring elements would imply exponential complexity. Fortunately a linear complexity algorithm exists in the literature, which has similar running times as an efficient implementation of algebraic operators using straight lines as structuring elements.
However even this implementation is sometimes not fast enough, leading practitioners to favour some attribute-based operators instead, which in some applications is not optimal.
In this paper we propose an implementation of path-based morphological operators which is shown experimentally to exhibit logarithmic complexity and comparable computing times with those of attribute-based operators.
Keywords
- Algebraic morphological operators
- attributes
- complexity
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
E. Breen and R. Jones. Attribute openings, thinnings and granulometries. Computer Vision, Graphics, and Image Processing: Image Understanding, 64(3):377–389, 1996.
E. J. Breen and D. Monro. An evaluation of priority queues for mathematical morphology. In J. Serra and P. Soille, editors, ISMM’94, Fontainebleau, pages 249–256. Kluwer.
M. Buckley and H. Talbot. Flexible linear openings and closings. In L. Vincent and D. Bloomberg, editors, ISMM’2000, Palo Alto. Kluwer.
H. Heijmans. Morphological image operators. Advances in Electronics and Electron Physics Series. Academic Press, Boston, 1994.
H. Heijmans, M. Buckley, and H. Talbot. Path-based morphological openings. In ICIP’04, pp. 3085–3088, Singapore, October 2004.
H. Heijmans, M. Buckley, and H. Talbot. Path openings and closings. Journal of Mathematical Imaging and Vision, 2004. In press.
H.J.A.M. Heijmans and C. Ronse. The algebraic basis of mathematical morphology, part I: dilations and erosions. Computer Vision, Graphics, and Image Processing, 50:245–295, 1990.
F. Jaumier. Application de la morphologie mathématique à la détection de formes sur les clichés angiofluorographiques de la rétine. Master’s thesis, July 1988.
D. Knuth. The art of computer programming. Volume 3: Sorting and searching. Addison-Wesley, 1973.
M.B. Kurdy and D. Jeulin. Directional mathematical morphology operations. In Proceedings of the 5th European Congress for Stereology, volume 8/2, pages 473–480, Freiburg im Breisgau, Germany, 1989.
C. L. Luengo Hendriks and van Vliet L. J. A rotation-invariant morphology for shape analysis of anisotropic objects and structures. In C. Arcelli, L.P. Cordella, and G. Sanniti di Baja, editors, Visual Form 2001: 4th International Workshop on Visual Form, page 378, Capri, Italy, 2001. Springer LNCS.
A. Meijster and H.F. Wilkinson. A comparison of algorithms for connected set openings and closings. IEEE Transactions on Pattern Analysis and Machine Intelligence, 24(4):484–494, April 2002.
C. Ronse and H.J.A.M. Heijmans. The algebraic basis of mathematical morphology, part ii: openings and closings. Computer Vision, Graphics, and Image Processing: Image Understanding, 54:74–97, 1991.
J. Serra. Image analysis and mathematical morphology. Academic Press, 1982.
V.N. Skladnev, A. Gutenev, S. Menzies, L.M. Bischof, H.G.F Talbot, E.J. Breen, and M.J. Buckley. Diagnostic feature extraction in dermatological examination. Patent WO 02/094098 A1, Polartechnics Limited, 2001.
P. Soille. Morphological Image Analysis, principles and applications. Springer-Verlag, 2nd edition, 2003. ISBN 3-540-42988-3.
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. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11):1313–1329, 2001.
Lee T., Ng V., Gallagher R., Coldman A., and McLean D. Dullrazor: A software approach to hair removal from images. Computers in Biology and Medicine, 27:533–543, 1997.
H. Talbot, T. Lee, D. Jeulin, D. Hanton, and L. W. Hobbs. Image analysis of insulation mineral fibres. Journal of Microscopy, 200(3):251–268, Dec 2000.
A. Tuzikov, P. Soille, D. Jeulin, H. Bruneel, and M. Vermeulen. Extraction of grid lines on stamped metal pieces using mathematical morphology. In Proc. 11th ICPR, pages 425–428, The Hague, September 1992.
G. van Antwerpen, P.W. Verbeek, and F.C.A. Groen. Automatic counting of asbestos fibres. In I.T. Young et al., editor, Signal Processing III: theories and applications, pages 891–896, 1986.
L. Vincent. Grayscale area openings and closings, their efficient implementation and applications. ISMM’93, pages 22–27, Barcelona, Spain.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer
About this paper
Cite this paper
Appleton, B., Talbot, H. (2005). 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. Springer, Dordrecht. https://doi.org/10.1007/1-4020-3443-1_4
Download citation
DOI: https://doi.org/10.1007/1-4020-3443-1_4
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-3442-8
Online ISBN: 978-1-4020-3443-5
eBook Packages: Computer ScienceComputer Science (R0)