Rohan Varma
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Rohan Varma has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Jelena Kovacevic
New York University Tandon School of Engineering, Brooklyn, NY, USA
2 shared publications - Siheng Chen
Shanghai Jiao Tong University, Shanghai, China
2 shared publications - Aarti Singh
Carnegie Mellon University, Pittsburgh, Pennsylvania, USA
1 shared publication
Latest Publications
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Graph topology recovery for regular and irregular graphs
In this paper, we study the recovery of the graph topology or structure. We first extend our previous work on graph signal recovery to present a joint graph signal and structure recovery framework. By doing this, we allow the algorithm to learn a graph structure from noisy and incomplete graph signals and recover the graph signals at the same time. In this paper, we particularly focus on the specific subproblem of graph structure learning and develop algorithms towards this problem and analyze them. We briefly study the implications when the underlying true graph structure is irregular or regular. Finally, we validate the proposed methods for both synthetic data and the real-world recovery problem of semi-supervised digit-image classification.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Graph topology recovery for regular and irregular graphs
In this paper, we study the recovery of the graph topology or structure. We first extend our previous work on graph signal recovery to present a joint graph signal and structure recovery framework. By doing this, we allow the algorithm to learn a graph structure from noisy and incomplete graph signals and recover the graph signals at the same time. In this paper, we particularly focus on the specific subproblem of graph structure learning and develop algorithms towards this problem and analyze them. We briefly study the implications when the underlying true graph structure is irregular or regular. Finally, we validate the proposed methods for both synthetic data and the real-world recovery problem of semi-supervised digit-image classification.
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6370-6374
Representations of piecewise smooth signals on graphs
We study representations of piecewise-smooth signals on graphs. We first define classes for smooth, piecewise-constant, and piecewise-smooth graph signals, followed by a series of multiresolution local sets to analyze those signals by implementing a multiresolution analysis on graphs. Based on these local sets, we propose local-set-based piecewise-constant and piecewise-smooth dictionaries as graph signal representations that, in spirit, resemble the classical Haar wavelet basis and are naturally localized in both graph vertex and graph Fourier domains. Moreover, they promote sparsity when representing piecewise-smooth graph signals. In the experiments, we show that local-set-based dictionaries outperform graph Fourier domain based representations when approximating both simulated and real-world graph signals.
- 1 March 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 6370-6374
Representations of piecewise smooth signals on graphs
We study representations of piecewise-smooth signals on graphs. We first define classes for smooth, piecewise-constant, and piecewise-smooth graph signals, followed by a series of multiresolution local sets to analyze those signals by implementing a multiresolution analysis on graphs. Based on these local sets, we propose local-set-based piecewise-constant and piecewise-smooth dictionaries as graph signal representations that, in spirit, resemble the classical Haar wavelet basis and are naturally localized in both graph vertex and graph Fourier domains. Moreover, they promote sparsity when representing piecewise-smooth graph signals. In the experiments, we show that local-set-based dictionaries outperform graph Fourier domain based representations when approximating both simulated and real-world graph signals.