“Example-based synthesis of 3D object arrangements” by Fisher, Ritchie, Savva, Funkhouser and Hanrahan
Conference:
Type(s):
Title:
- Example-based synthesis of 3D object arrangements
Session/Category Title: Acquiring and Synthesizing Indoor Scenes
Presenter(s)/Author(s):
Abstract:
We present a method for synthesizing 3D object arrangements from examples. Given a few user-provided examples, our system can synthesize a diverse set of plausible new scenes by learning from a larger scene database. We rely on three novel contributions. First, we introduce a probabilistic model for scenes based on Bayesian networks and Gaussian mixtures that can be trained from a small number of input examples. Second, we develop a clustering algorithm that groups objects occurring in a database of scenes according to their local scene neighborhoods. These contextual categories allow the synthesis process to treat a wider variety of objects as interchangeable. Third, we train our probabilistic model on a mix of user-provided examples and relevant scenes retrieved from the database. This mixed model learning process can be controlled to introduce additional variety into the synthesized scenes. We evaluate our algorithm through qualitative results and a perceptual study in which participants judged synthesized scenes to be highly plausible, as compared to hand-created scenes.
References:
1. Akaike, H. 1973. Information theory and an extension of the maximum likelihood principle. In Second International Symposium on Information Theory, vol. 1, 267–281.
2. Bokeloh, M., Wand, M., and Seidel, H.-P. 2010. A connection between partial symmetry and inverse procedural modeling. In ACM SIGGRAPH 2010 papers, ACM, New York, NY, USA, SIGGRAPH ’10, 104:1–104:10.
3. Chaudhuri, S., Kalogerakis, E., Guibas, L., and Koltun, V. 2011. Probabilistic reasoning for assembly-based 3D modeling. ACM Transactions on Graphics 30 (December).
4. Deng, J., Berg, A. C., and Fei-Fei, L. 2011. Hierarchical semantic indexing for large scale image retrieval. Computer Vision and Pattern Recognition, IEEE Computer Society Conference on 0, 785–792.
5. Diez, Y., and Sellarès, J. A. 2007. Efficient colored point set matching under noise. In Proceedings of the 2007 international conference on Computational science and its applications – Volume Part I, Springer-Verlag, Berlin, Heidelberg, ICCSA’07, 26–40.
6. Fisher, M., Savva, M., and Hanrahan, P. 2011. Characterizing structural relationships in scenes using graph kernels. In ACM SIGGRAPH 2011 papers, 34:1–34:12.
7. Hays, J., and Efros, A. A. 2007. Scene completion using millions of photographs. ACM Transactions on Graphics (SIGGRAPH 2007) 26, 3.
8. Kalogerakis, E., Chaudhuri, S., Koller, D., and Koltun, V. 2012. A probabilistic model for component-based shape synthesis. ACM Transactions on Graphics 31, 4.
9. Kalvin, A., and Taylor, R. 1996. Superfaces: Polygonal mesh simplification with bounded error. Computer Graphics and Applications, IEEE 16, 3, 64–77.
10. Kazhdan, M. 2007. An approximate and efficient method for optimal rotation alignment of 3d models. Pattern Analysis and Machine Intelligence, IEEE Transactions on 29, 7 (july), 1221–1229.
11. Kuhn, H. 1955. The hungarian method for the assignment problem. Naval research logistics quarterly 2, 1–2, 83–97.
12. Lawson, A., Linderman, M., Leonard, M., Stauffer, A., Pokines, B., and Carlin, M. 2009. Perturbation and pitch normalization as enhancements to speaker recognition. In Acoustics, Speech and Signal Processing, 2009. ICASSP 2009. IEEE International Conference on, IEEE, 4533–4536.
13. Merrell, P., Schkufza, E., Li, Z., Agrawala, M., and Koltun, V. 2011. Interactive furniture layout using interior design guidelines. In ACM SIGGRAPH 2011 papers, 87:1–87:10.
14. Murtagh, F. 1984. Complexities of hierarchic clustering algorithms: state of the art. Computational Statistics Quarterly 1, 2, 101–113.
15. Silverman, B. 1986. Density estimation for statistics and data analysis, vol. 26. Chapman & Hall/CRC.
16. Steinbach, M., Karypis, G., and Kumar, V. 2000. A comparison of document clustering techniques. In KDD workshop on text mining, vol. 400, 525–526.
17. Torsello, A., Albarelli, A., and Pelillo, M. 2007. Matching relational structures using the edge-association graph. In Image Analysis and Processing, 2007. ICIAP 2007. 14th International Conference on, 775–780.
18. Varga, T., and Bunke, H. 2003. Generation of synthetic training data for an hmm-based handwriting recognition system. In Document Analysis and Recognition, 2003. Proceedings. Seventh International Conference on, IEEE, 618–622.
19. Wolfson, H., and Rigoutsos, I. 1997. Geometric hashing: an overview. Computational Science Engineering, IEEE 4, 4 (oct-dec), 10–21.
20. Xu, K., Stewart, J., and Fiume, E. 2002. Constraint-based automatic placement for scene composition. In Graphics Interface 2002, 25–34.
21. Xu, K., Zhang, H., Cohen-Or, D., and Chen, B. 2012. Fit and diverse: Set evolution for inspiring 3d shape galleries. ACM Transactions on Graphics 31, 4.
22. Yeh, Y.-T., Yang, L., Watson, M., Goodman, N. D., and Hanrahan, P. 2012. Synthesizing open worlds with constraints using locally annealed reversible jump mcmc. ACM Transactions on Graphics 31, 4.
23. Yu, L.-F., Yeung, S.-K., Tang, C.-K., Terzopoulos, D., Chan, T. F., and Osher, S. J. 2011. Make it home: automatic optimization of furniture arrangement. In ACM SIGGRAPH 2011 papers, 86:1–86:12.
