This HTML5 document contains 41 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
n13http://solar.physics.montana.edu/canfield/papers/
yagohttp://dbpedia.org/class/yago/
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Delaunay_triangulation
dbo:wikiPageWikiLink
dbr:Gradient_pattern_analysis
Subject Item
dbr:GPA_(disambiguation)
dbo:wikiPageWikiLink
dbr:Gradient_pattern_analysis
dbo:wikiPageDisambiguates
dbr:Gradient_pattern_analysis
Subject Item
dbr:Gradient_Pattern_Analysis
dbo:wikiPageWikiLink
dbr:Gradient_pattern_analysis
dbo:wikiPageRedirects
dbr:Gradient_pattern_analysis
Subject Item
dbr:Gradient_pattern_analysis
rdf:type
yago:Procedure101023820 yago:Event100029378 yago:Act100030358 yago:Algorithm105847438 yago:Rule105846932 yago:Abstraction100002137 yago:YagoPermanentlyLocatedEntity yago:WikicatGeometricAlgorithms yago:Activity100407535 yago:PsychologicalFeature100023100
rdfs:label
Gradient pattern analysis
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.
dcterms:subject
dbc:Geometric_algorithms dbc:Signal_processing
dbo:wikiPageID
22130202
dbo:wikiPageRevisionID
721951482
dbo:wikiPageWikiLink
dbr:National_Institute_for_Space_Research dbr:Wavelet_analysis dbc:Signal_processing dbr:Matrix_(mathematics) dbc:Geometric_algorithms dbr:Gradient dbr:Symmetry_breaking dbr:University_of_Maryland,_College_Park dbr:Delaunay_triangulation dbr:Wave_turbulence
dbo:wikiPageExternalLink
n13:EAA.2023.pdf
owl:sameAs
wikidata:Q5591917 n14:4kdUi freebase:m.05p84tb yago-res:Gradient_pattern_analysis
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.
prov:wasDerivedFrom
wikipedia-en:Gradient_pattern_analysis?oldid=721951482&ns=0
dbo:wikiPageLength
3957
foaf:isPrimaryTopicOf
wikipedia-en:Gradient_pattern_analysis
Subject Item
wikipedia-en:Gradient_pattern_analysis
foaf:primaryTopic
dbr:Gradient_pattern_analysis