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.

Osamu Yamada

dblp:31/6383 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2024
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author · 2 since 2021Computer networks · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

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.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Content delivery and video streaming · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes
difference-set cyclic codes
0.011987
Development of an Error-Correction Method for Data Packet Multiplexed with TV Signals · IEEE Trans. Commun. 1987
Coding theory
error-correcting codes
0.011987
Development of an Error-Correction Method for Data Packet Multiplexed with TV Signals · IEEE Trans. Commun. 1987
Coding theory › error-correcting codes › decoding
majority-logic decoding
0.011987
Development of an Error-Correction Method for Data Packet Multiplexed with TV Signals · IEEE Trans. Commun. 1987

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

simulation · 0.0decoding algorithm modification · 0.0
YearPublicationVenuePosition
2024 A Method for City-Wide PoI-Level Congestion Prediction via Assimilation of Actual and Simulation-Based PoI Congestion Data
abstract
Regulating human flow is essential to reducing congestion in areas where people gather. A digital twin that realistically simulates human flow helps for this purpose. To realize a realistic human flow simulation mechanism, it is essential to take into account people's attributes. However, existing simulation methods use only location-specific information to predict people's behavior, thus do not reflect the routines that appear in people's actual lives. In this paper, we propose a human flow simulation using synthetic population data that help extract the attributes of people living in a target area. In the proposed method, we simulate the movement of people with each attribute like office workers, students, etc. every 15 minutes using the synthetic population data and the hourly transition probability matrix between PoIs (Points of Interest) by computing the transition probability matrix from hourly PoI-level congestion (people count) in the target area using people trajectory data included in the point-type fluid population data commercially available and applying a Markov chain to the congestion. The proposed simulation mechanism is based on the data assimilation of the actual PoI congestion vector (how many people were staying in each PoI) obtained from the point-type fluid population data and the virtual PoI congestion vector generated from the prediction of people's movement using the attribute information in the synthetic population data at regular time intervals. The data are assimilated at regular intervals to obtain highly accurate PoI-level congestion forecasts. The results of the mobility simulation for office workers showed that the maximum cosine similarity with the actual PoI congestion was 0.96 after 12 hours even when the actual PoI congestion vector is known only for a part of the area (one mesh).
Haruka Sakagami, Osamu Yamada, Yuki Matsuda 0001, Hirohiko Suwa, Keiichi Yasumoto
SMARTCOMP2
2024 Crowd Flow Prediction from Mobile Traces Through Time Series PoI Stay Counts
abstract
Predicting crowd flow is crucial for decision-making to mitigate various risks. For instance, in social problems such as traffic congestion and over-tourism, countermeasures can be taken by predicting crowd flows in advance. Typically, people visit multiple Points of Interest (PoI) for various purposes. Previous work has proposed methods to incorporate the behavioral characteristics of people in different areas, such as dining areas or office areas, into machine learning models. However, they have not considered the specific behavioral characteristics associated with each PoI, such as when restaurants or train stations experience peak periods. Recently, there has been an increase in the ability to handle large amounts of location information, leading to a growth in the volume of individual trace data. In this study, we propose a crowd flow prediction method that aggregates large-scale individual trace data of movements between PoIs and considers the behavioral characteristics associated with each PoI. We define this information as time series PoI stay counts generated from trace data collected from mobile phones. Using this, we developed a machine learning model to predict the number of people in an area (mesh) over the next several minutes to hours. This prediction is based on the number of people staying at each PoI (category) in neighboring areas (meshes). We applied this approach to densely populated areas in central Tokyo, where congestion is a significant concern, and conducted validation. The results showed that the method utilizing time series PoI stay counts improved prediction accuracy by up to 50% compared to methods that did not use it. Additionally, the Mean Absolute Percentage Error (MAPE) for predicting the number of people staying 1 hour later was only 2.57%.
Osamu Yamada, Yuki Matsuda 0001, Hirohiko Suwa, Keiichi Yasumoto
SMARTCOMP1
1991 An error-correcting code for data broadcasting and its error-correction capability
Osamu Yamada
Signal Process. Image Commun.1
1987 Development of an Error-Correction Method for Data Packet Multiplexed with TV Signals
abstract
By using the vertical blanking period of television signals, it is possible to transmit coded data such as teletext, telesoftware, music, etc. However, the quality of data transmission on television transmission channels is very poor and a powerful error-correction code is required to reliably transmit coded data. From the results of simulations using error pattern data collected in field tests and the comparison of various error-correction codes under many conditions, it has been determined that the shortened (272, 190) majority-logic decodable difference-set cyclic code is a suitable code for NTSC TV signals. By using error-correction codes proposed to date for teletext, it has been difficult to obtain a page error rate (PER) of 10-1in many measurement points. However, PER's of less than 10-2can be obtained in this system, even when random noise, ghost interference, or waveform distortion are present and bit error rates (BER's) are 10-2. This paper also gives an empirical equation according to the error data and shows that the error-correction capability increased equivalently up to 11 error-bits in a packet by modifying the decoding algorithm.
Osamu Yamada
IEEE Trans. Commun.1