Daeseung Yoo
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Daeseung Yoo has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Woo-Sung Jung
Electronics and Telecommunications Research Institute (ETRI), Daejeon, South Korea
5 shared publications - Taehyun Yoon
Artificial Intelligence Research Laboratory, Intelligent Robotics Research Division, Electronics and Telecommunications Research Institute, Daejeon, Republic of Korea
3 shared publications - Hoon Oh
Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan, South Korea
2 shared publications Do-Hyun Kim
Electronics and Telecommunications Research Institute, Daejeon, 34129, Korea
1 shared publication- Doi Thi Lan
Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan, South Korea
1 shared publication - Huu Phi Tran
Department of Electrical, Electronic and Computer Engineering, University of Ulsan, Ulsan 680-749, Korea
1 shared publication
Latest Publications
- Open Access
- 27 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 68111-68125
Companion Mobility to Assist in Future Human Location Prediction
Location prediction plays an important role in modeling human mobility. Existing studies focused on developing a prediction model which is based solely on the past mobility of only the person of interest (POI), rather than including information on the mobility of her/his companions. In fact, people frequently move in a group, and thus, using mobility data of a person’s companions can enhance accuracy when predicting that person’s future locations. Motivated by this, we propose a two-phase framework for predicting an individual’s future locations that fully benefits from spatio-temporal contexts embedded in that person’s and his/her companions’ mobility. The framework first determines the POI’s companions, then predicts future locations based on mobility information for both the POI and selected companions. Two companion selection methods are proposed in this work. The first method uses spatial closeness (SC) to determine the companions of the POI by measuring the similarity of the individuals’ geographic distributions. The second method builds person ID embedding (PIE) vectors, and cosine similarity is used to select the POI’s companions. To mitigate the curse of dimensionality, the framework also uses a stacked autoencoder in which the encoder compresses a high-dimensional input feature (e.g., location, time, and person ID) into a low-dimensional latent vector. For the second phase of the framework, a bidirectional recurrent neural network (BRNN)-based multi-output model is proposed to predict a person’s future locations in the next several time slots. To train the BRNN model, weighted loss is used, which takes into account the importance of each future time slot to predict the POI’s locations accurately. Experiments are conducted on two large-scale Wi-Fi trace datasets, demonstrating that the proposed model can effectively predict human future locations.
- 27 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 68111-68125
Open AccessCompanion Mobility to Assist in Future Human Location Prediction
Location prediction plays an important role in modeling human mobility. Existing studies focused on developing a prediction model which is based solely on the past mobility of only the person of interest (POI), rather than including information on the mobility of her/his companions. In fact, people frequently move in a group, and thus, using mobility data of a person’s companions can enhance accuracy when predicting that person’s future locations. Motivated by this, we propose a two-phase framework for predicting an individual’s future locations that fully benefits from spatio-temporal contexts embedded in that person’s and his/her companions’ mobility. The framework first determines the POI’s companions, then predicts future locations based on mobility information for both the POI and selected companions. Two companion selection methods are proposed in this work. The first method uses spatial closeness (SC) to determine the companions of the POI by measuring the similarity of the individuals’ geographic distributions. The second method builds person ID embedding (PIE) vectors, and cosine similarity is used to select the POI’s companions. To mitigate the curse of dimensionality, the framework also uses a stacked autoencoder in which the encoder compresses a high-dimensional input feature (e.g., location, time, and person ID) into a low-dimensional latent vector. For the second phase of the framework, a bidirectional recurrent neural network (BRNN)-based multi-output model is proposed to predict a person’s future locations in the next several time slots. To train the BRNN model, weighted loss is used, which takes into account the importance of each future time slot to predict the POI’s locations accurately. Experiments are conducted on two large-scale Wi-Fi trace datasets, demonstrating that the proposed model can effectively predict human future locations.
- Open Access
- 3 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 206074-206087
An Adaptive Batch-Image Based Driver Status Monitoring System on a Lightweight GPU-Equipped SBC
Most Driver Status Monitoring (DSM) systems consist of spatial features extractions and temporal status recognition in sequence. Extracting the spatial features, which include driver facial behavior such as eye closing and mouth opening, generally requires considerable computation. It causes DSM systems to lose the valuable instantly-occurring driver facial information during real-time processing. Loss of facial information affects the accuracy of the system, and its impact is more severe on restricted computing resources. To solve this problem, this paper proposes an Adaptive Batch-Image (ABI) based DSM (ABI-DSM) system. The ABI enables the DSM system to use images captured in real-time while the DSM process previous input images. For real-time operation on a lightweight GPU-equipped Single-Board Computer (SBC), the ABI-DSM system is designed as follows. First, the system uses the driver’s facial behavior to reduce the dimension of the time-series data for recognizing the status of the driver. The second, detection and tracking of driver’s faces are not used for facial behavior recognition. Also, the system works with PydMobileNet, which has lower parameters and FLOPs than MobileNetV2, for facial behavior recognition. Experiments show that the ABI-DSM systems based on MobileNetV2 and PydMobileNet perform better than others in terms of both FPS and Precision. In particular, the PydMobileNet-based ABI-DSM system outperforms competitors when the size of Batch-Image is over six images.
- 3 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 206074-206087
Open AccessAn Adaptive Batch-Image Based Driver Status Monitoring System on a Lightweight GPU-Equipped SBC
Most Driver Status Monitoring (DSM) systems consist of spatial features extractions and temporal status recognition in sequence. Extracting the spatial features, which include driver facial behavior such as eye closing and mouth opening, generally requires considerable computation. It causes DSM systems to lose the valuable instantly-occurring driver facial information during real-time processing. Loss of facial information affects the accuracy of the system, and its impact is more severe on restricted computing resources. To solve this problem, this paper proposes an Adaptive Batch-Image (ABI) based DSM (ABI-DSM) system. The ABI enables the DSM system to use images captured in real-time while the DSM process previous input images. For real-time operation on a lightweight GPU-equipped Single-Board Computer (SBC), the ABI-DSM system is designed as follows. First, the system uses the driver’s facial behavior to reduce the dimension of the time-series data for recognizing the status of the driver. The second, detection and tracking of driver’s faces are not used for facial behavior recognition. Also, the system works with PydMobileNet, which has lower parameters and FLOPs than MobileNetV2, for facial behavior recognition. Experiments show that the ABI-DSM systems based on MobileNetV2 and PydMobileNet perform better than others in terms of both FPS and Precision. In particular, the PydMobileNet-based ABI-DSM system outperforms competitors when the size of Batch-Image is over six images.
- Open Access
- 8 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 126239-126252
A Two-Hop Real-Time LoRa Protocol for Industrial Monitoring and Control Systems
A single-hop LoRa (Long Range) network suffers from a limitation in coverage caused by high signal attenuation when deployed in industrial areas, which often include wireless unfriendly zones (WUZs). Thus, some end nodes in WUZs may fail to transmit data to the gateway (GW). This paper proposes a reliable two-hop real-time LoRa protocol in which the nodes in WUZs transmit data to another node that relays the received data to the gateway for reliable transmission. The proposed protocol allocates transmission slots to nodes with different data transmission periods, so the nodes not only achieve high reliability but also meet time constraints or periods for delivering data to a gateway. In this case, 1-hop nodes (one hop away from GW) may consume more energy than 2-hop nodes (two hops away from GW). For energy balancing, the protocol uses a data aggregation approach to minimize the number of transmissions. We show by analysis that the proposed protocol can support up to 200 nodes using a single-channel GW when every node sends one packet with a payload of 30 bytes within 17 seconds, and 30% of the nodes are 2-hop nodes. In addition, we show by experiment that the proposed protocol can achieve high reliability in data transmission.
- 8 July 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 126239-126252
Open AccessA Two-Hop Real-Time LoRa Protocol for Industrial Monitoring and Control Systems
A single-hop LoRa (Long Range) network suffers from a limitation in coverage caused by high signal attenuation when deployed in industrial areas, which often include wireless unfriendly zones (WUZs). Thus, some end nodes in WUZs may fail to transmit data to the gateway (GW). This paper proposes a reliable two-hop real-time LoRa protocol in which the nodes in WUZs transmit data to another node that relays the received data to the gateway for reliable transmission. The proposed protocol allocates transmission slots to nodes with different data transmission periods, so the nodes not only achieve high reliability but also meet time constraints or periods for delivering data to a gateway. In this case, 1-hop nodes (one hop away from GW) may consume more energy than 2-hop nodes (two hops away from GW). For energy balancing, the protocol uses a data aggregation approach to minimize the number of transmissions. We show by analysis that the proposed protocol can support up to 200 nodes using a single-channel GW when every node sends one packet with a payload of 30 bytes within 17 seconds, and 30% of the nodes are 2-hop nodes. In addition, we show by experiment that the proposed protocol can achieve high reliability in data transmission.
- Open Access
- 8 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 107087-107102
Performance Analysis and Optimization of the Coverage Probability in Dual Hop LoRa Networks With Different Fading Channels
In this work, the performance evaluation and the optimization of dual-hop LoRa network are investigated. In particular, the coverage probability (Pcov) of edge end-devices (EDs) is computed in closed-form expressions under various fading channels, i.e., Nakagami-$m$ and Rayleigh fading. The Pcov under Nakagami-$m$ fading is computed in the approximated closed-form expressions; the Pcov under Rayleigh fading, on the other hand, is calculated in the exact closed-form expressions. In addition, we also investigate the impact of different kinds of interference on the performance of the Pcov, i.e., intra-SF interference, inter-SF interference (or capture effect) and both intra- and inter-SF interference. Our findings show that the impact of imperfect orthogonality is not non-negligible, along with the intra-SF interference. Moreover, based on the proposed mathematical framework, we formulate an optimization problem, which finds the optimal location of the relay to maximize the coverage probability. Since it is a mixed integer program with a non-convex objective function, we decompose the original problem with discrete optimization variables into sub-problems with a convex feasible set. After that, each sub-problem is effectively solved by utilizing the gradient descent approach. Monte Carlo simulations are supplied to verify the correctness of our mathematical framework. In addition, the results manifest that our proposed optimization algorithm converges rapidly, and the coverage probability is significantly improved when the location of relay is optimized.
- 8 June 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 107087-107102
Open AccessPerformance Analysis and Optimization of the Coverage Probability in Dual Hop LoRa Networks With Different Fading Channels
In this work, the performance evaluation and the optimization of dual-hop LoRa network are investigated. In particular, the coverage probability (Pcov) of edge end-devices (EDs) is computed in closed-form expressions under various fading channels, i.e., Nakagami-$m$ and Rayleigh fading. The Pcov under Nakagami-$m$ fading is computed in the approximated closed-form expressions; the Pcov under Rayleigh fading, on the other hand, is calculated in the exact closed-form expressions. In addition, we also investigate the impact of different kinds of interference on the performance of the Pcov, i.e., intra-SF interference, inter-SF interference (or capture effect) and both intra- and inter-SF interference. Our findings show that the impact of imperfect orthogonality is not non-negligible, along with the intra-SF interference. Moreover, based on the proposed mathematical framework, we formulate an optimization problem, which finds the optimal location of the relay to maximize the coverage probability. Since it is a mixed integer program with a non-convex objective function, we decompose the original problem with discrete optimization variables into sub-problems with a convex feasible set. After that, each sub-problem is effectively solved by utilizing the gradient descent approach. Monte Carlo simulations are supplied to verify the correctness of our mathematical framework. In addition, the results manifest that our proposed optimization algorithm converges rapidly, and the coverage probability is significantly improved when the location of relay is optimized.
- Open Access
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 44727-44738
A Real-Time LoRa Protocol for Industrial Monitoring and Control Systems
- 2 March 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 44727-44738
Open AccessA Real-Time LoRa Protocol for Industrial Monitoring and Control Systems