Abstract
In the paper, a class of algorithms for filling concavities in binary images is presented. The paradigm of computation is a serial, multi-resolution approach. Among the algorithms which have been implemented, the most significant one is fully described, while for the others, some hints are given on the computational complexity. The algorithm for the approximation of the convex hull has a complexity which is linear in the image dimensions, provided that the multi-resolution is already available. The performance of the algorithms has been measured on a broad set of images and experimental results are reported. Final considerations about parallelization are also given.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
V. Cantoni, V. Di Gesù, M. Ferretti, S. Levialdi, R. Negrini, R. Stefanelli: The Papia System, Journal of VLSI Signal Processing, 2, 1991, pp. 195–217.
J. Sklansky, L. Cordella, S. Levialdi: Parallel detection of concavities in cellular blobs, IEEE Trans. Computers, Vol. C-25, Feb. 1976, pp. 187–196.
G. Borgefors, G. S. di Baja: Filling and analysing concavities of digital patterns parallelwise, Visual Form — Analysis and Recognition, Plenum ed., 1994, pp. 57–66.
G. Borgefors, G. S. di Baja: Methods for hierarchical analysis of concavities, Proc. Int. Conf. 11th IAPR, Vol C, 1992, pp. 171–175.
L. Zangrandi: Strategie gerarchiche di raffinamento in algoritmi per l'elaborazione di immagini, Thesis, Dipartimento di Informatica e Sistemistica, Università di Pavia, 1994.
R. Klette: On the Approximation of Convex Hulls of finite Grid Point Set, PRL; vol. 2, 1983, pp. 19–22.
M. J. Duff: Propagation in cellular logic arrays, Proc. Workshop on Picture Data Description and Management, 1980, pp. 259–262
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Albanesi, M.G., Ferretti, M., Zangrandi, L. (1995). A pyramidal approach to convex hull and filling algorithms. In: Braccini, C., DeFloriani, L., Vernazza, G. (eds) Image Analysis and Processing. ICIAP 1995. Lecture Notes in Computer Science, vol 974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60298-4_249
Download citation
DOI: https://doi.org/10.1007/3-540-60298-4_249
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60298-9
Online ISBN: 978-3-540-44787-0
eBook Packages: Springer Book Archive