Si-Hyeon Lee

Si-Hyeon Lee

Auto-generated profile, based on publicly available information

Si-Hyeon Lee

Korea Advanced Institute of Science and Technology (KAIST)

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

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

Representative Publications

View All Publications
22 March 2018 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Open access
SLSi-Hyeon Lee
Si-Hyeon Lee
LWLigong Wang
Ligong Wang
AKAshish Khisti
Ashish Khisti
GWGregory W. Wornell
Gregory W. Wornell
We consider the problem of covert communication over a state-dependent channel, where the transmitter has causal or noncausal knowledge of the channel states. Here“, covert” means that a warden on the channel should observe similar statistics when the transmitter is sending a message and when it is not. When a sufficiently long secret key is shared between the transmitter and the receiver, we derive closed-form formulas for the maximum achievable covert communication rate (“covert capacity”) for discrete memoryless channels and, when the transmitter’s channel-state information (CSI) is noncausal, for additive white Gaussian noise (AWGN) channels. For certain channel models, including the AWGN channel, we show that the covert capacity is positive with CSI at the transmitter, but is zero without CSI. We also derive lower bounds on the rate of the secret key that is needed for the transmitter and the receiver to achieve the covert capacity.

29 October 2018 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
VTVincent Tan
Vincent Tan
SLSi-Hyeon Lee
Si-Hyeon Lee
We consider a covert communication scenario where a transmitter wishes to communicate simultaneously to two legitimate receivers while ensuring that the communication is not detected by an adversary, the warden. The legitimate receivers and the adversary observe the transmission from the transmitter via a three-user discrete or Gaussian memoryless broadcast channel. We focus on the case where the “no-input” symbol is not redundant, i.e., the output distribution at the warden induced by the no-input symbol is not a mixture of the output distributions induced by other input symbols, so that the covert communication is governed by the square root law, i.e., at most Θ( √n) bits can be transmitted over n channel uses. We show that for such a setting, a simple time-division strategy achieves the optimal throughputs for a non-trivial class of broadcast channels; this is not true for communicating over broadcast channels without the covert communication constraint. Our result implies that a code that uses two separate optimal point-to-point codes each designed for the constituent channels and each used for a fraction of the time is optimal in the sense that it achieves the best constants of the √n-scaling for the throughputs. Our proof strategy combines several elements in the network information theory literature, including concave envelope representations of the capacity regions of broadcast channels and El Gamal’s outer bound for more capable broadcast channels.

1 January 2021 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
KCKang-Hee Cho
Kang-Hee Cho
SLSi-Hyeon Lee
Si-Hyeon Lee

12 May 2023 in IEEE Communications Letters
Verified
Journal Article
Closed access
SHSeokhwa Hong
Seokhwa Hong
KKKyuyeong Kim
Kyuyeong Kim
SLSi-Hyeon Lee
Si-Hyeon Lee
In this paper, we propose a novel machine learning based jamming detection algorithm that can classify known attacks used for training and detect unknown attacks not used for training. The proposed algorithm has a hybrid structure of simple classification and anomaly detection models, which are decision tree (DT) and isolation forest (IF), respectively. After a test data passes through a DT that only classifies the data as normal or one of the known attacks, it enters an IF algorithm that determines if the DT’s decision is indeed correct. Furthermore, an ensemble method is applied to reduce the deviation. The proposed algorithm is evaluated on real datasets from wireless modems operating in the C-band under static and mobile environments with a total of four types of jamming attacks. For the simultaneous classification and detection task, the proposed algorithm is shown to achieve superior performance over a baseline algorithm for all the cases of jamming distances, the number of known jamming attacks, and mobility scenarios.

16 December 2020 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
HIHyeon-Seong Im
Hyeon-Seong Im
SLSi-Hyeon Lee
Si-Hyeon Lee
We study the effect of node mobility on the throughput scaling of the covert communication over a wireless adhoc network. It is assumed that $n$ mobile nodes want to communicate each other in a unit disk while keeping the presence of the communication secret from each of $\Theta (n^{s})$ non-colluding wardens ( $s>0$ ). The wardens can be mobile or fixed. Our results show that the node mobility greatly improves the throughput scaling, compared to the case of fixed node location. In particular, for $s\leq 1$ , the aggregate throughput scaling, i.e., the maximally achievable throughput scaling of the total network when each source-destination pair communicates with the same rate, is shown to be arbitrarily close to linear in $n$ when the number of channel uses $l$ that each warden uses to judge the presence of communication is not too large compared to $n$ . More specifically, the aggregate throughput scaling is arbitrarily close to linear when $s\leq 1$ and $l=O(n^{(\alpha -2)(1-s)})$ , where ${\alpha \geq 2}$ denotes the path loss exponent. For the achievability, we modify the two-hop based scheme by Grossglauser and Tse (2002), which was proposed for a wireless ad hoc network without a covertness constraint, by introducing a preservation region around each warden in which the senders are not allowed to transmit and by carefully analyzing the effect of covertness constraint on the transmit power and the resultant transmission rates. This scheme is shown to be optimal for $0 < s\leq 1$ under an assumption that each node outside preservation regions around wardens uses the same transmit power.

18 July 2024 in Frontiers in Aging Neuroscience
Verified
Journal Article
Open access
PDF file
JPJae-Min Park
Jae-Min Park
CMChang-Won Moon
Chang-Won Moon
BLByung Chan Lee
Byung Chan Lee
EOEungseok Oh
Eungseok Oh
JLJuhyun Lee
Juhyun Lee
SLSi-Hyeon Lee
Si-Hyeon Lee
Backgrounds: Freezing of gait (FoG) is a common and debilitating symptom of Parkinson's disease (PD) that can lead to falls and reduced quality of life. Wearable sensors have been used to detect FoG, but current methods have limitations in accuracy and practicality. In this paper, we aimed to develop a deep learning model using pressure sensor data from wearable insoles to accurately detect FoG in PD patients.Methods: We recruited 14 PD patients and collected data from multiple trials of a standardized walking test using the Pedar insole system. We proposed temporal convolutional neural network (TCNN) and applied rigorous data filtering and selective participant inclusion criteria to ensure the integrity of the dataset. We mapped the sensor data to a structured matrix and normalized it for input into our TCNN. We used a train-test split to evaluate the performance of the model.Results: We found that TCNN model achieved the highest accuracy, precision, sensitivity, specificity, and F1 score for FoG detection compared to other models. The TCNN model also showed good performance in detecting FoG episodes, even in various types of sensor noise situations.Conclusions: We demonstrated the potential of using wearable pressure sensors and machine learning models for FoG detection in PD patients. The TCNN model showed promising results and could be used in future studies to develop a real-time FoG detection system to improve PD patients' safety and quality of life. Additionally, our noise impact analysis identifies critical sensor locations, suggesting potential for reducing sensor numbers.