Algorithms for nonorthogonal approximate joint block-diagonalization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F12%3A00380078" target="_blank" >RIV/67985556:_____/12:00380078 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Algorithms for nonorthogonal approximate joint block-diagonalization
Original language description
Approximate joint block diagonalization (AJBD) of a set of matrices has applications in blind source separation, e.g., when the signal mixtures contain mutually independent subspaces of dimension higher than one. In this paper we present three novel AJBDalgorithms which differ in the final target criterion to be minimized in the optimization process. Two of the algorithms extend the principle of Jacobi elementary rotations to the more general concept of matrix elementary rotations. The proposed algorithms are compared to existing state-of-the art AJBD algorithms.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA102%2F09%2F1278" target="_blank" >GA102/09/1278: Advanced methods of blind source separation and blind deconvolution</a><br>
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
20th European Signal Processing Conference (EUSIPCO 2012)
ISBN
978-1-4673-1068-0
ISSN
—
e-ISSN
—
Number of pages
5
Pages from-to
2094-2098
Publisher name
EURASIP
Place of publication
Bucharest
Event location
Bukurešť
Event date
Aug 27, 2012
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000310623800421