Abstract
The problem of finding all the digital line segments in a digital curve is interesting in pattern recognition and image processing. We develop an algorithm solving this problem in O(log n) time using O(n) work on a CREW PRAM. This beats all known algorithmic results about digital curve segmentation. Moreover, our algorithm solves a more general segmentation problem which can be formulated in terms of semigroups.
Our algorithm makes use of two prerequisites, possibly interesting for their own: (a) certain parameter polygons with few vertices, called Hough polygons, which we assign to every digital line segment, and (b) the parallel search for monotone integer functions in O(log n) time by O(n) threshold queries.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
T.A.Anderson, C.E.Kim: Representation of digital line segments and their preimages, Computer Vision, Graphics, and Image Processing 30 (1985), 279–288
T.Asano, N.Katoh: Number theory helps line detection in digital images — an extended abstract, Int. Symposium on Algorithms and Computation ISAAC'93, Lecture Notes in Computer Science 762, Springer 1993, 313–322
T.Asano, N.Katoh, T.Tokuyama: A unified scheme for detecting fundamental curves in binary edge images, 2nd European Symposium on Algorithms ESA'94, Utrecht 1994, Lecture Notes in Computer Science 855, Springer 1994, 215–226
M.J.Atallah, M.T.Goodrich: Parallel algorithms for some functions of two convex polygons, Algorithmica 3 (1988), 535–548
P.Damaschke: Line segmentation of digital curves in parallel, 12th Symposium on Theoretical Aspects of Computer Science STACS'95, Munich 1995, Lecture Notes in Computer Science 900, Springer 1995, 539–549
P.Damaschke: The linear time recognition of digital arcs, Pattern Recognition Letters, to appear
I.Debled-Rennesson, J.P.Reveillès: A linear algorithm for segmentation of digital curves, 3rd Int. Workshop on Parallel Image Analysis, College Park/MD 1994
L.Dorst, A.W.M.Smeulders: Decomposition of discrete curves into piecewise segments in linear time, Contemporary Math. 119 (1991), 169–195
F.Gao, L.J.Guibas, D.G.Kirkpatrick, W.T.Laaser, J.Saxe: Finding extrema with unary predicates, Algorithmica 9 (1993), 591–600
R.Hassin, N.Megiddo: An optimal algorithm for finding all the jumps of a monotone step function, Journal of Algorithms 6 (1985), 265–274
J.JáJá: An Introduction to Parallel Algorithms, Addison-Wesley 1992
R.E.Ladner, M.J.Fischer: Parallel prefix computations, Journal of the ACM 27 (1980), 831–838
N.Megiddo: Linear programming in linear time when the dimension is fixed, Journal of the ACM 31 (1984), 114–127
J.P.Reveillès: Géométrie discrète, calcul en nombres entiers et algorithmique, Thèse d'Etat, Univ. Louis Pasteur, Strasbourg 1991
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damaschke, P. (1995). An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search. In: Spirakis, P. (eds) Algorithms — ESA '95. ESA 1995. Lecture Notes in Computer Science, vol 979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60313-1_171
Download citation
DOI: https://doi.org/10.1007/3-540-60313-1_171
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60313-9
Online ISBN: 978-3-540-44913-3
eBook Packages: Springer Book Archive