Junya Hara
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
Junya Hara has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Yuichi Tanaka
Graduate School of Engineering, The University of Osaka, Osaka, Japan
4 shared publications - Hiroshi Higashi
The University of Osaka
2 shared publications - Hayate Kojima
Graduate School of Engineering, The University of Osaka, Osaka, Japan
1 shared publication - Keigo Takanami
Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
1 shared publication - Saki Nomura
Department of Electrical Engineering and Computer Science, Tokyo University of Agriculture and Technology, Tokyo, Japan
1 shared publication - Seishi Takamura
Graduate School of Computer and Information Sciences, Hosei University, Tokyo, Japan
1 shared publication
Latest Publications
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 544-555
Algorithm Unrolling-Based Denoising of Multimodal Graph Signals
We propose a denoising method for multimodal graph signals by an alternating minimization scheme that sequentially solves signal restoration and graph learning problems. Many complex-structured data, i.e., those on sensor networks, can capture multiple modalities at each measurement point, referred to as modalities. They are also assumed to have an underlying structure or correlations in the modality domain as well as in space. Such multimodal data are regarded as graph signals on a twofold graph and they are often corrupted by noise. Furthermore, their spatial/modality relationships are not always given a priori: We need to estimate twofold graphs during a denoising algorithm. In this paper, we consider a signal denoising method on twofold graphs, where graphs are learned simultaneously. Specifically, the graph learning subproblems are solved using the primal-dual splitting (PDS) algorithm, while the signal update has a closed-form solution. Parameters in this iterative algorithm are learned from training data by unrolling the iteration with deep algorithm unrolling. Experimental results on synthetic and real-world data demonstrate that the proposed method outperforms existing model- and deep learning-based graph signal denoising methods.
- 13 April 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal and Information Processing over Networks
- Vol. 12, 544-555
Algorithm Unrolling-Based Denoising of Multimodal Graph Signals
We propose a denoising method for multimodal graph signals by an alternating minimization scheme that sequentially solves signal restoration and graph learning problems. Many complex-structured data, i.e., those on sensor networks, can capture multiple modalities at each measurement point, referred to as modalities. They are also assumed to have an underlying structure or correlations in the modality domain as well as in space. Such multimodal data are regarded as graph signals on a twofold graph and they are often corrupted by noise. Furthermore, their spatial/modality relationships are not always given a priori: We need to estimate twofold graphs during a denoising algorithm. In this paper, we consider a signal denoising method on twofold graphs, where graphs are learned simultaneously. Specifically, the graph learning subproblems are solved using the primal-dual splitting (PDS) algorithm, while the signal update has a closed-form solution. Parameters in this iterative algorithm are learned from training data by unrolling the iteration with deep algorithm unrolling. Experimental results on synthetic and real-world data demonstrate that the proposed method outperforms existing model- and deep learning-based graph signal denoising methods.
- Open Access
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 5, 1042-1051
Dynamic Sensor Placement Based on Sampling Theory for Graph Signals
In this paper, we consider a sensor placement problem where sensors can move within a network over time. Sensor placement problem aims to select K sensor positions from N candidates where K < N. Most existing methods assume that sensor positions are static, i.e., they do not move, however, many mobile sensors like drones, robots, and vehicles can change their positions over time. Moreover, underlying measurement conditions could also be changed, which are difficult to cover with statically placed sensors. We tackle the problem by allowing the sensors to change their positions in their neighbors on the network. We dynamically determine the sensor positions based on graph signal sampling theory such that the non-observed signals on the network can be best recovered from the observations. For signal recovery, the dictionary is learned from a pool of observed signals. It is also used for the sensor position selection. In experiments, we validate the effectiveness of the proposed method via the mean squared error of the reconstructed signals. The proposed dynamic sensor placement outperforms the existing static ones for both synthetic and real data
- 23 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 5, 1042-1051
Open AccessDynamic Sensor Placement Based on Sampling Theory for Graph Signals
In this paper, we consider a sensor placement problem where sensors can move within a network over time. Sensor placement problem aims to select K sensor positions from N candidates where K < N. Most existing methods assume that sensor positions are static, i.e., they do not move, however, many mobile sensors like drones, robots, and vehicles can change their positions over time. Moreover, underlying measurement conditions could also be changed, which are difficult to cover with statically placed sensors. We tackle the problem by allowing the sensors to change their positions in their neighbors on the network. We dynamically determine the sensor positions based on graph signal sampling theory such that the non-observed signals on the network can be best recovered from the observations. For signal recovery, the dictionary is learned from a pool of observed signals. It is also used for the sensor position selection. In experiments, we validate the effectiveness of the proposed method via the mean squared error of the reconstructed signals. The proposed dynamic sensor placement outperforms the existing static ones for both synthetic and real data
- Open Access
- 18 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 1421-1434
Graph Signal Sampling Under Stochastic Priors
We propose a generalized sampling framework for stochastic graph signals. Stochastic graph signals are characterized by graph wide sense stationarity (GWSS) which is an extension of wide sense stationarity (WSS) for standard time-domain signals. In this paper, graph signals are assumed to satisfy the GWSS conditions and we study their sampling as well as recovery procedures. In generalized sampling, a correction filter is inserted between the sampling and reconstruction operators to compensate for non-ideal measurements. We propose a design method for the correction filters to reduce the mean-squared error (MSE) between the original and reconstructed graph signals. We derive the correction filters for two cases: The reconstruction filter is arbitrarily chosen or predefined. The proposed framework allows for arbitrary sampling methods, i.e., sampling in the vertex or graph frequency domain. We show that the graph spectral response of the resulting correction filter parallels that for generalized sampling for WSS signals if sampling is performed in the graph frequency domain. The effectiveness of our approach is validated via experiments by comparing its MSE with existing approaches.
- 18 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 71 (1053587X) , 1421-1434
Open AccessGraph Signal Sampling Under Stochastic Priors
We propose a generalized sampling framework for stochastic graph signals. Stochastic graph signals are characterized by graph wide sense stationarity (GWSS) which is an extension of wide sense stationarity (WSS) for standard time-domain signals. In this paper, graph signals are assumed to satisfy the GWSS conditions and we study their sampling as well as recovery procedures. In generalized sampling, a correction filter is inserted between the sampling and reconstruction operators to compensate for non-ideal measurements. We propose a design method for the correction filters to reduce the mean-squared error (MSE) between the original and reconstructed graph signals. We derive the correction filters for two cases: The reconstruction filter is arbitrarily chosen or predefined. The proposed framework allows for arbitrary sampling methods, i.e., sampling in the vertex or graph frequency domain. We show that the graph spectral response of the resulting correction filter parallels that for generalized sampling for WSS signals if sampling is performed in the graph frequency domain. The effectiveness of our approach is validated via experiments by comparing its MSE with existing approaches.
- Open Access
- 24 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 4, 148-156
Multi-Channel Sampling on Graphs and Its Relationship to Graph Filter Banks
In this paper, we consider multi-channel sampling (MCS) for graph signals. We generally encounter full-band graph signals beyond the bandlimited ones in many applications, such as piecewise constant/smooth graph signals and union of bandlimited graph signals. Full-band graph signals can be represented by a mixture of multiple signals conforming to different generation models. This requires the analysis of graph signals via multiple sampling systems, i.e., MCS, while existing approaches only consider single-channel sampling. We develop a MCS framework based on generalized sampling. We also present a sampling set selection (SSS) method for the proposed MCS so that the graph signal is best recovered. Furthermore, we reveal that existing graph filter banks can be viewed as a special case of the proposed MCS. In signal recovery experiments, the proposed method exhibits the effectiveness of recovery for full-band graph signals.
- 24 February 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of Signal Processing
- Vol. 4, 148-156
Open AccessMulti-Channel Sampling on Graphs and Its Relationship to Graph Filter Banks
In this paper, we consider multi-channel sampling (MCS) for graph signals. We generally encounter full-band graph signals beyond the bandlimited ones in many applications, such as piecewise constant/smooth graph signals and union of bandlimited graph signals. Full-band graph signals can be represented by a mixture of multiple signals conforming to different generation models. This requires the analysis of graph signals via multiple sampling systems, i.e., MCS, while existing approaches only consider single-channel sampling. We develop a MCS framework based on generalized sampling. We also present a sampling set selection (SSS) method for the proposed MCS so that the graph signal is best recovered. Furthermore, we reveal that existing graph filter banks can be viewed as a special case of the proposed MCS. In signal recovery experiments, the proposed method exhibits the effectiveness of recovery for full-band graph signals.