Sparse Sampling for Inverse Problems with Tensors

Guillermo Ortiz-Jiménez, Mario Coutino, Sundeep Prabhakar Chepuri, Geert Leus
6/28/2018
cs.ITeess.SP

No confident code implementation found for this paper.

Abstract

We consider the problem of designing sparse sampling strategies for multidomain signals, which can be represented using tensors that admit a known multilinear decomposition. We leverage the multidomain structure of tensor signals and propose to acquire samples using a Kronecker-structured sensing function, thereby circumventing the curse of dimensionality. For designing such sensing functions, we develop low-complexity greedy algorithms based on submodular optimization methods to compute near-optimal sampling sets. We present several numerical examples, ranging from multi-antenna communications to graph signal processing, to validate the developed theory.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ortizjimnez2018sparse,
  title  = {Sparse Sampling for Inverse Problems with Tensors},
  author = {Guillermo Ortiz-Jiménez and Mario Coutino and Sundeep Prabhakar Chepuri and Geert Leus},
  year   = {2018},
  eprint = {1806.10976},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1806.10976}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1806.10976.svg)](https://codeofpaper.com/paper/1806.10976)

Discussion