Gradient pattern analysis
![]() | This article may be confusing or unclear to readers. (March 2009) |
Gradient Pattern Analysis (GPA)[1] is a geometric computing method for characterizing symmetry breaking of an ensemble of asymmetric 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 asymmetric vectors. As each vector can be characterized by its norm and phase, variations in the amplitudes can modify the respective gradient pattern.
The original concept of GPA was introduced by Rosa, Sharma and Valdivia in 1999[2] Usually GPA is applied for spatio-temporal pattern analysis in physics and environmental sciences operating on time-series and images.
Calculation
By connecting all vectors using a Delaunay triangulation criterion it is possible to characterize gradient assymetries computing the so-called gradient asymmetry coefficient, that has been defined as: , where is the total number of asymmetric vectors and is the number of Delaunay connections among them.
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 even when they are very similar but consist of a very fine structural difference. Not 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, is nonzero, defining different classes of irregular fluctuation patterns (1/f noise, chaotic, reactive-diffusive, etc).
Besides other measurements (called gradient moments) can be calculated form the gradient lattice.[3]. 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).
Relation to other methods
When GPA is conjugated with wavelet analysis, then the method is called Gradient Spectral Analysis, usually applied to short time series analysis.[4]
References
- ^ Rosa, R.R., J. Pontes, C. I. Christov, F. M. Ramos, C. Rodrigues Neto, E. L. Rempel, D. Walgraef, Physica A 283, 156 (2000).
- ^ Rosa, R.R., A. S. Sharma and J. Valdivia, Int. J. Mod. Phys. C, 10, 147 (1999).
- ^ Rosa, R.R., M. R. Campos, F. M. Ramos, N. L. Vijaykumar, S. Fujiwara, T. Sato, Braz. Jour. Phys. 33, 605 (2003).
- ^ Rosa, R.R. et al., Advances in Space Research 42, 844 (2008), doi:10.1016/j.asr.2007.08.015.
- Assireu, A.T., R. R. Rosa, N. L. Vijaykumar, J. A. Lorenzetti, E. L. Rempel, F. M. Ramos, L. D. Abreu Sá, M. J. A. Bolzan, A. Zanandrea, Physica D 68, 397 (2002).
- Rosa, R.R., M. R. Campos, F. M. Ramos, N. L. Vijaykumar, S. Fujiwara, T. Sato, Braz. Jour. Phys. 33, 605 (2003).
- Baroni, M.P.M.A, R. R. Rosa, A. Ferreira da Silva, I. Pepe, L. S. Roman, F. M. Ramos, R. Ahuja, C. Persson, E. Veje, Microelectronics Journal 37, 290 (2006).
- Rosa, R.R., M. P. M. A. Baroni, G. T. Zaniboni, A. Ferreira da Silva, L. S. Roman, J. Pontes and M. J. A. Bolzan, Physica A 386, 666 (2007).