It is expensive and time-consuming to collect sufficient labeled data for human activity recognition (HAR). Domain adaptation is a promising approach for cross-domain activity recognition. Existing methods mainly focus on adapting cross-domain representations via domain-level, class-level, or sample-level distribution matching. However, they might fail to capture the fine-grained locality information in activity data. The domain- and class-level matching are too coarse that may result in under-adaptation, while sample-level matching may be affected by the noise seriously and eventually cause over-adaptation. In this paper, we propose substructure-level matching for domain adaptation (SSDA) to better utilize the locality information of activity data for accurate and efficient knowledge transfer. Based on SSDA, we propose an optimal transport-based implementation, Substructural Optimal Transport (SOT), for cross-domain HAR. We obtain the substructures of activities via clustering methods and seeks the coupling of the weighted substructures between different domains. We conduct comprehensive experiments on four public activity recognition datasets (i.e. UCI-DSADS, UCI-HAR, USC-HAD, PAMAP2), which demonstrates that SOT significantly outperforms other state-of-the-art methods w.r.t classification accuracy (9%+ improvement). In addition, our mehtod is 5x faster than traditional OT-based DA methods with the same hyper-parameters.
翻译:为人类活动识别收集足够的标签数据(HAR)既费钱又费时。适应领域是跨领域活动识别的一个很有希望的方法。现有方法主要侧重于通过域级、级级或抽样级分布配对来调整跨部域表示方式。然而,它们可能未能在活动数据中捕捉精细化的地方信息。域级和类级匹配过于粗糙,可能导致适应不足,而抽样匹配可能受到噪音的严重影响,并最终导致过度适应。在本文件中,我们提议为域适应(SSSCDA)进行结构层面的下级匹配,以更好地利用活动数据的位置信息,促进准确和高效的知识转让。在SDADA的基础上,我们建议采用基于运输的最佳实施方法,即结构性最佳最佳最佳的优化最佳运输方法(SOT),用于跨领域的最佳方法。我们通过集群方法获取活动亚结构的亚结构,并寻求在不同领域之间加权的亚结构的组合。我们对四种公共活动识别数据集(即UCI-DS-DADS、UHA-DA-A-A-AA-AAAAAA-A-DR-A-ADR-DSA-A-AG-DR-A-A-DR-SDR-DR-DR)进行显著的改进方法,该方法与SDR-DR-A-A-A-A-A-A-A-A-A-A-A-A-A-DR-A-A-DR-B-B-B-B-DR-A-DR-T-AG-T-T-T-DR-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-D-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-T-D-D-D-D-D-D-T-T-T-T-