Akie Sakiyama

Akie Sakiyama

Auto-generated profile, based on publicly available information

Akie Sakiyama

Graduate School of BASE, Tokyo University of Agriculture and Technology, Tokyo, Japan

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
28 March 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Closed access
ASAkie Sakiyama
Akie Sakiyama
YTYuichi Tanaka
Yuichi Tanaka
Toshihisa TanakaToshihisa Tanaka
Toshihisa Tanaka
AOAntonio Ortega
Antonio Ortega

10 January 2019 in IEEE Transactions on Signal Processing
Verified
Journal Article
Open access
ASAkie Sakiyama
Akie Sakiyama
KWKana Watanabe
Kana Watanabe
YTYuichi Tanaka
Yuichi Tanaka
AOAntonio Ortega
Antonio Ortega
We propose two-channel critically-sampled filter banks for signals on undirected graphs that utilize spectral domain sampling. Unlike conventional approaches based on vertex domain sampling, our transforms have the following desirable properties: first, perfect reconstruction regardless of the characteristics of the underlying graphs and graph variation operators; and second, a symmetric structure; i.e., both analysis and synthesis filter banks are built using similar building blocks. Along with the structure of the filter banks, this paper also proves the general criterion for perfect reconstruction and theoretically shows that the vertex and spectral domain sampling coincide for a special case. The effectiveness of our approach is evaluated by comparing its performance in nonlinear approximation and denoising with various conventional graph transforms.

13 July 2017 in IEEE Journal of Selected Topics in Signal Processing
Verified
Journal Article
Closed access
DTDavid B. Tay
David B. Tay
YTYuichi Tanaka
Yuichi Tanaka
ASAkie Sakiyama
Akie Sakiyama
The construction of spectral filters for graph wavelet transforms is addressed in this paper. Both the undecimated and decimated cases will be considered. The filter functions are polynomials and can be implemented efficiently without the need for any eigendecomposition, which is computationally expensive for large graphs. Polynomial filters also have the advantage of the vertex localization property. The construction is achieved by designing suitable transformations that are used on traditional multirate filter banks. It will be shown how the classical quadrature-mirror-filters and linear phase, critically/over- sampled filter banks can be used to construct spectral graph wavelets that are almost tight. A variety of design examples will be given to show the versatility of the design technique.

1 January 2016 in IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Verified
Journal Article
Closed access
PDF file
SYSaho Yagyu
Saho Yagyu
ASAkie Sakiyama
Akie Sakiyama
YTYuichi Tanaka
Yuichi Tanaka

22 January 2019 in arXiv
Verified
Preprint
Open access
PDF file
ASAkie Sakiyama
Akie Sakiyama
KWKana Watanabe
Kana Watanabe
YTYuichi Tanaka
Yuichi Tanaka
AOAntonio Ortega
Antonio Ortega
We propose two-channel critically-sampled filter banks for signals on undirected graphs that utilize spectral domain sampling. Unlike conventional approaches based on vertex domain sampling, our transforms have the following desirable properties: 1) perfect reconstruction regardless of the characteristics of the underlying graphs and graph variation operators and 2) a symmetric structure; i.e., both analysis and synthesis filter banks are built using similar building blocks. Along with the structure of the filter banks, this paper also proves the general criterion for perfect reconstruction and theoretically shows that the vertex and spectral domain sampling coincide for a special case. The effectiveness of our approach is evaluated by comparing its performance in nonlinear approximation and denoising with various conventional graph transforms.

10 March 2020 in arXiv
Verified
Preprint
Open access
PDF file
ASAkie Sakiyama
Akie Sakiyama
YTYuichi Tanaka
Yuichi Tanaka
Toshihisa TanakaToshihisa Tanaka
Toshihisa Tanaka
AOAntonio Ortega
Antonio Ortega
This paper addresses the problem of selecting an optimal sampling set for signals on graphs. The proposed sampling set selection (SSS) is based on a localization operator that can consider both vertex domain and spectral domain localization. We clarify the relationships among the proposed method, sensor position selection methods in machine learning, and conventional SSS methods based on graph frequency. In contrast to the conventional graph signal processing-based approaches, the proposed method does not need to compute the eigendecomposition of a variation operator, while still considering (graph) frequency information. We evaluate the performance of our approach through comparisons of prediction errors and execution time.