Multichannel Compressed Sensing via Source Separation for Hyperspectral Images
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.
Understanding the functional dynamics of ligand-gated ion-channels (LGIC's) on the molecular level is the aim of this thesis. Members of the protein family of LGIC's are involved in the fast synaptic signal transmission and thereby play a central role in i ...
We investigate in the present work the fabrication of polymer-based micro-fluidic and micro-mechanical devices using sacrificial, resistive/conductive pastes, through a screen-printing process. An organic sacrificial paste is first screen-printed onto a su ...
Elsevier Science, Reg Sales Off, Customer Support Dept, 655 Ave Of The Americas, New York, Ny 10010 Usa2010
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
A generalization of Arikan's polar code construction using transformations of the form G(circle times n) where G is an l x l matrix is considered. Necessary and sufficient conditions are given for these transformations to ensure channel polarization. It is ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
This paper provides new results on computing simultaneous sparse approximations of multichannel signals over redundant dictionaries using two greedy algorithms. The first one, p-thresholding, selects the S atoms that have the largest p-correlation while ...
Confidential communication aided by a relay without security clearance is studied. General strategies and outer bounds are derived for the problem of secret communication and secret key generation when correlated observations at all terminals are available ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009
The estimation of doubly-selective channels is challenging since long channel impulse response should be estimated with a fast tracking speed. Provided that a structure of the channel response is sparse, i.e., only a few of channel gains are nonzero, a tra ...
An apparatus for manipulating fluid samples comprises a micro-chip device having first and second covered channels, each channel having openings at both ends. The channels intersect to form a common intersection. Three of the openings of the channels are c ...
This article treats the problem of learning a dictionary providing sparse representations for a given signal class, via ell1 minimisation, or more precisely the problem of identifying a dictionary dico from a set of training samples Y knowing that $ ...
Burnashev in 1976 gave an exact expression for the reliability function of a discrete memoryless channel (DMC) with noiseless feedback. A coding scheme that achieves this exponent needs, in general, to know the statistics of the channel. Suppose now that t ...
