Search

Domain Generalization (DG) model is an important tool to improve the robustness of person re-identification algorithm, but the domain gap makes it difficult to transfer knowledge cross-domain effectively. To solve the above problems, this paper proposes a generalization model based on a Meta-Bond Domain Alignment (M−BDA) model. To learn a generalizable model, a meta -learning strategy is introduced to simulate the training–testing process of the domain generalization. Then a bond-domain module is constructed in the training to align the source domain, which can reduce the domain gap between the source domain and the target domain, and facilitate the knowledge transfer. Finally, the bond-domain loss is counted on the feature space of the bond-domain to prevent the generated bond-domain from overfitting to the source domain. The experimental results show that the proposed algorithm achieves better performance in DukeMTMC-ReID, Market1501 and MSMT17 alternating as the source and the target domain tasks. In the generalization experiments of Market-1501 → DukeMTMC-ReID, mAP and Rank-1 increased by 7.7 % and 3.6 %, respectively, and in the generalization experiments of DukeMTMC-ReID → Market-1501, mAP and Rank-1 are increased by 9.3 % and 3.5 %, respectively, which are significantly better than the newer representative algorithms. [ABSTRACT FROM AUTHOR]

• A small target detection algorithm based on feature interaction and guided learning. • A feature guided alignment module is designed to obtain more effective features. • Gaussian distribution sample allocation strategy is introduced to obtain better samples. • Feature interaction and decoupling detection enhance the detection task capability. • A new regression loss function is used to optimize the localization ability to a certain extent. At present, for the diverse target sizes, different angles, and complex environment in aerial images, how to detect small objects effectively in aerial images is still a challenge task. In order to further improve the detection accuracy and reduce the missing rate, in this paper, we proposes a small target detection algorithm based on feature interaction and guided learning. Firstly, the feature guided alignment module is designed to deal with the problem of information loss and overlap. Secondly, the misallocation of small object samples is optimized by introducing gaussian sample allocation strategy. Then the interactive parallel detection header is designed to solve the detection task conflict problem. Finally, the new regression loss function is designed to enhance the localization ability of the target. The experimental results on the Tinyperson dataset and Visdrone dataset show that this model can improve the detection accuracy and reduce the missing rate of small targets effectively. [ABSTRACT FROM AUTHOR]

• A layout plane is a closed loop surrounded by layout keypoints. • The wall structure can be parametrization as an undirected graph. • Layout keypoint prediction is relative to human pose estimation. • Cuboid room assumption is limited in real life. Room layout estimation aims to predict the spatial structure of a room from a single image. Most existing methods relying on 2D cues are suitable for cuboid rooms, but non-cuboid rooms. 3D layout estimation methods can reconstruct 3D models of general rooms, but they are trained with depth information on high collection costs, consume large computation resources, and run slowly. This paper considers an undirected graph representation method of the general room layouts, which includes cuboid and non-cuboid rooms consisting of a single ceiling, a single floor, and multiple walls. To this end, we first predict the positions of the layout vertices and then use the network automatically learn the connection relationship between the vertices. The final layout is obtained through a simple layout inference post-processing algorithm. The experimental results both on cuboid and non-cuboid datasets validate the effectiveness and efficiency of our method. The code is available at https://github.com/Hui-Yao/2D-graph-layout-estimation. [ABSTRACT FROM AUTHOR]

Most deep learning-based image enhancement algorithms have been developed based on the image-to-image translation approach, in which enhancement processes are difficult to interpret. In this paper, we propose a novel interpretable image enhancement algorithm that estimates multiple transformation functions to describe complex color mapping. First, we develop a histogram-based multiple transformation function estimation network (HMTF-Net) to estimate multiple transformation functions by exploiting both the spatial and statistical information of the input images. Second, we estimate pixel-wise weight maps, which indicate the contribution of each transformation function at each pixel, based on the local structures of the input image and the transformed images obtained by each transformation function. Finally, we obtain the enhanced image as the weighted sum of the transformed images using the estimated weight maps. Extensive experiments confirm the effectiveness of the proposed approach and demonstrate that the proposed algorithm outperforms state-of-the-art image enhancement algorithms for different image enhancement tasks. [ABSTRACT FROM AUTHOR]

Nowadays, stereoscopic image quality assessment (SIQA) based on convolutional neural network (CNN) has become the mainstream model of image quality assessment (IQA). Compared with the two-dimensional quality evaluation model, stereoscopic image quality evaluation is more challenging due to the effects of depth and parallax information. In this paper, we propose a two-stream interactive network model to perform quality evaluation, which can well simulate the process of human stereo visual perception. Meanwhile, we enhance the extraction of local and global features of images by asymmetric convolution kernel and interactive sub-networks of inter-layers, respectively, which can further optimize our network model. Our proposed algorithm was evaluated on four public databases. The final experimental results show that our proposed algorithm exhibits good performance not only on the whole database but also on each single distortion type. [ABSTRACT FROM AUTHOR]