Existing SOTA methods in active learning object detection(ALOD) achieve impressive results, but they overlook two problems: (1) the requirement for instance-level labels during initialization, and (2) the constrained localization ability of the pre-trained fully supervised detector in the active learning phase. Problem (1) contradicts the fundamental purpose of active learning in balancing annotation costs and detection performance. Problem (2) arises from the fact that the active learning process relies on a single pre-trained fully supervised detector. To tackle these problems, we propose Image-level Labels Driven active learning object detection (termed as ILD). Specifically, we propose a multi-step reasoning process based on the chain-of-thought only using image-level labels, including a class-number-aware step and an iterative step, to enhance the detection ability of VLM. The detection results of the VLM and weakly supervised detector are used as pseudo ground-truth boxes to initialize a fully supervised detector during AL initialization. Thus, the initialization process of ILD eliminates the requirement for instance-level labels. In the active learning stage, we design two novel uncertainty and diversity acquisition functions to select the most informative images based on collaborative outputs from both the weakly supervised detector and the pre-trained fully supervised detector. The collaborative mechanism jointly measures the uncertainty of two detectors and the diversity of object features, thereby enhancing the localization quality. Extensive experiments demonstrate that the proposed ILD achieves state-of-the-art performance(i.e., 77.5%, 25.7%, and 27.9%) on PASCAL VOC2007, MS COCO2014 and MS COCO2017 datasets, surpassing the SOTA methods by 3.4%, 1.2% and 4.7%, respectively. Our code is publicly available on https://github.com/RuiTianHIT/ILD.

Owing to the normalized instance scales and robust supervision, heatmap-based human pose estimation (HPE) methods with top-down paradigm have achieved a dominant performance. However, there are two inherent deviations in the basic framework, i.e., representation and target deviations, resulting in performance bottlenecks. The representation deviation is caused by transforming various scales of instances into a unified input size, which results in performance degradation because data with different scale-related characteristics can hardly be handled via unified parameters. The target deviation is caused by exploiting a prior distribution (e.g., Gauss) to model the prediction error, which hinders sufficient network training. In this article, we propose a novel framework called DRPose to revise the abovementioned deviations. Specifically, to address the representation deviation, a scale-aware domain bridging (SDB) block is proposed to transfer feature maps from multiple scale-dependent domains into a unified intermediate domain with dynamic parameters. To address the target deviation, a differentiable coordinate decoder (DCD) is presented to adaptively adjust target distribution of heatmaps in an end-to-end manner. Extensive experiments show that the proposed method significantly improves the performance of most existing models with negligible additional cost. Beyond this, our method achieves 77.1% AP on the COCO test-dev set, outperforming prior works with similar model complexity.

Object detection in dark conditions has always been a great challenge due to the complex formation process of low-light images. Currently, the mainstream methods usually adopt domain adaptation with Teacher-Student architecture to solve the dark object detection problem, and they imitate the dark conditions by using non-learnable data augmentation strategies on the annotated source daytime images. Note that these methods neglected to model the intrinsic imaging process, i.e. image signal processing (ISP), which is important for camera sensors to generate low-light images. To solve the above problems, in this paper, we propose a novel method named ISP-Teacher for dark object detection by exploring Teacher-Student architecture from a new perspective (i.e. self-supervised learning based ISP degradation). Specifically, we first design a day-to-night transformation module that consistent with the ISP pipeline of the camera sensors (ISP-DTM) to make the augmented images look more in line with the natural low-light images captured by cameras, and the ISP-related parameters are learned in a self-supervised manner. Moreover, to avoid the conflict between the ISP degradation and detection tasks in a shared encoder, we propose a disentanglement regularization (DR) that minimizes the absolute value of cosine similarity to disentangle two tasks and push two gradients vectors as orthogonal as possible. Extensive experiments conducted on two benchmarks show the effectiveness of our method in dark object detection. In particular, ISP-Teacher achieves an improvement of +2.4% AP and +3.3% AP over the SOTA method on BDD100k and SHIFT datasets, respectively. The code can be found at https://github.com/zhangyin1996/ISP-Teacher.

Extensive research has been conducted on efficient and privacy-preserving similarity queries in eHealthcare, aiming at disease diagnosis based on similar patients while protecting the outsourced sensitive healthcare data. In this article, a new secure similarity query scheme named keyword-oriented multidimensional similarity query (KMSQ) is proposed for eHealthcare. Different from the state-of-the-art similar works, our proposed scheme enables users to query historical similar patients’ records based on their multidimensional physiological characteristics and symptom keywords (two data types) at the same time. Although the query can be securely performed sequentially by formerly proposed schemes, we carefully tailor a binary-decision-PB (BD-PB) tree to index the two data types simultaneously for efficient queries. Furthermore, inspired by the Hilbert exclusion condition and the properties of the polynomial function, an efficient query algorithm based on the BD-PB tree is designed in a filtration–verification manner, which further greatly improves the computational efficiency of queries, especially on the server side. To ensure secure query on untrusted clouds, the BD-PB tree-based KMSQ is protected through multiple encryption techniques. Specifically, function-hiding inner product preserving encryption (FHIPPE) is modified and combined with a lightweight matrix encryption technique to achieve secure data filtration. In addition, a symmetric homomorphic encryption (SHE) scheme is utilized to ensure secure verification that each candidate record in the filtration result satisfies the query requirements. Security analysis demonstrates the modified FHIPPE (MFHIPPE) and our proposed scheme meet the necessary security properties under the honest-but-curious model. Finally, extensive experiments are also conducted to show that KMSQ is computationally efficient.