This HTML5 document contains 29 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/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9http://dbpedia.org/resource/File:
n16https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n11http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Basis_expansion_time-frequency_analysis
rdfs:label
Basis expansion time-frequency analysis
rdfs:comment
Linear expansions in a single basis, whether it is a Fourier series, wavelet, or any other basis, are not suitable enough. A Fourier basis provided a poor representation of functions well localized in time, and wavelet bases are not well adapted to represent functions whose Fourier transforms have a narrow high frequency support. In both cases, it is difficult to detect and identify the signal patterns from their expansion coefficients, because the information is diluted across the whole basis. Therefore, we must use large amounts of Fourier basis or Wavelets to represent whole signal with small approximation error. Some matching pursuit algorithms are proposed in reference papers to minimize approximation error when given the amount of basis.
foaf:depiction
n11:Basis_expansion.png
dcterms:subject
dbc:Time–frequency_analysis
dbo:wikiPageID
52642074
dbo:wikiPageRevisionID
1004642143
dbo:wikiPageWikiLink
dbr:Fourier_series dbr:Fourier_transforms dbr:Matching_pursuit dbr:Short-time_Fourier_transform n9:Basis_expansion.png dbc:Time–frequency_analysis dbr:Time-frequency_analysis dbr:Wavelet
owl:sameAs
wikidata:Q28407007 n16:2dwuB
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Confusing dbt:Multiple_issues dbt:Orphan dbt:Context
dbo:thumbnail
n11:Basis_expansion.png?width=300
dbo:abstract
Linear expansions in a single basis, whether it is a Fourier series, wavelet, or any other basis, are not suitable enough. A Fourier basis provided a poor representation of functions well localized in time, and wavelet bases are not well adapted to represent functions whose Fourier transforms have a narrow high frequency support. In both cases, it is difficult to detect and identify the signal patterns from their expansion coefficients, because the information is diluted across the whole basis. Therefore, we must use large amounts of Fourier basis or Wavelets to represent whole signal with small approximation error. Some matching pursuit algorithms are proposed in reference papers to minimize approximation error when given the amount of basis.
prov:wasDerivedFrom
wikipedia-en:Basis_expansion_time-frequency_analysis?oldid=1004642143&ns=0
dbo:wikiPageLength
3427
foaf:isPrimaryTopicOf
wikipedia-en:Basis_expansion_time-frequency_analysis
Subject Item
dbr:Basis_Expansion_Time-Frequency_Analysis
dbo:wikiPageWikiLink
dbr:Basis_expansion_time-frequency_analysis
dbo:wikiPageRedirects
dbr:Basis_expansion_time-frequency_analysis
Subject Item
wikipedia-en:Basis_expansion_time-frequency_analysis
foaf:primaryTopic
dbr:Basis_expansion_time-frequency_analysis