With the growing significance of data privacy protection, Source‐Free Domain Adaptation (SFDA) has gained attention as a research topic that aims to transfer knowledge from a labeled source domain to an unlabeled target domain without accessing source data. However, the absence of source data often leads to model collapse or restricts the performance improvements of SFDA methods, as there is insufficient true‐labeled knowledge for each category. To tackle this, Source‐Free Active Domain Adaptation (SFADA) has emerged as a new task that aims to improve SFDA by selecting a small set of informative target samples labeled by experts. Nevertheless, existing SFADA methods impose a significant burden on human labelers, requiring them to continuously label a substantial number of samples throughout the training period. In this paper, a novel approach is proposed to alleviate the labeling burden in SFADA by only necessitating the labeling of an extremely small number of samples on a one‐time basis . Moreover, considering the inherent sparsity of these selected samples in the target domain, a Self‐adaptive Clustering‐based Active Learning (SCAL) method is proposed that propagates the labels of selected samples to other datapoints within the same cluster. To further enhance the accuracy of SCAL, a self‐adaptive scale search method is devised that automatically determines the optimal clustering scale, using the entropy of the entire target dataset as a guiding criterion. The experimental evaluation presents compelling evidence of our method's supremacy. Specifically, it outstrips previous SFDA methods, delivering state‐of‐the‐art (SOTA) results on standard benchmarks. Remarkably, it accomplishes this with less than 0.5% annotation cost, in stark contrast to the approximate 5% required by earlier techniques. The approach thus not only sets new performance benchmarks but also offers a markedly more practical and cost‐effective solution for SFADA, making it an attractive choice for real‐world applications where labeling resources are limited.
Efficient police booth deployment is vital for optimizing law enforcement and maintaining public safety. This paper tackles two key challenges in current solutions: insufficient coverage and redundant overlaps. First, this article introduces the Simultaneous Optimization for Max Coverage and Min Overlap model (SOOM-MCMO), which formalizes the dual objectives into a unified optimization framework. Second, to address limitations of traditional wolf pack algorithm, this article presents the Adaptive-Approaching Framework with Dynamic-Grid-Siege Wolf Pack Algorithm (AAF-DGS-WPOA). This technique dynamically adjusts searcher populations using spatial symmetry and hybrid optimization strategies, thereby enhancing coverage precision and reducing computational costs. Our proposed method (AAF-DGS-WPOA-based Police Booth Planning Method, PBPM-AAFDGS-WPOA) was evaluated on 20 public datasets as well as SOOM-MCMO. Results showed 15–30% coverage improvement and a 16.65% runtime reduction versus popular benchmarks like PSO, GA, and WDX_WPOA. The improved wolf pack algorithm also outperformed traditional approaches in coverage sufficiency, resource efficiency, and system responsiveness. This work advances practical methods for police booth planning, achieving higher social security outputs with lower resource investment.
Facial Beauty Prediction (FBP) aims to develop a machine that can automatically predict facial attractiveness. Recent advances demonstrate that deep learning models have achieved promising results in FBP tasks. However, conventional deep learning models lack the efficient ability to generalize to unseen attribute domain data, as attributes cause distribution discrepancy (asymmetry) among face data. To address this issue, we propose a simple yet effective method called MixAttr, a lightweight plug-and-play module that mixes two randomly selected feature statistics with different attributes to form a newly attributed feature. In this way, the feature space is implicitly enriched by increasing the diversity of features and mitigating the model shift caused by a single attribute, which benefits the decoupling of attributes and facial beauty prediction. Extensive experiments conducted to evaluate the properties and effectiveness of our method show that MixAttr can be flexibly inserted into existing network architectures to achieve state-of-the-art performance on different FBP benchmarks (e.g., a Pearson correlation of 0.9307 on SCUT-FBP5500). This feature mixing implicitly enriches the representation space, which is key to mitigating attribute-induced asymmetry and improving generalization. Additionally, we have also extended our method to the task of facial age estimation, demonstrating through superior experimental results that our method can also be applied to other attribute prediction tasks. We propose that distribution discrepancy in FBP can be viewed as a form of asymmetry in the feature space across different demographic groups. MixAttr mitigates this asymmetry by implicitly enriching the feature space and encouraging a more symmetric and attribute-invariant feature representation. By disentangling task-irrelevant attributes from task-oriented features, our method can improve both the accuracy and generalizability of deep models on tasks involving facial attribute prediction.