Fine-Grained Fragment Diffusion for Cross-Domain Crowd Counting

被引:6
|
作者
Zhu, Huilin [1 ]
Yuan, Jingling [1 ]
Yang, Zhengwei [2 ]
Zhong, Xian [1 ]
Wang, Zheng [2 ]
机构
[1] Wuhan Univ Technol, Sch Comp Sci & Artificial Intelligence, Wuhan, Peoples R China
[2] Wuhan Univ, Sch Comp Sci, Wuhan, Peoples R China
基金
中国国家自然科学基金;
关键词
Crowd Counting; Cross-domain; Distribution Alignment; Fine-Grained Similarity;
D O I
10.1145/3503161.3548298
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Deep learning improves the performance of crowd counting, but model migration remains a tricky challenge. Due to the reliance on training data and inherent domain shift, model application to unseen scenarios is tough. To facilitate the problem, this paper proposes a cross-domain Fine-Grained Fragment Diffusion model (FGFD) that explores feature-level fine-grained similarities of crowd distributions between different fragments to bridge the cross-domain gap (content-level coarse-grained dissimilarities). Specifically, we obtain features of fragments in both source and target domains, and then perform the alignment of the crowd distribution across different domains. With the assistance of the diffusion of crowd distribution, it is able to label unseen domain fragments and make source domain close to target domain, which is fed back to the model to reduce the domain discrepancy. By monitoring the distribution alignment, the distribution perception model is updated, then the performance of distribution alignment is improved. During the model inference, the gap between different domains is gradually alleviated. Multiple sets of migration experiments show that the proposed method achieves competitive results with other state-of-the-art domain-transfer methods.
引用
收藏
页码:5659 / 5668
页数:10
相关论文
共 50 条
  • [31] Error-Aware Density Isomorphism Reconstruction for Unsupervised Cross-Domain Crowd Counting
    He, Yuhang
    Ma, Zhiheng
    Wei, Xing
    Hong, Xiaopeng
    Ke, Wei
    Gong, Yihong
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 1540 - 1548
  • [32] A fine-grained flexible graph convolution network for visual inspection of resistance spot welds using cross-domain features
    Li, Qiu
    Yang, Bo
    Wang, Shilong
    Zhang, Zhengping
    Tang, Xiaoli
    Zhao, Chunyang
    JOURNAL OF MANUFACTURING PROCESSES, 2022, 78 : 319 - 329
  • [33] Cross-Domain Adversarial Autoencoder for Fine Grained Category Preserving Image Translation
    Hou, Haodi
    Hu, Jing
    Gao, Yang
    2020 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2020,
  • [34] Fine-Grained Sentiment Analysis of Cross-Domain Chinese E-Commerce Texts Based on SKEP_Gram-CDNN
    Zhang, Yanrong
    Zhu, Chengxiang
    Xie, Yunxi
    IEEE ACCESS, 2023, 11 : 74058 - 74070
  • [35] Parameterised and Fine-Grained Subgraph Counting, Modulo 2
    Goldberg, Leslie Ann
    Roth, Marc
    ALGORITHMICA, 2024, 86 (04) : 944 - 1005
  • [36] FINE-GRAINED MULTI-CLASS OBJECT COUNTING
    Go, Hyojun
    Byun, Junyoung
    Park, Byeongjun
    Choi, Myung-Ae
    Yoo, Seunghwa
    Kim, Changick
    2021 IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING (ICIP), 2021, : 509 - 513
  • [37] Fine-Grained Reductions from Approximate Counting to Decision
    Dell, Holger
    Lapinskas, John
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2021, 13 (02)
  • [38] Fine-Grained Probability Counting: Refined LogLog Algorithm
    Wang, Lun
    Cai, Zekun
    Wang, Hao
    Jiang, Jie
    Yang, Tong
    Cui, Bin
    Li, Xiaoming
    2018 IEEE INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2018, : 176 - 183
  • [39] Fine-Grained Reductions from Approximate Counting to Decision
    Dell, Holger
    Lapinskas, John
    STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 281 - 288
  • [40] Parameterised and Fine-Grained Subgraph Counting, Modulo 2
    Leslie Ann Goldberg
    Marc Roth
    Algorithmica, 2024, 86 : 944 - 1005