Abstract
We present a unified scheme for detecting digital components of various planar curves in a binary edge image. We introduce a measure d to reflect the complexity of a family of curves. For instance, d=2,3, and 5 for lines, circles, and ellipses, respectively. Our algorithm outputs all eligible curve components (a component is eligible if its size is at least a threshold k) in O(n d) time and linear space, where n is the number of points. Our only primitive operations are algebraic operations of bounded degrees and comparisons. We also propose an approximate algorithm with α perfectness, which runs in O((n/(1−α)k)d−1 n) time and outputs O((n/(1−α)k)d).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T. Asano, L. Guibas, and T. Tokuyama, Walking in an Arrangement Topologically, Int. J. of Comput. Geom. and Appl. 4–2 (1994).
T. Asano and N. Katoh, Number Theory Helps Line Detection in Digital Images, Proc. ISAAC'93, Springer LNCS 762, (1993), pp.313–322.
D.H. Ballard, Generalizing the Hough Transform to Detect Arbitrary Shapes, Pattern Recognition, 13–2 (1981), pp. 111–122.
C.M. Brown, Inherent Bias and Noise in the Hough Transform, IEEE Trans. Pattern Anal. Machine Intell., PAMI-5, No.5 (1983), pp. 493–505.
B. Chazelle, An Optimal Convex Hull Algorithm and New Results on Cuttings, Proc. 32nd IEEE Symp. on Foundation of Computer Science, (1991), pp.29–38.
R. O. Duda and P.E. Hart. Use of the Hough Transformation to Detect Lines and Curves in Pictures, Comm. of the ACM, 15, January 1972, pp.11–15.
H. Edelsbrunner and L.J. Guibas, Topologically Sweeping an Arrangement, J. Comp. and Sys. Sci., 38 (1989), 165–194.
L. Guibas, M. Overmars, and J-M. Robert, The Exact Fitting Problem for Points, Proc. 3rd CCCG, (1991), pp.171–174.
P.J. Heffernan and S. Schirra. Approximate Decision Algorithms for Point Set Congruence, Proc. 8th Symposium on Computational Geometry, (1992), pp. 93–101.
P.V.C. Hough, Method and Means for Recognizing Complex Patterns, US Patent 3069654, December 18, (1962).
D.P. Huttenlocher and K. Kedem, Computing the Minimum Housdorff Distance of Point Sets under Translation, Proc. 6th Symposium on Computational Geometry, (1990), pp. 340–349.
K. Imai, S. Sumino, and H. Imai, Minimax Geometric Fitting of Two Corresponding Sets of Points, Proc. 5th Symposium on Computational Geometry, (1989), pp. 276–282.
C. Kimme, D.H. Ballard, and J. Sklansky, Finding circles by an array of accumulators, Comm. ACM, 18 (1975), pp. 120–122.
H. Maitre, Contribution to the Prediction of Performance of the Hough Transform, IEEE Trans. Pattern Anal. Machine Intell., PAMI-8, No.5 (1986), pp. 669–674.
J. Matousěk, Range Searching with Efficient Hierarchical Cuttings, Proc. 8th ACM Computational Geometry, (1992), pp.276–285.
A. Rosenfeld and R.A. Melter, Digital Geometry, Tech. Report, CAR-323, Center for Automatic Research, University of Maryland, 1987.
P. Sauer, On the Recognition of Digital Circles in Linear Time, Computational Geometry: Theory and Applications, 2 (1993), pp. 287–302.
J. Sklansky, On the Hough technique for curve detection, IEEE Trans. Comp., C-27, 10 (1978), pp. 923–926.
S. Tsuji and F. Matsumoto, Detection of ellipses by a modified Hough transformation, IEEE Trans. Comp., C-27, No. 8 (1978), pp. 777–781.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Asano, T., Katoh, N., Tokuyama, T. (1994). A unified scheme for detecting fundamental curves in binary edge images. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049410
Download citation
DOI: https://doi.org/10.1007/BFb0049410
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive