← Search

Kazuki Naganuma

6 accepted papers

2025

Controlling the Number of Sample-Contributive Vertices in Generalized Sampling of Graph Signals

ICASSP 2025accepted

This paper proposes a method for sampling graph signals by designing a flexible sampling operator via a difference-of-convex (DC) based algorithm. Departing from conventional methods limited to bandlimited signals, our method extend the generalized sampling theory to handle graph signals beyond band…

Cited by 0SourceScholar
2025

Stable and Lightweight Deep Primal-Dual Unrolling for Constrained Image Restoration with Convolutional Sparse Coding

ICASSP 2025accepted

This paper proposes an image restoration method using a convolutional sparse coding (CSC) unrolling network with a box constraint and total variation. Unlike conventional deep unrolling methods, the proposed method constructs an interpretable lightweight network with restoration stability. Specifica…

Cited by 0SourceScholar
2024

Enhancing Hyperspectral Anomaly Detection by Difference-of-Convex Sparse Anomaly Modeling

ICASSP 2024accepted

We propose a hyperspectral (HS) anomaly detection method using a novel characterization of anomalies. Among HS anomaly detection approaches, decomposition-based methods, which simultaneously estimate a background part and an anomaly part from an HS image, have attracted much attention. In these meth…

Cited by 0SourceScholar
2023

Robust Spatiotemporal Fusion of Satellite Images via Convex Optimization

ICASSP 2023accepted

Spatiotemporal fusion (ST fusion) is a feasible solution to resolve a tradeoff between the temporal and spatial resolutions of satellite images. Although many ST fusion methods have been proposed, most methods have not been developed that explicitly take noise in observed images into account, despit…

Cited by 0SourceScholar
2023

Static-Scene Constrained Optimization for Matrix/Tensor-Decomposition-free Foreground-Background Separation

ICASSP 2023accepted

We propose an efficient foreground-background separation (FBS) method for (possibly noisy) video data. Most existing FBS methods model the background as a low-rank component. However, this approach is computationally expensive because it requires matrix/tensor decomposition of high-dimensional video…

Cited by 0SourceScholar