Abstract
In this paper, we consider the problem of “importance sampling” from a high dynamic range image, motivated by a computer graphics problem called image-based lighting. Image-based lighting is a method to light a scene by using real-world images as part of a 3D environment. Intuitively, the sampling problem reduces to finding representative points from the image such that they have higher density in regions of high intensity (or energy) and low density in regions of low intensity (or energy).
We formulate this task as a facility location problem where the facility costs are a function of the demand served. In particular, we aim to encourage load balance amongst the facilities by using V-shaped facility costs that achieve a minimum at the “ideal” level of demand. We call this the load-balanced facility location problem, and it is a generalization of the uncapacitated facility location problem with uniform facility costs. We develop a primal-dual approximation algorithm for this problem, and analyze its approximation ratio using dual fitting and factor-revealing linear programs. We also give some experimental results from applying our algorithm to instances derived from real high dynamic range images.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Arthur, D., Vassilvitskii, S.: k-means++: The advantages of careful seeding. In: SODA, pp. 1027–1035 (2007)
Bansal, N., Fleischer, L., Kimbrel, T., Mahdian, M., Schieber, B., Sviridenko, M.: Further improvements in competitive guarantees for QoS buffering. In: Díaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 196–207. Springer, Heidelberg (2004)
Chvatal, V.: A greedy heuristic for the set covering problem. Math. Oper. Res. 4, 233–235 (1979)
Debevec, P.: Image-based lighting. IEEE Comput. Graph. 22(2), 26–34 (2002)
Garg, N., Khandekar, R., Pandit, V.: Improved approximation for universal facility location. In: SODA, pp. 959–960 (2005)
Goemans, M.X., Kleinberg, J.M.: An improved approximation ratio for the minimum latency problem. Math. Program. 82, 111–124 (1998)
Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithm 31(1), 228–248 (1999)
Guha, S., Meyerson, A., Munagala, K.: Hierarchical placement and network design problems. In: FOCS, pp. 603–612 (2000)
Hajiaghayi, M.T., Mahdian, M., Mirrokni, V.S.: The facility location problem with general cost functions. Networks 42(6), 42–47 (2003)
Immorlica, N., Mahdian, M., Mirrokni, V.S.: Cycle cover with short cycles. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 641–653. Springer, Heidelberg (2005)
Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. J. ACM 50(6), 795–824 (2003)
Jain, M.R.S.K., Mahdian, M.: Packing Steiner trees. In: SODA, pp. 266–274 (2003)
Karger, D.R., Minkoff, M.: Building Steiner trees with incomplete global knowledge. In: FOCS, pp. 613–623 (2000)
Mahdian, M.: Facility Location and the Analysis of Algorithms through Factor-Revealing Programs. PhD thesis, MIT, Cambridge, MA (June 2004)
Mahdian, M., Pál, M.: Universal facility location. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol. 2832, pp. 409–421. Springer, Heidelberg (2003)
Mahdian, M., Ye, Y., Zhang, J.: Improved approximation algorithms for metric facility location problems. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol. 2462, pp. 229–242. Springer, Heidelberg (2002)
Svitkina, Z.: Lower-bounded facility location. In: SODA, pp. 1154–1163 (2008)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Archer, A., Krishnan, S. (2008). Importance Sampling via Load-Balanced Facility Location. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds) Integer Programming and Combinatorial Optimization. IPCO 2008. Lecture Notes in Computer Science, vol 5035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68891-4_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-68891-4_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68886-0
Online ISBN: 978-3-540-68891-4
eBook Packages: Computer ScienceComputer Science (R0)