Standard

Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform: book chapter. / Labunets, Valeri; Labunets-Rundblad, Ekaterina; Astola, Jaakko T.
APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIV: book. ред. / A.G. Tescher. Том 4472 SPIE, 2001. стр. 53-64 (Proceedings of SPIE; Том 4472).

Результаты исследований: Глава в книге, отчете, сборнике статейМатериалы конференцииРецензирование

Harvard

Labunets, V, Labunets-Rundblad, E & Astola, JT 2001, Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform: book chapter. в AG Tescher (ред.), APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIV: book. Том. 4472, Proceedings of SPIE, Том. 4472, SPIE, стр. 53-64. https://doi.org/10.1117/12.449740

APA

Labunets, V., Labunets-Rundblad, E., & Astola, J. T. (2001). Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform: book chapter. в A. G. Tescher (Ред.), APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIV: book (Том 4472, стр. 53-64). (Proceedings of SPIE; Том 4472). SPIE. https://doi.org/10.1117/12.449740

Vancouver

Labunets V, Labunets-Rundblad E, Astola JT. Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform: book chapter. в Tescher AG, Редактор, APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIV: book. Том 4472. SPIE. 2001. стр. 53-64. (Proceedings of SPIE). doi: 10.1117/12.449740

Author

Labunets, Valeri ; Labunets-Rundblad, Ekaterina ; Astola, Jaakko T. / Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform : book chapter. APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIV: book. Редактор / A.G. Tescher. Том 4472 SPIE, 2001. стр. 53-64 (Proceedings of SPIE).

BibTeX

@inproceedings{227e55b3d0e04243a3f097d3e032ad43,
title = "Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform: book chapter",
abstract = "Fast algorithms for a wide class of non-separable n-dimensional (nD) discrete unitary K-transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix-2 FFT-type approach. The method utilizes a decomposition of the nD K-transform into the product of a now nD discrete Radon transform and of a set of parallel/independ 1D K-transforms. If the nD K-transform has a separable kernel (e.g., the case of the discrete Fourier transform) our approach leads to decrease of multiplicative complexity by the factor of n comparing to the classical row/column separable approach. It is well known that an nth order Volterra filter of one dimensional signal can be evaluated by an appropriate nD linear convolution. This work describes new superfast algorithm for Volterra filtering. New approach is based on the superfast discrete Radon and Nussbaumer Polynomial Transforms.",
author = "Valeri Labunets and Ekaterina Labunets-Rundblad and Astola, {Jaakko T.}",
year = "2001",
doi = "10.1117/12.449740",
language = "English",
isbn = "0-8194-4186-4",
volume = "4472",
series = "Proceedings of SPIE",
publisher = "SPIE",
pages = "53--64",
editor = "Tescher, {A.G. }",
booktitle = "APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIV",
address = "United States",

}

RIS

TY - GEN

T1 - Superfast algorithms of multidimensional discrete k-wave transforms and Volterra filtering based on superfast radon transform

T2 - book chapter

AU - Labunets, Valeri

AU - Labunets-Rundblad, Ekaterina

AU - Astola, Jaakko T.

PY - 2001

Y1 - 2001

N2 - Fast algorithms for a wide class of non-separable n-dimensional (nD) discrete unitary K-transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix-2 FFT-type approach. The method utilizes a decomposition of the nD K-transform into the product of a now nD discrete Radon transform and of a set of parallel/independ 1D K-transforms. If the nD K-transform has a separable kernel (e.g., the case of the discrete Fourier transform) our approach leads to decrease of multiplicative complexity by the factor of n comparing to the classical row/column separable approach. It is well known that an nth order Volterra filter of one dimensional signal can be evaluated by an appropriate nD linear convolution. This work describes new superfast algorithm for Volterra filtering. New approach is based on the superfast discrete Radon and Nussbaumer Polynomial Transforms.

AB - Fast algorithms for a wide class of non-separable n-dimensional (nD) discrete unitary K-transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix-2 FFT-type approach. The method utilizes a decomposition of the nD K-transform into the product of a now nD discrete Radon transform and of a set of parallel/independ 1D K-transforms. If the nD K-transform has a separable kernel (e.g., the case of the discrete Fourier transform) our approach leads to decrease of multiplicative complexity by the factor of n comparing to the classical row/column separable approach. It is well known that an nth order Volterra filter of one dimensional signal can be evaluated by an appropriate nD linear convolution. This work describes new superfast algorithm for Volterra filtering. New approach is based on the superfast discrete Radon and Nussbaumer Polynomial Transforms.

UR - https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcAuth=tsmetrics&SrcApp=tsm_test&DestApp=WOS_CPL&DestLinkType=FullRecord&KeyUT=000174396200006

UR - http://www.scopus.com/inward/record.url?partnerID=8YFLogxK&scp=0035763162

U2 - 10.1117/12.449740

DO - 10.1117/12.449740

M3 - Conference contribution

SN - 0-8194-4186-4

VL - 4472

T3 - Proceedings of SPIE

SP - 53

EP - 64

BT - APPLICATIONS OF DIGITAL IMAGE PROCESSING XXIV

A2 - Tescher, A.G.

PB - SPIE

ER -

ID: 42978206