Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Path Clustering with Homology Area
KTH. KTH, CAS, RPL, Royal Inst Technol, Stocholm, Sweden..
CUNY Coll Staten Isl, Math Dept, Staten Isl, NY 10314 USA.;CUNY, Grad Ctr, Comp Sci, New York, NY USA..
KTH, School of Electrical Engineering and Computer Science (EECS), Robotics, perception and learning, RPL. KTH, CAS, RPL, Royal Inst Technol, Stocholm, Sweden..ORCID iD: 0000-0003-2965-2953
KTH, School of Electrical Engineering and Computer Science (EECS), Robotics, perception and learning, RPL. KTH, CAS, RPL, Royal Inst Technol, Stocholm, Sweden..ORCID iD: 0000-0003-1114-6040
2018 (English)In: 2018 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), IEEE Computer Society, 2018, p. 7346-7353Conference paper, Published paper (Refereed)
Abstract [en]

Path clustering has found many applications in recent years. Common approaches to this problem use aggregates of the distances between points to provide a measure of dissimilarity between paths which do not satisfy the triangle inequality. Furthermore, they do not take into account the topology of the space where the paths are embedded. To tackle this, we extend previous work in path clustering with relative homology, by employing minimum homology area as a measure of distance between homologous paths in a triangulated mesh. Further, we show that the resulting distance satisfies the triangle inequality, and how we can exploit the properties of homology to reduce the amount of pairwise distance calculations necessary to cluster a set of paths. We further compare the output of our algorithm with that of DTW on a toy dataset of paths, as well as on a dataset of real-world paths.

Place, publisher, year, edition, pages
IEEE Computer Society, 2018. p. 7346-7353
Series
IEEE International Conference on Robotics and Automation ICRA, ISSN 1050-4729
National Category
Geometry
Identifiers
URN: urn:nbn:se:kth:diva-237170ISI: 000446394505086ISBN: 978-1-5386-3081-5 (print)OAI: oai:DiVA.org:kth-237170DiVA, id: diva2:1258256
Conference
IEEE International Conference on Robotics and Automation (ICRA), MAY 21-25, 2018, Brisbane, AUSTRALIA
Note

QC 20181024

Available from: 2018-10-24 Created: 2018-10-24 Last updated: 2018-10-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Authority records BETA

Kragic, DanicaPokorny, Florian T.

Search in DiVA

By author/editor
Carvalho, J. FredericoKragic, DanicaPokorny, Florian T.
By organisation
KTHRobotics, perception and learning, RPL
Geometry

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 186 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf