Yuanzhi Huo

Mr. Yuanzhi Huo


Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
20 April 2022 in Information
Verified
Journal Article
Open access
PDF file
YHYuanzhi Huo
Yuanzhi Huo
PPPradini Puspitaningayu
Pradini Puspitaningayu
Nobuo FunabikiNobuo Funabiki
Nobuo Funabiki
KHKazushi Hamazaki
Kazushi Hamazaki
Minoru KuribayashiMinoru Kuribayashi
Minoru Kuribayashi
Kazuyuki KojimaKazuyuki Kojima
Kazuyuki Kojima
Nowadays, human indoor localization services inside buildings or on underground streets are in strong demand for various location-based services. Since conventional GPS cannot be used, indoor localization systems using wireless technologies have been extensively studied. Previously, we studied a fingerprint-based indoor localization system using IEEE802.15.4 devices, called FILS15.4, to allow use of inexpensive, tiny, and long-life transmitters. However, due to the narrow channel band and the low transmission power, the link quality indicator (LQI) used for fingerprints easily fluctuates by human movements and other uncontrollable factors. To improve the localization accuracy, FILS15.4 restricts the detection granularity to one room in the field, and adopts multiple fingerprints for one room, considering fluctuated signals, where their values must be properly adjusted. In this paper, we present a fingerprint optimization method for finding the proper fingerprint parameters in FILS15.4 by extending the existing one. As the training phase using the measurement LQI, it iteratively changes fingerprint values to maximize the newly defined score function for the room detecting accuracy. Moreover, it automatically increases the number of fingerprints for a room if the accuracy is not sufficient. For evaluations, we applied the proposed method to the measured LQI data using the FILS15.4 testbed system in the no. 2 Engineering Building at Okayama University. The validation results show that it improves the average detection accuracy (at higher than 97%) by automatically increasing the number of fingerprints and optimizing the values.

9 January 2023 in Algorithms
Verified
Journal Article
Open access
PDF file
YHYuanzhi Huo
Yuanzhi Huo
PPPradini Puspitaningayu
Pradini Puspitaningayu
Nobuo FunabikiNobuo Funabiki
Nobuo Funabiki
KHKazushi Hamazaki
Kazushi Hamazaki
Minoru KuribayashiMinoru Kuribayashi
Minoru Kuribayashi
Kazuyuki KojimaKazuyuki Kojima
Kazuyuki Kojima
Parameters often take key roles in determining the accuracy of algorithms, logics, and models for practical applications. Previously, we have proposed a general-purpose parameter optimization algorithm, and studied its applications in various practical problems. This algorithm optimizes the parameter values by repeating small changes of them based on a local search method with hill-climbing capabilities. In this paper, we present three diverse applications of this algorithm to show the versatility and effectiveness. The first application is the fingerprint-based indoor localization system using IEEE802.15.4 devices called FILS15.4 that can detect the location of a user in an indoor environment. It is shown that the number of fingerprints for each detection point, the fingerprint values, and the detection interval are optimized together, and the average detection accuracy exceeds 99%. The second application is the human face contour approximation model that is described by a combination of half circles, line segments, and a quadratic curve. It is shown that the simple functions can well approximate the face contour of various persons by optimizing the center coordinates, radii, and coefficients. The third application is the computational fluid dynamic (CFD) simulation to estimate temperature changes in a room. It is shown that the thermal conductivity is optimized to make the average temperature difference between the estimated and measured 0.22∘C.

11 December 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
CSChenrui Shi
Chenrui Shi
Nobuo FunabikiNobuo Funabiki
Nobuo Funabiki
YHYuanzhi Huo
Yuanzhi Huo
Mustika MentariMustika Mentari
Mustika Mentari
KSKohei Suga
Kohei Suga
TTTakashi Toshida
Takashi Toshida
Nowadays, digital transformation (DX) is the key concept to change and improve the operations in governments, companies, and schools. Therefore, any data should be digitized for processing by computers. Unfortunately, a lot of data and information are printed and handled on paper, although they may originally come from digital sources. Data on paper can be digitized using an optical character recognition (OCR) software. However, if the paper contains a table, it becomes difficult because of the separated characters by rows and columns there. It is necessary to solve the research question of “how to convert a printed table on paper into an Excel table while keeping the relationships between the cells?” In this paper, we propose a printed table digitization algorithm using image processing techniques and OCR software for it. First, the target paper is scanned into an image file. Second, each table is divided into a collection of cells where the topology information is obtained. Third, the characters in each cell are digitized by OCR software. Finally, the digitalized data are arranged in an Excel file using the topology information. We implement the algorithm on Python using OpenCV for the image processing library and Tesseract for the OCR software. For evaluations, we applied the proposal to 19 scanned and 17 screenshotted table images. The results show that for any image, the Excel file is generated with the correct structure, and some characters are misrecognized by OCR software. The improvement will be in future works.

7 October 2022 in Algorithms
Verified
Journal Article
Open access
PDF file
XZXudong Zhou
Xudong Zhou
Nobuo FunabikiNobuo Funabiki
Nobuo Funabiki
HHHein Htet
Hein Htet
AKAriel Kamoyedji
Ariel Kamoyedji
IAIrin Tri Anggraini
Irin Tri Anggraini
YSYan Watequlis Syaifudin
Yan Watequlis Syaifudin
Currently, the User-PC computingsystem (UPC) has been studied as a low-cost and high-performance distributed computing platform. It uses idling resources of personal computers (PCs) in a group. The job-worker assignment for minimizing makespan is critical to determine the performance of the UPC system. Some applications need to execute a lot of uniform jobs that use the identical program but with slightly different data, where they take the similar CPU time on a PC. Then, the total CPU time of a worker is almost linear to the number of assigned jobs. In this paper, we propose a static assignment algorithm of uniform jobs to workers in the UPC system, using simultaneous linear equations to find the lower bound on makespan, where every worker requires the same CPU time to complete the assigned jobs. For the evaluations of the proposal, we consider the uniform jobs in three applications. In OpenPose, the CNN-based keypoint estimation program runs with various images of human bodies. In OpenFOAM, the physics simulation program runs with various parameter sets. In code testing, two open-source programs run with various source codes from students for the Android programming learning assistance system (APLAS). Using the proposal, we assigned the jobs to six workers in the testbed UPC system and measured the CPU time. The results show that makespan was reduced by 10% on average, which confirms the effectiveness of the proposal.