Advanced
Advanced

Browsing by Author Karim, Abed-Meraim

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 2 of 2
  • Prev
  • 1
  • Next
  • Poster_A New Windowed Graph Fourier Transform.pdf.jpg
  • Conference paper

  • A New Windowed Graph Fourier Transform

    • Authors: Le, Trung-Thanh; Nguyen, Linh-Trung; Tran, Thi Thuy Quynh; Karim, Abed-Meraim (2017)

  • Considering graph signal processing (GSP) as an extended version of classical signal processing, definition of fundamental concepts such as spectral, Fourier transform, generalized operators and so forth for graph setting is highly beneficial and meaningful to get a deep understand of graph signals. In this paper, we concentrate on graph spectral analysis to aim at revealing hidden information of signals (data). In particular, we first define two new operators for GSP including translation and modulation, before introducing a new way to obtain the windowed graph Fourier transform called by namely Short Time Fourier Transform in classical setting. The experiment results indicate...
  • IEEE%20Xplore%20Abstract%20-%20Fast%20adaptive%20PARAFAC%20decomposition%20algorithm%20with%20linear%20complexity.pdf.jpg
  • Article

  • Fast adaptive PARAFAC decomposition algorithm with linear complexity

    • Authors: Nguyen, Viet Dung; Karim, Abed-Meraim; Nguyen, Linh Trung (2016)

  • We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension growing with time. It has linear complexity, good convergence rate and good estimation accuracy. To deal with large-scale problems, a parallel implementation can be applied to reduce both computational complexity and storage. We illustrate the effectiveness of our algorithm in comparison with the state-of-the-art algorithms through simulation experiments.

    Readership Map

    +
    −
    ABSTRACTS VIEWS

    46830699

    VIEWS & DOWNLOAD

    28529388

    Content Distribution

Browsing by Author Karim, Abed-Meraim

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 2 of 2
  • Poster_A New Windowed Graph Fourier Transform.pdf.jpg
  • Conference paper

  • A New Windowed Graph Fourier Transform

    • Authors: Le, Trung-Thanh; Nguyen, Linh-Trung; Tran, Thi Thuy Quynh; Karim, Abed-Meraim (2017)

  • Considering graph signal processing (GSP) as an extended version of classical signal processing, definition of fundamental concepts such as spectral, Fourier transform, generalized operators and so forth for graph setting is highly beneficial and meaningful to get a deep understand of graph signals. In this paper, we concentrate on graph spectral analysis to aim at revealing hidden information of signals (data). In particular, we first define two new operators for GSP including translation and modulation, before introducing a new way to obtain the windowed graph Fourier transform called by namely Short Time Fourier Transform in classical setting. The experiment results indicate...
  • IEEE%20Xplore%20Abstract%20-%20Fast%20adaptive%20PARAFAC%20decomposition%20algorithm%20with%20linear%20complexity.pdf.jpg
  • Article

  • Fast adaptive PARAFAC decomposition algorithm with linear complexity

    • Authors: Nguyen, Viet Dung; Karim, Abed-Meraim; Nguyen, Linh Trung (2016)

  • We present a fast adaptive PARAFAC decomposition algorithm with low computational complexity. The proposed algorithm generalizes the Orthonormal Projection Approximation Subspace Tracking (OPAST) approach for tracking a class of third-order tensors which have one dimension growing with time. It has linear complexity, good convergence rate and good estimation accuracy. To deal with large-scale problems, a parallel implementation can be applied to reduce both computational complexity and storage. We illustrate the effectiveness of our algorithm in comparison with the state-of-the-art algorithms through simulation experiments.