Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Kohei Ueda

dblp:180/2979 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
6since 2021 · last 2026
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 3 · 2 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Data mining · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › time series analysis
change point detection
0.612022
Change Detection with Probabilistic Models on Persistence Diagrams · ICDM 2022
Data mining
time series analysis
0.612022
Change Detection with Probabilistic Models on Persistence Diagrams · ICDM 2022
Computational geometry › topological data analysis › persistent homology
persistence diagram
0.612022
Change Detection with Probabilistic Models on Persistence Diagrams · ICDM 2022
Computational geometry
topological data analysis
0.612022
Change Detection with Probabilistic Models on Persistence Diagrams · ICDM 2022

Methods — techniques the papers use, named apart from their topics

minimum description length · 1.1kernel density estimation · 1.1gaussian mixture model · 1.1
YearPublicationVenuePosition
2026 Joint Clustering and Beamforming Design for Energy-Efficient Scalable Network-Assisted Full-Duplex Cell-Free Massive MIMO
abstract
This paper proposes a joint access point (AP) clustering and beamforming design method for network-assisted full-duplex cell-free massive multiple-input multiple-output (NAFD CF-mMIMO) systems that maximizes energy efficiency (EE) while maintaining high spectral efficiency (SE). The proposed method improves energy efficiency (EE) by reducing power consumption of APs with low contributions to performance. Numerical results demonstrate that the proposed approach achieves SE performance comparable to that of conventional methods designed to maximize SE.
Yuya Mito, Koushi Okui, Kohei Ueda, Koji Ishibashi
CCNC3
2025 Beamforming Design for Terrestrial-Satellite Spectrum Sharing in Upper Mid-Band Based on Angular Radiated Power Constraint
abstract
This paper investigates the beamforming design for an upper mid-band multi-user multiple-input single-output (MUMISO) system, aiming to mitigate interference from terrestrial base stations to satellites. The upper mid-band (7-24 GHz) is already utilized by several satellite services, necessitating the coexistence of emerging cellular systems with these existing satellite systems. As such, we propose a beamforming design with an angular radiated power constraint directed towards the sky angle region, effectively mitigating interference without requiring prior information about the satellites. Numerical results validate the efficacy of the proposed method in reducing interference. Moreover, we demonstrate that the proposed method can achieve sum spectral efficiency performance comparable to sum rate maximization approaches without such constraints.
Kohei Ueda, Koji Ishibashi, Hiroki Iimori, Paulo Valente Klaine, Szabolcs Malomsoky
ICC1
2025 Differential Modulation Based Non-Coherent Grant-Free NOMA Under Timing Offsets
abstract
In this paper, we propose a new transmission scheme for grant-free non-orthogonal multiple access (GF-NOMA) based on orthogonal frequency division multiplexing (OFDM) in the presence of timing offsets. The proposed method utilizes differential phase-shift keying (DPSK) between subcarriers, eliminating the need for channel estimation and mitigating the degradation of data detection caused by timing offsets. Furthermore, the proposed method conducts active user detection based on the coordinate descent method, which offers a lower computational complexity compared to the conventional method based on the structured generalized approximate message passing (S-GAMP). Computer simulations demonstrate that the proposed method achieves a lower miss detection probability compared to S-GAMP and a lower bit error rate than the method using PSK.
Eiji Yoshimura, Takanori Hara 0001, Kohei Ueda, Koji Ishibashi, Kenichi Higuchi
WCNC3
2025 Exploiting Low-Density Signal Structure via Approximate Message Passing With Side Information for Grant-Free NOMA
abstract
This paper studies an uplink grant-free non-orthogonal multiple access (GF-NOMA) system using low-density signature orthogonal frequency division multiplexing (LDS-OFDM), where each user transmits non-orthogonal pilots and data symbols that are mapped onto a small number of subcarriers determined by the LDS sequence. After an initial estimation based on pilot symbols, our proposed receiver utilizes the low-density signal structure to improve active user detection, channel estimation, and multi-user detection accuracy. To achieve this, a birth-death drift process is applied to model the information exchange between two estimation modules for pilot and data symbols, and a corresponding side information (SI) calculation and denoiser design are proposed for SI-aided multiple measurement vector approximate message passing (MMV-AMP). Moreover, the asymptotic performance of the proposed SI-aided MMV-AMP is analyzed based on state evolution. Numerical results confirm that the proposed method outperforms state-of-the-art methods and that it can perform predictions using the derived state evolution.
Kohei Ueda, Takanori Hara 0001, Koji Ishibashi
IEEE Trans. Wirel. Commun.1
2022 Change Detection with Probabilistic Models on Persistence Diagrams
abstract
Detecting structural changes in time-series data is crucial in many applications. However, the changes in the data may appear as global structural changes that cannot be detected by conventional methods. In recent years, Topological Data Analysis (TDA) has been used to detect such global structural changes. In TDA, information on connected components or holes of data is encoded into a two-dimensional plot called a persistence diagram (PD), which can be used to detect global changes in time-series. However, only a few studies on TDA conducted change detection assuming probabilistic structure on PDs. In this paper, we introduce probability structures into PD, with which we conduct change detection on the basis of the minimum description length principle. We propose the following two methods: (1) A parametric method: We employ the Gaussian mixture model for PD modeling and then detect global changes by tracking the changes in the optimal number of mixture components. (2) A non-parametric method: We employ kernel densities for PD modeling and then detect changes by tracking changes in their global complexity. These methods not only improve the detection accuracy of global structural changes but also provide the explainability of global changes. We showcase the effectiveness of the proposed methods using synthetic data and real-world financial time-series data.
Kohei Ueda, Yuichi Ike, Kenji Yamanishi
ICDM1
2022 Iterative Activity Detection and Carrier Frequency Offset Estimation for Grant-Free NOMA
abstract
Grant-free non-orthogonal multiple access (GF-NOMA) systems suffer from the performance degradation of active user detection (AUD) due to carrier frequency offsets (CFOs) caused by imperfect frequency synchronization among users and a base station. Although a conventional method efficiently performs CFO estimation, AUD, and channel estimation (CE) by introducing extended pilot sequences based on discrete grids of the CFOs, the inevitable estimation error caused by off-grid CFOs significantly degrades the quality of the CE. This paper proposes a more accurate joint AUD and CE method by performing AUD and CFO estimation independently and iteratively. Computer simulations demonstrate that our proposed scheme can estimate the active users and the corresponding channel coefficients as accurately as the case with the perfect knowledge of the CFOs.
Kohei Ueda, Takanori Hara 0001, Koji Ishibashi
PIMRC1
2016 Disaster Information Gathering System Based on Web Caching and OpenFlow in Unstable Networks
abstract
Emergency Rescue Information Sharing System supports rescue operations in early stage by gathering information about victims in need of help at the time of disaster. In this system, in-vehicle relays are used to gather extensive information. In-vehicle relays transmit information sent by mobile terminals to a database server via gateway switches. There are several wireless connections between relays and gateway switches to make the transmission redundant. However, information loss occurs when all links are disconnected. In addition, mobile terminals cannot send information without available wireless connections. In this paper, we propose a disaster information gathering mechanism that adopts Web-based offline operation and OpenFlow-based routing control. Offline operation of the system is realized by information caching and synchronization. Wireless links between in-vehicle relays and gateway switches are controlled by OpenFlow. Our mechanism selects a link for transmission dynamically in response to the status and priority changes of the wireless links. In order to prevent information loss while relays isolated from networks, information from mobile terminals is temporarily stored in in-vehicle servers. Prototype demonstration shows that the proposed mechanism can achieve high information gathering rate at the database server.
Saki Tabata, Kohei Ueda, Ryotaro Fukui, Keiko Shimazu, Hiroshi Shigeno
AINA2