Segmentation of structural curves using dynamic programming methods
From MaRDI portal
A random process with stepwise-changing parameters that take on a finite set of values is examined. An algorithm, based on dynamic programming methods, is presented for establishing a set of moments when the parameter values change for a fixed-length realization. For the case where the parameter has two values, the algorithm may be used in an infinite realization in real time and is equivalent to multiple application of the well-known Page procedure for determining the fault time of a random process.
Recommendations
- Optimal segmentation of empirical structural curves using dynamic programming
- scientific article; zbMATH DE number 3905699
- A dynamic programming segmentation procedure for hydrological and environmental time series
- scientific article; zbMATH DE number 1569484
- Selection of thresholds for failure algorithm of segmentation of experimental curves
Cited in
(10)- Algorithms for identification and classification of repeating fragments on experimental curves
- Modified dynamic programming approach for offline segmentation of long hydrometeorological time series
- A dynamic programming segmentation procedure for hydrological and environmental time series
- scientific article; zbMATH DE number 3880571 (Why is no real title available?)
- Curve-Like Structure Extraction Using Minimal Path Propagation With Backtracking
- A dynamic programming method for matching rail-track monitoring data
- Segmentation of piecewise stationary signals
- scientific article; zbMATH DE number 1569484 (Why is no real title available?)
- Optimal segmentation of empirical structural curves using dynamic programming
- Selection of thresholds for failure algorithm of segmentation of experimental curves
This page was built for publication: Segmentation of structural curves using dynamic programming methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058996)
