Results 11 - 20 of 3,968

Implementing approximate Bayesian inference for latent Gaussian models using integrated nested Laplace approximations: A manual for the inla-program

by Sara Martino, Nicolas Chopin , 2008
"... Structured additive regression models are perhaps the most commonly used class of models in statistical applications. It includes, among others, (generalised) linear models, (generalised) additive models, smoothing-spline models, state-space models, semiparametric regression, spatial and spatio-temp ..."
Abstract - Cited by 294 (20 self) - Add to MetaCart
-Gaussian response variables. The posterior marginals are not available in closed form due to the non-Gaussian response variables. For such models, Markov chain Monte Carlo methods can be implemented, but they are not without problems, both in terms of convergence and computational time. In some practical

Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data

by Danny Holten - IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS , 2006
"... A compound graph is a frequently encountered type of data set. Relations are given between items, and a hierarchy is defined on the items as well. We present a new method for visualizing such compound graphs. Our approach is based on visually bundling the adjacency edges, i.e., non-hierarchical edge ..."
Abstract - Cited by 271 (12 self) - Add to MetaCart
-hierarchical edges, together. We realize this as follows. We assume that the hierarchy is shown via a standard tree visualization method. Next, we bend each adjacency edge, modeled as a B-spline curve, toward the polyline defined by the path via the inclusion edges from one node to another. This hierarchical

A Taxonomy of Global Optimization Methods Based on Response Surfaces

by Donald R. Jones - Journal of Global Optimization , 2001
"... Abstract. This paper presents a taxonomy of existing approaches for using response surfaces for global optimization. Each method is illustrated with a simple numerical example that brings out its advantages and disadvantages. The central theme is that methods that seem quite reasonable often have no ..."
Abstract - Cited by 235 (1 self) - Add to MetaCart
Abstract. This paper presents a taxonomy of existing approaches for using response surfaces for global optimization. Each method is illustrated with a simple numerical example that brings out its advantages and disadvantages. The central theme is that methods that seem quite reasonable often have

A Pyramid Approach to Sub-Pixel Registration Based on Intensity

by Philippe Thevenaz, Urs Ruttiman, Michal Unser , 1998
"... We present an automatic sub-pixel registration algorithm that minimizes the mean square intensity difference between a reference and a test data set, which can be either images (2-D) or volumes (3-D). It uses an explicit spline representation of the images in conjunction with spline processing, and ..."
Abstract - Cited by 237 (18 self) - Add to MetaCart
We present an automatic sub-pixel registration algorithm that minimizes the mean square intensity difference between a reference and a test data set, which can be either images (2-D) or volumes (3-D). It uses an explicit spline representation of the images in conjunction with spline processing

Selecting the Number of Knots For Penalized Splines

by David Ruppert , 2000
"... Penalized splines, or P-splines, are regression splines fit by least-squares with a roughness penaly. P-splines have much in common with smoothing splines, but the type of penalty used with a P-spline is somewhat more general than for a smoothing spline. Also, the number and location of the knots ..."
Abstract - Cited by 105 (10 self) - Add to MetaCart
of the knots of a P-spline is not fixed as with a smoothing spline. Generally, the knots of a P-spline are at fixed quantiles of the independent variable and the only tuning parameter to choose is the number of knots. In this article, the effects of the number of knots on the performance of P-splines

Automatic reconstruction of B-spline surfaces of arbitrary topological type

by Matthias Eck - SIGGRAPH'96 , 1996
"... Creating freeform surfaces is a challenging task even with advanced geometric modeling systems. Laser range scanners offer a promising alternative for model acquisition—the 3D scanning of existing objects or clay maquettes. The problem of converting the dense point sets produced by laser scanners in ..."
Abstract - Cited by 173 (0 self) - Add to MetaCart
into useful geometric models is referred to as surface reconstruction. In this paper, we present a procedure for reconstructing a tensor product B-spline surface from a set of scanned 3D points. Unlike previous work which considers primarily the problem of fitting a single B-spline patch, our goal

Painterly Rendering with Curved Brush Strokes of Multiple Sizes

by Aaron Hertzmann , 1998
"... We present a new method for creating an image with a handpainted appearance from a photograph, and a new approach to designing styles of illustration. We "paint" an image with a series of spline brush strokes. Brush strokes are chosen to match colors in a source image. A painting is built ..."
Abstract - Cited by 238 (9 self) - Add to MetaCart
We present a new method for creating an image with a handpainted appearance from a photograph, and a new approach to designing styles of illustration. We "paint" an image with a series of spline brush strokes. Brush strokes are chosen to match colors in a source image. A painting is built

A Theory of Networks for Approximation and Learning

by Tomaso Poggio, Federico Girosi - Laboratory, Massachusetts Institute of Technology , 1989
"... Learning an input-output mapping from a set of examples, of the type that many neural networks have been constructed to perform, can be regarded as synthesizing an approximation of a multi-dimensional function, that is solving the problem of hypersurface reconstruction. From this point of view, t ..."
Abstract - Cited by 235 (24 self) - Add to MetaCart
, this form of learning is closely related to classical approximation techniques, such as generalized splines and regularization theory. This paper considers the problems of an exact representation and, in more detail, of the approximation of linear and nonlinear mappings in terms of simpler functions

Exact Evaluation Of Catmull-Clark Subdivision Surfaces At Arbitrary Parameter Values

by Jos Stam - Proceedings of SIGGRAPH , 1998
"... In this paper we disprove the belief widespread within the computer graphics community that Catmull-Clark subdivision surfaces cannot be evaluated directly without explicitly subdividing. We show that the surface and all its derivatives can be evaluated in terms of a set of eigenbasis functions whi ..."
Abstract - Cited by 225 (8 self) - Add to MetaCart
and easy to implement. We have used our implementation to compute high quality curvature plots of subdivision surfaces. The cost of our evaluation scheme is comparable to that of a bi-cubic spline. Therefore, our method allows many algorithms developed for parametric surfaces to be applied to Catmull

splines

by Rob J. Hyndman, Maxwell L King, Ivet Pitrun, Baki Billah, Rob J. Hyndman, Maxwell L. King, Ivet Pitrun, Baki Billah August
"... Abstract: We show how cubic smoothing splines fitted to univariate time series data can be used to obtain local linear forecasts. Our approach is based on a stochastic state space model which allows the use of a likelihood approach for estimating the smoothing parameter, and which enables easy const ..."
Abstract - Add to MetaCart
construction of prediction intervals. We show that our model is a special case of an ARIMA(0,2,2) model and we provide a simple upper bound for the smoothing parameter to ensure an invertible model. We also show that the spline model is not a special case of Holt’s local linear trend method. Finally we compare
Results 11 - 20 of 3,968