Motion-Adaptive Transforms based on Vertex-Weighted Graphs
2013 (English)In: 2013 Data Compression Conference (DCC), IEEE Computer Society, 2013, 181-190 p.Conference paper (Refereed)
Motion information in image sequences connects pixels that are highly correlated. In this paper, we consider vertex-weighted graphs that are formed by motion vector information. The vertex weights are defined by scale factors which are introduced to improve the energy compaction of motion-adaptive transforms. Further, we relate the vertex-weighted graph to a subspace constraint of the transform. Finally, we propose a subspace-constrained transform (SCT) that achieves optimal energy compaction for the given constraint. The subspace constraint is derived from the underlying motion information only and requires no additional information. Experimental results on energy compaction confirm that the motion-adaptive SCT outperforms motion-compensated orthogonal transforms while approaching the theoretical performance of the Karhunen Loeve Transform (KLT) along given motion trajectories.
Place, publisher, year, edition, pages
IEEE Computer Society, 2013. 181-190 p.
, Data Compression Conference. Proceedings, ISSN 1068-0314
subspace-constrained transform, vertex-weighted graph, motion-adaptive transform
Electrical Engineering, Electronic Engineering, Information Engineering
IdentifiersURN: urn:nbn:se:kth:diva-113204DOI: 10.1109/DCC.2013.23ISI: 000325712000019ScopusID: 2-s2.0-84881072015ISBN: 978-1-4673-6037-1OAI: oai:DiVA.org:kth-113204DiVA: diva2:605155
Data Compression Conference, DCC 2013; Snowbird, UT; United States; 20 March 2013 through 22 March 2013
QC 201311142013-02-132013-01-142013-11-14Bibliographically approved