With the prevalence of smart devices, such as smart phones, wearable equipments, and infrastructures, location-based service (LBS) has thrived in our daily life. In those practical LBS applications, group detection and tracking is a context-related research field in many scenarios, such as school yard, office building, shopping mall and so on. In this paper, we heuristically develop a temporal-spatial method for clustering and locating the groups, and then leverage a CRF-based event detection mechanism to improve the performance of recognizing contextual behaviors. The experimental results demonstrate that our system can achieve an impressive accuracy and precision of grouping and tracking.
Indoor localization on smartphones is an enabler for a number of ubiquitous and mobile computing applications attracting worldwide attentions. Many location-based services rely on WiFi fingerprinting approaches to achieve a reasonable accuracy. However, there is still room for improvement due to the prevalent-existing errors (e.g., 8∼12 m). In this study, we devise and implement a high-accuracy indoor localization solution leveraging the WiFi-based method and pedestrian mobility provided by smartphones. Our basic idea is that WiFi-only localization can generate rough but absolute positions, while user motion is able to bring accurate but relative locations. Taking both sides into account simultaneously, we design techniques to refine the raw WiFi positions in the process of laying the precise local trajectory appropriately down to the absolute coordinate using a novel least median of squares (LMS) fit algorithm. We develop a prototype system, named TraIL, and conduct comprehensive experiments in a building along different shaped routes. The evaluation results show that TraIL can achieve 80% improvement on average error with respect to WiFi-only indoor localization.
A digital twin-enabled power allocation scheme is proposed to realize flexible SNR optimization using Autoencoder. Three customized SNR targets are achieved, which is useful for accurate margin planning in mixed-line-rate transmission systems.
Feature selection is one of the challenging problems facing data analysis in areas such as pattern recognition, data mining, and decision support. Many rough set algorithms for feature selection have been developed, most of which are essentially dependent on the definite information contained within the lower approximation. This paper proposes a novel approach, called Unbalanced binary tree based feature selection (UBT-FS), which utilizes the indefinite information contained within rough set boundary region for reduction. UBT-FS designs the underlying mechanism for obtaining the boundary region from the unbalanced binary tree and adopts the boundary region based significance for determining the optimal search path as well as the boundary region based evaluation criterion for identifying feature subsets. These allow UBT-FS to have considerable ability in finding an optimal or suboptimal reduct whilst simultaneously achieving obviously better computational efficiency than other available algorithms, which is also supported by the experimental results.