Variational Tree Synthesis
نویسندگان
چکیده
Modelling trees according to desired shapes is important formany applications. Despite numerousmethods having been proposed in tree modelling, it is still a non-trivial task and challenging. In this paper, we present a new variational computing approach for generating realistic trees in specific shapes. Instead of directly modelling trees from symbolic rules, we formulate the tree modelling as an optimization process, in which a variational cost function is iteratively minimized. This cost function measures the difference between the guidance shape and the target tree crown. In addition, to faithfully capture the branch structure of trees, several botanical factors, including the minimum total branches volume and spatial branches patterns, are considered in the optimization to guide the tree modelling process. We demonstrate that our approach is applicable to generate trees with different shapes, from interactive design and complex polygonal meshes.
منابع مشابه
Tree-structured Approximations by Expectation Propagation
Approximation structure plays an important role in inference on loopy graphs. As a tractable structure, tree approximations have been utilized in the variational method of Ghahramani & Jordan (1997) and the sequential projection method of Frey et al. (2000). However, belief propagation represents each factor of the graph with a product of single-node messages. In this paper, belief propagation ...
متن کاملVariational Inference for the Nested Chinese Restaurant Process
The nested Chinese restaurant process (nCRP) is a powerful nonparametric Bayesian model for learning tree-based hierarchies from data. Since its posterior distribution is intractable, current inference methods have all relied on MCMC sampling. In this paper, we develop an alternative inference technique based on variational methods. To employ variational methods, we derive a tree-based stick-br...
متن کاملPropagation Algorithms for Variational Bayesian Learning
Variational approximations are becoming a widespread tool for Bayesian learning of graphical models. We provide some theoretical results for the variational updates in a very general family of conjugate-exponential graphical models. We show how the belief propagation and the junction tree algorithms can be used in the inference step of variational Bayesian learning. Applying these results to th...
متن کاملImage Modelling with Position-Encoding Dynamic Trees
This paper describes the Position-Encoding Dynamic Tree (PEDT). The PEDT is a probabilistic model for images which improves on the Dynamic Tree by allowing the positions of objects to play a part in the model. This increases the flexibility of the model over the Dynamic Tree and allows the positions of objects to be located and manipulated. The paper motivates and defines this form of probabili...
متن کاملVariational Approximations between Mean Field Theory and the Junction Tree Algorithm
Recently, variational approximations such as the mean field approximation have received much interest. We extend the standard mean field method by using an approximating dis tribution that factorises into cluster poten tials. This includes undirected graphs, di rected acyclic graphs and junction trees. We derive generalised mean field equations to op timise the cluster potentials. We show t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Graph. Forum
دوره 33 شماره
صفحات -
تاریخ انتشار 2014