1993
DOI: 10.1109/18.265499
|View full text |Cite
|
Sign up to set email alerts
|

A tree-structured piecewise linear adaptive filter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

1996
1996
2013
2013

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 22 publications
(8 citation statements)
references
References 14 publications
0
8
0
Order By: Relevance
“…The condition for the growth of the binary tree is as follows: If RM SE t ε, then stop the partition of vertex t; if RM SE t > ε, then partition the subspace: calculate the center of gravity of corresponding outputs on the subspace [21] …”
Section: Fuzzy-tree Identification Methods IImentioning
confidence: 99%
“…The condition for the growth of the binary tree is as follows: If RM SE t ε, then stop the partition of vertex t; if RM SE t > ε, then partition the subspace: calculate the center of gravity of corresponding outputs on the subspace [21] …”
Section: Fuzzy-tree Identification Methods IImentioning
confidence: 99%
“…At the same time, a common feature of those techniques is that they were developed for the processing of a single signal, not of large signal sets as in this paper. In particular, piecewise linear filters in [19] have been obtained by arranging linear filters and thresholds in a tree structure. Piecewise linear filters discussed in [20] were developed using so-called threshold decomposition, which is a segmentation operator exploited to split a signal into a set of multilevel components.…”
Section: Other Relevant Filtersmentioning
confidence: 99%
“…Proof: The proof of Theorem 1 is given in Section 7. ✷ It is worthwhile to observe that, due to an arbitrary matrix M B j in (19), the filter F (p−1) is not unique. In particular, M B j can be chosen as the zero matrix O similarly to the generic optimal linear [5] (which is also not unique by the same reason).…”
Section: Determination Of Piecewise Linear Interpolation Filtermentioning
confidence: 99%
“…Therefore, they can be used for cases where the data record is small. One technique for building PWL lters is based on regression trees 10], and although continuity is not enforced, they have been successfully applied to problems in channel equalization and echo cancellation 10,11].…”
Section: Introductionmentioning
confidence: 99%