Open Access
An optimal algorithm for approximating a piecewise linear function
Hiroshi Imai,Masao Iri +1 more
- Vol. 9, Iss: 3, pp 159-162
Reads0
Chats0
About:
The article was published on 1986-01-01 and is currently open access. It has received 110 citations till now. The article focuses on the topics: Piecewise & Piecewise linear function.read more
Citations
More filters
Proceedings ArticleDOI
Time series segmentation for context recognition in mobile devices
TL;DR: This paper considers context recognition by unsupervised segmentation of time series produced by sensors, and uses global iterative replacement or GIR, which gives approximately optimal results in a fraction of the time required by dynamic programming.
Journal ArticleDOI
Convex piecewise-linear fitting
Alessandro Magnani,Stephen Boyd +1 more
TL;DR: The method described, which is a variation on the K-means algorithm for clustering, seems to work well in practice, at least on data that can be fit well by a convex function.
Proceedings ArticleDOI
Deformable Markov model templates for time-series pattern matching
Xianping Ge,Padhraic Smyth +1 more
TL;DR: A novel and flexible approach is proposed based on segmental semiMarkov models that provides a systematic and coherent framework for leveraging both prior knowledge and training data for automatically detecting specific patterns or shapes in time-series data.
Journal ArticleDOI
Computational-geometric methods for polygonal approximations of a curve
Hiroshi Imai,Masao Iri +1 more
TL;DR: This paper considers the problem of approximating a piecewise linear curve by another whose vertices are a subset of the vertices of the former, and shows that an optimum solution of this problem can be found in a polynomial time.
Journal ArticleDOI
Approximating polygons and subdivisions with minimum-link paths
TL;DR: This work investigates fattening by convolving the segments or vertices with disks and attempts to approximate objects with the minimum number of line segments, or with near the minimum, by using efficient greedy algorithms.