Diep N. Nguyen

2papers

2 Papers

4.5CVJul 3
Seeing Through WiFi: Lightweight Human Pose Estimation with Dynamic Kernel Attention

Toan D. Gian, Van-Dinh Nguyen, Vo Phi Son et al.

WiFi-based human pose estimation (HPE) enables the detection and interpretation of human body positions and movements without the need for wearable devices while preserving individual privacy concerns. Implementing this solution requires enhancing model performance and maintaining efficiency, especially on resource-constrained devices. This paper introduces a novel framework, WiLHPE, for lightweight and efficient human pose estimation using WiFi CSI signals. Empowered by a camera-based model during training, WiLHPE processes raw WiFi signals directly to estimate human poses in the testing phase. It employs a novel neural network architecture to dynamically learn convolutional kernels and apply attention mechanisms across channel and frequency spaces. This innovative method diversifies the kernels to improve the recognition capabilities of WiFi signals without adding complexity, ensuring efficiency. Additionally, the Tree-Structured Parzen Estimator algorithm is employed to optimize the critical hyperparameters of the neural network efficiently, minimizing the time required for optimal hyperparameter search compared to heuristic methods. Results from experiments on both the MM-Fi and WiPose datasets highlight the superiority of WiLHPE over state-of-the-art approaches, achieving 85.96% and 94.27% at PCK50, respectively, with minimal computational overhead. Notably, WiLHPE performs impressively even under challenging conditions, maintaining around 80% at PCK50 under AWGN noise with an error variance of 0.5.

1.2NTJul 3
Derivative-Free Richelot Isogenies via Subresultants with Algebraic Certification

Hung T. Dang, Diep V. Nguyen

The classical Richelot $(2,2)$-isogeny step for genus-$2$ curves constructs a codomain triple $(U,V,W)$ from a factorization $f=uvw$ via Wronskian derivatives. We give a completely derivative-free reformulation over prime fields $\mathbb{F}_p$, $p>2$, by expressing the Wronskian output through the $2\times 2$ minors of the coefficient matrix and recovering them from first subresultants and a linear syzygy. The resulting Remainder-Polynomial Route (RPR) is proven to produce the identical output triple in $\mathbb{F}_p[x]$ not merely up to units, but as an exact polynomial identity. Building on this equivalence, we introduce the Guarded Subresultant Route (GSR), a deterministic evaluator that certifies admissibility through constant-size algebraic guards, a lightweight post-check, and at most one bounded affine retry. All routes execute $O(1)$ field operations per step. A prototype over $10^6$ matched trials per prime confirms a $4.75$--$6\times$ kernel speedup for RPR over the classical Wronskian formula, and the full GSR pipeline remains $1.4$--$3\times$ faster than WRO despite the certification overhead. Correctness is independently verified by a double-Richelot involution test on $2.5\times10^5$ random triples across five primes.