A Linear Time Algorithm for Near Minimax Continuous Piecewise Linear Representations of Discrete Data

An algorithm that constructs a continuous piecewise linear representation, subject to a certain slope/segment length constraint, of a given set of data is described. The algorithm yields an optimal or near optimal representation, subject to this constraint, in the ... norm and does so in at worst O(...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:SIAM journal on scientific computing Ročník 32; číslo 5; s. 2584 - 2602
Hlavní autoři: Szusz, Emily K., Willms, Allan R.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Philadelphia Society for Industrial and Applied Mathematics 01.01.2010
Témata:
ISSN:1064-8275, 1095-7197
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:An algorithm that constructs a continuous piecewise linear representation, subject to a certain slope/segment length constraint, of a given set of data is described. The algorithm yields an optimal or near optimal representation, subject to this constraint, in the ... norm and does so in at worst O(nK) time, where n is the number of data points and K the number of segments. The constraint is determined by a user-specified parameter, ..., which dictates a lower bound for the distance between opposite-sign slope discontinuities. For reasonable ... values, the resulting representation of the data captures the signal and both smooths the noise and provides a measure of it. This representation is useful for applications that require a specified interval for the data values and also allows easy and continuous interpolation of ranges between recorded time points. The algorithm is described, some of its properties are proven, and its capabilities demonstrated with several examples. Comparisons are made with alternative techniques. (ProQuest: ... denotes formulae/symbols omitted.)
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1064-8275
1095-7197
DOI:10.1137/090769077