Optimal Illumination Distance Metrics for Person Re-Identification in Complex Lighting Conditions

被引:0
|
作者
Wang, Chao [1 ]
Wang, Zhongyuan [1 ]
Hu, Ruimin [1 ]
Wang, Xiaochen [1 ]
Zhou, Wen [2 ]
机构
[1] Wuhan Univ, Natl Engn Res Ctr Multimedia Software, Sch Comp Sci, Wuhan, Peoples R China
[2] Nanjing Univ Finance & Econ, Nanjing, Peoples R China
关键词
Person re-identification; Complex Lighting; Optimal Illumination Distance;
D O I
10.1145/3700771
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Person re-identification is extensively applied in public security and surveillance. However, environmental factors like time and location often lead to varying lighting conditions in captured pedestrian images, significantly impacting identification accuracy. Current approaches mitigate this issue through lighting transformation techniques, aiming to normalize images to a standard lighting condition for consistent person re-identification results. Yet, these methods overlook the fact that different content may hold distinct identification values under diverse lighting conditions. To address this, we conducted an analysis on the identification distance between images of the same or different pedestrians under pre-defined lighting conditions. From this analysis, we introduce the concept of optimal lighting: a condition where the distance between image pairs is minimized compared to other lighting scenarios. We propose utilizing this optimal lighting distance in the image retrieval process for final ranking. Our study, validated on synthetic datasets Market-IA and Duke-IA, demonstrates that optimal lighting is independent of image texture information. Each image pair exhibits a unique optimal lighting, yet consistently shows a minimum distance value.
引用
收藏
页数:18
相关论文
共 50 条
  • [21] Illumination Distillation Framework for Nighttime Person Re-Identification and a New Benchmark
    Lu, Andong
    Zhang, Zhang
    Huang, Yan
    Zhang, Yifan
    Li, Chenglong
    Tang, Jin
    Wang, Liang
    IEEE TRANSACTIONS ON MULTIMEDIA, 2024, 26 : 406 - 419
  • [22] A Systematic Evaluation and Benchmark for Person Re-Identification: Features, Metrics, and Datasets
    Karanam, Srikrishna
    Gou, Mengran
    Wu, Ziyan
    Rates-Borras, Angels
    Camps, Octavia
    Radke, Richard J.
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (03) : 523 - 536
  • [23] Person Re-identification in the Wild
    Zheng, Liang
    Zhang, Hengheng
    Sun, Shaoyan
    Chandraker, Manmohan
    Yang, Yi
    Tian, Qi
    30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, : 3346 - 3355
  • [24] OCCLUDED PERSON RE-IDENTIFICATION
    Zhuo, Jiaxuan
    Chen, Zeyu
    Lai, Jianhuang
    Wang, Guangcong
    2018 IEEE INTERNATIONAL CONFERENCE ON MULTIMEDIA AND EXPO (ICME), 2018,
  • [25] Person Re-identification by Attributes
    Layne, Ryan
    Hospedales, Timothy
    Gong, Shaogang
    PROCEEDINGS OF THE BRITISH MACHINE VISION CONFERENCE 2012, 2012,
  • [26] Person re-identification in crowd
    Mazzon, Riccardo
    Tahir, Syed Fahad
    Cavallaro, Andrea
    PATTERN RECOGNITION LETTERS, 2012, 33 (14) : 1828 - 1837
  • [27] Person in Uniforms Re-Identification
    Xiang, Chong-yang
    Wu, Xiao
    He, Jun-Yan
    Yuan, Zhaoquan
    He, Tingquan
    ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS, 2025, 21 (02)
  • [28] Partial Person Re-identification
    Zheng, Wei-Shi
    Li, Xiang
    Xiang, Tao
    Liao, Shengcai
    Lai, Jianhuang
    Gong, Shaogang
    2015 IEEE INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV), 2015, : 4678 - 4686
  • [29] Unsupervised domain adaptation in homogeneous distance space for person re-identification
    Zheng, Dingyuan
    Xiao, Jimin
    Wei, Yunchao
    Wang, Qiufeng
    Huang, Kaizhu
    Zhao, Yao
    PATTERN RECOGNITION, 2022, 132
  • [30] Deep feature learning with mixed distance maximization for person Re-identification
    Choe, Chunhwa
    Choe, Gwangmin
    Wang, Tianjiang
    Han, Sokmin
    Yuan, Caihong
    MULTIMEDIA TOOLS AND APPLICATIONS, 2019, 78 (19) : 27719 - 27741