By Topic

New definition and fast recognition of digital straight segments and arcs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
V. A. Kovalevsky ; Tech. Fachhochschule Berlin, Germany

The definition and recognition algorithm for a digital straight segment (DSS) is presented. The points of a DSS must have a limited distance from that edge. A recognition algorithm is given which uses only integer arithmetic and needs an average of about 10 such operations per point. The definition of a digital circular arc (DCA) which uses the notion of centers of the pixels (a pixel is considered as an elementary rectangular area) on both sides of a given curve is given. The centers comprise two sets: the left and the right. The curve is a DCA if a Euclidean circle separating the sets from each other exists. An efficient algorithm for finding all such circles is presented

Published in:

Pattern Recognition, 1990. Proceedings., 10th International Conference on  (Volume:ii )

Date of Conference:

16-21 Jun 1990