Sparse representation on graphs by tight wavelet frames and applications

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

In this paper, we introduce a new (constructive) characterization of tight wavelet frames on non-flat domains in both continuum setting, i.e. on manifolds, and discrete setting, i.e. on graphs; we discuss how fast tight wavelet frame transforms can be computed and how they can be effectively used to process graph data. We start with defining the quasi-affine systems on a given manifold M. The quasi-affine system is formed by generalized dilations and shifts of a finite collection of wavelet functions Ψ:={ψj:1≤j≤r}⊂L2(R). We further require that ψj is generated by some refinable function ϕ{symbol} with mask aj. We present the condition needed for the masks {aj:0≤j≤r}, as well as regularity conditions needed for ϕ{symbol} and ψj, so that the associated quasi-affine system generated by Ψ is a tight frame for L2(M). The condition needed for the masks is a simple set of algebraic equations which are not only easy to verify for a given set of masks {aj}, but also make the construction of {aj} entirely painless. Then, we discuss how the transition from the continuum (manifolds) to the discrete setting (graphs) can be naturally done. In order for the proposed discrete tight wavelet frame transforms to be useful in applications, we show how the transforms can be computed efficiently and accurately by proposing the fast tight wavelet frame transforms for graph data (WFTG). Finally, we consider two specific applications of the proposed WFTG: graph data denoising and semi-supervised clustering. Utilizing the sparse representation provided by the WFTG, we propose ℓ1-norm based optimization models on graphs for denoising and semi-supervised clustering. On one hand, our numerical results show significant advantage of the WFTG over the spectral graph wavelet transform (SGWT) by [1] for both applications. On the other hand, numerical experiments on two real data sets show that the proposed semi-supervised clustering model using the WFTG is overall competitive with the state-of-the-art methods developed in the literature of high-dimensional data classification, and is superior to some of these methods.

Original languageEnglish (US)
JournalApplied and Computational Harmonic Analysis
DOIs
StateAccepted/In press - Nov 13 2014
Externally publishedYes

Fingerprint

Wavelet Frames
Tight Frame
Sparse Representation
Masks
Graph in graph theory
Transform
Semi-supervised Clustering
Affine Systems
Mask
Wavelet transforms
Denoising
Continuum
Refinable Functions
Data Classification
High-dimensional Data
Experiments
Regularity Conditions
Dilation
Optimization Model
Algebraic Equation

Keywords

  • Big data
  • Graph clustering
  • Sparse approximation on graphs
  • Spectral graph theory
  • Tight wavelet frames

ASJC Scopus subject areas

  • Applied Mathematics

Cite this

@article{d874f19c08794274b5aefbd345ef4f47,
title = "Sparse representation on graphs by tight wavelet frames and applications",
abstract = "In this paper, we introduce a new (constructive) characterization of tight wavelet frames on non-flat domains in both continuum setting, i.e. on manifolds, and discrete setting, i.e. on graphs; we discuss how fast tight wavelet frame transforms can be computed and how they can be effectively used to process graph data. We start with defining the quasi-affine systems on a given manifold M. The quasi-affine system is formed by generalized dilations and shifts of a finite collection of wavelet functions Ψ:={ψj:1≤j≤r}⊂L2(R). We further require that ψj is generated by some refinable function ϕ{symbol} with mask aj. We present the condition needed for the masks {aj:0≤j≤r}, as well as regularity conditions needed for ϕ{symbol} and ψj, so that the associated quasi-affine system generated by Ψ is a tight frame for L2(M). The condition needed for the masks is a simple set of algebraic equations which are not only easy to verify for a given set of masks {aj}, but also make the construction of {aj} entirely painless. Then, we discuss how the transition from the continuum (manifolds) to the discrete setting (graphs) can be naturally done. In order for the proposed discrete tight wavelet frame transforms to be useful in applications, we show how the transforms can be computed efficiently and accurately by proposing the fast tight wavelet frame transforms for graph data (WFTG). Finally, we consider two specific applications of the proposed WFTG: graph data denoising and semi-supervised clustering. Utilizing the sparse representation provided by the WFTG, we propose ℓ1-norm based optimization models on graphs for denoising and semi-supervised clustering. On one hand, our numerical results show significant advantage of the WFTG over the spectral graph wavelet transform (SGWT) by [1] for both applications. On the other hand, numerical experiments on two real data sets show that the proposed semi-supervised clustering model using the WFTG is overall competitive with the state-of-the-art methods developed in the literature of high-dimensional data classification, and is superior to some of these methods.",
keywords = "Big data, Graph clustering, Sparse approximation on graphs, Spectral graph theory, Tight wavelet frames",
author = "Bin Dong",
year = "2014",
month = "11",
day = "13",
doi = "10.1016/j.acha.2015.09.005",
language = "English (US)",
journal = "Applied and Computational Harmonic Analysis",
issn = "1063-5203",
publisher = "Academic Press Inc.",

}

