FWFen Wang

Fen Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Fen Wang has a total of 21 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Fast Kernel-Based Sampling of Graph Signals Using Localized Graph Filter Impulse Responses

    by Fen Wang, Cheng Yang, Wuyue Zhang, Xue Zhang, Baoyi Xu

    Kernel-based reconstruction of graph signals was extensively studied in graph signal processing domain, which has been which has been verified to be efficient for real-world applications. However, a fast sampling approach under the kernel-based assumption is still missing in this field, that can further improve the reconstruction performance. In this paper, we will propose an eigen-decomposition-free (ED-free) sampling method for general kernel-based graph signals. We first define graph signals as vectors in reproducing kernel Hilbert space (RKHS), and then introduce an explicit kernel-based recovery method. Then, we focus on the A-optimal sampling function on submatrix of a constantly shifted kernel matrix to stabilize the recovery performance. For fast optimization, we define node-dependent vectors called localized graph filter impulse responses (LogFIRs)—the impulse responses of square root of kernel matrix, which can be estimated fast without ED. Using these vectors, we reformulate our sampling objective and develop a low-complexity algorithm to evaluate nodes via only simple scalar multiplications. Further, we find that the proposed algorithm tends to sample nodes whose supported LogFIRs are as orthogonal as possible. Besides, we prove that our proposed sampling method can improve the recovery performance of graph signals under bandlimited and smooth models via exquisitely choosing specific kernels. Finally, extensive simulations on synthetic and real-world graph signals have validated that our proposed method achieves state-of-the-art execution time and has superior reconstruction performance compared to other deterministic sampling alternatives.

  • Fast MSE-Based Sampling of Bandlimited Graph Signals via Low-Pass Impulse Responses

    by Fen Wang, Gene Cheung, Minxiang Ye, Taihao Li, Yi-Tian Feng

    Sampling is a fundamental problem in graph signal processing that selects a node subset to collect samples, so that data in the remaining nodes can be well recovered. Existing eigen-decomposition-free (ED-free) graph sampling schemes are not designed to minimize mean square error (MMSE) of reconstructed bandlimited graph signals, often resulting in sub-par MSE performance. In this paper, we propose a lightweight ED-free algorithm to minimize an approximate MSE objective using per-node impulse responses of an ideal low-pass graph filter. Specifically, we first derive a proxy of the MMSE greedy sampling objective without matrix inverse. We then define node-dependent impulse responses of an ideal low-pass graph filter—analogous to the sinc function in traditional signal processing—which can be approximated very fast without ED. We use these response vectors to reformulate our derived sampling objective, then show that the optimal sampling set has supported low-pass impulse responses that are as orthogonal as possible—defaulting to uniform sampling for 1D regular kernels when the graph Fourier basis is DFT. For optimization, we propose a fast sampling algorithm to evaluate candidates via vector-vector multiplications by reusing previous greedy results. For faster sampling, we relax the MMSE-based greedy objective to a bounded approximation, so that candidate nodes can be easily appraised using simple scalar multiplications. Extensive experiments show that our sampling method achieved state-of-the-art sampling speed and had the best MSE performance among deterministic ED-free sampling methods in various scenarios.


  • Fast Sampling and Reconstruction for Linear Inverse Problems: From Vectors to Tensors

    by Fen Wang, Gene Cheung, Taihao Li, Ying Du, Yu-Ping Ruan

    Signals typical in the real world have different modes, expressed as vectors, matrices, or higher-order tensors. In practice, a target signal is commonly assumed to be linear in the residing factor mode(s) with low-dimensional parameters, and thus can be recovered from partial samples by solving a linear inverse problem (LIP). Sampling for LIPs is to partially query signals for better recovery. There exist many fast sampling methods for vector signals, but they are not applicable for higher-order tensors due to high computation and storage costs. In this paper, we propose a fast sampling algorithm for vector signals first and then extend it to sample tensors with low complexity. Specifically, a tensor signal with $R$ modes is modelled as multilinear on $R$ factor matrices ${\mathbf \{U_{i}\}}^{R}_{i=1}$, whose vectorized version is linear on a matrix $\pmb {\Phi }$—the Kronecker product of $\mathbf {U}_{i}$'s. Thus, it can be estimated from partial noisy samples via the least-squares (LS) method, where the mean square error (MSE) depends on chosen samples and matrix $\pmb {\Phi }$. Instead of MSE, we minimize a modified MSE problem and prove it has the same optimal and greedy solutions to a problem with a sample-dependent sub-matrix of $\pmb {\Phi }\pmb {\Phi }^\top$. For one-order vector signals, where $\pmb {\Phi }=\mathbf {U}_{1}$ is given, we propose a fast algorithm to solve the sampling problem via simple vector-vector multiplications based on a matrix inversion formula and greedy solution reuse. For higher-order tensors, we extend our sampling algorithm to select entries by addressing matrices $\mathbf {U}_{i}$'s directly, thus removing the burden of obtaining $\pmb {\Phi }$ explicitly. Accompanying our sampling strategy, we propose an iterative reconstruction scheme to estimate the LS solution. Experiments on synthetic and real-world signals from vectors to tensors validated the performance and efficacy of our strategy compared to previous methods.


  • Surface engineering of Ti3C2Tx MXene by oxygen plasma irradiation as room temperature ethanol sensor

    by Zijing Wang, Fen Wang, Angga Hermawan, Jianfeng Zhu, Shu Yin

    In this work, a surface modification strategy by oxygen plasma irradiation was introduced for the first time to significantly improve the room temperature sensing performance of Ti3C2T[ ] MXene. Oxygen plasma irradiation induced TiO2formation on the Ti3C2T[ ] surface, produced lattice distortion, increased the specific surface area, and provided mesoporous structures. The gas sensitivity performance characterization results show the gas response value of Ti3C2T[ ] irradiated for 0.5 h (Ti3C2T[ ]0.5P) was hundreds of times better than the pristine Ti3C2T[ ]alongside with its sufficient response time (280 s) and rapid recovery time (11 s). The excellent sensing performance is attributed to the formation of more reactive sites on the edge and basal planes of Ti3C2T[ ] and mesoporous structures which greatly improved the adsorption of ethanol. Additionally, the relatively low work function of TiO2facilitates the formation of a Schottky junction for easy migration of charge carrier, the thereby shortening the sensing response time. This strategy offers a facile and controllable surface modification of other 2D materials, without damaging their structures.


  • Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift

    by Fen Wang, Yongchao Wang, Gene Cheung, Cheng Yang

    Matrix completion algorithms fill missing entries in a large matrix given a subset of observed samples. The problem of how to pre-select a subset of entries for sampling to maximize the reconstructed matrix fidelity is largely unaddressed. In this paper, we propose two sampling algorithms to tackle this problem: (i) a fast base sampling algorithm on general single graphs, and (ii) an extended sampling algorithm from the base algorithm for active matrix completion. Assuming the double graph smoothness prior where rows / columns of the matrix signal are smooth with respect to row / column factor graphs, we first show that a matrix signal can be recovered from partial observations by solving a system of linear equations ${\mathbf Q}{\mathbf x}={\mathbf y}$ , where the sought matrix is vectorized as ${\mathbf x}$ and interpreted as a signal residing on a single graph. On this single graph, to promote small reconstruction error and stability of the linear system, we maximize the smallest eigenvalue $\lambda _{\min }$ of ${\mathbf Q}$ by greedily selecting samples corresponding to the largest magnitude entries in the first eigenvectors of ${\mathbf Q}$ , based on a corollary of the Gershgorin circle theorem. Extending to the active matrix completion case, we alternately choose entries in the rows and columns corresponding to the largest magnitude entries in the first eigenvectors of the row / column coefficient matrices ${\mathbf Q}_r$ and ${\mathbf Q}_c$ . Our algorithm benefits computationally from warm start as the first eigenvectors are computed recurrently for more samples. Extensive experiments on both synthetic and real-world datasets show that our extended graph sampling algorithm outperforms existing sampling schemes for matrix completion, when combined with a range of modern matrix completion algorithms.


  • Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment

    by Yuanchao Bai, Fen Wang, Gene Cheung, Yuji Nakatsukasa, Wen Gao

    Graph sampling set selection, where a subset of nodes are chosen to collect samples to reconstruct a bandlimited or smooth graph signal, is a fundamental problem in graph signal processing (GSP). Previous works employ an unbiased least square (LS) signal reconstruction scheme and select samples via expensive extreme eigenvector computation. Instead, we assume a biased graph Laplacian regularization (GLR) based scheme that solves a system of linear equations for reconstruction. We then choose samples to minimize the condition number of the coefficient matrix---specifically, maximize the smallest eigenvalue ${\lambda_{min}}$ . Circumventing explicit eigenvalue computation, we maximize instead the lower bound of ${\lambda_{min}}$ , designated by the smallest left-end of all Gershgorin discs of the matrix. To achieve this efficiently, we first convert the optimization to a dual problem, where we minimize the number of samples needed to align all Gershgorin disc left-ends at a chosen lower-bound target T. Algebraically, the dual problem amounts to optimizing two disc operations: i) shifting of disc centers due to sampling, and ii) scaling of disc radii due to a similarity transformation of the matrix. We further reinterpret the dual to an intuitive disc coverage problem bearing strong resemblance to the famous NP-hard set cover (SC) problem. The reinterpretation enables us to derive a fast approximation algorithm from a known SC error-bounded approximation algorithm. We find the appropriate target ${T}$ efficiently via binary search. Experiments on real graph data show that our disc-based sampling algorithm runs substantially faster than existing sampling schemes and outperforms other eigen-decomposition-free sampling schemes in reconstruction error.


  • Open Access

    Fast Graph Sampling Set Selection Using Gershgorin Disc Alignment

    by Yuanchao Bai, Fen Wang, Gene Cheung, Yuji Nakatsukasa, Wen Gao

    Graph sampling set selection, where a subset of nodes are chosen to collect samples to reconstruct a smooth graph signal, is a fundamental problem in graph signal processing (GSP). Previous works employ an unbiased least-squares (LS) signal reconstruction scheme and select samples via expensive extreme eigenvector computation. Instead, we assume a biased graph Laplacian regularization (GLR) based scheme that solves a system of linear equations for reconstruction. We then choose samples to minimize the condition number of the coefficient matrix---specifically, maximize the smallest eigenvalue $\lambda_{\min}$. Circumventing explicit eigenvalue computation, we maximize instead the lower bound of $\lambda_{\min}$, designated by the smallest left-end of all Gershgorin discs of the matrix. To achieve this efficiently, we first convert the optimization to a dual problem, where we minimize the number of samples needed to align all Gershgorin disc left-ends at a chosen lower-bound target $T$. Algebraically, the dual problem amounts to optimizing two disc operations: i) shifting of disc centers due to sampling, and ii) scaling of disc radii due to a similarity transformation of the matrix. We further reinterpret the dual as an intuitive disc coverage problem bearing strong resemblance to the famous NP-hard set cover (SC) problem. The reinterpretation enables us to derive a fast approximation scheme from a known SC error-bounded approximation algorithm. We find an appropriate target $T$ efficiently via binary search. Extensive simulation experiments show that our disc-based sampling algorithm runs substantially faster than existing sampling schemes and outperforms other eigen-decomposition-free sampling schemes in reconstruction error.

  • Open Access

    Graph Sampling for Matrix Completion Using Recurrent Gershgorin Disc Shift

    by Fen Wang, Yongchao Wang, Gene Cheung, Cheng Yang

    Matrix completion algorithms fill missing entries in a large matrix given a subset of observed samples. However, how to best pre-select informative matrix entries given a sampling budget is largely unaddressed. In this paper, we propose a fast sample selection strategy for matrix completion from a graph signal processing perspective. Specifically, we first regularize the matrix reconstruction objective using a dual graph signal smoothness prior, resulting in a system of linear equations for solution. We then select appropriate samples to maximize the smallest eigenvalue $\lambda_{\min}$ of the coefficient matrix, thus maximizing the stability of the linear system. To efficiently solve this combinatorial problem, we derive a greedy sampling strategy, leveraging on Gershgorin circle theorem, that iteratively selects one sample (equivalent to shifting one Gershgorin disc) at a time corresponding to the largest magnitude entry in the first eigenvector of a modified graph Laplacian matrix. Our algorithm benefits computationally from warm start as the first eigenvectors of incremented Laplacian matrices are computed recurrently for more samples. To achieve computation scalability when sampling large matrices, we further rewrite the coefficient matrix as a sum of two separate components, each of which exhibits block-diagonal structure that we exploit for alternating block-wise sampling. Extensive experiments on both synthetic and real-world datasets show that our graph sampling algorithm substantially outperforms existing sampling schemes for matrix completion and reduces the completion error, when combined with a range of modern matrix completion algorithms.

  • Low-complexity Graph Sampling With Noise and Signal Reconstruction via Neumann Series

    by Fen Wang, Gene Cheung, Yongchao Wang

    Graph sampling addresses the problem of selecting a node subset in a graph to collect samples, so that a $K$ -bandlimited signal can be reconstructed in high fidelity. Assuming an independent and identically distributed (i.i.d.) noise model, minimizing the expected mean square error (MMSE) leads to the known A-optimality criterion for graph sampling, which is expensive to compute and difficult to optimize. In this paper, we propose an augmented objective based on Neumann series that well approximates the original criterion and is amenable to greedy optimization. Specifically, we show that a shifted A-optimal criterion can be equivalently written as a function of an ideal low-pass (LP) graph filter, which in turn can be approximated efficiently via fast graph Fourier transform (FGFT). Minimizing the new objective, we select nodes greedily without large matrix inversions using a matrix inverse lemma. Further, for the dynamic network case where node availability varies across time, we propose an extended sampling strategy that replaces offline samples one-by-one in the selected set. For signal reconstruction, we propose an accompanied biased signal recovery strategy that reuses the approximated filter from sampling. Experiments show that our reconstruction is more robust to large noise than the least square (LS) solution, and our sampling strategy far outperforms several existing schemes.


  • Open Access

    Low-complexity Graph Sampling with Noise and Signal Reconstruction via Neumann Series

    by Fen Wang, Gene Cheung, Yongchao Wang

    Graph sampling addresses the problem of selecting a node subset in a graph to collect samples, so that a K-bandlimited signal can be reconstructed in high fidelity. Assuming an independent and identically distributed (i.i.d.) noise model, minimizing the expected mean square error (MMSE) leads to the known A-optimality criterion for graph sampling, which is expensive to compute and difficult to optimize. In this paper, we propose an augmented objective based on Neumann series that well approximates the original criterion and is amenable to greedy optimization. Specifically, we show that a shifted A-optimal criterion can be equivalently written as a function of an ideal low-pass (LP) graph filter, which in turn can be approximated efficiently via fast graph Fourier transform (FGFT). Minimizing the new objective, we select nodes greedily without large matrix inversions using a matrix inverse lemma. Further, for the dynamic network case where node availability varies across time, we propose an extended sampling strategy that replaces offline samples one-by-one in the selected set. For signal reconstruction, we propose an accompanied biased signal recovery strategy that reuses the approximated filter from sampling. Experiments show that our reconstruction is more robust to large noise than the least square (LS) solution, and our sampling strategy far outperforms several existing schemes.