Fast Fourier Transform -algoritmit digitaalisessa kuvankäsittelyssä
Authors
Date
2020Copyright
This publication is copyrighted. You may download, display and print it for Your own personal use. Commercial use is prohibited.
Tutkimuksessa esitellään Fast Fourier Transform-algoritmien (FFT) pääpiirteet
ja niiden käyttökohteita digitaalisessa kuvankäsittelyssä. This study exhibits the main points of Fast Fourier Transform algorithms (FFT)
and some of their use cases in digital image processing.
Metadata
Show full item recordCollections
- Kandidaatintutkielmat [4196]
Related items
Showing items with similar title or keywords.
-
A fast Fourier transform based direct solver for the Helmholtz problem
Toivanen, Jari; Wolfmayr, Monika (John Wiley & Sons, 2020)This article is devoted to the efficient numerical solution of the Helmholtz equation in a two‐ or three‐dimensional (2D or 3D) rectangular domain with an absorbing boundary condition (ABC). The Helmholtz problem is ... -
Torus Computed Tomography
Ilmavirta, Joonas; Koskela, Olli; Railo, Jesse (Society for Industrial and Applied Mathematics, 2020)We present a new computed tomography (CT) method for inverting the Radon transform in 2 dimensions. The idea relies on the geometry of the flat torus; hence we call the new method Torus CT. We prove new inversion formulas ... -
Fourier-sarjoista ja -muunnoksesta
Vähämäki, Susanna (2015) -
Fourier'n sarjan suppeneminen
Annala, Leevi (2017)Funktion f Fourier'n sarja on ääretön funktiosarja, jossa summataan funktiosta f ja summausindeksistä n riippuvia Fourier'n kertoimia funktiolla e^{inx} kerrottuna. Fourier'n sarjoja käytetään esimerkiksi osittaisdiffere ... -
Norm-inflation results for purely BBM-type Boussinesq systems
Bautista, George J.; Potenciano-Machado, Leyter (Elsevier, 2022)This article is concerned with the norm-inflation phenomena associated with a periodic initial-value abcd-Benjamin-Bona-Mahony type Boussinesq system. We show that the initial-value problem is ill-posed in the periodic ...