Simple Shadow Removal

Given the location of shadows, how can we obtain highquality shadow-free images? Several methods have been proposed so far, but they either introduce artifacts or can be difficult to implement. We propose here a simple method that results in virtually error and shadow-free images in a very short time. Our approach is based on the insight that shadow regions differ from their shadow-free counterparts by a single scaling factor. We derive a robust method to obtain that factor. We show that for complex scenes containing many disjointed shadow regionsour new method is faster and more robust than others previously published. The method delivers good performance on a variety of out-

[1]  W D Wright,et al.  Color Science, Concepts and Methods. Quantitative Data and Formulas , 1967 .

[2]  G. Wyszecki,et al.  Color Science Concepts and Methods , 1982 .

[3]  Rama Chellappa,et al.  A Method for Enforcing Integrability in Shape from Shading Algorithms , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[4]  Huang Yumin,et al.  A PHYSICAL APPROACH TO COLOR IMAGE UNDERSTANDING , 1991 .

[5]  Guillermo Sapiro,et al.  Image inpainting , 2000, SIGGRAPH.

[6]  Yair Weiss,et al.  Deriving intrinsic images from image sequences , 2001, Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001.

[7]  Mark S. Drew,et al.  Removing Shadows from Images , 2002, ECCV.

[8]  Hao Jiang,et al.  Tracking objects with shadows , 2003, IS&T/SPIE Electronic Imaging.

[9]  Cheng Lu,et al.  Intrinsic Images by Entropy Minimization , 2004, ECCV.

[10]  J. M. Rubin,et al.  Color vision and image intensities: When are changes material? , 1982, Biological Cybernetics.

[11]  Michael J. Swain,et al.  Color indexing , 1991, International Journal of Computer Vision.

[12]  Patrick Pérez,et al.  Region filling and object removal by exemplar-based image inpainting , 2004, IEEE Transactions on Image Processing.

[13]  Graham D. Finlayson,et al.  Hamiltonian Path based Shadow Removal , 2005, BMVC.