Affordable Access

Publisher Website

Detecting the straightness of digital curves inO(N) steps

Authors
Journal
Computer Vision Graphics and Image Processing
0734-189X
Publisher
Elsevier
Publication Date
Volume
45
Issue
1
Identifiers
DOI: 10.1016/0734-189x(89)90067-4
Disciplines
  • Computer Science
  • Mathematics

Abstract

Abstract Many objects that appears in digital images are bounded by straight lines. Curves are often detected as series of edges. The detection of the straightness of those edge sequences is a major problem in image interpretation. In this paper the RULI chain code is used for encoding geometric configurations. Rosenfeld ( IEEE Trans. Comput. C-23, 1974, 1264–1269) and Ronse ( Pattern Recognit. Lett. 3, 1985, 323–326) used the “chord property” to identify straight lines. While this test takes O(n ∗ ∗ 2) steps, the algorithm discussed in this paper only takes O( n) steps, where n is the number of code elements. Furthermore, the algorithm calculates the interval that delimits the slope of the straight line.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

Fast polygonal approximation of digital curves usi...

on IEEE Transactions on Pattern A... September 2007

On the straightness of digital arcs.

on IEEE Transactions on Pattern A... February 1985

Digital straightness—a review

on Discrete Applied Mathematics Jan 01, 2004

Digital Straightness

on Electronic Notes in Theoretica... Jan 01, 2001
More articles like this..