TY - JOUR

T1 - Sparse representation on graphs by tight wavelet frames and applications

AU - Dong, Bin

PY - 2014/11/13

Y1 - 2014/11/13

N2 - In this paper, we introduce a new (constructive) characterization of tight wavelet frames on non-flat domains in both continuum setting, i.e. on manifolds, and discrete setting, i.e. on graphs; we discuss how fast tight wavelet frame transforms can be computed and how they can be effectively used to process graph data. We start with defining the quasi-affine systems on a given manifold M. The quasi-affine system is formed by generalized dilations and shifts of a finite collection of wavelet functions Ψ:={ψj:1≤j≤r}⊂L2(R). We further require that ψj is generated by some refinable function ϕ{symbol} with mask aj. We present the condition needed for the masks {aj:0≤j≤r}, as well as regularity conditions needed for ϕ{symbol} and ψj, so that the associated quasi-affine system generated by Ψ is a tight frame for L2(M). The condition needed for the masks is a simple set of algebraic equations which are not only easy to verify for a given set of masks {aj}, but also make the construction of {aj} entirely painless. Then, we discuss how the transition from the continuum (manifolds) to the discrete setting (graphs) can be naturally done. In order for the proposed discrete tight wavelet frame transforms to be useful in applications, we show how the transforms can be computed efficiently and accurately by proposing the fast tight wavelet frame transforms for graph data (WFTG). Finally, we consider two specific applications of the proposed WFTG: graph data denoising and semi-supervised clustering. Utilizing the sparse representation provided by the WFTG, we propose ℓ1-norm based optimization models on graphs for denoising and semi-supervised clustering. On one hand, our numerical results show significant advantage of the WFTG over the spectral graph wavelet transform (SGWT) by [1] for both applications. On the other hand, numerical experiments on two real data sets show that the proposed semi-supervised clustering model using the WFTG is overall competitive with the state-of-the-art methods developed in the literature of high-dimensional data classification, and is superior to some of these methods.

AB - In this paper, we introduce a new (constructive) characterization of tight wavelet frames on non-flat domains in both continuum setting, i.e. on manifolds, and discrete setting, i.e. on graphs; we discuss how fast tight wavelet frame transforms can be computed and how they can be effectively used to process graph data. We start with defining the quasi-affine systems on a given manifold M. The quasi-affine system is formed by generalized dilations and shifts of a finite collection of wavelet functions Ψ:={ψj:1≤j≤r}⊂L2(R). We further require that ψj is generated by some refinable function ϕ{symbol} with mask aj. We present the condition needed for the masks {aj:0≤j≤r}, as well as regularity conditions needed for ϕ{symbol} and ψj, so that the associated quasi-affine system generated by Ψ is a tight frame for L2(M). The condition needed for the masks is a simple set of algebraic equations which are not only easy to verify for a given set of masks {aj}, but also make the construction of {aj} entirely painless. Then, we discuss how the transition from the continuum (manifolds) to the discrete setting (graphs) can be naturally done. In order for the proposed discrete tight wavelet frame transforms to be useful in applications, we show how the transforms can be computed efficiently and accurately by proposing the fast tight wavelet frame transforms for graph data (WFTG). Finally, we consider two specific applications of the proposed WFTG: graph data denoising and semi-supervised clustering. Utilizing the sparse representation provided by the WFTG, we propose ℓ1-norm based optimization models on graphs for denoising and semi-supervised clustering. On one hand, our numerical results show significant advantage of the WFTG over the spectral graph wavelet transform (SGWT) by [1] for both applications. On the other hand, numerical experiments on two real data sets show that the proposed semi-supervised clustering model using the WFTG is overall competitive with the state-of-the-art methods developed in the literature of high-dimensional data classification, and is superior to some of these methods.

KW - Big data

KW - Graph clustering

KW - Sparse approximation on graphs

KW - Spectral graph theory

KW - Tight wavelet frames

UR - http://www.scopus.com/inward/record.url?scp=84945582519&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84945582519&partnerID=8YFLogxK

U2 - 10.1016/j.acha.2015.09.005

DO - 10.1016/j.acha.2015.09.005

M3 - Article

AN - SCOPUS:84945582519

JO - Applied and Computational Harmonic Analysis

JF - Applied and Computational Harmonic Analysis

SN - 1063-5203

ER -