Koki Yamada
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
Koki Yamada has a total of 54 co-authors. Here are the top co-authors by number of shared publications:
- Kohei Yatabe
Tokyo University of Agriculture and Technology
6 shared publications - Kenji Shiraishi
Nagoya University
3 shared publications - Natsuki Akaishi
Department of Electrical Engineering and Computer Science, Tokyo University of Agriculture and Technology, 2-24-16 Naka-cho, Koganei, Tokyo, Japan
3 shared publications M. Sato
University of Tsukuba
2 shared publicationsS. Miyazaki
Hiroshima University, Japan
2 shared publicationsY. Nara
Selete, Japan
2 shared publications
Latest Publications
- Open Access
- 1 January 2026
- Published by Acoustical Society of Japan in Acoustical Science and Technology
- Vol. 47  (1) , 13-23
On the crossband filter representations of LTI systems: Algorithms and inversion
Since convolution operators characterize linear time-invariant (LTI) systems, convolution is one of the most fundamental operations in acoustic signal processing. Likewise, the analysis and processing of acoustic signals in the time-frequency domain is commonplace. In this context, LTI systems are often approximated with simple time-frequency domain operations, such as channel-wise multiplicative weights or channel-wise convolution. On the other hand, accurate computation of LTI systems in the time-frequency domain usually requires using crossband filters. However, the algorithms for connecting the LTI systems and the corresponding crossband filters have not been well-established, which has hindered their practical applications. In this paper, we introduce and compare several algorithms for computing the crossband filter representation of a given LTI system. Furthermore, we propose an inverse scheme for converting crossband filters into LTI systems, which is proven to recover the correct LTI system from its crossband filter representation. Efficient algorithms for this conversion are presented. We demonstrate numerically that the conversion of crossband filters into LTI systems is faithful: If the crossband filter represents an LTI system, then the conversion recovers the corresponding impulse response, confirming our theoretical result. Finally, we compare the computation time of forward and inverse conversion for all the presented algorithms.
- 1 January 2026
- Published by Acoustical Society of Japan in Acoustical Science and Technology
- Vol. 47  (1) , 13-23
Open AccessOn the crossband filter representations of LTI systems: Algorithms and inversion
Since convolution operators characterize linear time-invariant (LTI) systems, convolution is one of the most fundamental operations in acoustic signal processing. Likewise, the analysis and processing of acoustic signals in the time-frequency domain is commonplace. In this context, LTI systems are often approximated with simple time-frequency domain operations, such as channel-wise multiplicative weights or channel-wise convolution. On the other hand, accurate computation of LTI systems in the time-frequency domain usually requires using crossband filters. However, the algorithms for connecting the LTI systems and the corresponding crossband filters have not been well-established, which has hindered their practical applications. In this paper, we introduce and compare several algorithms for computing the crossband filter representation of a given LTI system. Furthermore, we propose an inverse scheme for converting crossband filters into LTI systems, which is proven to recover the correct LTI system from its crossband filter representation. Efficient algorithms for this conversion are presented. We demonstrate numerically that the conversion of crossband filters into LTI systems is faithful: If the crossband filter represents an LTI system, then the conversion recovers the corresponding impulse response, confirming our theoretical result. Finally, we compare the computation time of forward and inverse conversion for all the presented algorithms.
- Open Access
Sparse Regularization by Smooth Non-separable Non-convex Penalty Function Based on Ultra-discretization Formula
In sparse optimization, the $\ell_{1}$ norm is widely adopted for its convexity, yet it often yields solutions with smaller magnitudes than expected. To mitigate this drawback, various non-convex sparse penalties have been proposed. Some employ non-separability, with ordered weighting as an effective example, to retain large components while suppressing small ones. Motivated by these approaches, we propose ULPENS, a non-convex, non-separable sparsity-inducing penalty function that enables control over the suppression of elements. Derived from the ultra-discretization formula, ULPENS can continuously interpolate between the $\ell_{1}$ norm and a non-convex selective suppressing function by adjusting parameters inherent to the formula. With the formula, ULPENS is smooth, allowing the use of efficient gradient-based optimization algorithms. We establish key theoretical properties of ULPENS and demonstrate its practical effectiveness through numerical experiments.Open AccessSparse Regularization by Smooth Non-separable Non-convex Penalty Function Based on Ultra-discretization Formula
In sparse optimization, the $\ell_{1}$ norm is widely adopted for its convexity, yet it often yields solutions with smaller magnitudes than expected. To mitigate this drawback, various non-convex sparse penalties have been proposed. Some employ non-separability, with ordered weighting as an effective example, to retain large components while suppressing small ones. Motivated by these approaches, we propose ULPENS, a non-convex, non-separable sparsity-inducing penalty function that enables control over the suppression of elements. Derived from the ultra-discretization formula, ULPENS can continuously interpolate between the $\ell_{1}$ norm and a non-convex selective suppressing function by adjusting parameters inherent to the formula. With the formula, ULPENS is smooth, allowing the use of efficient gradient-based optimization algorithms. We establish key theoretical properties of ULPENS and demonstrate its practical effectiveness through numerical experiments. - 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 31  (10709908) , 2575-2579
Harmonic/Percussive Source Separation Based on Anisotropic Smoothness of Magnitude Spectrograms via Convex Optimization
Harmonic/percussive source separation (HPSS) is an important tool for analyzing and processing audio signals. The standard approach to HPSS takes advantage of the structural difference of sinusoidal and percussive components, called anisotropic smoothness , in magnitude spectrograms. However, the existing methods disregard phase of the spectrograms and/or approximate the problem, which naturally limits the upper bound of the performance of HPSS. In this letter, we propose a novel approach to HPSS that regards phase without the approximation. The proposed method introduces an auxiliary variable that acts as an adaptive weight of a weighted energy minimization problem, which enables us to apply smoothing on magnitude of complex-valued spectrograms. Compared to the existing methods, the proposed method can obtain separated components having better magnitude and phase by simultaneously handling them.
- 16 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 31  (10709908) , 2575-2579
Harmonic/Percussive Source Separation Based on Anisotropic Smoothness of Magnitude Spectrograms via Convex Optimization
Harmonic/percussive source separation (HPSS) is an important tool for analyzing and processing audio signals. The standard approach to HPSS takes advantage of the structural difference of sinusoidal and percussive components, called anisotropic smoothness , in magnitude spectrograms. However, the existing methods disregard phase of the spectrograms and/or approximate the problem, which naturally limits the upper bound of the performance of HPSS. In this letter, we propose a novel approach to HPSS that regards phase without the approximation. The proposed method introduces an auxiliary variable that acts as an adaptive weight of a weighted energy minimization problem, which enables us to apply smoothing on magnitude of complex-valued spectrograms. Compared to the existing methods, the proposed method can obtain separated components having better magnitude and phase by simultaneously handling them.
- Open Access
- 19 August 2024
- Published by International Union of Crystallography (IUCr) in Journal of Applied Crystallography
- Vol. 57  (5) , 1323-1335
Ptychographic phase retrieval via a deep-learning-assisted iterative algorithm
Ptychography is a powerful computational imaging technique with microscopic imaging capability and adaptability to various specimens. To obtain an imaging result, it requires a phase-retrieval algorithm whose performance directly determines the imaging quality. Recently, deep neural network (DNN)-based phase retrieval has been proposed to improve the imaging quality from the ordinary model-based iterative algorithms. However, the DNN-based methods have some limitations because of the sensitivity to changes in experimental conditions and the difficulty of collecting enough measured specimen images for training the DNN. To overcome these limitations, a ptychographic phase-retrieval algorithm that combines model-based and DNN-based approaches is proposed. This method exploits a DNN-based denoiser to assist an iterative algorithm like ePIE in finding better reconstruction images. This combination of DNN and iterative algorithms allows the measurement model to be explicitly incorporated into the DNN-based approach, improving its robustness to changes in experimental conditions. Furthermore, to circumvent the difficulty of collecting the training data, it is proposed that the DNN-based denoiser be trained without using actual measured specimen images but using a formula-driven supervised approach that systemically generates synthetic images. In experiments using simulation based on a hard X-ray ptychographic measurement system, the imaging capability of the proposed method was evaluated by comparing it with ePIE and rPIE. These results demonstrated that the proposed method was able to reconstruct higher-spatial-resolution images with half the number of iterations required by ePIE and rPIE, even for data with low illumination intensity. Also, the proposed method was shown to be robust to its hyperparameters. In addition, the proposed method was applied to ptychographic datasets of a Simens star chart and ink toner particles measured at SPring-8 BL24XU, which confirmed that it can successfully reconstruct images from measurement scans with a lower overlap ratio of the illumination regions than is required by ePIE and rPIE.
- 19 August 2024
- Published by International Union of Crystallography (IUCr) in Journal of Applied Crystallography
- Vol. 57  (5) , 1323-1335
Open AccessPtychographic phase retrieval via a deep-learning-assisted iterative algorithm
Ptychography is a powerful computational imaging technique with microscopic imaging capability and adaptability to various specimens. To obtain an imaging result, it requires a phase-retrieval algorithm whose performance directly determines the imaging quality. Recently, deep neural network (DNN)-based phase retrieval has been proposed to improve the imaging quality from the ordinary model-based iterative algorithms. However, the DNN-based methods have some limitations because of the sensitivity to changes in experimental conditions and the difficulty of collecting enough measured specimen images for training the DNN. To overcome these limitations, a ptychographic phase-retrieval algorithm that combines model-based and DNN-based approaches is proposed. This method exploits a DNN-based denoiser to assist an iterative algorithm like ePIE in finding better reconstruction images. This combination of DNN and iterative algorithms allows the measurement model to be explicitly incorporated into the DNN-based approach, improving its robustness to changes in experimental conditions. Furthermore, to circumvent the difficulty of collecting the training data, it is proposed that the DNN-based denoiser be trained without using actual measured specimen images but using a formula-driven supervised approach that systemically generates synthetic images. In experiments using simulation based on a hard X-ray ptychographic measurement system, the imaging capability of the proposed method was evaluated by comparing it with ePIE and rPIE. These results demonstrated that the proposed method was able to reconstruct higher-spatial-resolution images with half the number of iterations required by ePIE and rPIE, even for data with low illumination intensity. Also, the proposed method was shown to be robust to its hyperparameters. In addition, the proposed method was applied to ptychographic datasets of a Simens star chart and ink toner particles measured at SPring-8 BL24XU, which confirmed that it can successfully reconstruct images from measurement scans with a lower overlap ratio of the illumination regions than is required by ePIE and rPIE.
- Open Access
Edge Sampling of Graphs: Graph Signal Processing Approach With Edge Smoothness
Finding important edges in a graph is a crucial problem for various research fields, such as network epidemics, signal processing, machine learning, and sensor networks. In this paper, we tackle the problem based on sampling theory on graphs. We convert the original graph to a line graph where its nodes and edges, respectively, represent the original edges and the connections between the edges. We then perform node sampling of the line graph based on the edge smoothness assumption: This process selects the most critical edges in the original graph. We present a general framework of edge sampling based on graph sampling theory and reveal a theoretical relationship between the degree of the original graph and the line graph. We also propose an acceleration method for edge sampling in the proposed framework by using the relationship between two types of Laplacian of the node and edge domains. Experimental results in synthetic and real-world graphs validate the effectiveness of our approach against some alternative edge selection methods.
Open AccessEdge Sampling of Graphs: Graph Signal Processing Approach With Edge Smoothness
Finding important edges in a graph is a crucial problem for various research fields, such as network epidemics, signal processing, machine learning, and sensor networks. In this paper, we tackle the problem based on sampling theory on graphs. We convert the original graph to a line graph where its nodes and edges, respectively, represent the original edges and the connections between the edges. We then perform node sampling of the line graph based on the edge smoothness assumption: This process selects the most critical edges in the original graph. We present a general framework of edge sampling based on graph sampling theory and reveal a theoretical relationship between the degree of the original graph and the line graph. We also propose an acceleration method for edge sampling in the proposed framework by using the relationship between two types of Laplacian of the node and edge domains. Experimental results in synthetic and real-world graphs validate the effectiveness of our approach against some alternative edge selection methods.
- Open Access
- 4 July 2024
- Published by International Union of Crystallography (IUCr) in Journal of Applied Crystallography
- Vol. 57  (4) , 1085-1097
Subgradient-projection-based stable phase-retrieval algorithm for X-ray ptychography
X-ray ptychography is a lensless imaging technique that visualizes the nanostructure of a thick specimen which cannot be observed with an electron microscope. It reconstructs a complex-valued refractive index of the specimen from observed diffraction patterns. This reconstruction problem is called phase retrieval (PR). For further improvement in the imaging capability, including expansion of the depth of field, various PR algorithms have been proposed. Since a high-quality PR method is built upon a base PR algorithm such as ePIE, developing a well performing base PR algorithm is important. This paper proposes an improved iterative algorithm named CRISP. It exploits subgradient projection which allows adaptive step size and can be expected to avoid yielding a poor image. The proposed algorithm was compared with ePIE, which is a simple and fast-convergence algorithm, and its modified algorithm, rPIE. The experiments confirmed that the proposed method improved the reconstruction performance for both simulation and real data.
- 4 July 2024
- Published by International Union of Crystallography (IUCr) in Journal of Applied Crystallography
- Vol. 57  (4) , 1085-1097
Open AccessSubgradient-projection-based stable phase-retrieval algorithm for X-ray ptychography
X-ray ptychography is a lensless imaging technique that visualizes the nanostructure of a thick specimen which cannot be observed with an electron microscope. It reconstructs a complex-valued refractive index of the specimen from observed diffraction patterns. This reconstruction problem is called phase retrieval (PR). For further improvement in the imaging capability, including expansion of the depth of field, various PR algorithms have been proposed. Since a high-quality PR method is built upon a base PR algorithm such as ePIE, developing a well performing base PR algorithm is important. This paper proposes an improved iterative algorithm named CRISP. It exploits subgradient projection which allows adaptive step size and can be expected to avoid yielding a poor image. The proposed algorithm was compared with ePIE, which is a simple and fast-convergence algorithm, and its modified algorithm, rPIE. The experiments confirmed that the proposed method improved the reconstruction performance for both simulation and real data.
- 9 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 30  (10709908) , 1082-1086
Versatile Time-Frequency Representations Realized by Convex Penalty on Magnitude Spectrogram
Sparse time-frequency (T-F) representations have been an important research topic for more than several decades. Among them, optimization-based methods (in particular, exten-sions of basis pursuit) allow us to design the representations through objective functions. Since acoustic signal processing uti-lizes models of spectrogram, the flexibility of optimization-based T-F representations is helpful for adjusting the representation for each application. However, acoustic applications often require models of magnitude of T-F representations obtained by discrete Gabor transform (DGT). Adjusting a T-F representation to such a magnitude model (e.g., smoothness of magnitude of DGT coefficients) results in a non-convex optimization problem that is difficult to solve. In this paper, instead of tackling difficult non-convex problems, we propose a convex optimization-based framework that realizes a T-F representation whose magnitude has characteristics specified by the user. We analyzed the prop-erties of the proposed method and provide numerical examples of sparse T-F representations having, e.g., low-rank or smooth magnitude, which have not been realized before.
- 9 August 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 30  (10709908) , 1082-1086
Versatile Time-Frequency Representations Realized by Convex Penalty on Magnitude Spectrogram
Sparse time-frequency (T-F) representations have been an important research topic for more than several decades. Among them, optimization-based methods (in particular, exten-sions of basis pursuit) allow us to design the representations through objective functions. Since acoustic signal processing uti-lizes models of spectrogram, the flexibility of optimization-based T-F representations is helpful for adjusting the representation for each application. However, acoustic applications often require models of magnitude of T-F representations obtained by discrete Gabor transform (DGT). Adjusting a T-F representation to such a magnitude model (e.g., smoothness of magnitude of DGT coefficients) results in a non-convex optimization problem that is difficult to solve. In this paper, instead of tackling difficult non-convex problems, we propose a convex optimization-based framework that realizes a T-F representation whose magnitude has characteristics specified by the user. We analyzed the prop-erties of the proposed method and provide numerical examples of sparse T-F representations having, e.g., low-rank or smooth magnitude, which have not been realized before.
- Open Access
- 14 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70  (1053587X) , 3296-3311
Graph Signal Restoration Using Nested Deep Algorithm Unrolling
Graph signal processing is a ubiquitous task in many applications such as sensor, social, transportation and brain networks, point cloud processing, and graph neural networks. Often, graph signals are corrupted in the sensing process, thus requiring restoration. In this paper, we propose two graph signal restoration methods based on deep algorithm unrolling (DAU). First, we present a graph signal denoiser by unrolling iterations of the alternating direction method of multiplier (ADMM). We then suggest a general restoration method for linear degradation by unrolling iterations of Plug-and-Play ADMM (PnP-ADMM). In the second approach, the unrolled ADMM-based denoiser is incorporated as a submodule, leading to a nested DAU structure. The parameters in the proposed denoising/restoration methods are trainable in an end-to-end manner. Our approach is interpretable and keeps the number of parameters small since we only tune graph-independent regularization parameters. We overcome two main challenges in existing graph signal restoration methods: 1) limited performance of convex optimization algorithms due to fixed parameters which are often determined manually. 2) large number of parameters of graph neural networks that result in difficulty of training. Several experiments for graph signal denoising and interpolation are performed on synthetic and real-world data. The proposed methods show performance improvements over several existing techniques in terms of root mean squared error in both tasks.
- 14 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 70  (1053587X) , 3296-3311
Open AccessGraph Signal Restoration Using Nested Deep Algorithm Unrolling
Graph signal processing is a ubiquitous task in many applications such as sensor, social, transportation and brain networks, point cloud processing, and graph neural networks. Often, graph signals are corrupted in the sensing process, thus requiring restoration. In this paper, we propose two graph signal restoration methods based on deep algorithm unrolling (DAU). First, we present a graph signal denoiser by unrolling iterations of the alternating direction method of multiplier (ADMM). We then suggest a general restoration method for linear degradation by unrolling iterations of Plug-and-Play ADMM (PnP-ADMM). In the second approach, the unrolled ADMM-based denoiser is incorporated as a submodule, leading to a nested DAU structure. The parameters in the proposed denoising/restoration methods are trainable in an end-to-end manner. Our approach is interpretable and keeps the number of parameters small since we only tune graph-independent regularization parameters. We overcome two main challenges in existing graph signal restoration methods: 1) limited performance of convex optimization algorithms due to fixed parameters which are often determined manually. 2) large number of parameters of graph neural networks that result in difficulty of training. Several experiments for graph signal denoising and interpolation are performed on synthetic and real-world data. The proposed methods show performance improvements over several existing techniques in terms of root mean squared error in both tasks.
- Open Access
- 18 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 143734-143745
Temporal Multiresolution Graph Learning
Estimating time-varying graphs, i.e., a set of graphs in which one graph represents the relationship among nodes in a certain time slot, from observed data is a crucial problem in signal processing, machine learning, and data mining. Although many existing methods only estimate graphs with a single temporal resolution, the actual graphs often demonstrate different relationships in different temporal resolutions. In this study, we propose an approach for time-varying graph learning by leveraging a multiresolution property. The proposed method assumes that time-varying graphs can be decomposed by a linear combination of graphs localized at different temporal resolutions. We formulate a convex optimization problem for temporal multiresolution graph learning. In experiments using synthetic and real data, the proposed method demonstrates the promising objective performances for synthetic data, and obtains reasonable temporal multiresolution graphs from real data.
- 18 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 9, 143734-143745
Open AccessTemporal Multiresolution Graph Learning
Estimating time-varying graphs, i.e., a set of graphs in which one graph represents the relationship among nodes in a certain time slot, from observed data is a crucial problem in signal processing, machine learning, and data mining. Although many existing methods only estimate graphs with a single temporal resolution, the actual graphs often demonstrate different relationships in different temporal resolutions. In this study, we propose an approach for time-varying graph learning by leveraging a multiresolution property. The proposed method assumes that time-varying graphs can be decomposed by a linear combination of graphs localized at different temporal resolutions. We formulate a convex optimization problem for temporal multiresolution graph learning. In experiments using synthetic and real data, the proposed method demonstrates the promising objective performances for synthetic data, and obtains reasonable temporal multiresolution graphs from real data.
- 27 April 2012
- Published by The Electrochemical Society in ECS Transactions
- Vol. 45  (3) , 437-442
(Invited) Low-Frequency Noise Reduction in Si Nanowire MOSFETs
We have investigated the noise spectral density of nanowire and planar FETs. It was experimentally found that the nanowire FET shows lower noise density than the planar FET. By a simulation using Poisson-Schrödinger equations, the distribution of inversion carriers is located further from the interface due to quantum confinement, which well explains the observed lower noise density of nanowire FET.
- 27 April 2012
- Published by The Electrochemical Society in ECS Transactions
- Vol. 45  (3) , 437-442
(Invited) Low-Frequency Noise Reduction in Si Nanowire MOSFETs
We have investigated the noise spectral density of nanowire and planar FETs. It was experimentally found that the nanowire FET shows lower noise density than the planar FET. By a simulation using Poisson-Schrödinger equations, the distribution of inversion carriers is located further from the interface due to quantum confinement, which well explains the observed lower noise density of nanowire FET.