A unified scheme for detecting fundamental curves in binary edge images

Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)


We present a unified scheme for detecting digital components of various planar curves in a binary edge image. We introduce a measure d to reflect the complexity of a family of curves. For instance, d = 2, 3, and 5 for lines, circles, and ellipses, respectively. Our algorithm outputs all eligible curve components (a component is eligible if its size is at least a threshold k) in O(nd) time and linear space, where n is the number of points. Our only primitive operations are algebraic operations of bounded degrees and comparisons. We also propose an approximate algorithm with α-perfectness, which runs in (Formula presented) time and outputs (Formula presented) curves.

Original languageEnglish
Title of host publicationAlgorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
EditorsJan van Leeuwen
Number of pages12
ISBN (Print)9783540584346
Publication statusPublished - 1994 Jan 1
Event2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands
Duration: 1994 Sep 261994 Sep 28

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume855 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other2nd Annual European Symposium on Algorithms, ESA 1994

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'A unified scheme for detecting fundamental curves in binary edge images'. Together they form a unique fingerprint.

Cite this