Results 111 to 120 of about 43,057 (164)
Some of the next articles are maybe not open access.

Image Compression Using Polynomial Fitting

2019 3rd International conference on Electronics, Communication and Aerospace Technology (ICECA), 2019
A new efficient method to compress images using polynomial curve fitting approximation techniques is presented in this paper. The polynomial curve fitting represents many pixels by a smaller number of polynomial coefficients. The presented method is based on two distinct scanning techniques of the image under compression.
Shaimaa M. Othman   +3 more
openaire   +1 more source

Fitting Density Functions with Polynomials

Applied Statistics, 1992
Summary: A robust procedure is developed for estimating density functions from data. It requires the existence of a parametric function, called the key function, to give a first approximation to the density and then improves the fit using polynomial adjustments.
openaire   +2 more sources

Polynomial Curve Fitting with Constraint

SIAM Review, 1962
The polynomial of degree \(n\) is written \(f_n = g_{k-1} + p_k h_{n-k}\) where \(g\) passes through the \(k\) absolute points \((a,b)\), \(p\) is \(\prod(x - a)\), and \(h\) is to satisfy a least-squares condition. \(g\) is determined by applying the algorithm of \textit{G. E. Forsythe} [J. Soc. Ind. Appl. Math.
openaire   +1 more source

Quadtree-based polynomial polygon fitting

2013 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2013
In this paper, we present a novel method for surface reconstruction with a low execution time for segmenting and representing scattered scenes accurately. The surfaces are described in a memory-efficient fashion as polynomial functions and polygons. Segmentation and parameter determination is done in one pass by using a quadtree on ordered point clouds,
Hampp, Joshua, Bormann, Richard
openaire   +1 more source

Adaptive Constructive Polynomial Fitting

2010
To extract geometric primitives from edges, we use an incremental linear-time fitting algorithm, which is based on constructive polynomial fitting. In this work, we propose to determine the polynomial order by observing the regularity and the increase of the fitting cost.
Francis Deboeverie   +3 more
openaire   +1 more source

Polyfit — A package for polynomial fitting

Computer Physics Communications, 1989
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Polynomial curve fitting by substitution

Proceedings of the 8th FPGAWorld Conference, 2011
We propose an approach of polynomial curve fitting computation based on least-squares method. Our method enables to compute polynomial coefficients using only one matrix multiplication operation. In order to do this number of fitted points and order of the polynomial should be fixed and interval between points on the x axis should be equal.
Maksim Gorev   +2 more
openaire   +1 more source

Weighted fit by orthonormal polynomials

Computer Physics Communications, 1981
Abstract The fitting technique by orthonormal polynomials and Forsythe's recurrence relationship, generalized in order to take into account experimental errors, are discussed. Comparison is made between orthonormal and standard fits to point out the improvements on the latter, mainly from a computational point of view.
ROSATO, ELIO   +4 more
openaire   +2 more sources

Discrete least squares polynomial fits

Communications of the ACM, 1975
The recurrence relation between orthogonal polynomials is widely used for discrete least squares data fitting. A variant of the classical algorithm which has better numerical properties is presented and the reason for its improved performance is explained.
openaire   +2 more sources

Interpolation and Polynomial Curve Fitting

The Mathematics Teacher, 2014
Two methods for precalculus students to find exact-fit polynomials.
Yajun Yang, Sheldon P. Gordon
openaire   +1 more source

Home - About - Disclaimer - Privacy