Ali Khodabakhsh

Ali Khodabakhsh

Auto-generated profile, based on publicly available information

Ali Khodabakhsh

University of Texas at Austin 78712 Austin TX USA

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 December 2018 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
RSRasoul Shafipour
Rasoul Shafipour
AKAli Khodabakhsh
Ali Khodabakhsh
Gonzalo MateosGonzalo Mateos
Gonzalo Mateos
ENEvdokia Nikolova
Evdokia Nikolova
We study the problem of constructing a graph Fourier transform (GFT) for directed graphs (digraphs), which decomposes graph signals into different modes of variation with respect to the underlying network. Accordingly, to capture low, medium and high frequencies we seek a digraph (D)GFT such that the orthonormal frequency components are as spread as possible in the graph spectral domain. To that end, we advocate a two-step design whereby we: (i) find the maximum directed variation (i.e., a novel notion of frequency on a digraph) a candidate basis vector can attain; and (ii) minimize a smooth spectral dispersion function over the achievable frequency range to obtain the desired spread DGFT basis. Both steps involve non-convex, orthonormality-constrained optimization problems, which are efficiently tackled via a feasible optimization method on the Stiefel manifold that provably converges to a stationary solution. We also propose a heuristic to construct the DGFT basis from Laplacian eigenvectors of an undirected version of the digraph. We show that the spectral-dispersion minimization problem can be cast as supermodular optimization over the set of candidate frequency components, whose orthonormality can be enforced via a matroid basis constraint. This motivates adopting a scalable greedy algorithm to obtain an approximate solution with quantifiable worst-case spectral dispersion. We illustrate the effectiveness of our DGFT algorithms through numerical tests on synthetic and real-world networks. We also carry out a graph-signal denoising task, whereby the DGFT basis is used to decompose and then low-pass filter temperatures recorded across the United States.

8 February 2021 in Mathematical Programming
Verified
Journal Article
Closed access
PDF file
SGSwati Gupta
Swati Gupta
AKAli Khodabakhsh
Ali Khodabakhsh
HMHassan Mortagy
Hassan Mortagy
ENEvdokia Nikolova
Evdokia Nikolova

1 May 2019
Verified
Conference Paper
Closed access
RSRasoul Shafipour
Rasoul Shafipour
AKAli Khodabakhsh
Ali Khodabakhsh
Gonzalo MateosGonzalo Mateos
Gonzalo Mateos
We propose a methodology to carry out vertex-frequency analyses of graph signals, with the goal of unveiling the signal's frequency occupancy over a localized region in the network. To this end, we first introduce localized graph signals in the vertex domain, by defining windows that are localized around each node by construction. Recent directed graph Fourier transform (DGFT) advances facilitate the frequency analysis of said localized signals, to reveal the signal's energy distribution in a way akin to a spectrogram in the vertex-frequency plane. We then learn a set of windows by applying gradient descent method to an optimization problem governed by penalty parameters in the spectral domain. We also argue about the tradeoff between the resolution in the vertex and frequency domains based on the said parameters. We evaluate the performance of the proposed windowed GFT approach through numerical experiments on synthetic and real-world graphs.

23 September 2018 in arXiv
Verified
Preprint
Open access
PDF file
RSRasoul Shafipour
Rasoul Shafipour
AKAli Khodabakhsh
Ali Khodabakhsh
Gonzalo MateosGonzalo Mateos
Gonzalo Mateos
ENEvdokia Nikolova
Evdokia Nikolova
We study the problem of constructing a graph Fourier transform (GFT) for directed graphs (digraphs), which decomposes graph signals into different modes of variation with respect to the underlying network. Accordingly, to capture low, medium and high frequencies we seek a digraph (D)GFT such that the orthonormal frequency components are as spread as possible in the graph spectral domain. To that end, we advocate a two-step design whereby we: (i) find the maximum directed variation (i.e., a novel notion of frequency on a digraph) a candidate basis vector can attain; and (ii) minimize a smooth spectral dispersion function over the achievable frequency range to obtain the desired spread DGFT basis. Both steps involve non-convex, orthonormality-constrained optimization problems, which are efficiently tackled via a provably convergent, feasible optimization method on the Stiefel manifold. We also propose a heuristic to construct the DGFT basis from Laplacian eigen-vectors of an undirected version of the digraph. We show that the spectral-dispersion minimization problem can be cast as supermodular optimization over the set of candidate frequency components, whose orthonormality can be enforced via a matroid basis constraint. This motivates adopting a scalable greedy algorithm to obtain an approximate solution with quantifiable worst-case spectral dispersion. We illustrate the effectiveness of our DGFT algorithms through numerical tests on synthetic and real-world networks. We also carry out a graph-signal denoising task, whereby the DGFT basis is used to decompose and then low-pass filter temperatures recorded across the United States.

26 August 2023
Verified
Book Chapter
Closed access
PDF file
YWYutong Wu
Yutong Wu
AKAli Khodabakhsh
Ali Khodabakhsh
Bo LiBo Li
Bo Li
ENEvdokia Nikolova
Evdokia Nikolova
EPEmmanouil Pountourakis
Emmanouil Pountourakis

4 September 2023
Verified
Book Chapter
Closed access
PDF file
AKAli Khodabakhsh
Ali Khodabakhsh
ENEvdokia Nikolova
Evdokia Nikolova
EPEmmanouil Pountourakis
Emmanouil Pountourakis
JHJimmy Horn
Jimmy Horn