Gradient Pattern Analysis

Gradient pattern analysis (GPA)Rosa, R.R., Pontes, J., Christov, C.I., Ramos, F.M., Rodrigues Neto, C., Rempel, E.L., Walgraef, D. ''Physica A'' 283, 156 (2000). is a geometric computing method for characterizing geometrical bilateral symmetry breaking of an ensemble of symmetric vectors regularly distributed in a square lattice. Usually, the lattice of vectors represent the first-order gradient of a scalar field, here an ''M x M'' square amplitude matrix. An important property of the gradient representation is the following: A given ''M x M'' matrix where all amplitudes are different results in an ''M x M'' gradient lattice containing $N_ = M^2$ asymmetric vectors. As each vector can be characterized by its norm and phase, variations in the $M^2$ amplitudes can modify the respective $M^2$ gradient pattern.

The original concept of GPA was introduced by Rosa, Sharma and Valdivia in 1999.Rosa, R.R.; Sharma, A.S.and Valdivia, J.A. ''Int. J. Mod. Phys. C'', 10, 147 (1999), . Usually GPA is applied for spatio-temporal pattern analysis in physics and environmental sciences operating on time-series and digital images.

Calculation

By connecting all vectors using a Delaunay triangulation criterion it is possible to characterize gradient asymmetries computing the so-called ''gradient asymmetry coefficient'', that has been defined as:
$G_A=\frac$,
where $N_ > 0$ is the total number of asymmetric vectors, $N_$ is the number of Delaunay connections among them and the property $N_ > N_$
is valid for any gradient square lattice.

As the asymmetry coefficient is very sensitive to small changes in the phase and modulus of each gradient vector, it can distinguish complex variability patterns (bilateral asymmetry) even when they are very similar but consist of a very fine structural difference. Note that, unlike most of the statistical tools, the GPA does not rely on the statistical properties of the data but
depends solely on the local symmetry properties of the correspondent gradient pattern.

For a complex extended pattern (matrix of amplitudes of a spatio-temporal pattern) composed by locally asymmetric fluctuations, $G_$ is nonzero, defining different classes of irregular fluctuation patterns (1/f noise, chaotic, reactive-diffusive, etc.).

Besides $G_$ other measurements (called ''gradient moments'') can be calculated from the gradient lattice.Rosa, R.R.; Campos, M.R.; Ramos, F.M.; Vijaykumar, N.L.; Fujiwara, S.; Sato, T. ''Braz. J. Phys.'' 33, 605 (2003). Considering the sets of local norms and phases as discrete compact groups, spatially distributed in a square lattice, the gradient moments have the basic property of being globally invariant (for rotation and modulation).

The primary research on gradient lattices applied to characterize weak wave turbulence from X-ray images o
solar active regions
was developed in the Department of Astronomy at University of Maryland, College Park, USA. A key line of research on GPA's algorithms and applications has been developed at Lab for Computing and Applied Mathematics (LAC) at National Institute for Space Research (INPE) in Brazil.

Relation to other methods

When GPA is conjugated with wavelet analysis, then the method is called ''Gradient spectral analysis'' (GSA), usually applied to short time series analysis.Rosa, R.R. et al., ''Advances in Space Research'' 42, 844 (2008), {{doi, 10.1016/j.asr.2007.08.015.

References

Geometric algorithms
Signal processing