Publication

A graph learning approach for light field image compression

Publications associées (37)

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

Graph-Based Representation and Coding of Multiview Images

Pascal Frossard, Bénédicte Motz

Instead of lossily coding depth images resulting in undesirable geometric distortion, graph-based representation (GBR) describes disparity information as a graph with a controllable accuracy. In this paper, we propose a more compact graphical representatio ...

Ieee2016

Tracking Time-Vertex Propagation using Dynamic Graph Wavelets

Nathanaël Perraudin, Benjamin Ricaud, Francesco Grassi

Graph Signal Processing generalizes classical signal processing to signal or data indexed by the vertices of a weighted graph. So far, the research efforts have been focused on static graph signals. However numerous applications involve graph signals evolv ...

2016

Objective and subjective evaluation of light field image compression algorithms

Touradj Ebrahimi, Martin Rerabek, Irene Viola

This paper reports results of subjective and objective quality assessments of responses to a grand challenge on light field image compression. The goal of the challenge was to collect and evaluate new compression algorithms for light field images. In total ...

2016

Luminance coding in graph-based representation of multiview images

Pascal Frossard, Thomas Maugey

Multi-view video transmission poses great challenges because of its data size and dimension. Therefore, how to design efficient 3D scene representations and coding (of luminance and geometry) has become a critical research topic. Recently, the graph-based ...

2014

Graph-Based vs Depth-Based Data Representation for Multiview Images

Pascal Frossard, Thomas Maugey

In this paper, we propose a representation and coding method for multiview images. As an alternative to depth-based schemes, we propose a representation that captures the geometry and the dependencies between pixels in different views in the form of connec ...

2013

Multiview image coding using graph-based approach

Pascal Frossard, Thomas Maugey

In this paper, we design a new approach for coding the geometry information in a multiview image scenario. As an alternative to depth-based schemes, we propose a representation that captures the dependencies between pixels in different frames in the form o ...

2013

Graph-based representation and coding of multiview geometry

Pascal Frossard, Thomas Maugey

We propose a new approach for describing the geometry information of multiview image representations. Rather than transmitting the raw geometry of the scene, under the form of depth information, we build a graph that represents the connections between corr ...

2013

Constrained Binary Identification Problem

Amin Karbasi, Morteza Zadimoghaddam

We consider the problem of building a binary decision tree, to locate an object within a set by way of the least number of membership queries. This problem is equivalent to the “20 questions game” of information theory and is closely related to lossless so ...

2013

Reduced-Dimension Linear Transform Coding of Correlated Signals in Networks

Michael Christoph Gastpar, Naveen Goela

A model called the linear transform network (LTN) is proposed to analyze the compression and estimation of correlated signals transmitted over directed acyclic graphs (DAGs). An LTN is a DAG network with multiple source and receiver nodes. Source nodes tra ...

Institute of Electrical and Electronics Engineers2012

Space crossing numbers

We define the crossing number for an embedding of a graph G into R^3, and prove a lower bound on it which almost implies the classical crossing lemma. We also give sharp bounds on the space crossing numbers of pseudo-random graphs. ...

2011