Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Motion-Adaptive Transforms Based on the Laplacian of Vertex-Weighted Graphs
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0003-0381-3085
KTH, School of Electrical Engineering (EES), Communication Theory.ORCID iD: 0000-0002-7807-5681
2014 (English)Conference paper, Published paper (Refereed)
Abstract [en]

We construct motion-adaptive transforms for image sequences by using the eigenvectors of Laplacian matrices defined on vertex-weighted graphs, where the weights of the vertices are defined by scale factors. The vertex weights determine only the first basis vector of the linear transform uniquely. Therefore, we use these weights to define two Laplacians of vertex-weighted graphs. The eigenvectors of each Laplacian share the first basis vector as defined by the scale factors only. As the first basis vector is common for all considered Laplacians, we refer to it as subspace constraint. The first Laplacian uses the inverse scale factors, whereas the second utilizes the scale factors directly. The scale factors result from the assumption of ideal motion. Hence, the ideal unscaled pixels are equally connected and we are free to form arbitrary graphs, such as complete graphs, ring graphs, or motion-inherited graphs. Experimental results on energy compaction show that the Laplacian which is based on the inverse scale factors outperforms the one which is based on the direct scale factors. Moreover, Laplacians of motion-inherited graphs are superior than that of complete or ring graphs, when assessing the energy compaction of the resulting motion-adaptive transforms.

Place, publisher, year, edition, pages
IEEE , 2014. 53-62 p.
Series
Data Compression Conference Proceedings, ISSN 1068-0314
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Research subject
Electrical Engineering
Identifiers
URN: urn:nbn:se:kth:diva-144078DOI: 10.1109/DCC.2014.67Scopus ID: 2-s2.0-84903449241OAI: oai:DiVA.org:kth-144078DiVA: diva2:710886
Conference
2014 Data Compression Conference, DCC 2014; Snowbird, UT; United States; 26 March 2014 - 28 March 2014
Note

QC 20150410

Available from: 2014-04-08 Created: 2014-04-08 Last updated: 2015-04-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Flierl, Markus

Search in DiVA

By author/editor
Liu, DuFlierl, Markus
By organisation
Communication Theory
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 79 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf