Covering with ellipses

Alon Efrat, Frank Hoffmann, Christian Knauer, Klaus Kriegel, Günter Rote, Caola Wenk

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We address the problem of how to cover a set of required points by a small number of axis-parallel ellipses that avoid a second set of forbidden points. We study geometric properties of such covers and present an efficient randomized approximation algorithm for the cover construction. This question is motivated by a special pattern recognition task where one has to identify ellipse-shaped protein spots in two-dimensional electrophoresis images.

Original languageEnglish (US)
Pages (from-to)145-160
Number of pages16
JournalAlgorithmica
Volume38
Issue number1
DOIs
StatePublished - Oct 2003

Fingerprint

Approximation algorithms
Electrophoresis
Pattern recognition
Covering
Cover
Proteins
Ellipse
Randomized Algorithms
Set of points
Pattern Recognition
Approximation Algorithms
Protein

Keywords

  • Algorithms and data structures
  • Approximation algorithm
  • Computational geometry
  • Proteomics
  • Set cover

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software
  • Applied Mathematics
  • Safety, Risk, Reliability and Quality

Cite this

Efrat, A., Hoffmann, F., Knauer, C., Kriegel, K., Rote, G., & Wenk, C. (2003). Covering with ellipses. Algorithmica, 38(1), 145-160. https://doi.org/10.1007/s00453-003-1047-0

Covering with ellipses. / Efrat, Alon; Hoffmann, Frank; Knauer, Christian; Kriegel, Klaus; Rote, Günter; Wenk, Caola.

In: Algorithmica, Vol. 38, No. 1, 10.2003, p. 145-160.

Research output: Contribution to journalArticle

Efrat, A, Hoffmann, F, Knauer, C, Kriegel, K, Rote, G & Wenk, C 2003, 'Covering with ellipses', Algorithmica, vol. 38, no. 1, pp. 145-160. https://doi.org/10.1007/s00453-003-1047-0
Efrat A, Hoffmann F, Knauer C, Kriegel K, Rote G, Wenk C. Covering with ellipses. Algorithmica. 2003 Oct;38(1):145-160. https://doi.org/10.1007/s00453-003-1047-0
Efrat, Alon ; Hoffmann, Frank ; Knauer, Christian ; Kriegel, Klaus ; Rote, Günter ; Wenk, Caola. / Covering with ellipses. In: Algorithmica. 2003 ; Vol. 38, No. 1. pp. 145-160.
@article{b2decc0af08b4265893dc45665262b1f,
title = "Covering with ellipses",
abstract = "We address the problem of how to cover a set of required points by a small number of axis-parallel ellipses that avoid a second set of forbidden points. We study geometric properties of such covers and present an efficient randomized approximation algorithm for the cover construction. This question is motivated by a special pattern recognition task where one has to identify ellipse-shaped protein spots in two-dimensional electrophoresis images.",
keywords = "Algorithms and data structures, Approximation algorithm, Computational geometry, Proteomics, Set cover",
author = "Alon Efrat and Frank Hoffmann and Christian Knauer and Klaus Kriegel and G{\"u}nter Rote and Caola Wenk",
year = "2003",
month = "10",
doi = "10.1007/s00453-003-1047-0",
language = "English (US)",
volume = "38",
pages = "145--160",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Covering with ellipses

AU - Efrat, Alon

AU - Hoffmann, Frank

AU - Knauer, Christian

AU - Kriegel, Klaus

AU - Rote, Günter

AU - Wenk, Caola

PY - 2003/10

Y1 - 2003/10

N2 - We address the problem of how to cover a set of required points by a small number of axis-parallel ellipses that avoid a second set of forbidden points. We study geometric properties of such covers and present an efficient randomized approximation algorithm for the cover construction. This question is motivated by a special pattern recognition task where one has to identify ellipse-shaped protein spots in two-dimensional electrophoresis images.

AB - We address the problem of how to cover a set of required points by a small number of axis-parallel ellipses that avoid a second set of forbidden points. We study geometric properties of such covers and present an efficient randomized approximation algorithm for the cover construction. This question is motivated by a special pattern recognition task where one has to identify ellipse-shaped protein spots in two-dimensional electrophoresis images.

KW - Algorithms and data structures

KW - Approximation algorithm

KW - Computational geometry

KW - Proteomics

KW - Set cover

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

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

U2 - 10.1007/s00453-003-1047-0

DO - 10.1007/s00453-003-1047-0

M3 - Article

AN - SCOPUS:21144435127

VL - 38

SP - 145

EP - 160

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 1

ER -