Force curve segmentation by piecewise polynomial approximation: mathematical formulation and complete structure of the algorithm - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2010

Force curve segmentation by piecewise polynomial approximation: mathematical formulation and complete structure of the algorithm

Résumé

In this technical report, we give a detailed formulation of the force curve segmentation problem based on the fitting of the curve by a piecewise polynomial. The segmentation algorithm is a discrete search in which the unknowns are the positions Dj, j=1,...,k of the discontinuity points. We first formulate the problem as the minimization of a least-square cost function with respect to D=[D1,...,Dk]\in R^k. Then, we describe the structure of the proposed optimization algorithm including the update of the list of discontinuity positions D when their number k increases.
Fichier principal
Vignette du fichier
soussend.pdf (79.45 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00508384 , version 1 (03-08-2010)
hal-00508384 , version 2 (23-08-2010)

Identifiants

  • HAL Id : hal-00508384 , version 2

Citer

Charles Soussen, Junbo Duan, David Brie, Pavel Polyakov, Gregory Francius, et al.. Force curve segmentation by piecewise polynomial approximation: mathematical formulation and complete structure of the algorithm. 2010. ⟨hal-00508384v2⟩
146 Consultations
349 Téléchargements

Partager

Gmail Facebook X LinkedIn More