¿Qué está mal?

Aviso: Antes de informar sobre un error con la descarga, por favor, prueba el enlace directo: Probabilistic Programming for Procedural Modeling and Design


Debes iniciar sesión para hacer esto.

Probabilistic Programming for Procedural Modeling and Design

Probabilistic Programming for Procedural Modeling and Design

Probabilistic Programming for Procedural Modeling and Design

Puntuación: ---- | 0 votos
| Enviando voto
| ¡Votado!

Detalles del libro:

Editor:Standford University
Páginas:152 páginas
Tamaño:43.10 MB


Procedural modeling, or the use of pseudo-random programs to generate visual content, plays an important role in computer graphics and design. It facilitates content creation at massive scales, can automatically create painstakingly-detailed imagery, and can even generate pleasantly surprising results that can help people to navigate large and unintuitive design spaces.

Many procedural modeling applications demand directable content—the ability to enforce aesthetic or functional constraints on model output. Bayesian inference provides a framework for such control: the procedural model specifies a generative prior, with the constraints encoded as a likelihood function.

In this dissertation, we use probabilistic programming languages to express such Bayesian procedural models. A probabilistic programming language (PPL) provides random choice and Bayesian conditioning operators as primitives, and inference corresponds to searching the space of program executions for high-probability execution traces. PPLs can concisely express arbitrary probability distributions, including the complex, hierarchical, and often recursive stochastic processes required in procedural modeling.

Unfortunately, PPL inference is typically inefficient, relying on expensive Monte Carlo methods. This dissertation develops a suite a of techniques for speeding up PPL inference. First, we eliminate redundant computation from Metropolis-Hastings, one of the most commonly used PPL inference algorithms. Next, we show how to efficiently explore tightly-constrained design spaces using the gradient-based, Hamiltonian Monte Carlo algorithm. Then, we address the problems posed by deep branching structures in procedural models such as recursive trees, using a new variant of Sequential Monte Carlo. Finally, we make procedural modeling programs learn from their own outputs, using neural networks that guide programs toward high-probability results with fewer samples. Together, these tools bring PPL inference closer to interactive rates, which can enable more compelling graphics and design applications.



Cargando comentarios...

Escaneando listas...

El libro en números

Posición global

posición en categorías

en catálogo desde



Nothing yet...


Nothing yet...

'LIKES' sociales

Nothing yet...



Esto puede tardar un momento


Segmentación por países

Esto puede tardar un momento

Páginas de entrada

Segmentación por sitios web


Esto puede tardar un momento