Publications related to Higher-order singular value decomposition

Low-Rank Tensor Methods for High-Dimensional Problems

In this thesis, we propose and analyze novel numerical algorithms for solving three different high-dimensional problems involving tensors. The commonality of these problems is that the tensors can potentially be well approximated in low-rank formats. Ident ...

EPFL2023

Sparse Sampling for Inverse Problems With Tensors

Guillermo Ortiz Jimenez

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 sam ...

2019

Multigrid Methods Combined With Low-Rank Approximation For Tensor-Structured Markov Chains

Daniel Kressner, Francisco Santos Paredes Quartin de Macedo

Markov chains that describe interacting subsystems suffer from state space explosion but lead to highly structured matrices. In this work, we propose a novel tensor-based algorithm to address such tensor-structured Markov chains. Our algorithm combines a t ...

2018

Scalable Low-rank Matrix and Tensor Decomposition on Graphs

Nauman Shahid

In many signal processing, machine learning and computer vision applications, one often has to deal with high dimensional and big datasets such as images, videos, web content, etc. The data can come in various forms, such as univariate or multivariate time ...

EPFL2017

Fourier dimensionality reduction of radio-interferometric data

Jean-Philippe Thiran, Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

Next-generation radio-interferometers face a computing challenge with respect to the imaging techniques that can be applied in the big data setting in which they are designed. Dimensionality reduction can thus provide essential savings of computing resourc ...

2017

A Fourier dimensionality reduction model for big data interferometric imaging

Jean-Philippe Thiran, Yves Wiaux, Rafael Eduardo Carrillo Rangel, Vijay Kartik

Data dimensionality reduction in radio interferometry can provide savings of computational resources for image reconstruction through reduced memory footprints and lighter computations per iteration, which is important for the scalability of imaging method ...

Oxford Univ Press2017

Multilinear Low-Rank Tensors on Graphs & Applications

Pierre Vandergheynst, Nauman Shahid, Francesco Grassi

We propose a new framework for the analysis of low- rank tensors which lies at the intersection of spectral graph theory and signal processing. As a first step, we present a new graph based low-rank decomposition which approximates the classical low-rank S ...

2016

Reduced Basis Methods: From Low-Rank Matrices To Low-Rank Tensors

Daniel Kressner, Jonas Ballani

We propose a novel combination of the reduced basis method with low-rank tensor techniques for the efficient solution of parameter-dependent linear systems in the case of several parameters. This combination, called rbTensor, consists of three ingredients. ...

Siam Publications2016

Low-Rank Tensor Methods for Communicating Markov Processes

Daniel Kressner, Francisco Santos Paredes Quartin de Macedo

Stochastic models that describe interacting processes, such as stochastic automata networks, feature a dimensionality that grows exponentially with the number of processes. This state space explosion severely impairs the use of standard methods for the num ...

Springer-Verlag Berlin2014

Low-Rank Tensor Methods With Subspace Correction For Symmetric Eigenvalue Problems

Daniel Kressner, André Uschmajew, Michael Maximilian Steinlechner

We consider the solution of large-scale symmetric eigenvalue problems for which it is known that the eigenvectors admit a low-rank tensor approximation. Such problems arise, for example, from the discretization of high-dimensional elliptic PDE eigenvalue p ...

Siam Publications2014

Multi-Way Compressed Sensing for Sparse Low-Rank Tensors

Anastasios Kyrillidis

For linear models, compressed sensing theory and methods enable recovery of sparse signals of interest from few measurements-in the order of the number of nonzero entries as opposed to the length of the signal of interest. Results of similar flavor have mo ...

IEEE Institute of Electrical and Electronics Engineers2012

Higher Order SVD Analysis for Dynamic Texture Synthesis

Sabine Süsstrunk, Luciano Sbaiz, Roberto Costantini

Videos representing flames, water, smoke, etc. are often defined as dynamic textures: "textures" because they are characterized by redundant repetition of a pattern and "dynamic" because this repetition is also in time and not only in space. Dynamic textur ...

Institute of Electrical and Electronics Engineers2008

Compact representations for static and dynamic texture synthesis

Roberto Costantini

In nature, textures can be found everywhere. Texture, together with color and shape, represents the fundamental characteristics of objects. Texture conveys an idea of repetition of a certain structure, which is not limited only to the visual domain. We can ...

EPFL2007