Fitting discrete polynomial curve and surface to noisy data

DOI10.1007/s10472-014-9425-7zbMath1327.65028OpenAlexW2031597116MaRDI QIDQ499719

Fumiki Sekiya, Sugimoto, Akihiro

Publication date: 6 October 2015

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10472-014-9425-7

zbMATH Keywords

outliersnumerical examplescomputer visioncurve fittingimage segmentationobject recognitionsurface fittingdiscrete polynomial curvediscrete polynomial surfacelocal optimalrandom sample consensusRANSAC methodshape approximation

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (3)

On Connectivity of Discretized 2D Explicit Curve ⋮ On properties of analytical approximation for discretizing 2D curves and 3D surfaces ⋮ Target recognition of indoor trolley for humanoid robot based on piecewise fitting method

Cites Work

• Unnamed Item
• Unnamed Item
• The supercover of an \(m\)-flat is a discrete analytical object
• A generalized preimage for the digital analytical hyperplane recognition
• The condition number of real Vandermonde, Krylov and positive definite Hankel matrices
• Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties
• Use of the Hough transformation to detect lines and curves in pictures
• Introduction to Digital Level Layers
• Efficient Robust Digital Hyperplane Fitting with Bounded Error
• Estimation of the Derivatives of a Digital Function with a Convergent Bounded Error
• Optimal Consensus Set for Annulus Fitting
• Recognition of Digital Hyperplanes and Level Layers with Forbidden Points
• Least Median of Squares Regression
• The Minimum Sum of Absolute Errors Regression: A State of the Art Survey
• A linear algorithm for incremental digital display of circular arcs
• Introduction to Stochastic Search and Optimization
• Discrete linear objects in dimension n: the standard model
• Discrete Polynomial Curve Fitting to Noisy Data
• O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles
• Efficient Robust Digital Annulus Fitting with Bounded Error
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition

This page was built for publication: Fitting discrete polynomial curve and surface to noisy data