From a 2D Shape to a String Structure Using the Symmetry Set
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Standard
From a 2D Shape to a String Structure Using the Symmetry Set. / Kuijper, Arjan; Olsen, Ole Fogh; Giblin, Peter; Bille, Phillip; Nielsen, Mads.
Computer Vision - ECCV 2004: 8th European Conference on Computer Vision, Prague, Czech Republic, May 11-14, 2004. Proceedings, Part II. <Forlag uden navn>, 2004. s. 313-325 (Lecture notes in computer science, Bind 3022/2004).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Harvard
APA
Vancouver
Author
Bibtex
}
RIS
TY - GEN
T1 - From a 2D Shape to a String Structure Using the Symmetry Set
AU - Kuijper, Arjan
AU - Olsen, Ole Fogh
AU - Giblin, Peter
AU - Bille, Phillip
AU - Nielsen, Mads
N1 - Conference code: 8
PY - 2004
Y1 - 2004
N2 - Many attempts have been made to represent families of 2D shapes in a simpler way. These approaches lead to so-called structures as the Symmetry Set () and a subset of it, the Medial Axis (). In this paper a novel method to represent the as a string is presented. This structure is related to so-called arc-annotated sequences, and allows faster and simpler query algorithms for comparison and database applications than graph structures, used to represent the . Example shapes are shown and their data structures derived. They show the stability and robustness of the and its string representation. This work is part of the DSSCV project supported by the IST Programme of the European Union (IST-2001-35443). https://www.itu.dk/English/research/DoI/projects/dsscv/
AB - Many attempts have been made to represent families of 2D shapes in a simpler way. These approaches lead to so-called structures as the Symmetry Set () and a subset of it, the Medial Axis (). In this paper a novel method to represent the as a string is presented. This structure is related to so-called arc-annotated sequences, and allows faster and simpler query algorithms for comparison and database applications than graph structures, used to represent the . Example shapes are shown and their data structures derived. They show the stability and robustness of the and its string representation. This work is part of the DSSCV project supported by the IST Programme of the European Union (IST-2001-35443). https://www.itu.dk/English/research/DoI/projects/dsscv/
U2 - 10.1007/b97866
DO - 10.1007/b97866
M3 - Article in proceedings
SN - 978-3-540-21983-5
T3 - Lecture notes in computer science
SP - 313
EP - 325
BT - Computer Vision - ECCV 2004
PB - <Forlag uden navn>
Y2 - 29 November 2010
ER -
ID: 5070704