Yusuke Gotoh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Yusuke Gotoh has a total of 53 co-authors. Here are the top co-authors by number of shared publications:
Kiki Adhinugraha
La Trobe University
3 shared publicationsKoji Sakai
Kyoto Prefectural Univ Med, Dept Radiol, Kamigyo Ku, Kajii Cho, Kyoto 6028566, Japan
3 shared publicationsAkira Uchiyama
Osaka Univ, Grad Sch Informat Sci & Technol, 1-5 Yamadaoka, Suita, Osaka 5650871, Japan
2 shared publications- David Taniar
Faculty of Information Technology, Monash University, Melbourne 3800, Australia
2 shared publications Jun Tazoe
Kyoto Prefectural Univ Med, Dept Radiol, Kamigyo Ku, Kajii Cho, Kyoto 6028566, Japan
2 shared publications- Kiki Adhinugraha
Department of Computer Science and Information Technology, La Trobe University, Bundoora, VIC 3086, Australia
2 shared publications
Latest Publications
- 16 November 2026
- Published by Springer Nature
- p. 359-370
A Hybrid Data Delivery Method Supporting Secondary Delivery in Integrated Broadcasting and Communication Environments
- 16 November 2026
- Published by Springer Nature
- p. 359-370
A Hybrid Data Delivery Method Supporting Secondary Delivery in Integrated Broadcasting and Communication Environments
- Open Access
Making Trilateration Work with Imperfect Data: A Low-Cost BLE-Based Indoor Positioning Approach
Bluetooth Low Energy (BLE)-based trilateration is attractive for indoor positioning because it can operate with low-cost infrastructure, yet RSSI-derived distances can become geometrically incompatible in real deployments. This study characterises those failure geometries using 162 million raw RSSI records collected from Emergency Room and Office deployments at Diponegoro National Hospital, Indonesia, from which 12.9 million synchronised three-scanner observations were analysed. Four recurring Trilateration Failure Modes (TFMs) are quantified across two deployments, three LDPL exponent scenarios, and raw versus Kalman-filtered RSSI. Failure-mode prevalence depends jointly on deployment and the assumed RSSI-to-distance model: TFM-I dominates several conditions, whereas TFM-III becomes dominant under higher-attenuation assumptions, with the transition occurring at different scenarios in the two deployments. To contextualise the Radius Adjustment Intersection Method (RAIM), two deterministic geometric baselines are evaluated: a common-factor Uniform Radius Scaling (URS) baseline and a Paek-style pairwise incremental adjustment. A common scale factor is feasible for 23.63–96.34% of observations, showing that a single multiplicative correction cannot reconcile all observed circle configurations. The Paek-style adjustment and RAIM both recover near-complete three-circle feasibility, but they produce different correction magnitudes and coordinate displacements. RAIM retains the smallest RSSI-derived radius as an anchor and sequentially adjusts the remaining radii. These outcomes are interpreted as geometric constraint-satisfaction and spatial-plausibility results rather than absolute localisation accuracy because ground-truth coordinates were unavailable. Anchor-sensitivity analysis further shows that alternative anchor choices can shift estimated coordinates by several metres, while room-polygon outlier status changes by less than 0.06%. The results identify deployment-dependent failure geometry, correction-model choice, and anchor selection as considerations for low-cost BLE trilateration.
Open AccessMaking Trilateration Work with Imperfect Data: A Low-Cost BLE-Based Indoor Positioning Approach
Bluetooth Low Energy (BLE)-based trilateration is attractive for indoor positioning because it can operate with low-cost infrastructure, yet RSSI-derived distances can become geometrically incompatible in real deployments. This study characterises those failure geometries using 162 million raw RSSI records collected from Emergency Room and Office deployments at Diponegoro National Hospital, Indonesia, from which 12.9 million synchronised three-scanner observations were analysed. Four recurring Trilateration Failure Modes (TFMs) are quantified across two deployments, three LDPL exponent scenarios, and raw versus Kalman-filtered RSSI. Failure-mode prevalence depends jointly on deployment and the assumed RSSI-to-distance model: TFM-I dominates several conditions, whereas TFM-III becomes dominant under higher-attenuation assumptions, with the transition occurring at different scenarios in the two deployments. To contextualise the Radius Adjustment Intersection Method (RAIM), two deterministic geometric baselines are evaluated: a common-factor Uniform Radius Scaling (URS) baseline and a Paek-style pairwise incremental adjustment. A common scale factor is feasible for 23.63–96.34% of observations, showing that a single multiplicative correction cannot reconcile all observed circle configurations. The Paek-style adjustment and RAIM both recover near-complete three-circle feasibility, but they produce different correction magnitudes and coordinate displacements. RAIM retains the smallest RSSI-derived radius as an anchor and sequentially adjusts the remaining radii. These outcomes are interpreted as geometric constraint-satisfaction and spatial-plausibility results rather than absolute localisation accuracy because ground-truth coordinates were unavailable. Anchor-sensitivity analysis further shows that alternative anchor choices can shift estimated coordinates by several metres, while room-polygon outlier status changes by less than 0.06%. The results identify deployment-dependent failure geometry, correction-model choice, and anchor selection as considerations for low-cost BLE trilateration.
- Open Access
An Open-Source System for Public Transport Route Data Curation Using OpenTripPlanner in Australia
Access to large-scale public transport journey data is essential for analysing accessibility, equity, and urban mobility. Although digital platforms such as Google Maps provide detailed routing for individual users, their licensing and access restrictions prevent systematic data extraction for research purposes. Open-source routing engines such as OpenTripPlanner offer a transparent alternative, but are often limited to local or technical deployments that restrict broader use. This study evaluates the feasibility of deploying a publicly accessible, open-source routing platform based on OpenTripPlanner to support large-scale public transport route simulation across multiple cities. Using Australian metropolitan areas as a case study, the platform integrates GTFS and OpenStreetMap data to enable repeatable journey queries through a web interface, an API, and bulk processing tools. Across eight metropolitan regions, the system achieved itinerary coverage above 90 percent and sustained approximately 3000 routing requests per minute under concurrent access. These results demonstrate that open-source routing infrastructure can support reliable, large-scale route simulation using open data. Beyond performance, the platform enables public transport accessibility studies that are not feasible with proprietary routing services, supporting reproducible research, transparent decision-making, and evidence-based transport planning across diverse urban contexts.
Open AccessAn Open-Source System for Public Transport Route Data Curation Using OpenTripPlanner in Australia
Access to large-scale public transport journey data is essential for analysing accessibility, equity, and urban mobility. Although digital platforms such as Google Maps provide detailed routing for individual users, their licensing and access restrictions prevent systematic data extraction for research purposes. Open-source routing engines such as OpenTripPlanner offer a transparent alternative, but are often limited to local or technical deployments that restrict broader use. This study evaluates the feasibility of deploying a publicly accessible, open-source routing platform based on OpenTripPlanner to support large-scale public transport route simulation across multiple cities. Using Australian metropolitan areas as a case study, the platform integrates GTFS and OpenStreetMap data to enable repeatable journey queries through a web interface, an API, and bulk processing tools. Across eight metropolitan regions, the system achieved itinerary coverage above 90 percent and sustained approximately 3000 routing requests per minute under concurrent access. These results demonstrate that open-source routing infrastructure can support reliable, large-scale route simulation using open data. Beyond performance, the platform enables public transport accessibility studies that are not feasible with proprietary routing services, supporting reproducible research, transparent decision-making, and evidence-based transport planning across diverse urban contexts.
- 27 November 2025
- Published by Springer Nature
- p. 159-174
AR Superimposed Display System with Video Synchronization
- 27 November 2025
- Published by Springer Nature
- p. 159-174
AR Superimposed Display System with Video Synchronization
- 1 October 2025
- Published by Springer Nature
- p. 63-73
Proposal of Division-Based Broadcasting System Considering Dynamic Switching of Image Quality
- 1 October 2025
- Published by Springer Nature
- p. 63-73
Proposal of Division-Based Broadcasting System Considering Dynamic Switching of Image Quality
- 28 November 2024
- Published by Springer Nature
- p. 107-112
A Genetic Algorithm-Based Scheduling Method Considering Working Hours for Medical Doctors
- 28 November 2024
- Published by Springer Nature
- p. 107-112
A Genetic Algorithm-Based Scheduling Method Considering Working Hours for Medical Doctors
- Open Access
- 14 October 2024
- Published by MDPI AG in Journal of Imaging
- Vol. 10 (10) , 251
Searching Method for Three-Dimensional Puncture Route to Support Computed Tomography-Guided Percutaneous Puncture
In CT-guided percutaneous punctures—an image-guided puncture method using CT images—physicians treat targets such as lung tumors, liver tumors, renal tumors, and intervertebral abscesses by inserting a puncture needle into the body from the exterior while viewing images. By recognizing two-dimensional CT images prior to a procedure, a physician determines the least invasive puncture route for the patient. Therefore, the candidate puncture route is limited to a two-dimensional region along the cross section of the human body. In this paper, we aim to construct a three-dimensional puncture space based on multiple two-dimensional CT images to search for a safer and shorter puncture route for a given patient. If all puncture routes starting from a target in the three-dimensional space were examined from all directions (the brute-force method), the processing time to derive the puncture route would be very long. We propose a more efficient method for three-dimensional puncture route selection in CT-guided percutaneous punctures. The proposed method extends the ray-tracing method, which quickly derives a line segment from a given start point to an end point on a two-dimensional plane, and applies it to three-dimensional space. During actual puncture route selection, a physician can use CT images to derive a three-dimensional puncture route that is safe for the patient and minimizes the puncture time. The main novelty is that we propose a method for deriving a three-dimensional puncture route within the allowed time in an actual puncture. The main goal is for physicians to select the puncture route they will use in the actual surgery from among the multiple three-dimensional puncture route candidates derived using the proposed method. The proposed method derives a three-dimensional puncture route within the allowed time in an actual puncture. Physicians can use the proposed method to derive a new puncture route, reducing the burden on patients and improving physician skills. In the evaluation results of a computer simulation, for a 3D CT image created by combining 170 two-dimensional CT images, the processing time for deriving the puncture route using the proposed method was approximately 59.4 s. The shortest length of the puncture route from the starting point to the target was between 20 mm and 22 mm. The search time for a three-dimensional human body consisting of 15 CT images was 4.77 s for the proposed method and 2599.0 s for a brute-force method. In a questionnaire, physicians who actually perform puncture treatments evaluated the candidate puncture routes derived by the proposed method. We confirmed that physicians could actually use these candidates as a puncture route.
- 14 October 2024
- Published by MDPI AG in Journal of Imaging
- Vol. 10 (10) , 251
Open AccessSearching Method for Three-Dimensional Puncture Route to Support Computed Tomography-Guided Percutaneous Puncture
In CT-guided percutaneous punctures—an image-guided puncture method using CT images—physicians treat targets such as lung tumors, liver tumors, renal tumors, and intervertebral abscesses by inserting a puncture needle into the body from the exterior while viewing images. By recognizing two-dimensional CT images prior to a procedure, a physician determines the least invasive puncture route for the patient. Therefore, the candidate puncture route is limited to a two-dimensional region along the cross section of the human body. In this paper, we aim to construct a three-dimensional puncture space based on multiple two-dimensional CT images to search for a safer and shorter puncture route for a given patient. If all puncture routes starting from a target in the three-dimensional space were examined from all directions (the brute-force method), the processing time to derive the puncture route would be very long. We propose a more efficient method for three-dimensional puncture route selection in CT-guided percutaneous punctures. The proposed method extends the ray-tracing method, which quickly derives a line segment from a given start point to an end point on a two-dimensional plane, and applies it to three-dimensional space. During actual puncture route selection, a physician can use CT images to derive a three-dimensional puncture route that is safe for the patient and minimizes the puncture time. The main novelty is that we propose a method for deriving a three-dimensional puncture route within the allowed time in an actual puncture. The main goal is for physicians to select the puncture route they will use in the actual surgery from among the multiple three-dimensional puncture route candidates derived using the proposed method. The proposed method derives a three-dimensional puncture route within the allowed time in an actual puncture. Physicians can use the proposed method to derive a new puncture route, reducing the burden on patients and improving physician skills. In the evaluation results of a computer simulation, for a 3D CT image created by combining 170 two-dimensional CT images, the processing time for deriving the puncture route using the proposed method was approximately 59.4 s. The shortest length of the puncture route from the starting point to the target was between 20 mm and 22 mm. The search time for a three-dimensional human body consisting of 15 CT images was 4.77 s for the proposed method and 2599.0 s for a brute-force method. In a questionnaire, physicians who actually perform puncture treatments evaluated the candidate puncture routes derived by the proposed method. We confirmed that physicians could actually use these candidates as a puncture route.
- 20 September 2024
- Published by Springer Nature
- p. 298-307
Evaluation of Bandwidth-Aware Scheduling Method for Division-Based Broadcasting with Multiple Video Qualities
- 20 September 2024
- Published by Springer Nature
- p. 298-307
Evaluation of Bandwidth-Aware Scheduling Method for Division-Based Broadcasting with Multiple Video Qualities
- 11 April 2024
- Published by Springer Nature
- p. 438-449
Video Compression Method Using Vector Quantization
- 11 April 2024
- Published by Springer Nature
- p. 438-449
Video Compression Method Using Vector Quantization
- 14 February 2024
- Published by Springer Nature
- p. 423-434
Proposal of Indoor AR Navigation System Using SLAM for Location Search
- 14 February 2024
- Published by Springer Nature
- p. 423-434
Proposal of Indoor AR Navigation System Using SLAM for Location Search