Publications associées à Multisample anti-aliasing

Motif Cut Sparsifiers

Mikhail Kapralov, Mikhail Makarov, Jakab Tardos

A motif is a frequently occurring subgraph of a given directed or undirected graph G (Milo et al.). Motifs capture higher order organizational structure of G beyond edge relationships, and, therefore, have found wide applications such as in graph clusterin ...

IEEE COMPUTER SOC2022

Automated Daylighting Control System based on Sky Luminance Monitoring and Lighting Computing

Yujie Wu

Sufficient daylight exposure contributes to occupants' productivity and health in buildings. However, excessive daylight ingress induces discomfort glare and increases the cooling load in warm seasons. The performance of manual shading systems is limited b ...

EPFL2019

Near-Infrared Fusion for Photorealistic Image Dehazing

Sabine Süsstrunk, Majed El Helou, Frederike Dümbgen, Natalija Gucevska

Scattering of light due to the presence of aerosol particles along the path of radiation causes atmospheric haze in images. This scattering is significantly less severe in longer wavelength bands than in shorter ones, thus the importance of near-infrared ( ...

2018

Learning Data Triage: Linear Decoding Works for Compressive MRI

Volkan Cevher, Yen-Huan Li

The standard approach to compressive sampling considers recovering an unknown deterministic signal with certain known structure, and designing the sub-sampling pattern and recovery algorithm based on the known structure. This approach requires looking for ...

Ieee2016

An Inner-Product Calculus for Periodic Functions and Curves

Michaël Unser, Daniel Andreas Schmitter, Anaïs Laure Marie-Thérèse Badoual

Our motivation is the design of efficient algorithms to process closed curves represented by basis functions or wavelets. To that end, we introduce an inner-product calculus to evaluate correlations and

L _{ 2 }

distances between such curves. In partic ...

IEEE Institute of Electrical and Electronics Engineers2016

A Fast Hadamard Transform for Signals with Sub-linear Sparsity in the Transform Domain

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

In this paper, we design a new iterative low-complexity algorithm for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT. We suppose that N is a power of two and K = O(N^α), scales sub-linearly in N for some α ∈ (0, ...

Institute of Electrical and Electronics Engineers2015

Jaggies as aliasing or reconstruction phenomena: a tutorial

Roger Hersch, Isaac Amidror

Jaggies (staircasing effects) along slanted lines or curved edges are omnipresent in digital imaging. They are so widespread in digital display devices that very often they are associated with the modern "computerized" world (and sometimes even intentional ...

Is&T & Spie2014

Sampling and Reconstruction of Spatial Fields using Mobile Sensors

Martin Vetterli, Jayakrishnan Unnikrishnan

Spatial sampling is traditionally studied in a static setting where static sensors scattered around space take measurements of the spatial field at their locations. In this paper we study the emerging paradigm of sampling and reconstructing spatial fields ...

Institute of Electrical and Electronics Engineers2013

A Fast Hadamard Transform for Signals with Sub-linear Sparsity

Martin Vetterli, Robin Scheibler, Saeid Haghighatshoar

A new iterative low complexity algorithm has been presented for computing the Walsh-Hadamard transform (WHT) of an N dimensional signal with a K-sparse WHT, where N is a power of two and K = O(N^α), scales sub- linearly in N for some 0 < α < 1. Assuming a ...

2013

Realistic Analytical Phantoms for Parallel Magnetic Resonance Imaging

Michaël Unser, Matthieu Guerquin-Kern

The quantitative validation of reconstruction algorithms requires reliable data. Rasterized simulations are popular but they are tainted by an aliasing component that impacts the assessment of the performance of reconstruction. We introduce analytical simu ...

Institute of Electrical and Electronics Engineers2012