Publications by Arash Amini | EPFL Graph Search

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

This paper is devoted to the characterization of an extended family of continuous-time autoregressive moving average (CARMA) processes that are solutions of stochastic differential equations driven by white Levy innovations. These are completely specified ...

Bayesian estimation problems involving Gaussian distributions often result in linear estimation techniques. Nevertheless, there are no general statements as to whether the linearity of the Bayesian estimator is restricted to the Gaussian case. The two comm ...

With the emergence of social networks and improvements in the internet speed, the video data has become an ever-increasing portion of the global internet traffic. Besides the content, the quality of a video sequence is an important issue at the user end wh ...

We consider continuous-time sparse stochastic processes from which we have only a finite number of noisy/noiseless samples. Our goal is to estimate the noiseless samples (denoising) and the signal in-between (interpolation problem). By relying on tools fro ...

The characteristic functional is the infinite-dimensional generalization of the Fourier transform for measures on function spaces. It characterizes the statistical law of the associated stochastic process in the same way as a characteristic function specif ...

We investigate the problem of the optimal reconstruction of a generalized Poisson process from its noisy samples. The process is known to have a finite rate of innovation since it is generated by a random stream of Diracs with a finite average number of im ...

We present a sampling theory for a class of binary images with finite rate of innovation (FRI). Every image in our model is the restriction of

\mathds{1}_{\{p\leq0\}}

to the image plane, where

\mathds{1}

denotes the indicator function and

p

is some r ...

Extracting low dimensional structure from high dimensional data arises in many applications such as machine learning, statistical pattern recognition, wireless sensor networks, and data compression. If the data is restricted to a lower dimensional subspace ...

We investigate a stochastic signal-processing framework for signals with sparse derivatives, where the samples of a Levy process are corrupted by noise. The proposed signal model covers the well-known Brownian motion and piecewise-constant Poisson process; ...

The detection of landmarks or patterns is of interest for extracting features in biological images. Hence, algorithms for finding these keypoints have been extensively investigated in the literature, and their localization and detection properties are well ...

We adopt an innovation-driven framework and investigate the sparse/compressible distributions obtained by linearly measuring or expanding continuous-domain stochastic models. Starting from the first principles, we show that all such distributions are neces ...

We introduce a definition of the notion of compressibility for infinite deterministic and i.i.d. random sequences which is based on the asymptotic behavior of truncated subsequences. For this purpose, we use asymptotic results regarding the distribution of ...

Motivated by the analog nature of real-world signals, we investigate continuous-time random processes. For this purpose, we consider the stochastic processes that can be whitened by linear transformations and we show that the distribution of their samples ...

We introduce a new method for adaptive one-bit quantization of linearmeasurements and propose an algorithm for the recovery of signals based on generalized approximate message passing (GAMP). Our method exploits the prior statistical information on the sig ...

Many recent algorithms for sparse signal recovery can be interpreted as maximum-a-posteriori (MAP) estimators relying on some specific priors. From this Bayesian perspective, state-of-the-art methods based on discrete-gradient regularizers, such as total-v ...

Arash Amini

Chat with Graph Search

A Unified Formulation of Gaussian Versus Sparse Stochastic Processes-Part II: Discrete-Domain Theory

On the Linearity of Bayesian Interpolators for Non-Gaussian Continuous-Time AR(1) Processes

Feature-based no-reference video quality assessment using Extra Trees

Bayesian Estimation for Continuous-Time Sparse Stochastic Processes

On the Continuity of Characteristic Functionals and Sparse Stochastic Modeling

Bayesian Denoising Of Generalized Poisson Processes With Finite Rate Of Innovation

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Low-rank Matrix Approximation Using Point-wise Operators

MMSE Estimation of Sparse Levy Processes

Angular Accuracy of Steerable Feature Detectors

Sparsity and Infinite Divisibility

Compressibility of Deterministic and Random Infinite Sequences

The Analog Formulation of Sparsity Implies Infinite Divisibility and Rules Out Bernoulli-Gaussian Priors

One-Bit Measurements With Adaptive Thresholds

Mmse Denoising Of Sparse Levy Processes Via Message Passing