Publication

Towards More Accurate and Efficient Beamformed Radio Interferometry Imaging

Related publications (104)

Graph Chatbot

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.

The Squares of Montchoisy. Notes for a History of the Open Form in Geneva

Elena Cogato Lanza

This paper deals with the ambivalent character of the neighborhood «Squares Montchoisy» built in Geneva between 1929 and 1957. According to visual representations (photographs and drawings) disseminated by the architect Maurice Braillard, the project embod ...

2014

Fourier Analysis Of Stationary Time Series In Function Space

Victor Panaretos, Shahin Tavakoli

We develop the basic building blocks of a frequency domain framework for drawing statistical inferences on the second-order structure of a stationary sequence of functional data. The key element in such a context is the spectral density operator, which gen ...

Institute of Mathematical Statistics2013

When crowding of crowding leads to uncrowding

Michael Herzog, Bilge Sayim, Mauro Manassi

In object recognition, features are thought to be processed in a hierarchical fashion from low-level analysis (edges and lines) to complex figural processing (shapes and objects). Here, we show that figural processing determines low-level processing. Verni ...

Association for Research in Vision and Ophthalmology2013

Fourier Approximation Of Symmetric Ideal Knots

Henryk Gerlach, Mathias Carlen

Enforcing a specific symmetry group on a curve, knotted or not, is not trivial using standard interpolations such as polygons or splines. For a prescribed symmetry group we present a symmetrization process based on a Fourier description of a knot. The pres ...

2012

Approximate Cloaking for the Full Wave Equation via Change of Variables

Hoài-Minh Nguyên

We study, in the context of the full wave equation, an approximate cloaking scheme that was previously considered for the Helmholtz equation [R. V. Kohn, D. Onofrei, M. S. Vogelius, and M. I. Weinstein, Comm. Pure Appl. Math., 63 (2010), pp. 973--1016, H.- ...

Society for Industrial and Applied Mathematics2012

MATHICSE Technical Report : Sparse spectral approximations for computing polynomial functionals

Fabio Nobile

We give a new fast method for evaluating sprectral approximations of nonlinear polynomial functionals. We prove that the new algorithm is convergent if the functions considered are smooth enough, under a general assumption on the spectral eigenfunctions th ...

MATHICSE2012

When crowding of crowding leads to uncrowding

Michael Herzog, Mauro Manassi

In peripheral crowding, target perception can be strongly deteriorated by nearby flankers. What happens if flanker “A” crowds flanker “B” and “B” crowds target “C”? At 9° eccentricity, we determined offset discrimination thresholds for verniers. When the v ...

2012

Applications of short space-time Fourier analysis in digital acoustics

Martin Vetterli, Francisco Pereira Correia Pinto

This paper presents a signal processing tool for analyzing and manipulating digitized acoustic wave fields, based on a spatio-temporal extension of the time-frequency representation space. The emphasis is on wave fields acquired with a 1-D linear array of ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Diffractionless Fourier Domain Microscopy

Theo Lasser, Rainer Leitgeb, Cédric Blatter, Tilman Schmoll

Several methods have been proposed and realized to increase the lateral resolution in microscopy and ultimately to beat the actual diffraction limit as stated by Abbe. Structured illumination for example enhances the lateral resolution by virtually extendi ...

2011

Chebyshev polynomial approximation for transductive learning on graphs

Nathanaël Perraudin

The goal of transductive learning is to find a way to recover the labels of lots of data with only a few known samples. In this work, we will work on graphs for two reasons. First, it’s possible to construct a graph from a given dataset with features. The ...

2011