Institution profile

Nagoya Institute of Technology

Academic institutionasia · jp
Official website
Research library74linked papers
Opportunities0open roles
Selected work

Representative Papers

Physics-Aware Decoding for Communication Channels Governed by Partial Differential Equations

Jan 27, 2025

To address the low decoding efficiency and poor recovery accuracy of digital signals in physical channels governed by partial differential equations (PDEs)—such as heat conduction and the nonlinear Schrödinger equation (NLSE) channel—this paper proposes a physics-aware decoding framework. The core method introduces a novel gradient-flow decoding mechanism: leveraging backpropagated gradients from a differentiable PDE solver to directly guide iterative error correction, jointly optimizing channel modeling and symbol recovery under strict PDE constraints. Unlike conventional black-box neural networks or purely numerical solvers, our approach establishes a new signal processing paradigm grounded in physics-driven modeling and gradient-based optimization. Experiments on heat equation and NLSE channels demonstrate significantly reduced bit error rates, along with superior robustness and generalization compared to baseline methods. This work provides a differentiable, interpretable, and broadly applicable decoding pathway for physical-layer communications.

1 citationsRead paper

Flow Matching-Based PET Image Reconstruction

Aug 20, 2026

本文提出基于流匹配的PET图像重建方法,通过结合泊松似然引导和EM预处理器,实现数据一致性优化与流传播分离,提高不同剂量水平下的偏差-方差权衡。

0 citationsRead paper

Robust and Efficient Noisy-Label Time-Series Classification via Dynamic Time Warping Based Granular Ball Computing

Aug 12, 2026

This work addresses the susceptibility of dynamic time warping (DTW)-based nearest neighbor classifiers to label noise and their high computational cost during inference in time series classification. To mitigate these issues, the authors propose a granular-ball-based classification framework that aggregates temporally similar training samples into granular balls and performs classification at the granularity level. Two DTW-driven strategies for constructing granular balls are introduced. Experimental results on four benchmark datasets demonstrate that the proposed method significantly enhances robustness against symmetric label noise while substantially reducing the number of DTW computations required during inference. The approach thus achieves a favorable trade-off between classification accuracy, computational efficiency, and noise resilience.

0 citationsRead paper

Spatio-Temporal Scheduling for Robust and Efficient Multi-Transmitter Wireless Power Transfer

Aug 10, 2026

This work addresses the challenge of achieving both efficiency and robustness in multi-user wireless power transfer under time-varying channels, where conventional single-transmitter time-division scheduling falls short. The authors propose a spatiotemporal joint scheduling approach that leverages coordinated multi-transmitter beamforming to simultaneously optimize temporal and spatial resource allocation. By incorporating a nonlinear rectenna model and strategically exploiting inter-cluster interference as a performance-enhancing factor, the method effectively adapts to dynamic channel conditions. Experimental results demonstrate that the proposed scheme significantly improves both the efficiency and stability of energy delivery, particularly in complex propagation environments characterized by shadow fading and other channel impairments.

0 citationsRead paper
Recent publications

Latest Papers

Flow Matching-Based PET Image Reconstruction

Aug 20, 2026

本文提出基于流匹配的PET图像重建方法,通过结合泊松似然引导和EM预处理器,实现数据一致性优化与流传播分离,提高不同剂量水平下的偏差-方差权衡。

0 citationsRead paper

Robust and Efficient Noisy-Label Time-Series Classification via Dynamic Time Warping Based Granular Ball Computing

Aug 12, 2026

This work addresses the susceptibility of dynamic time warping (DTW)-based nearest neighbor classifiers to label noise and their high computational cost during inference in time series classification. To mitigate these issues, the authors propose a granular-ball-based classification framework that aggregates temporally similar training samples into granular balls and performs classification at the granularity level. Two DTW-driven strategies for constructing granular balls are introduced. Experimental results on four benchmark datasets demonstrate that the proposed method significantly enhances robustness against symmetric label noise while substantially reducing the number of DTW computations required during inference. The approach thus achieves a favorable trade-off between classification accuracy, computational efficiency, and noise resilience.

0 citationsRead paper

Spatio-Temporal Scheduling for Robust and Efficient Multi-Transmitter Wireless Power Transfer

Aug 10, 2026

This work addresses the challenge of achieving both efficiency and robustness in multi-user wireless power transfer under time-varying channels, where conventional single-transmitter time-division scheduling falls short. The authors propose a spatiotemporal joint scheduling approach that leverages coordinated multi-transmitter beamforming to simultaneously optimize temporal and spatial resource allocation. By incorporating a nonlinear rectenna model and strategically exploiting inter-cluster interference as a performance-enhancing factor, the method effectively adapts to dynamic channel conditions. Experimental results demonstrate that the proposed scheme significantly improves both the efficiency and stability of energy delivery, particularly in complex propagation environments characterized by shadow fading and other channel impairments.

0 citationsRead paper

A Differentiable Covariance Calculus for Linear Gaussian Bayesian Networks

Jul 05, 2026

This work addresses the lack of a unified differentiable framework for inference and estimation in linear Gaussian Bayesian networks, which traditionally rely on ad hoc derivations tailored to specific graph structures. The authors propose a novel, unified differentiable covariance calculus centered on the joint covariance matrix, applicable to arbitrary directed acyclic graphs and structured parameterizations. Key tasks—including conditioning, d-separation testing, and maximum likelihood estimation with latent variables—are reformulated as linear algebraic operations on covariances, enabling gradient computation via a single backward pass. By integrating K-recursive covariance mappings, automatic differentiation, and information geometry, the framework naturally subsumes the Slepian–Bangs formula and the Cramér–Rao bound. Its correctness and consistency are validated on state-space models and their extensions with skip connections.

0 citationsRead paper