Publication

Statistics of Wavelet Coefficients for Sparse Self-Similar Images

Publications associées (40)

On the 2D Post-Processing of Brillouin Optical Time-Domain Analysis

Luc Thévenaz, Zhisheng Yang, Simon Adrien Zaslawski

The benefits and limitations inherent to the 2D post-processing of measurements from Brillouin optical time-domain analyzers are investigated from a fundamental point of view. In a preliminary step, the impact of curve fitting on the precision of the estim ...

2020

Scaling up Kernel Ridge Regression via Locality Sensitive Hashing

Mikhail Kapralov, Amir Zandieh, Navid Nouri

Random binning features, introduced in the seminal paper of Rahimi and Recht '07, are an efficient method for approximating a kernel matrix using locality sensitive hashing. Random binning features provide a very simple and efficient way to approximate the ...

ADDISON-WESLEY PUBL CO2020

The n-term Approximation of Periodic Generalized Levy Processes

Michaël Unser, Julien René Pierre Fageot, John Paul Ward

In this paper, we study the compressibility of random processes and fields, called generalized Levy processes, that are solutions of stochastic differential equations driven by d-dimensional periodic Levy white noises. Our results are based on the estimati ...

SPRINGER/PLENUM PUBLISHERS2020

Optimized Wavelet Denoising for Self-Similar alpha-Stable Processes

Michaël Unser, Pedram Pad

We investigate the performance of wavelet shrinkage methods for the denoising of symmetric-a-stable (S alpha S) self-similar stochastic processes corrupted by additive white Gaussian noise (AWGN), where a is tied to the sparsity of the process. The wavelet ...

2017

Gaussian versus Sparse Stochastic Processes

Julien René Pierre Fageot

Although our work lies in the field of random processes, this thesis was originally motivated by signal processing applications, mainly the stochastic modeling of sparse signals. We develop a mathematical study of the innovation model, under which a signal ...

EPFL2017

Non-gaussianity of the critical 3d Ising model

Bernardo Zan

We discuss the 4pt function of the critical 3d Ising model, extracted from recent conformal bootstrap results. We focus on the non-gaussianity Q - the ratio of the 4pt function to its gaussian part given by three Wick contractions. This ratio reveals signi ...

2017

FIR filters for hardware-based real-time multi-band image blending

Yusuf Leblebici, Vladan Popovic

Creating panoramic images has become a popular feature in modern smart phones, tablets, and digital cameras. A user can create a 360 degree field-of-view photograph from only several images. Quality of the resulting image is related to the number of source ...

Spie-Int Soc Optical Engineering2015

Compute-and-Forward using nested linear codes for the Gaussian MAC

Michael Christoph Gastpar, Jingge Zhu

The classical modulo-lattice construction of Erez et al. has been successfully applied to several coding problems under Gaussian noise, including coding for computation over multiple-access channels (MAC). For the latter problem, an alternative constructio ...

2015

Solving the Shortest Vector Problem in 2^n Time via Discrete Gaussian Sampling

Divesh Aggarwal

We give a randomized 2^{n+o(n)}-time and space algorithm for solving the Shortest Vector Problem (SVP) on n-dimensional Euclidean lattices. This improves on the previous fastest algorithm: the deterministic O(4^n)-time and O(2^n)-space algorithm of Miccian ...

ACM2015

Modeling the Importance of Faces in Natural Images

Sabine Süsstrunk, Cheryl Shaulya Lau, Appu Shaji, Gökhan Yildirim, Bin Jin

In this work we study the varying importance of faces in images. Face importance is found to be affected by the size and number of faces present. We collected a dataset of 152 face images with faces in different size and number of faces. We conducted a cro ...

Spie-Int Soc Optical Engineering2015

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search