About: Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the Cramer-Rao Lower Bound     Goto   Sponge   Distinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • FastICA is one of the most popular algorithms for Independent Component Analysis, demixing a set of statistically independent sources that have been mixed linearly. A key question is how accurate the method is for finite data samples. We propose an improved version of the FastICA algorithm which is asymptotically efficient, i.e., its accuracy given by the residual error variance attains the Cram'er-Rao lower bound. The error is thus as small as possible. This result is rigorously proven under the assumption that the probability distribution of the independent signal components belongs to the class of generalized Gaussian distributions with parameter $/alpha$, denoted GG$(/alpha)$ for $/alpha >2$. We name the algorithm EFICA. Computational complexity of a Matlab$^TM$ implementation of the algorithm is shown to be only slightly (about three times) higher than that of the standard symmetric FastICA.
  • FastICA is one of the most popular algorithms for Independent Component Analysis, demixing a set of statistically independent sources that have been mixed linearly. A key question is how accurate the method is for finite data samples. We propose an improved version of the FastICA algorithm which is asymptotically efficient, i.e., its accuracy given by the residual error variance attains the Cram'er-Rao lower bound. The error is thus as small as possible. This result is rigorously proven under the assumption that the probability distribution of the independent signal components belongs to the class of generalized Gaussian distributions with parameter $/alpha$, denoted GG$(/alpha)$ for $/alpha >2$. We name the algorithm EFICA. Computational complexity of a Matlab$^TM$ implementation of the algorithm is shown to be only slightly (about three times) higher than that of the standard symmetric FastICA. (en)
  • Algoritmus FastICA je jednim z popularnich algoritmu ktere slouzi ke slepe separaci puvodne nezavislych signalu, ktere byly linearne smichane dohromady.V clanku je navrzena vylepsena varianta tohoto algoritmu, ktera je statisticky eficientni, tj. jeji presnost merena pomoci rezidualni variance chyby dosahuje Rao-Cramerovy meze. Tento vysledek j eodvozen za predpokladu, ze pravdepodobnostni distribuce puvodnich signalu patri do rodiny zobecnenych Gaussovych distribuci. Vypocetni narocnost nove procedury jen mirne (asi trikrat) prevysuje slozitost symetricke varianty algoritmu FastICA. Vlastnosti algoritmu jsou porovnavany v simulacich s jinymi algoritmy, a to nejen na tride zobecnenych Gaussovskych distribucich ale take na bi-modalnich distribucich a na separaci linearne smichanych recovych signalu. (cs)
Title
  • Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the Cramer-Rao Lower Bound
  • Statisticky eficientni varianta algoritmu FastICA pro analyzu nezavislych komponent (cs)
  • Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the Cramer-Rao Lower Bound (en)
skos:prefLabel
  • Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the Cramer-Rao Lower Bound
  • Statisticky eficientni varianta algoritmu FastICA pro analyzu nezavislych komponent (cs)
  • Efficient Variant of Algorithm FastICA for Independent Component Analysis Attaining the Cramer-Rao Lower Bound (en)
skos:notation
  • RIV/67985556:_____/06:00041066!RIV07-AV0-67985556
http://linked.open.../vavai/riv/strany
  • 1265;1277
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1M0572), Z(AV0Z10750506)
http://linked.open...iv/cisloPeriodika
  • 5
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 473433
http://linked.open...ai/riv/idVysledku
  • RIV/67985556:_____/06:00041066
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Independent component analysis; blind source separation; blind deconvolution; Cramer-Rao lower bound; algorithm FastICA (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • US - Spojené státy americké
http://linked.open...ontrolniKodProRIV
  • [98E5584EE30D]
http://linked.open...i/riv/nazevZdroje
  • IEEE Transactions on Neural Networks
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 17
http://linked.open...iv/tvurceVysledku
  • Koldovský, Zbyněk
  • Tichavský, Petr
  • Oja, E.
http://linked.open...n/vavai/riv/zamer
issn
  • 1045-9227
number of pages
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software