Abstract
We propose a method for extracting a shadow matte from a single image. The removal of shadows from a single image is a difficult problem to solve unless additional information is available. We use user-supplied hints to solve the problem. The proposed method estimates a fractional shadow matte using a graph cut energy minimization approach. We present a new hierarchical graph cut algorithm that efficiently solves the multi-labeling problems, allowing our approach to run at interactive speeds. The effectiveness of the proposed shadow removal method is demonstrated using various natural images, including aerial photographs.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Nielsen, M., Madsen, C.B.: Graph cut based segmentation of soft shadows for seamless removal and augmentation. In: Proc. of Scandinavian Conf. on Image Anal. (SCIA), pp. 918–927 (2007)
Boykov, Y., Veksler, O., Zabih, R.: Fast approximate energy minimization via graph cuts. IEEE Trans. on Patt. Anal. and Mach. Intell. 23(11), 1222–1239 (2001)
Ishikawa, H.: Exact optimization for markov random fields with convex priors. IEEE Trans. on Patt. Anal. and Mach. Intell. 25(10), 1333–1336 (2003)
Weiss, Y.: Deriving intrinsic images from image sequences. In: Proc. of Int’l Conf. on Comp. Vis. (ICCV), vol. 2, pp. 68–75 (2001)
Matsushita, Y., Nishino, K., Ikeuchi, K., Sakauchi, M.: Illumination normalization with time-dependent intrinsic images for video surveillance. IEEE Trans. on Patt. Anal. and Mach. Intell. 26(10), 1336–1347 (2004)
Finlayson, G.D., Drew, M.S., Lu, C.: Intrinsic images by entropy minimization. In: Pajdla, T., Matas, J(G.) (eds.) ECCV 2004. LNCS, vol. 3023, pp. 582–595. Springer, Heidelberg (2004)
Fredembach, C., Finlayson, G.: Simple shadow removal. In: Proc. of Int’l Conf. on Patt. Recog. (ICPR), pp. 832–835 (2006)
Tappen, M.F., Freeman, W.T., Adelson, E.H.: Recovering intrinsic images from a single image. IEEE Trans. on Patt. Anal. and Mach. Intell. 27(9), 1459–1472 (2005)
Baba, M., Mukunoki, M., Asada, N.: Shadow removal from a real image based on shadow density. In: ACM SIGGRAPH Posters, p. 60 (2004)
Arbel, E., Hel-Or, H.: Texture-preserving shadow removal in color images containing curved surfaces. In: Proc. of Comp. Vis. and Patt. Recog. CVPR (2007)
Wu, T.P., Tang, C.K.: A bayesian approach for shadow extraction from a single image. In: Proc. of Int’l Conf. on Comp. Vis. (ICCV), vol. 1, pp. 480–487 (2005)
Wu, T.P., Tang, C.K., Brown, M.S., Shum, H.Y.: Natural shadow matting. ACM Transactions on Graphics 26(2), 8 (2007)
Li, Y., Sun, J., Tang, C.K., Shum, H.Y.: Lazy snapping. In: Proc. of ACM SIGGRAPH, pp. 303–308 (2004)
Barrow, H.G., Tenenbaum, J.M.: Recovering intrinsic scene characteristics from images. In: Computer Vision Systems, pp. 3–26 (1978)
Levin, A., Zomet, A., Weiss, Y.: Separating reflections from a single image using local features. In: Proc. of Comp. Vis. and Patt. Recog. (CVPR), pp. 306–313 (2004)
Rother, C., Kolmogorov, V., Blake, A.: Grabcut — interactive foreground extraction using iterated graph cuts. In: Proc. of ACM SIGGRAPH, pp. 309–314 (2004)
D’Elia, C., Poggi, G., Scarpa, G.: A tree-structured markov random field model for bayesian image segmentation. IEEE Trans. on Image Processing 12(10), 1259–1273 (2003)
Feng, W., Liu, Z.Q.: Self-validated and spatially coherent clustering with net-structured mrf and graph cuts. In: Proc. of Int’l Conf. on Patt. Recog. (ICPR), pp. 37–40 (2006)
Lombaert, H., Sun, Y., Grady, L., Xu, C.: A multilevel banded graph cuts method for fast image segmentation. In: Proc. of Int’l Conf. on Comp. Vis. (ICCV), vol. 1, pp. 259–265 (2005)
Nagahashi, T., Fujiyoshi, H., Kanade, T.: Image segmentation using iterated graph cuts based on multi-scale smoothing. In: Proc. of Asian Conf. on Comp. Vis. (ACCV), pp. 806–816 (2007)
Darbon, J., Sigelle, M.: Image restoration with discrete constrained total variation. J. Math. Imaging Vis. 26(3), 261–276 (2006)
Juan, O., Boykov, Y.: Active graph cuts. In: Proc. of Comp. Vis. and Patt. Recog. (CVPR), pp. 1023–1029 (2006)
Lempitsky, V., Rother, C., Blake, A.: Logcut - efficient graph cut optimization for markov random fields. In: Proc. of Int’l Conf. on Comp. Vis., ICCV (2007)
Komodakis, N., Tziritas, G., Paragios, N.: Fast, approximately optimal solutions for single and dynamic MRFS. In: Proc. of Comp. Vis. and Patt. Recog. CVPR (2007)
Scharstein, D., Pal, C.: Learning conditional random fields for stereo. In: Proc. of Comp. Vis. and Patt. Recog. CVPR (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miyazaki, D., Matsushita, Y., Ikeuchi, K. (2010). Interactive Shadow Removal from a Single Image Using Hierarchical Graph Cut. In: Zha, H., Taniguchi, Ri., Maybank, S. (eds) Computer Vision – ACCV 2009. ACCV 2009. Lecture Notes in Computer Science, vol 5994. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12307-8_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-12307-8_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12306-1
Online ISBN: 978-3-642-12307-8
eBook Packages: Computer ScienceComputer Science (R0)