Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

A Numerical study of Newton interpolation with extremely high degrees

Michael Breuß;  Friedemann Kemm;  Oliver Vogel — 2018

Kybernetika

In current textbooks the use of Chebyshev nodes with Newton interpolation is advocated as the most efficient numerical interpolation method in terms of approximation accuracy and computational effort. However, we show numerically that the approximation quality obtained by Newton interpolation with Fast Leja (FL) points is competitive to the use of Chebyshev nodes, even for extremely high degree interpolation. This is an experimental account of the analytic result that the limit distribution of FL...

Numerical algorithms for perspective shape from shading

Michael Breuss;  Emiliano Cristiani;  Jean-Denis Durou;  Maurizio Falcone;  Oliver Vogel — 2010

Kybernetika

The Shape-From-Shading (SFS) problem is a fundamental and classic problem in computer vision. It amounts to compute the 3-D depth of objects in a single given 2-D image. This is done by exploiting information about the illumination and the image brightness. We deal with a recent model for Perspective SFS (PSFS) for Lambertian surfaces. It is defined by a Hamilton–Jacobi equation and complemented by state constraints boundary conditions. In this paper we investigate and compare three state-of-the-art...

Page 1

Download Results (CSV)