On stationarizability for nonstationary 2-D random fields using discrete wavelet transforms

Summary

This study introduces a practical method to stationarize nonstationary 2-D random fields, including fractional Brownian motion (fBm) fields. It also details correlation functions for discrete wavelet transforms of 2-D fBm fields exhibiting fast hyperbolic decay.

Related Concept Videos

Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
Standing Waves01:17

Standing Waves

Sometimes waves do not seem to move; rather, they just vibrate in place. Unmoving waves can be seen on the surface of a glass of milk kept in a refrigerator, which is one example of standing waves. Vibrations from the refrigerator motor create waves on the milk that oscillate up and down but do not seem to move across the surface. These waves are formed or created by the superposition of two or more identical moving waves in opposite directions. The waves move through each other, with their...
Discrete Fourier Transform01:15

Discrete Fourier Transform

The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
Properties of DTFT I01:24

Properties of DTFT I

In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
Partial Differential Equations01:21

Partial Differential Equations

A stone dropped into a still pond generates waves that propagate outward in circular patterns, creating a dynamic surface whose elevation depends on both position and time. At any given location, the water level oscillates as the wave passes, while at any fixed moment, the surface exhibits smooth, curved structures extending across space. This dual dependence requires a mathematical description that accounts for variation in multiple variables simultaneously.At a fixed point on the water...
Discrete-time Fourier transform01:26

Discrete-time Fourier transform

The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...