A unified scheme for detecting fundamental curves in binary edge images

Tetsuo Asano; Naoki Katoh; Takeshi Tokuyama

A unified scheme for detecting fundamental curves in binary edge images

Tetsuo Asano, Naoki Katoh, Takeshi Tokuyama

INF - System Information Sciences

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Citations (Scopus)

Abstract

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(n^d) 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 language	English
Title of host publication	Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings
Editors	Jan van Leeuwen
Publisher	Springer-Verlag
Pages	215-226
Number of pages	12
ISBN (Print)	9783540584346
Publication status	Published - 1994 Jan 1
Event	2nd Annual European Symposium on Algorithms, ESA 1994 - Utrecht, Netherlands Duration: 1994 Sep 26 → 1994 Sep 28

Publication series

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

Other

Other	2nd Annual European Symposium on Algorithms, ESA 1994
Country	Netherlands
City	Utrecht
Period	94/9/26 → 94/9/28

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

Fingerprint 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

Asano, T., Katoh, N., & Tokuyama, T. (1994). A unified scheme for detecting fundamental curves in binary edge images. In J. van Leeuwen (Ed.), Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings (pp. 215-226). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS). Springer-Verlag.

A unified scheme for detecting fundamental curves in binary edge images. / Asano, Tetsuo; Katoh, Naoki; Tokuyama, Takeshi.

Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. ed. / Jan van Leeuwen. Springer-Verlag, 1994. p. 215-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 855 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Asano, T, Katoh, N & Tokuyama, T 1994, A unified scheme for detecting fundamental curves in binary edge images. in J van Leeuwen (ed.), Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 855 LNCS, Springer-Verlag, pp. 215-226, 2nd Annual European Symposium on Algorithms, ESA 1994, Utrecht, Netherlands, 94/9/26.

Asano, Tetsuo ; Katoh, Naoki ; Tokuyama, Takeshi. / A unified scheme for detecting fundamental curves in binary edge images. Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings. editor / Jan van Leeuwen. Springer-Verlag, 1994. pp. 215-226 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{e317ba3ad2864c9faab1a64337fdf811,

title = "A unified scheme for detecting fundamental curves in binary edge images",

abstract = "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.",

author = "Tetsuo Asano and Naoki Katoh and Takeshi Tokuyama",

year = "1994",

month = jan,

day = "1",

language = "English",

isbn = "9783540584346",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

pages = "215--226",

editor = "{van Leeuwen}, Jan",

booktitle = "Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings",

note = "2nd Annual European Symposium on Algorithms, ESA 1994 ; Conference date: 26-09-1994 Through 28-09-1994",

}

TY - GEN

T1 - A unified scheme for detecting fundamental curves in binary edge images

AU - Asano, Tetsuo

AU - Katoh, Naoki

AU - Tokuyama, Takeshi

PY - 1994/1/1

Y1 - 1994/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84947791985&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84947791985&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84947791985

SN - 9783540584346

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 215

EP - 226

BT - Algorithms - ESA'94 - 2nd Annual European Symposium, Proceedings

A2 - van Leeuwen, Jan

PB - Springer-Verlag

T2 - 2nd Annual European Symposium on Algorithms, ESA 1994

Y2 - 26 September 1994 through 28 September 1994

ER -