Spherical subspace and eigen based affine projection algorithms
نویسندگان
چکیده
In this paper, we combine spherical subspace (SS) and eigen based updating methods with the a ne projection (AP) method to produce a new family of fast SS-AP algorithms that o ers additional tradeo s between computation and adaptive ltering performance. Moreover, the implementation of SS-AP is less complicated than the fast RLS based AP algorithms. For certain applications, e.g., echo cancellation and equalization in digital subscriber loop (DSL) transceivers, SS-AP o ers performance that is comparable to AP, but at computational costs that are less than the fast AP algorithms.
منابع مشابه
A Family of Selective Partial Update Affine Projection Adaptive Filtering Algorithms
In this paper we present a general formalism for the establishment of the family of selective partial update affine projection algorithms (SPU-APA). The SPU-APA, the SPU regularized APA (SPU-R-APA), the SPU partial rank algorithm (SPU-PRA), the SPU binormalized data reusing least mean squares (SPU-BNDR-LMS), and the SPU normalized LMS with orthogonal correction factors (SPU-NLMS-OCF) algorithms...
متن کاملEstimating the Number of Wideband Radio Sources
In this paper, a new approach for estimating the number of wideband sources is proposed which is based on RSS or ISM algorithms. Numerical results show that the MDL-based and EIT-based proposed algorithm havea much better detection performance than that in EGM and AIC cases for small differences between the incident angles of sources. In addition, for similar conditions, RSS algorithm offers hi...
متن کاملImage Restoration with Two-Dimensional Adaptive Filter Algorithms
Two-dimensional (TD) adaptive filtering is a technique that can be applied to many image, and signal processing applications. This paper extends the one-dimensional adaptive filter algorithms to TD structures and the novel TD adaptive filters are established. Based on this extension, the TD variable step-size normalized least mean squares (TD-VSS-NLMS), the TD-VSS affine projection algorithms (...
متن کاملRobust factorization for the affine camera: Analysis and comparison
Based on our previous work on the use of subspace distances for the outlier deiection problem in video sequences under afFne projection. this paper reports ourfurther analysis of the problem and presents fwo algorithms for computing the reprojection errors of imagefeatures in the outlier detection process. Extensive experiments on real video sequences have been conducted to verrfi the performan...
متن کاملGraph and Subspace Learning for Domain Adaptation
Graph and Subspace Learning for Domain Adaptation by Le Shu Doctor of Philosophy in Computer and Information Sciences Temple University in Philadelphia, October, 2015 Researcher Advisor: Longin Jan Latecki In many practical problems, given that the instances in the training and test may be drawn from different distributions, traditional supervised learning can not achieve good performance on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997