Martínez Enríquez, EduardoDíaz de María, FernandoCid Sueiro, JesúsOrtega Gómez, Román Antonio2014-04-222014-04-222013Proceedings of 20th IEEE International Conference on Image Processing (ICIP). September 15-18, 2013. Melbourne, Australia. IEEE, pp. 1948-1952978-1-4799-2341-0https://hdl.handle.net/10016/18793The basis functions of lifting transform on graphs are completely determined by finding a bipartition of the graph and defining the prediction and update filters to be used. In this work we consider the design of prediction filters that minimize the quadratic prediction error and therefore the energy of the detail coefficients, which will give rise to higher energy compaction. Then, to determine the graph bipartition, we propose a distributed maximum-cut algorithm that significantly reduces the computational cost with respect to the centralized version used in our previous work. The proposed techniques show improvements in coding performance and computational cost as compared to our previous work.application/pdfengWavelet transformsVideo codingMCTFLiftingGraphsFilter optimization and complexity reduction for video coding using graph-based transformsconference paper10.1109/ICIP.2013.6738401open access194819522013 20th IEEE International Conference on Image Processing (ICIP)CC/0000020784