About: Hilbert-space techniques for spectral representation in terms of overcomplete bases     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Topics associated with the representation of objects from a separable Hilbert space in terms of an a priori given overcomplete system (dictionary) of its generators (atoms) are handled. First the procedure of finding such a representation is formulated and solved using the Hilbert-space technique of linear bounded operators and their generalized inverse. Afterwards the problem of finding its sparse representation is discussed, i.e. such representation where most information on the given object is concentrated in a fewest possible number of its nonzero (spectral) coefficients in that representation. This may be rephrased as a procedure for finding a subbasis which is in a certain sense optimal for the given object in the scope of the prescribed overcomplete system. In general the common approach based on Moore-Penrose pseudoinverse does not yield the desired sparse solutions. That is why alternate procedures are discussed, in particular from the point of view of their numerical stability and computatio
  • Topics associated with the representation of objects from a separable Hilbert space in terms of an a priori given overcomplete system (dictionary) of its generators (atoms) are handled. First the procedure of finding such a representation is formulated and solved using the Hilbert-space technique of linear bounded operators and their generalized inverse. Afterwards the problem of finding its sparse representation is discussed, i.e. such representation where most information on the given object is concentrated in a fewest possible number of its nonzero (spectral) coefficients in that representation. This may be rephrased as a procedure for finding a subbasis which is in a certain sense optimal for the given object in the scope of the prescribed overcomplete system. In general the common approach based on Moore-Penrose pseudoinverse does not yield the desired sparse solutions. That is why alternate procedures are discussed, in particular from the point of view of their numerical stability and computatio (en)
  • Topics associated with the representation of objects from a separable Hilbert space in terms of an a priori given overcomplete system (dictionary) of its generators (atoms) are handled. First the procedure of finding such a representation is formulated and solved using the Hilbert-space technique of linear bounded operators and their generalized inverse. Afterwards the problem of finding its sparse representation is discussed, i.e. such representation where most information on the given object is concentrated in a fewest possible number of its nonzero (spectral) coefficients in that representation. This may be rephrased as a procedure for finding a subbasis which is in a certain sense optimal for the given object in the scope of the prescribed overcomplete system. In general the common approach based on Moore-Penrose pseudoinverse does not yield the desired sparse solutions. That is why alternate procedures are discussed, in particular from the point of view of their numerical stability and computatio (cs)
Title
  • Hilbert-space techniques for spectral representation in terms of overcomplete bases
  • Hilbert-space techniques for spectral representation in terms of overcomplete bases (en)
  • Hilbert-space techniques for spectral representation in terms of overcomplete bases (cs)
skos:prefLabel
  • Hilbert-space techniques for spectral representation in terms of overcomplete bases
  • Hilbert-space techniques for spectral representation in terms of overcomplete bases (en)
  • Hilbert-space techniques for spectral representation in terms of overcomplete bases (cs)
skos:notation
  • RIV/00216224:14310/02:00007145!RIV08-MSM-14310___
http://linked.open.../vavai/riv/strany
  • 259
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM 143100001)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 647621
http://linked.open...ai/riv/idVysledku
  • RIV/00216224:14310/02:00007145
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • functional approximation; kernel operators; frame and wavelet expansions; pseudoinverse operators (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1C0249C80BD9]
http://linked.open...v/mistoKonaniAkce
  • August 2001, Čihák near Žamberk (Northeast Bohem
http://linked.open...i/riv/mistoVydani
  • Brno (Czech Rep.)
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the Summer School DATASTAT'2001, Folia Fac. Sci. Nat. Univ. Masaryk. Brunensis, Mathematica 11
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Veselý, Vítězslav
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Masaryk University
https://schema.org/isbn
  • 80-210-3028-3
http://localhost/t...ganizacniJednotka
  • 14310
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 84 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software