English
Related papers

Related papers: Multiarray Signal Processing: Tensor decomposition…

200 papers

Non-convex constraints have recently proven a valuable tool in many optimisation problems. In particular sparsity constraints have had a significant impact on sampling theory, where they are used in Compressed Sensing and allow structured…

Information Theory · Computer Science 2012-05-09 Thomas Blumensath

Large-scale neuroimaging studies have been collecting brain images of study individuals, which take the form of two-dimensional, three-dimensional, or higher dimensional arrays, also known as tensors. Addressing scientific questions arising…

Methodology · Statistics 2013-04-23 Xiaoshan Li , Hua Zhou , Lexin Li

The problem of recovering signals of high complexity from low quality sensing devices is analyzed via a combination of tools from signal processing and harmonic analysis. By using the rich structure offered by the recent development in…

Information Theory · Computer Science 2020-03-16 Roza Aceska , Jean-Luc Bouchot , Shidong Li

We consider the well-studied problem of decomposing a vector time series signal into components with different characteristics, such as smooth, periodic, nonnegative, or sparse. We describe a simple and general framework in which the…

Machine Learning · Computer Science 2022-09-21 Bennet E. Meyers , Stephen P. Boyd

We give some new results on sparse signal recovery in the presence of noise, for weighted spaces. Traditionally, were used dictionaries that have the norm equal to 1, but, for random dictionaries this condition is rarely satisfied.…

Functional Analysis · Mathematics 2016-01-27 L. Gavruta , G. Zamani Eskandani , P. Gavruta

The theory of Compressed Sensing, the emerging sampling paradigm 'that goes against the common wisdom', asserts that 'one can recover signals in Rn from far fewer samples or measurements, if the signal has a sparse representation in some…

Information Theory · Computer Science 2013-11-01 Ankit Kundu , Pradosh K. Roy

In the context of the compressed sensing problem, we propose a new ensemble of sparse random matrices which allow one (i) to acquire and compress a {\rho}0-sparse signal of length N in a time linear in N and (ii) to perfectly recover the…

Information Theory · Computer Science 2013-04-15 Maria Chiara Angelini , Federico Ricci-Tersenghi , Yoshiyuki Kabashima

We consider representations of tensors as sums of decomposable tensors or, equivalently, decomposition of multilinear forms into one--forms. In this short note we show that there exists a particular finite strongly orthogonal decomposition…

Numerical Analysis · Mathematics 2014-09-19 Juan Manuel Peña , Tomas Sauer

Compressed sensing deals with efficient recovery of analog signals from linear encodings. This paper presents a statistical study of compressed sensing by modeling the input signal as an i.i.d. process with known distribution. Three classes…

Information Theory · Computer Science 2012-07-12 Yihong Wu , Sergio Verdú

Compressed sensing has a wide range of applications that include error correction, imaging, radar and many more. Given a sparse signal in a high dimensional space, one wishes to reconstruct that signal accurately and efficiently from a…

Numerical Analysis · Mathematics 2009-05-28 Deanna Needell

A new line of research uses compression methods to measure the similarity between signals. Two signals are considered similar if one can be compressed significantly when the information of the other is known. The existing compression-based…

Computer Vision and Pattern Recognition · Computer Science 2019-09-30 Tanaya Guha , Rabab K. Ward

This work studies the problem of simultaneously separating and reconstructing signals from compressively sensed linear mixtures. We assume that all source signals share a common sparse representation basis. The approach combines classical…

Information Theory · Computer Science 2015-05-30 Martin Kleinsteuber , Hao Shen

The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measurements. However, prior knowledge of the sparsity basis is…

Information Theory · Computer Science 2010-04-29 Sivan Gleichman , Yonina C. Eldar

Compressed sensing is a relatively new mathematical paradigm that shows a small number of linear measurements are enough to efficiently reconstruct a large dimensional signal under the assumption the signal is sparse. Applications for this…

Numerical Analysis · Mathematics 2018-01-08 Lenny Fukshansky , Deanna Needell , Benny Sudakov

The Tucker decomposition expresses a given tensor as the product of a small core tensor and a set of factor matrices. Apart from providing data compression, the construction is useful in performing analysis such as principal component…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-07-19 Venkatesan T Chakaravarthy , Jee W Choi , Douglas J Joseph , Xing Liu , Prakash Murali , Yogish Sabharwal , Dheeraj Sreedhar

Compressed sensing is a signal processing technique whereby the limits imposed by the Shannon--Nyquist theorem can be exceeded provided certain conditions are imposed on the signal. Such conditions occur in many real-world scenarios, and…

Information Theory · Computer Science 2018-02-16 Fintan Hegarty , Padraig Ó Catháin , Yunbin Zhao

We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in…

Machine Learning · Statistics 2013-12-18 Nikolaos M. Freris , Orhan Öçal , Martin Vetterli

While convolutional neural networks (CNNs) have become the de facto standard for most image processing and computer vision applications, their deployment on edge devices remains challenging. Tensor decomposition methods provide a means of…

Computer Vision and Pattern Recognition · Computer Science 2022-10-13 Marawan Gamal Abdel Hameed , Ali Mosleh , Marzieh S. Tahaei , Vahid Partovi Nia

Consider a data set collected by (individuals-features) pairs in different times. It can be represented as a tensor of three dimensions (Individuals, features and times). The tensor biclustering problem computes a subset of individuals and…

Machine Learning · Computer Science 2019-03-12 Andriantsiory Dina Faneva , Mustapha Lebbah , Hanane Azzag , Gaël Beck

Deep networks can be trained to map images into a low-dimensional latent space. In many cases, different images in a collection are articulated versions of one another; for example, same object with different lighting, background, or pose.…

Computer Vision and Pattern Recognition · Computer Science 2023-03-14 Rakib Hyder , M. Salman Asif