# Opt

@article{DeVito2017Opt, title={Opt}, author={Zach DeVito and Michael Mara and Michael Zollh{\"o}fer and Gilbert Louis Bernstein and Jonathan Ragan-Kelley and Christian Theobalt and Pat Hanrahan and Matthew Fisher and Matthias Nie{\ss}ner}, journal={ACM Transactions on Graphics (TOG)}, year={2017}, volume={36}, pages={1 - 27} }

Many graphics and vision problems can be expressed as non-linear least squares optimizations of objective functions over visual data, such as images and meshes. The mathematical descriptions of these functions are extremely concise, but their implementation in real code is tedious, especially when optimized for real-time performance on modern GPUs in interactive applications. In this work, we propose a new language, Opt,1 for writing these objective functions over image- or graph-structured… Expand

#### Figures from this paper

#### 19,439 Citations

Thallo - Scheduling for High-Performance Large-Scale Non-Linear Least-Squares Solvers

- Computer Science
- ACM Trans. Graph.
- 2021

Large-scale optimization problems at the core of many graphics, vision, and imaging applications are often implemented by hand in tedious and error-prone processes in order to achieve high… Expand

Differentiable programming for image processing and deep learning in halide

- Computer Science
- ACM Trans. Graph.
- 2018

This work extends the image processing language Halide with general reverse-mode automatic differentiation (AD), and the ability to automatically optimize the implementation of gradient computations, and shows how differentiable programming enables dramatically improving the quality of even traditional, feed-forward image processing algorithms, blurring the distinction between classical and deep methods. Expand

An Efficient Solution to Structured Optimization Problems using Recursive Matrices

- Computer Science
- Comput. Graph. Forum
- 2019

This work presents a linear algebra framework for structured matrices and general optimization problems that yields a speedup of 3–5 compared to other optimization frameworks and defines mixed matrices, which allow every element to be of a different type. Expand

Fast Nonlinear Least Squares Optimization of Large‐Scale Semi‐Sparse Problems

- Computer Science
- Comput. Graph. Forum
- 2020

A novel iterative solver is introduced for nonlinear least squares optimization of large‐scale semi‐sparse problems using the nonlinear Levenberg‐Marquardt method, and results are obtained up to one order of magnitude faster than other existing solvers, without sacrificing the generality and the accuracy of the model. Expand

Massively parallel data processing for quantitative total flow imaging with optical coherence microscopy and tomography

- Computer Science
- Comput. Phys. Commun.
- 2017

An application of massively parallel processing of quantitative flow measurements data acquired using spectral optical coherence microscopy and achieved a 150 fold reduction in processing time when compared to a former CPU implementation. Expand

Optimization of freeform surfaces using intelligent deformation techniques for LED applications

- Computer Science
- 2018

This research addresses two important issues: the selection of appropriate vertices of the cubical grid and the surfaces created by them are not always feasible to manufacture, which is the same problem faced in any optimization technique while creating freeform surfaces. Expand

Freeform surface descriptions. Part II: Application benchmark

- Computer Science
- 2017

Recommendations for the right choice of freeform surface representations for practical issues in the optimization of optical systems can be given under restrictions of the benchmark assumptions. Expand

Symmetric moving frames

- Computer Science
- ACM Trans. Graph.
- 2019

A fundamentally new representation of 3D cross fields based on Cartan's method of moving frames is introduced, finding that cross fields and ordinary frame fields are locally characterized by identical conditions on their Darboux derivative, and applies this representation to compute 3DCross fields that are as smooth as possible everywhere but on a prescribed network of singular curves. Expand

"First time right" - calculating imaging systems from scratch -INVITED

- EPJ Web of Conferences
- 2021

Freeform optics can be used to greatly extend the functionalities, improve performance, and reduce the volume and weight of optical systems. Today, the design of imaging systems largely relies on… Expand

SHARP: a distributed, GPU-based ptychographic solver

- Physics, Computer Science
- 2016

A set of algorithmic and computational methodologies used at the Advanced Light Source, and DOE light sources packaged as a CUDA based software environment named SHARP is introduced, aimed at providing state-of-the-art high-throughput ptychography reconstructions for the coming era of diffraction limited light sources. Expand

#### References

SHOWING 1-10 OF 12 REFERENCES

Limit Theorems for Stochastic Processes

- Mathematics
- 1987

I. The General Theory of Stochastic Processes, Semimartingales and Stochastic Integrals.- II. Characteristics of Semimartingales and Processes with Independent Increments.- III. Martingale Problems… Expand

Asymptotic arbitrage in large financial markets

- Economics, Computer Science
- Finance Stochastics
- 1998

The suggested theory can be considered as a natural extension of Arbirage Pricing Theory covering the continuous as well as the discrete time case. Expand

On the range of options prices

- Economics, Computer Science
- Finance Stochastics
- 1997

This paper considers the valuation of an option with time to expiration and pay-off function which is a convex function, and constant interest rate, and finds that, for “most” such models, the range of the values of the option is the interval, this interval being the biggest interval in which the values must lie, whatever model is used. Expand

Robustness of the Black and Scholes Formula

- Economics
- 1998

Consider an option on a stock whose volatility is unknown and stochastic. An agent assumes this volatility to be a specific function of time and the stock price, knowing that this assumption may… Expand

Dynamic Programming and Pricing of Contingent Claims in an Incomplete Market

- Mathematics
- 1995

The problem of pricing contingent claims or options from the price dynamics of certain securities is well understood in the context of a complete financial market. This paper studies the same problem… Expand

Equivalent martingale measures and no-arbitrage in stochastic securities market models

- Mathematics
- 1990

We characterize those vector-valued stochastic processes (with a finite index set and defined on an arbitrarystochasic base) which can become a martingale under an equivalent change of measure.This… Expand

Processes of normal inverse Gaussian type

- Mathematics, Computer Science
- Finance Stochastics
- 1997

A number of stochastic processes with normal inverse Gaussian marginals and various types of dependence structures are discussed, including Ornstein-Uhlenbeck type processes, superpositions of such processes and Stochastic volatility models in one and more dimensions. Expand

ABSOLUTE CONTINUITY AND SINGULARITY OF LOCALLY ABSOLUTELY CONTINUOUS PROBABILITY DISTRIBUTIONS. I

- Mathematics
- 1979

The second part of this study deals with criteria for the absolute continuity of measures for various classes of random processes, starting out from the general results in Part I. We consider… Expand

Optional decomposition of supermartingales and hedging in incomplete security markets

- Probability Theory and Related Fields,
- 1996

Probabilité et Potentiel

- Hermann, Paris,
- 1976