20 October 2020 in IEEE Transactions on Image Processing
Domain adaptation has been a fundamental technology for transferring knowledge from a source domain to a target domain. The key issue of domain adaptation is how to reduce the distribution discrepancy between two domains in a proper way such that they can be treated indifferently for learning. In this paper, we propose a novel domain adaptation approach, which can thoroughly explore the data distribution structure of target domain. Specifically, we regard the samples within the same cluster in target domain as a whole rather than individuals and assigns pseudo-labels to the target cluster by class centroid matching. Besides, to exploit the manifold structure information of target data more thoroughly, we further introduce a local manifold self-learning strategy into our proposal to adaptively capture the inherent local connectivity of target samples. An efficient iterative optimization algorithm is designed to solve the objective function of our proposal with theoretical convergence guarantee. In addition to unsupervised domain adaptation, we further extend our method to the semi-supervised scenario including both homogeneous and heterogeneous settings in a direct but elegant way. Extensive experiments on seven benchmark datasets validate the significant superiority of our proposal in both unsupervised and semi-supervised manners.
9 May 2022 in IEEE Transactions on Geoscience and Remote Sensing
Ship detection is a crucial but challenging task in optical remote sensing images. Recently, thanks to the emergence of deep neural networks (DNNs), significant progress has been made in ship detection. However, there are still two significant issues that must be addressed: 1) the high-resolution optical images may confuse the background with the ship, leading to more false alarms during detection and 2) the detector receives fewer positive samples due to the sparse and uneven distribution of ships in the optical remote sensing images. In this article, we innovatively propose using the saliency information to aid the ship detection task to tackle these two issues. To achieve this goal, we devise two novel modules, feature-enhanced structure (FES) and saliency prediction branch (SPB), to boost the capacity of ship detection in complex environments and propose a new sampling strategy named salient screening mechanism (SSM) to increase the number of positive samples. More specifically, SSM is adopted during the training phase to mine more positive samples from the ignored set. Then, in an end-to-end learning fashion, a neural network that incorporates our carefully designed FES and SPB is trained to gain more discriminative information for distinguishing the foreground and the background. To evaluate the effectiveness of our proposal, two new datasets HRSC-SO and DOTA-isaid-ship are constructed, which possess the annotation information for both object detection and saliency detection. We conduct extensive experiments on the constructed dataset, and the results demonstrate that our method outperforms the previous state-of-the-art approaches.
10 August 2022 in IEEE Transactions on Circuits and Systems for Video Technology
As one of the learning ways for inducing efficient image compact representation, graph embedding (GE) based manifold learning has been widely developed over the last two decades. Good graph embedding depends on the construction of graphs concerning intra-class compactness and inter-class separability, which are crucial indicators of the effectiveness of a model in generating discriminative features. Unsupervised approaches are designed to reveal the data structure information from a local or global perspective, but the resulting compact representation often has poorly inter-class margins due to the lack of label information. Moreover, supervised techniques only consider enhancing the adjacency affinity within classes, but exclude the affinity of different classes, resulting in inadequate capture of marginal structures between different class distributions. To overcome these issues, we propose a learning framework that implements Class-Oriented Self-Learning Graph Embedding (COSLGE), in which we achieve a flexible low-dimensional compact representation by imposing an adaptive graph learning process across the entire data while examining the inter-class separability of low-dimensional embedding by jointly learning a linear classifier. Besides, our framework can be easily extended to semi-supervised scenarios. Extensive experiments on several widely-used benchmark databases demonstrate the effectiveness of the proposed method in comparison to some state-of-the-art approaches.
25 April 2022 in Neural Processing Letters
17 February 2023 in arXiv
Domain adaptation manages to transfer the knowledge of well-labeled source data to unlabeled target data. Many recent efforts focus on improving the prediction accuracy of target pseudo-labels to reduce conditional distribution shift. In this paper, we propose a novel domain adaptation method, which infers target pseudo-labels through cross-domain label propagation, such that the underlying manifold structure of two domain data can be explored. Unlike existing cross-domain label propagation methods that separate domain-invariant feature learning, affinity matrix constructing and target labels inferring into three independent stages, we propose to integrate them into a unified optimization framework. In such way, these three parts can boost each other from an iterative optimization perspective and thus more effective knowledge transfer can be achieved. Furthermore, to construct a high-quality affinity matrix, we propose a discriminative graph self-learning strategy, which can not only adaptively capture the inherent similarity of the data from two domains but also effectively exploit the discriminative information contained in well-labeled source data and pseudo-labeled target data. An efficient iterative optimization algorithm is designed to solve the objective function of our proposal. Notably, the proposed method can be extended to semi-supervised domain adaptation in a simple but effective way and the corresponding optimization problem can be solved with the identical algorithm. Extensive experiments on six standard datasets verify the significant superiority of our proposal in both unsupervised and semi-supervised domain adaptation settings.