Results 251 to 260 of about 9,697 (298)

Affine projection algorithm with variable projection order

2012 IEEE International Conference on Communications (ICC), 2012
Increasing the projection order in the affine projection adaptive filtering algorithm speeds up the convergence but also increases the steady-state misalignment. To address this unfavorable compromise, we propose a new affine projection algorithm with a variable projection order.
Reza Arablouei, Kutluyil Dogançay
openaire   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

Local Affine Multidimensional Projection

IEEE Transactions on Visualization and Computer Graphics, 2011
Multidimensional projection techniques have experienced many improvements lately, mainly regarding computational times and accuracy. However, existing methods do not yet provide flexible enough mechanisms for visualization-oriented fully interactive applications.
Paulo Joia, Danilo Barbosa Coimbra, José Alberto Cuminato, Fernando Vieira Paulovich, Luis Gustavo Nonato   +4 more
openaire   +2 more sources

The fast affine projection algorithm

1995 International Conference on Acoustics, Speech, and Signal Processing, 2002
This paper discusses a new adaptive filtering algorithm called fast affine projections (FAP). FAP's key features include LMS like complexity and memory requirements (low), and RLS like convergence (fast) for the important case where the excitation signal is speech.
Steven L. Gay, Sanjeev Tavathia
openaire   +1 more source

Hybrid affine projection algorithm

2014 13th International Conference on Control Automation Robotics & Vision (ICARCV), 2014
In this work, we put forward a new adaptation criterion, namely the hybrid criterion (HC), which is a mixture of the traditional mean square error (MSE) and the maximum correntropy criterion (MCC). The HC criterion is developed from the viewpoint of the least trimmed squares (LTS) estimator, a high breakdown estimator that can avoid undue influence ...
Xiaohan Yang, Hua Qu, Ji-hong Zhao 0001, Badong Chen   +3 more
openaire   +1 more source

Regularization of the Affine Projection Algorithm

IEEE Transactions on Circuits and Systems II: Express Briefs, 2011
The affine projection algorithm (APA) is an attractive choice for echo cancellation, mainly for its convergence features. A matrix inversion is required within the APA. For practical reasons, this matrix needs to be regularized, i.e., a positive constant is added to the elements of its main diagonal. This regularization parameter is of great importance
Constantin Paleologu, Jacob Benesty, Silviu Ciochina   +2 more
openaire   +1 more source

Feature Affine Projection Algorithms

ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2020
There is a growing research interest in proposing new techniques to detect and exploit signals/systems sparsity. Recently, the idea of hidden sparsity has been proposed, and it has been shown that, in many cases, sparsity is not explicit, and some tools are required to expose hidden sparsity.
openaire   +1 more source

Trimmed affine projection algorithms

2014 International Joint Conference on Neural Networks (IJCNN), 2014
The least trimmed squares (LTS) estimator is a robust estimator as it can avoid undue influence from outliers. The exact solution of the LTS estimation is however hard to And and if the number of data is large then the method is unfeasible. In this work, we apply the LTS criterion to adaptive filtering and develop the trimmed affine projection ...
Badong Chen, Xiaohan Yang, Hong Ji, Hua Qu, Nanning Zheng 0001, José C. Príncipe   +5 more
openaire   +1 more source

Affine projections of polynomials

Proceedings of the forty-fourth annual ACM symposium on Theory of computing, 2012
An m-variate polynomial f is said to be an affine projection of some n-variate polynomial g if there exists an nm matrix A and an n-dimensional vector b such that f(x)=g(Ax+b). In other words, if f can be obtained by replacing each variable of g by an affine combination of the variables occurring in f, then it is said to be an affine projection of g ...
openaire   +1 more source

Affinely and Projectively Regular Polytopes

Journal of the London Mathematical Society, 1968
A \(d\)-polytope \(P\) (i.e. a \(d\)-dimensional convex polytope in Euclidean space \(R^d)\) is said to be affinely (resp. projectively) regular if the group of affine (resp. projective) transformations of \(R^d\) which preserve \(P\) is transitive on the complete towers of faces of \(P\) (such a tower being a set \( \left\{F^0, F^1, \ldots, F^{d-1 ...
openaire   +1 more source

Local projective and affine invariants

Annals of Mathematics and Artificial Intelligence, 1995
The author uses the implicit curve representation without using a curve parameter to produce local projective and affine invariants of a curve. This approach is useful in pattern recognition.
openaire   +1 more source