Multi-field Pattern Matching based on Sparse Feature Sampling
2016 (English)In: IEEE Transactions on Visualization and Computer Graphics, ISSN 1077-2626, E-ISSN 1941-0506, Vol. 22, no 1, 807-816 p.Article in journal (Refereed) PublishedText
We present an approach to pattern matching in 3D multi-field scalar data. Existing pattern matching algorithms work on single scalar or vector fields only, yet many numerical simulations output multi-field data where only a joint analysis of multiple fields describes the underlying phenomenon fully. Our method takes this into account by bundling information from multiple fields into the description of a pattern. First, we extract a sparse set of features for each 3D scalar field using the 3D SIFT algorithm (Scale-Invariant Feature Transform). This allows for a memory-saving description of prominent features in the data with invariance to translation, rotation, and scaling. Second, the user defines a pattern as a set of SIFT features in multiple fields by e.g. brushing a region of interest. Third, we locate and rank matching patterns in the entire data set. Experiments show that our algorithm is efficient in terms of required memory and computational efforts.
Place, publisher, year, edition, pages
2016. Vol. 22, no 1, 807-816 p.
Convolution, Correlation, Data visualization, Feature extraction, Jacobian matrices, Pattern matching, Three-dimensional displays
Research subject Computer Science; SRA - E-Science (SeRC)
IdentifiersURN: urn:nbn:se:kth:diva-184847DOI: 10.1109/TVCG.2015.2467292ISI: 000364043400086ScopusID: 2-s2.0-84947094032OAI: oai:DiVA.org:kth-184847DiVA: diva2:916939
QC 201604042016-04-052016-04-052016-04-05Bibliographically approved