Quartic orders and sharpness in trajectory estimation for smooth cumulative chord cubics

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper discusses the issue of fitting reduced data with smooth interpolant by piecewise-cubics to estimate an unknown curve γ in arbitrary Euclidean space. The interpolation knots satisfying γ(ti) = qi are assumed to be unknown and guessed according to so-called cumulative chords. More specifically, first estimates of the derivatives at interpolation points Qm are found by using piecewise-cubics combined with cumulative chords. Next Hermite interpolation is applied to construct C1 piecewise-cubic yielding the interpolant with no cusps and corners. At least quartic orders of convergence for both trajectory and length estimations are analytically established in [1]. However their sharpness was exclusively tested for length estimation. This paper verifies experimentally the latter with respect to the trajectory approximation. Additionally, an excellent performance of the interpolant in question on sparse data is also confirmed experimentally. Fitting reduced data is used in computer vision and graphics, engineering, physics as well as in medical and biological sciences. A specific example of medical application is also presented in this paper.

Cite

CITATION STYLE

APA

Kozera, R., Noakes, L., & Szmielew, P. (2014). Quartic orders and sharpness in trajectory estimation for smooth cumulative chord cubics. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8671, 9–16. https://doi.org/10.1007/978-3-319-11331-9_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free