Publications related to Dual graph

Clustering with Multi-Layer Graphs: A Spectral Perspective

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...

Institute of Electrical and Electronics Engineers2012

Audio-Visual Object Extraction using Graph Cuts

Pierre Vandergheynst, Anna Llagostera Casanovas

We propose a novel method to automatically extract the audio-visual objects that are present in a scene. First, the synchrony between related events in audio and video channels is exploited to identify the possible locations of the sound sources. Video reg ...

Institute of Electrical and Electronics Engineers2012

Correlation-Aware Reconstruction of Network Coded Sources

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

In this paper, we consider the problem of decoding network coded correlated data when the decoder does not receive sufficient information for exact decoding. We propose an iterative decoding algorithm based on belief propagation that efficiently exploits t ...

2012

Hardness of Vertex Deletion and Project Scheduling

Ola Nils Anders Svensson

Assuming the Unique Games Conjecture, we show strong inapproximability results for two natural vertex deletion problems on directed graphs: for any integer k ≥ 2 and arbitrary small ε > 0, the Feedback Vertex Set problem and the DAG Vertex Deletion problem ...

Springer2012

Weakly regular subdivisions

Lionel Pournin

It is shown that 2-dimensional subdivisions can be made regular by moving their vertices within parallel 1-dimensional spaces. As a consequence, any 2-dimensional subdivision is projected from the boundary complex of a 4-polytope. ...

Springer-Verlag2012

Image Segmentation With Background Correction Using A Multiplicative Smoothing-Spline Model

Michaël Unser, Aurélien Bourquard, Ramtin Madani

This paper presents an image-segmentation method which compensates multiplicative distortions based on smooth regularity assumptions. In this work, we generalize the original Chan-Vese functional to handle a continuous multiplicative bias. In the derivatio ...

Ieee2012

Image Segmentation with Background Correction Using a Multiplicative Smoothing-Spline Model

Michaël Unser, Aurélien Bourquard, Ramtin Madani

This paper presents an image-segmentation method which compensates multiplicative distortions based on smooth regularity assumptions. In this work, we generalize the original Chan-Vese functional to handle a continuous multiplicative bias. In the derivati ...

IEEE2012

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian

N

-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset up ...

2012

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Christina Fragouli, Ayan Sengupta, I-Hsiang Wang

We evaluate the information-theoretic achievable rates of Quantize-Map-and-Forward (QMF) relaying schemes over Gaussian N-relay diamond networks. Focusing on vector Gaussian quantization at the relays, our goal is to understand how close to the cutset uppe ...

Ieee2012

Drawing planar graphs of bounded degree with few slopes

János Pach, Balázs Keszegh, Doemoetoer Palvoelgyi

We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different sl ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Dual graph

Graph Chatbot

Chat with Graph Search

Clustering with Multi-Layer Graphs: A Spectral Perspective

Audio-Visual Object Extraction using Graph Cuts

Correlation-Aware Reconstruction of Network Coded Sources

Hardness of Vertex Deletion and Project Scheduling

Weakly regular subdivisions

Image Segmentation With Background Correction Using A Multiplicative Smoothing-Spline Model

Image Segmentation with Background Correction Using a Multiplicative Smoothing-Spline Model

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Drawing planar graphs of bounded degree with few slopes

Audio-Visual Object Extraction using Graph Cuts

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Weakly regular subdivisions

Image Segmentation With Background Correction Using A Multiplicative Smoothing-Spline Model

Hardness of Vertex Deletion and Project Scheduling

Optimizing Quantize-Map-and-Forward Relaying for Gaussian Diamond Networks

Clustering with Multi-Layer Graphs: A Spectral Perspective

Image Segmentation with Background Correction Using a Multiplicative Smoothing-Spline Model

Drawing planar graphs of bounded degree with few slopes

Correlation-Aware Reconstruction of Network Coded Sources