Publication

Compressive Source Separation: Theory and Methods for Hyperspectral Imaging

Publications associées (44)

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

3D Steerable Wavelets And Monogenic Analysis For Bioimaging

Michaël Unser

In this paper we introduce a 3D wavelet frame that has the key property of steerability. The proposed wavelet frame relies on the combination of a 3D isotropic wavelet transform with the 3D Riesz operator which brings steerability to the pyramid. The novel ...

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

3D Steerable Wavelets and Monogenic Analysis for Bioimaging

Michaël Unser

IEEE2011

Distributed Compressed Sensing of Hyperspectral Images via Blind Source Separation

Pierre Vandergheynst, Mohammad Golbabaee

This paper describes a novel framework for compressive sampling (CS) of multichannel signals that are highly dependent across the channels. In this work, we assume few number of sources are generating the multichannel observations based on a linear mixture ...

2010

Modeling and Flatness of Rigid and Flexible Cable Suspended Underactuated Robots

Philippe Müllhaupt, Basile Graf

A modeling framework is proposed for the control of rigid and flexible cable-like systems such as cranes, together with a systematic algorithm for computing flat outputs of mechanical systems for which the flat output is a linear combination of the free co ...

2010

Hyper-DEMIX: Blind Source Separation of Hyperspectral Images Using Local ML Estimates

We propose a new method to unmix hyperspectral images. Our method exploits the structure of the material abundance maps by assuming that in some regions of the spatial dimension, only one material is present. Such regions provide a local estimate of the en ...

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

Multichannel Compressed Sensing via Source Separation for Hyperspectral Images

Pierre Vandergheynst, Mohammad Golbabaee

This paper describes a novel framework for compressive sampling of multichannel signals that are highly correlated across the channels. In this work, we assume few number of independent sources are generating the multichannel observations based on a linear ...

2010

A fast daylight model suitable for embedded controllers

David Lindelöf

This paper describes a fast daylight model suitable or embedded daylight controllers. For a given room geometry (including position and tilt of venetian blinds, and the sun's position), the indoor illuminances are modeled as a linear combination of outdoor ...

2009

H-1 NMR spectroscopy of rat brain in vivo at 14.1 Tesla: Improvements in quantification of the neurochemical profile

Rolf Gruetter, Lijing Xin, Cristina Ramona Cudalbu

Ultra-short echo-time proton single voxel spectra of rat brain were obtained on a 14.1 T 26 cm horizontal bore system. At this field, the fitted linewidth in the brain tissue of adult rats was about 11 Hz. New, separated resonances ascribed to phosphocholi ...

2008

Super-resolution from unregistered aliased images

Patrick Vandewalle

Aliasing in images is often considered as a nuisance. Artificial low frequency patterns and jagged edges appear when an image is sampled at a too low frequency. However, aliasing also conveys useful information about the high frequency content of the image ...

EPFL2006

Kernel Matching Pursuit for Large Datasets

Jean-Philippe Thiran, Vlad Popovici

Kernel matching pursuit is a greedy algorithm for building an approximation of a discriminant function as a linear combination of some basis functions selected from a kernel-induced dictionary. Here we propose a modification of the kernel matching pursuit ...

2005