Publications by Mitra Fatemi | EPFL Graph Search

Related publications (7)

Sampling and Reconstruction of Shapes with Algebraic Boundaries

Martin Vetterli, Arash Amini, Mitra Fatemi

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

2016

Shapes from pixels

Martin Vetterli, Arash Amini, Loïc Arnaud Baboulaz, Mitra Fatemi

Continuous-domain visual signals are usually captured as discrete (digital) images. This operation is not invertible in general, in the sense that the continuous-domain signal cannot be exactly reconstructed based on the discrete image, unless it satisfies ...

Institute of Electrical and Electronics Engineers2016

Equivalence of synthesis and atomic formulations of sparse recovery

Volkan Cevher, Mitra Fatemi

Recovery of sparse signals from linear, dimensionality reducing measurements broadly fall under two well-known formulations, named the synthesis and the analysis a ́ la Elad et al. Recently, Chandrasekaran et al. introduced a new algorithmic sparse recover ...

Ieee2012

Optimal Sampling Rates in Infinite-Dimensional Compressed Sensing

Martin Vetterli, Loïc Arnaud Baboulaz, Mitra Fatemi

The theory of compressed sensing studies the problem of recovering a high dimensional sparse vector from its projections onto lower dimensional subspaces. The recently introduced framework of infinite-dimensional compressed sensing [1], to some extent gene ...

2013

Shapes from Pixels

Mitra Fatemi

In today's digital world, sampling is at the heart of any signal acquisition device. Imaging devices are ubiquitous examples that capture two-dimensional visual signals and store them as the pixels of discrete images. The main concern is whether and how th ...

EPFL2016

Randomized recovery for boolean compressed sensing

Martin Vetterli, Mitra Fatemi

We consider the problem of boolean compressed sensing, which is alternatively known as group testing. The goal is to recover a small number of defective items in a large set from a few collective binary tests. This problem can be formulated as a binary lin ...

2013

Efficient multistage secret sharing scheme using bilinear map

Mitra Fatemi

In a multistage secret sharing (MSSS) scheme, the authorised subsets of participants could recover a number of secrets in different stages. A one-stage multisecret sharing (OSMSS) scheme is a special case of MSSS schemes in which all the secrets are recove ...

Inst Engineering Technology-Iet2014