Entropy Minimization for Shadow Removal

被引:247
|
作者
Finlayson, Graham D. [2 ]
Drew, Mark S. [1 ]
Lu, Cheng [3 ]
机构
[1] Simon Fraser Univ, Vancouver, BC, Canada
[2] Univ E Anglia, Norwich NR4 7TJ, Norfolk, England
[3] Micron Technol Inc, San Jose, CA USA
基金
加拿大自然科学与工程研究理事会;
关键词
Illumination; Reflectance; Intrinsic images; Illumination invariants; Color; Shadows; Entropy; Quadratic entropy; INTRINSIC IMAGES; CAST SHADOWS; COLOR;
D O I
10.1007/s11263-009-0243-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Recently, a method for removing shadows from colour images was developed (Finlayson et al. in IEEE Trans. Pattern Anal. Mach. Intell. 28:59-68, 2006) that relies upon finding a special direction in a 2D chromaticity feature space. This "invariant direction" is that for which particular colour features, when projected into 1D, produce a greyscale image which is approximately invariant to intensity and colour of scene illumination. Thus shadows, which are in essence a particular type of lighting, are greatly attenuated. The main approach to finding this special angle is a camera calibration: a colour target is imaged under many different lights, and the direction that best makes colour patch images equal across illuminants is the invariant direction. Here, we take a different approach. In this work, instead of a camera calibration we aim at finding the invariant direction from evidence in the colour image itself. Specifically, we recognize that producing a 1D projection in the correct invariant direction will result in a 1D distribution of pixel values that have smaller entropy than projecting in the wrong direction. The reason is that the correct projection results in a probability distribution spike, for pixels all the same except differing by the lighting that produced their observed RGB values and therefore lying along a line with orientation equal to the invariant direction. Hence we seek that projection which produces a type of intrinsic, independent of lighting reflectance-information only image by minimizing entropy, and from there go on to remove shadows as previously. To be able to develop an effective description of the entropy-minimization task, we go over to the quadratic entropy, rather than Shannon's definition. Replacing the observed pixels with a kernel density probability distribution, the quadratic entropy can be written as a very simple formulation, and can be evaluated using the efficient Fast Gauss Transform. The entropy, written in this embodiment, has the advantage that it is more insensitive to quantization than is the usual definition. The resulting algorithm is quite reliable, and the shadow removal step produces good shadow-free colour image results whenever strong shadow edges are present in the image. In most cases studied, entropy has a strong minimum for the invariant direction, revealing a new property of image formation.
引用
收藏
页码:35 / 57
页数:23
相关论文
共 50 条
  • [1] Entropy Minimization for Shadow Removal
    Graham D. Finlayson
    Mark S. Drew
    Cheng Lu
    International Journal of Computer Vision, 2009, 85 : 35 - 57
  • [2] Moving Cast Shadow Detection Based on Region Intrinsic Image with Entropy Minimization
    Guo, Ling
    Du, Ming-hui
    PROCEEDINGS OF 2012 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND NETWORK TECHNOLOGY (ICCSNT 2012), 2012, : 2126 - 2130
  • [3] On Entropy Minimization and Convergence
    S. Dostoglou
    A. Hughes
    Jianfei Xue
    Journal of Statistical Physics, 2019, 177 : 485 - 505
  • [4] Minimization of entropy functionals
    Leonard, Christian
    JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS, 2008, 346 (01) : 183 - 204
  • [5] On Entropy Minimization and Convergence
    Dostoglou, S.
    Hughes, A.
    Xue, Jianfei
    JOURNAL OF STATISTICAL PHYSICS, 2019, 177 (03) : 485 - 505
  • [6] From Shadow Generation to Shadow Removal
    Liu, Zhihao
    Yin, Hui
    Wu, Xinyi
    Wu, Zhenyao
    Mi, Yang
    Wang, Song
    2021 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, CVPR 2021, 2021, : 4925 - 4934
  • [7] Shadow Minimization Boolean Function Reconstruction
    Aslanyan, Levon
    Katona, Gyula
    Sahakyan, Hasmik
    INFORMATICA, 2024, 35 (01) : 1 - 20
  • [8] Entropy minimization within the maximum entropy approach
    Vakarin, E. V.
    Badiali, J. P.
    4TH INTERNATIONAL WORKSHOP ON STATISTICAL PHYSICS AND MATHEMATICS FOR COMPLEX SYSTEMS (SPMCS2014), 2015, 604
  • [9] Shadow Removal via Shadow Image Decomposition
    Le, Hieu
    Samaras, Dimitris
    2019 IEEE/CVF INTERNATIONAL CONFERENCE ON COMPUTER VISION (ICCV 2019), 2019, : 8577 - 8586
  • [10] Facial shadow removal
    Smith, William A. P.
    Hancock, Edwin R.
    STRUCTURAL, SYNTACTIC, AND STATISTICAL PATTERN RECOGNITION, PROCEEDINGS, 2006, 4109 : 569 - 577