2012
DOI: 10.1109/tsp.2011.2170980
|View full text |Cite
|
Sign up to set email alerts
|

Robust Set-Membership Affine-Projection Adaptive-Filtering Algorithm

Abstract: An improved set-membership affine-projection (AP) adaptive-filtering algorithm is proposed. The new algorithm uses two error bounds that are estimated during the learning phase and by this means significantly reduced steady-state misalignment is achieved as compared to those in the conventional AP and set-membership AP algorithms while achieving similar convergence speed and re-adaptation capability. In addition, the proposed algorithm offers robust performance with respect to the error bound, projection order… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
21
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 39 publications
(21 citation statements)
references
References 19 publications
0
21
0
Order By: Relevance
“…Provide a reference of research result from Cheng et al (2011), and obtain 8 qualified photos from each portion of the upward slope as the basis of image processing. Because enhancements of own image of PhotoModeler Scanner are weak, the programming process of Matlab 2012b (MathWorks Ltd., USA) is used, general images with noises are denoising with adaptive filtering (Bhotto & Antoniou, 2012), and the details of blurred image are disposed by the method of layering and purifying the wavelet packet (Jiang & Cui, 2015). …”
Section: Acquisition and Enhancement Of Photosmentioning
confidence: 99%
“…Provide a reference of research result from Cheng et al (2011), and obtain 8 qualified photos from each portion of the upward slope as the basis of image processing. Because enhancements of own image of PhotoModeler Scanner are weak, the programming process of Matlab 2012b (MathWorks Ltd., USA) is used, general images with noises are denoising with adaptive filtering (Bhotto & Antoniou, 2012), and the details of blurred image are disposed by the method of layering and purifying the wavelet packet (Jiang & Cui, 2015). …”
Section: Acquisition and Enhancement Of Photosmentioning
confidence: 99%
“…The bound of SM filtering algorithms is an important quantity to measure the quality of the estimates that could be included in the constraint set. In [36], [37], several predetermined bounding schemes have been reported for development of the adaptive SM filters, which achieve reduced complexity without performance degradation. However, in a nonstationary scenario, they are impractical to reflect the time-varying nature of the environment and may result in poor convergence and tracking performance.…”
Section: Time-varying Bound Schemesmentioning
confidence: 99%
“…Prior work on SMF blind algorithms for interference suppression is very limited [7], [8]. The use of time-varying bounds is also restricted to applications where one assumes that the "true" error bound is constant [16] and to the parameter-dependent error bound recently proposed in [13], [15]. The time-varying bound techniques so far reported are not blind and do not exploit these mechanisms for channel and parameter estimation.…”
Section: A Prior and Related Workmentioning
confidence: 99%