DeepAI AI Chat
Log In Sign Up

Tensor Matched Kronecker-Structured Subspace Detection for Missing Information

by   Ishan Jindal, et al.
Wayne State University

We consider the problem of detecting whether a tensor signal having many missing entities lies within a given low dimensional Kronecker-Structured (KS) subspace. This is a matched subspace detection problem. Tensor matched subspace detection problem is more challenging because of the intertwined signal dimensions. We solve this problem by projecting the signal onto the Kronecker structured subspace, which is a Kronecker product of different subspaces corresponding to each signal dimension. Under this framework, we define the KS subspaces and the orthogonal projection of the signal onto the KS subspace. We prove that reliable detection is possible as long as the cardinality of the missing signal is greater than the dimensions of the KS subspace by bounding the residual energy of the sampling signal with high probability.


Tensor Matched Subspace Detection

The problem of testing whether an incomplete tensor lies in a given tens...

Sample, computation vs storage tradeoffs for classification using tensor subspace models

In this paper, we exhibit the tradeoffs between the (training) sample, c...

Algorithms for an Efficient Tensor Biclustering

Consider a data set collected by (individuals-features) pairs in differe...

Some Options for L1-Subspace Signal Processing

We describe ways to define and calculate L_1-norm signal subspaces which...

GLIMPS: A Greedy Mixed Integer Approach for Super Robust Matched Subspace Detection

Due to diverse nature of data acquisition and modern applications, many ...

Performance Limits on the Classification of Kronecker-structured Models

Kronecker-structured (K-S) models recently have been proposed for the ef...

Change Detection: A functional analysis perspective

We develop a new approach for detecting changes in the behavior of stoch...