About: Gradient pattern analysis

An Entity of Type: Rule105846932, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Gradient pattern analysis (GPA) 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 asymmetric vectors. As each vector can be characterized by its norm and phase, variations in the amplitudes can modify the respective gradient pattern.

Property Value
dbo:abstract
  • Gradient pattern analysis (GPA) 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 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. Usually GPA is applied for spatio-temporal pattern analysis in physics and environmental sciences operating on time-series and digital images. (en)
dbo:wikiPageExternalLink
dbo:wikiPageID
  • 22130202 (xsd:integer)
dbo:wikiPageLength
  • 3957 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID
  • 721951482 (xsd:integer)
dbo:wikiPageWikiLink
dcterms:subject
rdf:type
rdfs:comment
  • Gradient pattern analysis (GPA) 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 asymmetric vectors. As each vector can be characterized by its norm and phase, variations in the amplitudes can modify the respective gradient pattern. (en)
rdfs:label
  • Gradient pattern analysis (en)
owl:sameAs
prov:wasDerivedFrom
foaf:isPrimaryTopicOf
is dbo:wikiPageDisambiguates of
is dbo:wikiPageRedirects of
is dbo:wikiPageWikiLink of
is foaf:primaryTopic of
Powered by OpenLink Virtuoso    This material is Open Knowledge     W3C Semantic Web Technology     This material is Open Knowledge    Valid XHTML + RDFa
This content was extracted from Wikipedia and is licensed under the Creative Commons Attribution-ShareAlike 3.0 Unported License