← Search

Koki Yamada

7 accepted papers

2023

Enhancing Teleoperated Robot Customer Service through Speech Monitoring and Filtering

IROS 2023poster

In this paper, we propose a system that supports operators who provide services to customers using teleoperated robots. We observed that unprofessional or lazy operators of teleoperated robots are a risk for businesses as they are likely to speak in ways that are inappropriate for customer services.…

Cited by 0SourceScholar
2023

Restoration of Time-Varying Graph Signals using Deep Algorithm Unrolling

ICASSP 2023accepted

In this paper, we propose a restoration method of time-varying graph signals, i.e., signals on a graph whose signal values change over time, using deep algorithm unrolling. Deep algorithm unrolling is a method that learns parameters in an iterative optimization algorithm with deep learning technique…

Cited by 0SourceScholar
2022

Edge Sampling of Graphs Based on Edge Smoothness

ICASSP 2022accepted

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 no…

Cited by 0SourceScholar
2021

Design of Graph Signal Sampling Matrices for Arbitrary Signal Subspaces

ICASSP 2021accepted

We propose a design method of sampling matrices for graph signals that guarantees perfect recovery for arbitrary graph signal subspaces. When the signal subspace is known, perfect reconstruction is always possible from the samples with an appropriately designed sampling matrix. However, most graph s…

Cited by 0SourceScholar
2021

Graph Signal Denoising Using Nested-Structured Deep Algorithm Unrolling

ICASSP 2021accepted

In this paper, we propose a deep algorithm unrolling (DAU) based on a variant of the alternating direction method of multiplier (ADMM) called Plug-and-Play ADMM (PnP-ADMM) for denoising of signals on graphs. DAU is a trainable deep architecture realized by unrolling iterations of an existing optimiz…

Cited by 0SourceScholar