# Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.

## Presentation on theme: "Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform."— Presentation transcript:

Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform

Basis for a Vector Space Every vector in the space is a linear combination of basis vectors. n independent vectors from an n th dimensional vector space form a basis. Orthogonal Basis: Every two basis vectors are Orthogonal. Orthonormal Basis: The absolute value of all basis vectors is 1.

Complex Numbers Absolute Value: Phase: a b  i R

Fourier Spectrum Fourier: Fourier Spectrum Fourier PhaseFourier:

Discrete Fourier Transform Fourier Transform Inverse Fourier Transform Complexity: O(N 2 ) (10 6 10 12 ) FFT: O(N logN) (10 6 10 7 )

2D Discrete Fourier Fourier Transform Inverse Fourier Transform

Display Fourier Spectrum as Picture 1. Compute 2. Scale to full range Original f0124100 Scaled to 10000010 Log (1+f)00.691.011.614.62 Scaled to 10012410 Example for range 0..10: 3. Move (0,0) to center of image (Shift by N/2)

Decomposition

Decomposition (II) 1-D Fourier is sufficient to do 2-D Fourier –Do 1-D Fourier on each column. On result: –Do 1-D Fourier on each row –(Multiply by N?) 1-D Fourier Transform is enough to do Fourier for ANY dimension

Derivatives I Inverse Fourier Transform

Derivatives II To compute the x derivative of f (up to a constant) : –Computer the Fourier Transform F –Multiply each Fourier coefficient F(u,v) by u –Compute the Inverse Fourier Transform To compute the y derivative of f (up to a constant) : –Computer the Fourier Transform F –Multiply each Fourier coefficient F(u,v) by v –Compute the Inverse Fourier Transform

Translation

Periodicity & Symmetry

Rotation

Linearity

Convolution Theorem Convolution by Fourier: Complexity of Convolution: O(N logN)

Filtering in the Frequency Domain Low-Pass Filtering Band-Pass Filtering High-Pass Filtering Picture FourierFilter Filtered Picture Filtered Fourier

(0 0 1 1 0 0)  Sinc (0 0 1 1 0 0) * (0 0 1 1 0 0 ) = (0 1 2 1 0 0)  Sinc 2 (0 1 4 6 4 1 0) = (0 0 1 1 0 0 ) 4  Sinc 4 Fourier (Gaussian)  Gaussian Low Pass: Frequency & Image

Continuous Sampling · = T * = 1/T ·=Image: * = 1/T Fourier:

Download ppt "Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform."

Similar presentations
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://slideplayer.com/slide/5338512/", "fetch_time": 1590563595000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-24/segments/1590347392141.7/warc/CC-MAIN-20200527044512-20200527074512-00388.warc.gz", "warc_record_offset": 553076035, "warc_record_length": 18637, "token_count": 691, "char_count": 2624, "score": 3.578125, "int_score": 4, "crawl": "CC-MAIN-2020-24", "snapshot_type": "latest", "language": "en", "language_score": 0.7001533508300781, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00040-of-00064.parquet"}