TWTiexing Wang

Tiexing Wang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tiexing Wang has a total of 11 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Harvesting Ambient RF for Presence Detection Through Deep Learning

    by Yang Liu, Tiexing Wang, Yuexin Jiang, Biao Chen

    This article explores the use of ambient radio frequency (RF) signals for human presence detection through deep learning. Using Wi-Fi signal as an example, we demonstrate that the channel state information (CSI) obtained at the receiver contains rich information about the propagation environment. Through judicious preprocessing of the estimated CSI followed by deep learning, reliable presence detection can be achieved. Several challenges in passive RF sensing are addressed. With presence detection, how to collect training data with human presence can have a significant impact on the performance. This is in contrast to activity detection when a specific motion pattern is of interest. A second challenge is that RF signals are complex-valued. Handling complex-valued input in deep learning requires careful data representation and network architecture design. Finally, human presence affects CSI variation along multiple dimensions; such variation, however, is often masked by system impediments, such as timing or frequency offset. Addressing these challenges, the proposed learning system uses preprocessing to preserve human motion-induced channel variation while insulating against other impairments. A convolutional neural network (CNN) properly trained with both magnitude and phase information is then designed to achieve reliable presence detection. Extensive experiments are conducted. Using off-the-shelf Wi-Fi devices, the proposed deep-learning-based RF sensing achieves near-perfect presence detection during multiple extended periods of test and exhibits superior performance compared with leading edge passive infrared sensors. A comparison with existing RF-based human presence detection also demonstrates its robustness in performance, especially when deployed in a completely new environment. The learning-based passive RF sensing thus provides a viable and promising alternative for presence or occupancy detection.


  • Nonparametric Composite Hypothesis Testing in an Asymptotic Regime

    by Qunwei Li, Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney

    We investigate the nonparametric, composite hypothesis testing problem for arbitrary unknown distributions in the asymptotic regime where both the sample size and the number of hypothesis grow exponentially large. Such asymptotic analysis is important in many practical problems, where the number of variations that can exist within a family of distributions can be countably infinite. We introduce the notion of discrimination capacity, which captures the largest exponential growth rate of the number of hypothesis relative to the sample size so that there exists a test with asymptotically vanishing probability of error. Our approach is based on various distributional distance metrics in order to incorporate the generative model of the data. We provide analyses of the error exponent using the maximum mean discrepancy and Kolmogorov-Smirnov distance and characterize the corresponding discrimination rates, i.e., lower bounds on the discrimination capacity, for these tests. Finally, an upper bound on the discrimination capacity based on Fano's inequality is developed. Numerical results are presented to validate the theoretical results.


  • Open Access

    Nonparametric Composite Hypothesis Testing in an Asymptotic Regime

    by Qunwei Li, Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K. Varshney

    We investigate the nonparametric, composite hypothesis testing problem for arbitrary unknown distributions in the asymptotic regime where both the sample size and the number of hypotheses grow exponentially large. Such asymptotic analysis is important in many practical problems, where the number of variations that can exist within a family of distributions can be countably infinite. We introduce the notion of \emph{discrimination capacity}, which captures the largest exponential growth rate of the number of hypotheses relative to the sample size so that there exists a test with asymptotically vanishing probability of error. Our approach is based on various distributional distance metrics in order to incorporate the generative model of the data. We provide analyses of the error exponent using the maximum mean discrepancy (MMD) and Kolmogorov-Smirnov (KS) distance and characterize the corresponding discrimination rates, i.e., lower bounds on the discrimination capacity, for these tests. Finally, an upper bound on the discrimination capacity based on Fano's inequality is developed. Numerical results are presented to validate the theoretical results.

  • Exponentially Consistent K-Means Clustering Algorithm Based on Kolmogrov-Smirnov Test

    by Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K Varshney

    This paper studies clustering using a Kolmogorov-Smirnov based K-means algorithm. All data sequences are assumed to be generated by unknown continuous distributions. The pairwise KS distances of the distributions are assumed to be lower bounded by a certain positive constant. The convergence analysis of the proposed algorithms and upper bounds on the error probability are provided for both known and unknown number of clusters. More importantly, it is shown that the probability of error decays exponentially as the sample size of each data sequence goes to infinity, and the error exponent is only a function of the pairwise KS distances of the distributions. the analysis is validated by simulation results.


  • Clustering under composite generative models

    by Tiexing Wang, Donald J. Bucci, Yingbin Liang, Biao Chen, Pramod K Varshney

    This paper studies clustering of data samples generated from composite distributions using the Kolmogorov-Smirnov (KS) based K-means algorithm. All data sequences are assumed to be generated from unknown continuous distributions. The maximum intra-cluster KS distance of each distribution cluster is assumed to be smaller than the minimum inter-cluster KS distance of different clusters. The analysis of convergence and upper bounds on the error probability are provided for both cases with known and unknown number of clusters. Furthermore, it is shown that the probability of error decays exponentially as the number of samples in each data sequence goes to infinity, and the error exponent is only a function of the difference of the inter-cluster and intra-cluster KS distances. The analysis is validated by simulation results.


  • First order echo based room shape recovery using a single mobile device

    by Tiexing Wang, Fangrong Peng, Biao Chen

    This paper considers the problem of constructing 2-D room shape. A mobile device with co-located microphone and loudspeaker is used and the distances between consecutive measurement points are assumed to be known. The uniqueness of the mapping between the first-order echoes and the room geometry is guaranteed for any convex polygons. A practical algorithm for room reconstruction in the presence of noise and higher order echoes is proposed. Experimental results are provided to demonstrate the effectiveness of our approach.


  • Room shape reconstruction with a single mobile acoustic sensor

    by Fangrong Peng, Tiexing Wang, Biao Chen

    This paper studies the problem of recovering the geometry of a polygonal room via the room impulse response. Specifically, a single mobile node, with co-located loudspeaker and microphone, is deployed and times of arrival of the first-order echoes are used for room shape reconstruction. The uniqueness of the mapping between the first-order echoes and the room geometry is guaranteed for most polygons with one important exception, namely parallelogram. Algorithmic procedure is proposed to eliminate the higher-order echoes and retrieve the room geometry. Numerical simulations are provided to demonstrate the effectiveness of our approach.