论文信息 - Fast parametrized biorthogonal transforms

Fast parametrized biorthogonal transforms

In this paper the authors propose the buildling scheme of fast parametrized biorthogonal transforms taking advantage of data-flow graphs for calculation of fast orthonormal transforms and two-point biorthogonal butterfly operators. Streszczenie. W pracy zaproponowano schemat budowy szybkich parametryzowanych przeksztalce ´ n biortogonalnych oparty o diagramy przeply- wowe dla szybkich przeksztalce ´ n ortonormalnych i dwupunktowe biortogonalne operatory motylkowe. ( Szybkie parametryzowane transformacje bi-ortogonalne)

Mykhaylo Yatsymirskyy | Dariusz Puchala

[1] Jaakko Astola,et al. On a Class of Parametric Transforms and Its Application to Image Compression , 2007, EURASIP J. Adv. Signal Process..

[2] M. Omair Ahmad,et al. New Parametric Discrete Fourier and Hartley Transforms, and Algorithms for Fast Computation , 2011, IEEE Transactions on Circuits and Systems I: Regular Papers.

[3] S. Agaian,et al. Parametric Slant-Hadamard transforms with applications , 2002, IEEE Signal Processing Letters.

[4] William K. Pratt,et al. Generalized Wiener Filtering Computation Techniques , 1972, IEEE Transactions on Computers.

[5] Pierre Comon,et al. Handbook of Blind Source Separation: Independent Component Analysis and Applications , 2010 .

[6] D. Puchala,et al. Fast neural networks learning techniques for signal compression , 2010 .