Studying Error Resilience Performance for a Feedback Channel Based Transform Domain Wyner-Ziv Video Codec

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.

In the era of big data, new transportation-related concepts and methodologies need to be proposed for understanding how congestion propagates. pNEUMA, a unique dataset that was acquired during a first-of-its-kind experiment with a swarm of drones over a de ...

There has been growing interest in studying connections between generalization error of learning algorithms and information measures. In this work, we generalize a result that employs the maximal leakage, a measure of leakage of information, and explore ho ...

Real-time video transcoding has recently raised as a valid alternative to address the ever-increasing demand for video contents in servers' infrastructures in current multi-user environments. High Efficiency Video Coding (HEVC) makes efficient online trans ...

During the last twenty years, Random matrix theory (RMT) has produced numerous results that allow a better understanding of large random matrices. These advances have enabled interesting applications in the domain of communication. Although this theory can ...

Fatigue safety verification of existing bridges that uses ‘‘re-calculation’’ based on codes, usually results in insufficient fatigue safety, triggering invasive interventions. Instead of “re-calculation”, Structural Health Monitoring (SHM) should be used f ...

The increasing ubiquity of edge devices in the consumer market, along with their ever more computationally expensive workloads, necessitate corresponding increases in computing power to support such workloads. In-memory computing is attractive in edge devi ...

We study lossy gradient compression methods to alleviate the communication bottleneck in data-parallel distributed optimization. Despite the significant attention received, current compression schemes either do not scale well, or fail to achieve the target ...

In his landmark paper "A Mathematical Theory of Communication," the founding father of information theory and coding theory, Claude E. Shannon, established the largest rate at which reliable communication is possible and he revealed that the key to this re ...

Covariance operators are fundamental in functional data analysis, providing the canonical means to analyse functional variation via the celebrated Karhunen-Loeve expansion. These operators may themselves be subject to variation, for instance in contexts wh ...

Polar codes are capacity-achieving error-correcting codes with an explicit construction that can be decoded with low-complexity algorithms. In this work, we show how the state-of-the-art low-complexity decoding algorithm can be improved to better accommoda ...

Studying Error Resilience Performance for a Feedback Channel Based Transform Domain Wyner-Ziv Video Codec

Chat with Graph Search

Lane Detection and Lane Changing Phenomena Identification with Data from a Swarm of Drones

Learning and Adaptive Data Analysis via Maximal Leakage

MAMUT: Multi-Agent Reinforcement Learning for Efficient Real-Time Multi-User Video Transcoding

Statistical Applications of Random Matrix Theory: Comparison of Two Populations

Quantification of the conditional value of SHM data for the fatigue safety evaluation of a road viaduct

BLADE: A BitLine Accelerator for Devices on the Edge

PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimization

From LDPC Block to LDPC Convolutional Codes: Capacity, Stability, and Universality

Procrustes Metrics on Covariance Operators and Optimal Transportation of Gaussian Processes

Fast Low-Complexity Decoders for Low-Rate Polar Codes