Title :
On recursive, O(N) partitioning of a digitized curve into digital straight segments
Author :
Linderbaum, M. ; Bruckstein, A.
Author_Institution :
Dept. of Comput. Sci., Technion, Haifa, Israel
fDate :
9/1/1993 12:00:00 AM
Abstract :
A simple online algorithm for partitioning of a digital curve into digital straight-line segments of maximal length is given. The algorithm requires O(N) time and O(1) space and is therefore optimal. Efficient representations of the digital segments are obtained as byproducts. The algorithm also solves a number-theoretical problem concerning nonhomogeneous spectra of numbers
Keywords :
computational complexity; image segmentation; number theory; digitized curve segmentation; nonhomogeneous spectra; number-theoretical problem; online algorithm; recursive partitioning; Computer science; Heuristic algorithms; Image coding; Image segmentation; Linear programming; Machine intelligence; Mathematics; Partitioning algorithms; Performance analysis; Testing;
Journal_Title :
Pattern Analysis and Machine Intelligence, IEEE Transactions on
