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
Fast Similarity Search in Scalar Fields using Merging Histograms
KTH, School of Computer Science and Communication (CSC), Computational Science and Technology (CST). (Visualization and Data Analysis)
KTH, School of Computer Science and Communication (CSC), Computational Science and Technology (CST). (Visualization and Data Analysis)ORCID iD: 0000-0002-1498-9062
2015 (English)In: Topological Methods in Data Analysis and Visualization IV: Theory, Algorithms, and Applications, Springer, 2015, 1-14 p.Chapter in book (Refereed)
Resource type
Text
Abstract [en]

Similarity estimation in scalar fields using level set topology has attracted a lot of attention in the recent past. Most existing techniques match parts of contour or merge trees against each other by estimating a best overlap between them. Due to their combinatorial nature, these methods can be computationally expensive or prone to instabilities. In this paper, we use an inexpensive feature descriptor to compare subtrees of merge trees against each other. It is the data histogram of the voxels encompassed by a subtree. A small modification of the merge tree computation algorithm allows for obtaining these histograms very efficiently. Furthermore, the descriptor is robust against instabilities in the merge tree. The method is useful in an interactive environment, where a user can search for all structures similar to an interactively selected one. Our method is conservative in the sense that it finds all similar structures, with the rare occurrence of some false positives. We show with several examples the effectiveness, efficiency and accuracy of our method.

Place, publisher, year, edition, pages
Springer, 2015. 1-14 p.
National Category
Computer Science
Research subject
Computer Science; SRA - E-Science (SeRC)
Identifiers
URN: urn:nbn:se:kth:diva-184849OAI: oai:DiVA.org:kth-184849DiVA: diva2:916936
Conference
TopoInVis 2015, May 20-22
Note

QC 20160406

Available from: 2016-04-05 Created: 2016-04-05 Last updated: 2017-09-07

Open Access in DiVA

No full text

Other links

Fast Similarity Search in Scalar Fields using Merging Histograms

Search in DiVA

By author/editor
Saikia, HimangshuWeinkauf, Tino
By organisation
Computational Science and Technology (CST)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Total: 6 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