Share Email Print
cover

Proceedings Paper • new

Separation of composite tensors with sparse Tucker representations
Author(s): Ashley Prater-Bennette; Kenneth Theodore Carr
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A common tool to process and interpret multimodal data is to represent the data in a sparse Tucker format, decomposed as a sparse core tensor and dictionary matrices for each modal dimension. In real-world applications one may be presented with a composition of several tensors, each with its own sparse Tucker representation and collection of dictionaries. The Tucker model and associated recovery algorithms struggle to accurately separate composite tensors in this situation, either having difficulty with the overcomplete dictionaries or not fully taking advantage of the special structure of the decomposition. To address these deficiencies, we introduce an overcomplete sparse Tucker model and an iterative algorithm to separate a composite sparse Tucker tensor. The method, which is based on soft-thresholding shrinkage techniques, is demonstrated to effectively separate overcomplete tensors and recover the sparse component tensors on real-world datasets, and to do so more accurately than other Tucker methods.

Paper Details

Date Published: 13 May 2019
PDF: 7 pages
Proc. SPIE 10989, Big Data: Learning, Analytics, and Applications, 109890N (13 May 2019); doi: 10.1117/12.2519095
Show Author Affiliations
Ashley Prater-Bennette, Air Force Research Lab. (United States)
Kenneth Theodore Carr, Northeastern Univ. (United States)


Published in SPIE Proceedings Vol. 10989:
Big Data: Learning, Analytics, and Applications
Fauzia Ahmad, Editor(s)

© SPIE. Terms of Use
Back to Top