Results 1 to 10 of about 240,707 (227)

Fast B-Spline 2D Curve Fitting for unorganized Noisy Datasets [PDF]

open access: yes, 2014
In the context of coordinate metrology and reverse engineering, freeform curve reconstruction from unorganized data points still offers ways for improvement. Geometric convection is the process of fitting a closed shape, generally represented in the form
ANWER, Nabil   +5 more
core   +8 more sources

Learning the smoothness of noisy curves with application to online curve estimation [PDF]

open access: yesElectronic Journal of Statistics, 2022
Combining information both within and across trajectories, we propose a simple estimator for the local regularity of the trajectories of a stochastic process. Independent trajectories are measured with errors at randomly sampled time points. Non-asymptotic bounds for the concentration of the estimator are derived.
Golovkine, Steven   +2 more
openaire   +4 more sources

Quantifying the information in noisy epidemic curves

open access: yesNature Computational Science, 2022
AbstractReliably estimating the dynamics of transmissible diseases from noisy surveillance data is an enduring problem in modern epidemiology. Key parameters, such as the instantaneous reproduction number, Rt at time t, are often inferred from incident time series, with the aim of informing policymakers on the growth rate of outbreaks or testing ...
Kris V. Parag   +2 more
openaire   +4 more sources

Curvature Estimation in Noisy Curves [PDF]

open access: yes, 2007
An algorithm of estimation of the curvature at each point of a general discrete curve in O(n log2 n) is proposed. It uses the notion of blurred segment, extending the definition of segment of arithmetic discrete line to be adapted to noisy curves. The proposed algorithm relies on the decomposition of a discrete curve into maximal blurred segments also ...
Nguyen, Thanh Phuong   +1 more
openaire   +3 more sources

Curve Detection in a Noisy Image

open access: yesVision Research, 1997
In this paper we propose a new theory of the Gestalt law of good continuation. In this theory perceptual processes are modeled by an exponential pyramid algorithm. To test the new theory we performed three experiments. The subject's task was to detect a target (a set of dots arranged along a straight or curved line) among background dots. Detectability
Monika Salach-Golyska   +2 more
openaire   +3 more sources

A noisy principal component analysis for forward rate curves [PDF]

open access: yesEuropean Journal of Operational Research, 2015
Principal Component Analysis (PCA) is the most common nonparametric method for estimating the volatility structure of Gaussian interest rate models. One major difficulty in the estimation of these models is the fact that forward rate curves are not directly observable from the market so that non-trivial observational errors arise in any statistical ...
Marcio Laurini, Alberto Ohashi
openaire   +3 more sources

Tangential Cover for 3D Irregular Noisy Digital Curves [PDF]

open access: yes, 2022
International ...
Phuc Ngo, Isabelle Debled-Rennesson
openaire   +1 more source

The type II phase resetting curve is optimal for stochastic synchrony [PDF]

open access: yes, 2009
The phase-resetting curve (PRC) describes the response of a neural oscillator to small perturbations in membrane potential. Its usefulness for predicting the dynamics of weakly coupled deterministic networks has been well characterized.
Aushra Abouzeid   +10 more
core   +1 more source

Curve reconstruction from noisy samples

open access: yesProceedings of the nineteenth annual symposium on Computational geometry, 2003
AbstractWe present an algorithm to reconstruct a collection of disjoint smooth closed curves from noisy samples. Our noise model assumes that the samples are obtained by first drawing points on the curves according to a locally uniform distribution followed by a uniform perturbation in the normal directions.
Cheng, SW   +5 more
openaire   +3 more sources

Fitting algebraic curves to noisy data

open access: yesProceedings of the thiry-fourth annual ACM symposium on Theory of computing, 2002
AbstractWe introduce the following problem which is motivated by applications in vision and pattern detection: We are given pairs of datapoints (x1,y1),(x2,y2),…,(xm,ym)∈[−1,1]×[−1,1], a noise parameter δ>0, a degree bound d, and a threshold ρ>0.
Subhash Khot, Sanjeev Arora
openaire   +2 more sources

Home - About - Disclaimer - Privacy