Shuichiro Haruta

Shuichiro Haruta

Auto-generated profile, based on publicly available information

Shuichiro Haruta

Division KDDI Research, Inc 2-1-15 Ohara Fujimino-shi 356-8502 Saitama Japan

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 October 2020 in IEEE Access
Verified
Journal Article
Open access
HKHiroya Kato
Hiroya Kato
KOKyohei Osuge
Kyohei Osuge
SHShuichiro Haruta
Shuichiro Haruta
ISIwao Sasase
Iwao Sasase
There exists a need of “image steganalysis” which reveals whether steganographic signals are embedded in an image to improve information security. Among various steganalysis, Convolutional Neural Networks (CNN) based steganalysis is promising since it can automatically learn the features of diverse steganographic algorithms. However, the detection performance of CNN is degraded when an image is intentionally resized by the nearest-neighbor interpolation before steganography. This is because spatial frequency in a resized image gets high, which disturbs the training. In order to overcome this shortcoming, in this article, we propose a preprocessing by using multiple steganography for intentional image downsampling on CNN-based steganalysis. In the proposed preprocessing, steganographic signals are additionally embedded into both resized original images and resized steganographic ones with the same embedding key since difference of spatial frequencies between them gets obvious, which helps CNN learn features. The reason why the difference gets obvious is that steganographic signals tend to be continuously embedded into same pixels in resized images when they are additionally embedded. Thus, by training resized images after the proposed preprocessing, the detection performance can be improved. Since the proposed preprocessing is very simple, it does not greatly increase the training time of CNN. Our evaluation shows accuracy in a model with the proposed preprocessing is up to 34.8% higher than that in the conventional model when the same steganography is additionally embedded. Besides, we also show that the proposed preprocessing yields up to 23.1% higher accuracy compared with the conventional one even when another steganography is additionally embedded.

10 July 2024
Verified
Conference Paper
Open access
ZLZhi Li
Zhi Li
DADaichi Amagata
Daichi Amagata
YZYihong Zhang
Yihong Zhang
Takahiro HaraTakahiro Hara
Takahiro Hara
SHShuichiro Haruta
Shuichiro Haruta
MKMori Kurokawa
Mori Kurokawa
Building high-quality recommender systems is challenging for new services and small companies, because of their sparse interactions. Cross-domain recommendations (CDRs) alleviate this issue by transferring knowledge from data in external domains. However, most existing CDRs leverage data from only a single external domain and serve only two domains. CDRs serving multiple domains require domain-shared entities (i.e., users and items) to transfer knowledge, which significantly limits their applications due to the hardness and privacy concerns of finding such entities. We therefore focus on a more general scenario, non-overlapped multi-target CDRs (NO-MTCDRs), which require no domain-shared entities and serve multiple domains. Existing methods require domain-shared users to learn user preferences and cannot work on NO-MTCDRs. We hence propose MITrans, a novel mutual information-based (MI-based) preference disentangling and transferring framework to improve recommendations for all domains. MITrans effectively leverages knowledge from multiple domains as well as learning both domain-shared and domain-specific preferences without using domain-shared users. In MITrans, we devise two novel MI constraints to disentangle domain-shared and domain-specific preferences. Moreover, we introduce a module that fuses domain-shared preferences in different domains and combines them with domain-specific preferences to improve recommendations. Our experimental results on two real-world datasets demonstrate the superiority of MITrans in terms of recommendation quality and application range against state-of-the-art overlapped and non-overlapped CDRs.

25 April 2024
Verified
Book Chapter
Closed access
PDF file
RSRei Sato
Rei Sato
SHShuichiro Haruta
Shuichiro Haruta
KSKazuhiro Saito
Kazuhiro Saito
MKMori Kurokawa
Mori Kurokawa

12 June 2023
Verified
Conference Paper
Open access
TKTatsuya Konishi
Tatsuya Konishi
SHShuichiro Haruta
Shuichiro Haruta
MKMori Kurokawa
Mori Kurokawa
KTKenta Tsukatsune
Kenta Tsukatsune
YMYuto Mizutani
Yuto Mizutani
COChihiro Ono
Chihiro Ono
In this paper, we propose CG-GNN, a novel compiled graphs-based feature extraction method for Enterprise Social Networks (ESNs). For the provider of ESNs, extracting features from a given social graph is essential. However, since the amount of data available for a single enterprise is often limited, it is necessary to utilize data from other enterprises. We hypothesize that each enterprise has its own enterprise-specific features, while there is a general structure underlying in all enterprises. To reflect the hypothesis, our approach introduces “compiled graphs” to capture enterprise-specific features by mapping them through functions dedicated to that enterprise. The graphs are then handled by Graph Neural Networks (GNNs) that are commonly used across all enterprises to extract general structural information. Therefore, the obtained representations by CG-GNN are balanced in terms of enterprise-specific and enterprise-generic characteristics. Through experiments with private and publicly available datasets, we show that CG-GNN outperforms baselines by a large margin. In a practical scenario, we compute the ideal input of the proposed method for the purpose of ESNs revitalization. This experiment also demonstrates its feasibility and we believe the results are useful for many ESN providers.


12 September 2024 in arXiv
Verified
Preprint
Open access
PDF file
YWYanan Wang
Yanan Wang
SHShuichiro Haruta
Shuichiro Haruta
DZDonghuo Zeng
Donghuo Zeng
JVJulio Vizcarra
Julio Vizcarra
MKMori Kurokawa
Mori Kurokawa
Video question answering (VideoQA) is a task to predict the correct answer to questions posed about a given video. The system must comprehend spatial and temporal relationships among objects extracted from videos to perform causal and temporal reasoning. While prior works have focused on modeling individual object movements using transformer-based methods, they falter when capturing complex scenarios involving multiple objects (e.g., "a boy is throwing a ball in a hoop"). We propose a contrastive language event graph representation learning method called CLanG to address this limitation. Aiming to capture event representations associated with multiple objects, our method employs a multi-layer GNN-cluster module for adversarial graph representation learning, enabling contrastive learning between the question text and its relevant multi-object event graph. Our method outperforms a strong baseline, achieving up to 2.2% higher accuracy on two challenging VideoQA datasets, NExT-QA and TGIF-QA-R. In particular, it is 2.8% better than baselines in handling causal and temporal questions, highlighting its strength in reasoning multiple object-based events.