Edge tracing in a priori known direction

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a contour tracing algorithm based on a priori knowledge about searched edges. The algorithm is destined to trace edges having long fragments of approximately constant direction. This enables the implementation of one edge detector mask only in a given area and simplifies the thinning procedure. The way of searching for starting points is discussed as well as choosing and joining fragments of edges assuring the best correspondence between the found edge and the knowledge possessed. The algorithm shows good insensitivity to noise and local edge distortions.

Cite

CITATION STYLE

APA

Nowak, A., Florek, A., & Piascik, T. (1992). Edge tracing in a priori known direction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 588 LNCS, pp. 38–42). Springer Verlag. https://doi.org/10.1007/3-540-55426-2_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free