Gradient pattern analysis: Difference between revisions

Content deleted Content added
No edit summary
Cleaned up and wikfied (some -- needs more work)
Line 1:
 
== Introduction ==
 
The '''Gradient Pattern Analysis''' (GPA)<ref (\cite{name=rosa2000}>Rosa,\cite{rosa03}) R.R., basicallyJ. consistsPontes, inC. I. Christov, F. M. Ramos, C. Rodrigues Neto, E. L. Rempel, D. Walgraef, ''Physica A'' '''283''', 156 (2000).</ref> 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\times x M$'' square amplitude matrix. An important property of the gradient representation is the following: A given $''M\times x M$'' matrix where all amplitudes are different results ain an ''M x M'' gradient lattice containing <math>N_{V} = M^2</math> asymmetric vectors. As each vector can be characterized by its norm and phase, variations in the <math>M^2</math> amplitudes can modify the respective <math>M^2</math> gradient pattern.
$M\times M$ gradient lattice containing $N_{V}=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 ideasconcept onof GPA was introduced by Rosa, Sharma and Valdivia, in 1999<ref \cite{name=Rosa99}>Rosa, R.R., A. S. Sharma and J. Valdivia, ''Int. J. Mod. Phys. C'', '''10''', 147 (1999).</ref> 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 criteriumcriterion it is possible to characterize gradient asymetriesassymetries computing the so-called ''gradient asymmetry coefficient'', that has been defined as:
<math>G_A=\frac{|N_C-N_V|}{N_V}</math>,
\begin{equation}
where $N_V<math>N_{V} > 0$</math> is the total number of asymmetric vectors and $N_C$<math>N_{C}</math> is the number of Delaunay connections among them.
G_A=\frac{|N_C-N_V|}{N_V},
\end{equation}
where $N_V>0$ is the total number of asymmetric vectors and $N_C$ 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, $<math>G_{A}</math> is nonzero, defining different classes of irregular fluctuation patterns (1/f noise, chaotic, reactive-diffusive, etc).
 
G_{A}$ is nonzero, defining different classes of irregular fluctuation patterns (1/f noise, chaotic, reactive-diffusive, etc).
Besides $<math>G_{A}$</math> other measurements (called ''gradient moments'') can be calculated form the gradient lattice.<ref \cite{name=rosa03}>Rosa, R.R., M. R. Campos, F. M. Ramos, N. L. Vijaykumar, S. Fujiwara, T. Sato, ''Braz. Jour. Phys.'' '''33''', 605 (2003).</ref>. 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.<ref \cite{name=rosa08}>Rosa, R.R. et al., ''Advances in Space Research'' '''42''', 844 (2008), doi:10.1016/j.asr.2007.08.015.</ref>
== References ==
{{reflist}}
{{refbegin}}
\bibitem{rosa99} R. R. Rosa, A. S. Sharma and J. Valdivia, {\em Int. J. Mod. Phys. C \/} {\bf 10}, 147 (1999).
\bibitem{rosa2000}* Assireu, A.T., R. R. Rosa, N. L. Vijaykumar, J. PontesA. Lorenzetti, CE. IL. ChristovRempel, F. M. Ramos, CL. RodriguesD. NetoAbreu Sá, EM. LJ. RempelA. Bolzan, DA. WalgraefZanandrea, {\em ''Physica A \/} {\bfD'' 283}'''68''', 156397 (20002002).
\bibitem{assireu2002}* A. T. AssireuRosa, R. R. Rosa, NM. LR. VijaykumarCampos, JF. AM. LorenzettiRamos, EN. L. RempelVijaykumar, FS. M. RamosFujiwara, LT. D. Abreu SáSato, M''Braz. JJour. APhys.'' Bolzan'''33''', A. Zanandrea, {\em Physica D \/} {\bf 168} 397605 (20022003).
\bibitem{rosa03}* Baroni, M.P.M.A, R. R. Rosa, MA. RFerreira da Silva, I. CamposPepe, FL. MS. RamosRoman, NF. LM. VijaykumarRamos, SR. FujiwaraAhuja, TC. SatoPersson, {\em BrazE. Jour. Phys.Veje, \/}''Microelectronics {\bfJournal'' 33}'''37''', 605290 (20032006).
\bibitem{baroni06}* Rosa, R.R., M. P. M. A. Baroni, RG. RT. RosaZaniboni, A. Ferreira da Silva, I. Pepe, L. S. Roman, FJ. M.Pontes Ramos,and RM. Ahuja, CJ. Persson, EA. VejeBolzan, {\em''Physica MicroelectronicsA'' Journal \/} {\bf 37}'''386''', 290666 (20062007).
{{refend}}
\bibitem{rosa07} R. R. Rosa, M. P. M. A. Baroni, G. T. Zaniboni, A. Ferreira da Silva, L. S. Roman, J. Pontes and M. J. A. Bolzan, {\em Physica A \/} {\bf 386}, 666 (2007).
\bibitem{rosa08} R.R.Rosa et al., {\em Advances in Space Research} {\bf 42}, 844 (2008), doi:10.1016/j.asr.2007.08.015.
== External Links ==
 
Lab for Computing and Applied Mathematics
(MATLAB code for Gradient Spectral Analysis).