3 papers
eess.SP2024
Edge Sampling of Graphs: Graph Signal Processing Approach With Edge Smoothness
Kenta Yanagiya, Koki Yamada, Yasuo Katsuhara +2
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 pa…
eess.SP2023
Versatile Time-Frequency Representations Realized by Convex Penalty on Magnitude Spectrogram
Keidai Arai, Koki Yamada, Kohei Yatabe
Sparse time-frequency (T-F) representations have been an important research topic for more than several decades. Among them, optimization-based methods (in particular, extensions o…
cs.LG2023
Clustering of Time-Varying Graphs Based on Temporal Label Smoothness
Katsuki Fukumoto, Koki Yamada, Yuichi Tanaka +1
We propose a node clustering method for time-varying graphs based on the assumption that the cluster labels are changed smoothly over time. Clustering is one of the fundamental tas…